## Notions of Computation and Monads (1989)

### Cached

### Download Links

- [www.disi.unige.it]
- [www.disi.unige.it]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cornell.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Information and Computation |

Citations: | 728 - 15 self |

### BibTeX

@ARTICLE{Moggi89notionsof,

author = {Eugenio Moggi},

title = {Notions of Computation and Monads},

journal = {Information and Computation},

year = {1989},

volume = {93},

pages = {55--92}

}

### Years of Citing Articles

### OpenURL

### Abstract

The lambda-calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with lambda-terms. However, if one goes further and uses beta eta-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from values to values), that may jeopardise the applicability of theoretical results. In this paper we introduce calculi based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs, for a wide range of notions of computation.