Computational lambda-calculus and monads
Eugenio Moggi · 2003
The lambda -calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses beta eta -conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model.>
Cited by 842 works. doi:10.1109/lics.1989.39155
Authors
References
- Categories for the Working Mathematician
- The Lambda Calculus - Its Syntax and Semantics
- Call-by-name, call-by-value and the λ-calculus
- To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
- The Collected Papers of Gerhard Gentzen
- Basic concepts of enriched category theory
- Edinburgh LCF: A mechanised logic of computation
- Algebraic Theories
- Monads on symmetric monoidal closed categories
- The linear abstract machine