Computational Lambda-Calculus and Monads

by: Eugenio Moggi

(1989), pp. 14-23.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

jrw, cedricboidin, tautologico, pile, glaubersp, mfrydr, ds, complogic (group), mmarcus

Find related articles with these CiteULike tags

category-theory, citavi-standorte-done, computation, fonctional, lambda-calculus, languages, lueth_02_composing, monad, monads, no-tag, programming-languages

Abstract

The lambda-calculus is considered an 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. We give 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.

@inbook{citeulike:139665, abstract = {The lambda-calculus is considered an 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. We give 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.}, address = {Washington, DC}, author = {Moggi, Eugenio }, booktitle = {Proceedings 4th Annual IEEE Symp.\ on Logic in Computer Science, LICS'89, Pacific Grove, CA, USA, 5--8 June 1989}, citeulike-article-id = {139665}, pages = {14--23}, posted-at = {2008-01-10 19:08:56}, priority = {2}, publisher = {IEEE Computer Society Press}, title = {Computational Lambda-Calculus and Monads}, url = {http://citeseer.ist.psu.edu/moggi89computational.html}, year = {1989} }

RIS record

TY - CHAP ID - citeulike:139665 L3 - citeulike-article-id:139665 TI - Computational Lambda-Calculus and Monads T2 - Proceedings 4th Annual IEEE Symp.\ on Logic in Computer Science, LICS'89, Pacific Grove, CA, USA, 5--8 June 1989 SP - 14 EP - 23 AD - Washington, DC PB - IEEE Computer Society Press N2 - The lambda-calculus is considered an 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. We give 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. AU - Moggi, Eugenio PY - 1989/// UR - http://citeseer.ist.psu.edu/moggi89computational.html ER -

RIS BibTeX