Computational Lambda-Calculus and Monads (1989)

by Eugenio Moggi
Citations:437 - 6 self

Documents Related by Co-Citation

455 Comprehending Monads – Philip Wadler - 1992
1305 Monads for functional programming – Philip Wadler - 1995
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
1559 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
730 Notions of Computation and Monads – Eugenio Moggi - 1991
63 editors. Report on the Programming Language Haskell 98. A non-strict Purely Functional Language – S Peyton Jones, J Hughes - 1999
117 Report on the functional programming language Haskell: A non-strict, purely functional language: Version 1.2 – Peyton Jones P, S L, P Wadler - 1992
233 Monad Transformers and Modular Interpreters – Sheng Liang, Paul Hudak, Mark Jones - 1995
111 Continuation-passing, closure-passing style – Trevor Jim - 1989
41 A functional theory of exceptions – M Spivey - 1990
325 Denotational Semantics: A Methodology for Language Development – D A Schmidt - 1986
160 The essence of Algol – J Reynolds - 1981
85 Integrating functional and imperative programming – D K Gifford, J M Lucassen - 1986
134 Linear Types Can Change the World! – Philip Wadler - 1990
71 Single-threaded polymorphic lambda calculus – J C Guzman, P Hudak - 1990
919 Categories for the working mathematician – Mac Lane, S - 1971
86 How to replace failure by a list of successes – P Wadler - 1985
23 A Category-Theoretic Account of Program Modules – Eugenio Moggi - 1994
53 The essence of functional programming (invited talk – Philip Wadler - 1992