Computational Lambda-Calculus and Monads Export

@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}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4025}, 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4025}, year = {1989} }

TY - CHAP ID - citeulike:139665 L3 - citeulike-article-id:139665 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. AD - Washington, DC EP - 23 TI - Computational Lambda-Calculus and Monads PB - IEEE Computer Society Press T2 - Proceedings 4th Annual IEEE Symp.\ on Logic in Computer Science, LICS'89, Pacific Grove, CA, USA, 5--8 June 1989 SP - 14 AU - Moggi, Eugenio PY - 1989/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4025 ER -