## Computational lambda-calculus and monads (1989)

### Cached

### Download Links

- [pfp7.is.ocha.ac.jp]
- [www.disi.unige.it]
- [www.disi.unige.it]
- [www.disi.unige.it]
- DBLP

### Other Repositories/Bibliography

Citations: | 437 - 6 self |

### BibTeX

@INPROCEEDINGS{Moggi89computationallambda-calculus,

author = {Eugenio Moggi},

title = {Computational lambda-calculus and monads},

booktitle = {},

year = {1989},

pages = {14--23},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

The λ-calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with λ-terms. However, if one goes further and uses βη-conversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1