## Paper: Computational lambda-calculus and monads (at LICS 1989)

Authors:**Moggi, E.**

### Abstract

The λ-calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses βη-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

### BibTeX

@InProceedings{Moggi-Computationallambda, author = {Moggi, E.}, title = {Computational lambda-calculus and monads}, booktitle = {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989}, year = 1989, editor = {Rohit Parikh}, month = {June}, pages = {14--23}, location = {Pacific Grove, CA, USA}, publisher = {IEEE Computer Society Press} }