Paradigmas de Programação

4º Ano do Mestrado Integrado em Engenharia Informática e Computação
Programa Doutoral em Engenharia Informática

(2º Semestre    2013/2014)

Apontadores úteis


Artigos de referência

  1. J. McCarthy, Recursive functions of symbolic expressions and their computation by machine, Comm. ACM 3, 4 (1960) 184-195.
  2. J. Backus, Can programming be liberated from the von Neuman style?, Comm. ACM 21, 8 (1978) 613-641. (large file)
  3. R. Harper, Introduction to Standard ML, Report ECS-LFCS-86-14, Dept. Computer Science, Univ. Edinburgh, 1989. (Link is to updated web version.)
  4. B. Kernighan, Why Pascal is Not My Favorite Programming Language, Bell Labs CSTR 100, July 1981.
  5. A. Koenig, An anecdote about ML type inference, USENIX Symposium on Very High Level Languages,1994.
  6. Aleph One, Smashing the stack for fun and profit , Phrack 7, 49 (1996)
  7. E.W. Dijkstra Go To Statement Considered Harmful , Communications of the ACM, 11, 3 (1968) 147-148.
  8. N. Wirth, Program development by stepwise refinement, Communications of the ACM, 14, 4 (1971) 221--227.
  9. D. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, 15, 12 (1972) 1053-1058.
  10. D. Ingalls, Design principles behind Smalltalk, BYTE Special Issue on Smalltalk, August 1981. (Scanned by Dwight Hughes.)
  11. 15 Years Ago in BYTE: The Smalltalk Environment by Larry Tessler, BYTE, August 1996.
  12. W.R. Cook, Interfaces and specifications for the Smalltalk-80 collection classes,.Proc ACM Conf. Object-Oriented Programming Systems, Languages, and Applications (OOPSLA '92). ACM SIGPLAN Notices ,Vol. 27, No. 10 (Oct. 1992), Pages 1-15.
  13. Gilad Bracha, Generics in the Java Programming Language, Sun Microsystems, 2004.
  14. Peter Canning, William Cook, Walter Hill, Walter Oltho, John C. Mitchell, F-Bounded Polymorphism for Object-Oriented Programming, FPCA 1989. (First few pages only)
  15. Paul Hudak, John Hughes, Simon Peyton Jones, and Philip Wadler, A history of Haskell: Being lazy with class, Proc. 3rd ACM SIGPLAN conference on History of Programming Languages (HOPL), 2007, (Stanford cache)
  16. Simon Peyton Jones, Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell, IOS Press 2001. (Stanford cache)
  17. Philip Wadler, Monads for functional programming In M. Broy (ed.), Marktoberdorf Summer School on Program Design Calculi, Springer Verlag, 1992. (Stanford cache)
  18. Simon Peyton Jones, Beautiful concurrency. In Beautiful Code, ed. Andy Oram, Greg Wilson, O’Reilly 2007.
  19. Dan Grossman, The Transactional Memory / Garbage Collection Analogy. In ACM Symp. Object-Oriented Programming: Systems, Languages, and Architectures (OOPSLA’07), 2007,
  20. David H. D. Warren (October 1983). An abstract Prolog instruction set. Menlo Park, CA, USA: SRI International.