Seminar on Classic Papers in Computing Scienc

Articles

  1. John McCarthy (1963) - A Basis for a Mathematical Theory of Computation.
  2. P. Naur, B. Randell (eds.) (1969) - Software Engineering - Report on a conference sponsored by the NATO Science Committee - Garmisch, Germany, 7th. to 11th. October, 1968.
  3. (Sir) Tony Hoare (1976) - Software Engineering.
  4. (Sir) Tony Hoare (1998) - Unified Theories of Programming.
  5. (Sir) Tony Hoare (2004) - The verifying compiler: A grand challenge for computing research of the 21st. century.
  6. (Sir) Tony Hoare et al. (2007) - The verified software initiative: A manifesto.
  7. (Sir) Tony Hoare (1969) - An Axiomatic Basis for Computer Programming.
  8. Robert W. Floyd (1967) - Assigning Meanings to Programs.
  9. Alan Turing (1949) - Checking a large routine.
  10. Edsger W. Dijkstra (1974) - Guarded commands, non-determinacy and a calculus for the derivation of programs.
  11. (Sir) Tony Hoare (1980) - The Emperor's Old Clothes.
  12. Edsger W. Dijkstra (1988) - On the cruelty of really teaching Computing Science.
  13. Donald Knuth (1992) - Literate Programming.
  14. J. Backus, P. Naur (ed.) et al. (1960) - Report on the algorithmic language ALGOL 60.
  15. John Backus et al. (1957) - The FORTRAN automatic coding system.
  16. Edsger W. Dijkstra (1968) - Go To Statement Considered Harmful.
  17. David Parnas (1972) - On the Criteria To Be Used in Decomposing Systems into Modules.
  18. Ole-Johan Dahl, C.A.R. Hoare (1972) - Hierarchical Program Structures.
  19. Barbara Liskov, Stephen Zilles (1974) - Programming with abstract data types.
  20. Barbara Liskov (1992) - A History of CLU.
  21. Alan Kay (1993) - The Early History of Smalltalk.
  22. Peter Landin (1965) - A Correspondence Between ALGOL 60 and Church's Lambda Notation: Part I.
  23. Christopher Strachey (1967) - Fundamental Concepts in Programming Languages.
  24. Dana Scott (1982) - Domains for Denotational Semantics.
  25. Gordon Plotkin (1981,2004) - A Structural Approach to Operational Semantics.
  26. Peter Landin (1966) - The Next 700 Programming Languages.
  27. John Backus (1978) - Can Programming Be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs.
  28. John McCarthy (1960) - Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I.
  29. Guy Lewis Steele Jr., Gerald Jay Sussman (1976) - Lambda: The ultimate imperative.
  30. John Hughes (1990) - Why Functional Programming Matters.
  31. Luis Damas, Robin Milner (1982) - Principal type-schemes for functional programs.
  32. Robert Constable (2011) - The Triumph of Types: Principia Mathematica's Impact on Computer Science.
  33. Per Martin-Löf (1979) - Constructive Mathematics and Computer Programming.
  34. T. Altenkirch, C. McBride, J. McKinna (2005) - Why Dependent Types Matter.
  35. Xavier Leroy (2009) - Formal verification of a realistic compiler.
  36. Jonathan Bowen, Victoria Stavridou (1992) - Safety-Critical Systems, Formal Methods and Standards.
  37. Bertrand Russell (1905) - Mathematical Logic as based on the Theory of Types.
  38. Gottlob Frege (1879) - Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought.
  39. Richard Dedekind (1888) - What are the numbers and what should they be?
  40. Alan Turing (1936) - On computable numbers, with an application to the Entscheidungsproblem.
  41. Robin Gandy (1988) - The Confluence of Ideas in 1936.
  42. L.F. Menabrea, Ada Augusta Lovelace (1842)  - Sketch of The Analytical Engine Invented by Charles Babbage.
  43. Alan Turing (1945) - Proposed electronic calculator.
  44. Jean-Yves Girard (1987) - Linear Logic.
  45. Noam Chomsky (1959) - On Certain Formal Properties of Grammars.
  46. Donald Knuth (1965) - On the Translation of Languages from Left to Right.
  47. Edsger W. Dijkstra (1965) - Solution of a Problem in Concurrent Programming Control.
  48. Susan Owicki, David Gries (1976) - Verifying Properties of Parallel Programs: An Axiomatic Approach.
  49. Amir Pnueli (1977) - The temporal logic of programs.
  50. Leslie Lamport el al. (1982) - The Byzantine Generals Problem.
  51. David Harel (1987) - Statecharts: A visual formalism for complex systems.
  52. Robin Milner (1993) - Elements of Interaction - Turing Award Lecture.
  53. Robin Milner (1997) - Turing, Computing and Communication.
  54. Robin Milner (1986) - A Calculus of Communicating Systems.
  55. (Sir) Tony Hoare (1978) - Communicating Sequential Processes.
  56. Robin Milner et al. (1989) - A Calculus of Mobile Processes, Part I.
  57. E.M. Clarke et al. (1983) - Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach.
  58. Martin Davis et al. (1962) - A Machine Program for Theorem-Proving.
  59. Robert Kowalski (1979) - Algorithm = Logic + Control.
  60. J. Hartmanis, R.E. Stearns (1963) - On the computational complexity of algorithms.
  61. Manuel Blum (1967) - A Machine-Independent Theory of the Complexity of Recursive Functions.
  62. Stephen Cook (1971) - The Complexity of Theorem-Proving Procedures.
  63. Stephen Cook (2000) - The P versus NP problem.
  64. Philippe Flajolet (1985) - Mathematical methods in the analysis of algorithms and data structures.
  65. Claude Shannon (1948) - A Mathematical Theory of Communication.
  66. Edgar F. Codd (1970) - A Relational Model of Data for Large Shared Data Banks.
  67. Peter Chen (1976) ArchivoNo finalizado; Peter Chen (1976) - The Entity-Relationship Model - Toward a Unified View of Data.
  68. J. McCarthy, M.L. Minsky, N. Rochester, C.E. Shannon (1955) - A proposal for the Dartmouth summer research project on Artificial Intelligence.
  69. Tim Berners-Lee (1989) - Information Management: A Proposal.
  70. Tim Berners-Lee et al. (2001) - The Semantic Web.
  71. Whitfield Diffie, Martin E. Hellman (1976) - New Directions in Cryptography.
Computación Teórica (Compute)

La Facultad de Ingeniería da servicios de apoyo a estudiantes avanzados y graduados para facilitar su inserción laboral. Según el último relevamiento realizado la facultad cuenta con plena inserción de sus graduados.

A través de este espacio se busca promover y dar a conocer las oportunidades que tienen las mujeres dentro del área de las Tecnologías de la Información y la Comunicación. Asimismo, se realizan diferentes actividades para impulsar a estudiar tecnología.

El Centro de Innovación y Emprendimientos (CIE) de la Universidad ORT Uruguay, promueve y desarrolla la generación de nuevos emprendedores. Sus acciones están dirigidas a fomentar la innovación, la actitud emprendedora y promover oportunidades.