(Enter summary)
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. (Update)
Cited by: More
Under consideration for publication in Math. Struct. in .. - Judgmental..
(Correct)
A Probabilistic Language based upon Sampling Functions - Sungwoo Park Frank
(Correct)
Avoiding Causal Dependencies via Proof Irrelevance in a.. - Ley-Wild, Pfenning (2006)
(Correct)
Similar documents (at the sentence level):
25.1%: Computational Lambda-Calculus and Monads - Moggi (1988)
(Correct)
15.2%: Notions of Computation and Monads - Moggi (1989)
(Correct)
Active bibliography (related documents): More All
0.4: Programming Metalogics with a Fixpoint Type - Crole (1992)
(Correct)
0.3: Partial Morphisms in Categories of Effective Objects - Moggi (1996)
(Correct)
0.1: Functional Notation for Indexed Concepts - Wolfengagen (2000)
(Correct)
Similar documents based on text: More All
0.1: Categorical Semantics as a Basis for Program Transformation - Verwer (1990)
(Correct)
0.1: Monads and Effects - Benton, Hughes, Moggi (2000)
(Correct)
0.1: Monads and Effects (revised) - Benton, Hughes, Moggi (2000)
(Correct)
Related documents from co-citation: More All
28: Comprehending Monads
- Wadler - 1990
23: Imperative functional programming
- Jones, Wadler - 1993
23: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
BibTeX entry: (Update)
Eugenio Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 14--23, Pacific Grove, California, June 1989. IEEE. http://citeseer.ist.psu.edu/moggi89computational.html More
@incollection{ moggi89computational,
author = "Eugenio Moggi",
title = "Computational Lambda-Calculus and Monads",
booktitle = "Proceedings 4th Annual {IEEE} Symp.\ on Logic in Computer Science, {LICS}'89, Pacific Grove, {CA}, {USA}, 5--8 June 1989",
publisher = "IEEE Computer Society Press",
address = "Washington, DC",
pages = "14--23",
year = "1989",
url = "citeseer.ist.psu.edu/moggi89computational.html" }
Citations (may not include all citations):
291
Theoretical Computer Science (context) - Lafont, abstract - 1988
156
Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
51
autonomous categories and cofree coalgebras (context) - Seely
30
The theory of constructions: Categorical semantics and topos.. (context) - Hyland, Pitts - 1987
26
volume 26 of Graduate Texts in Mathematics (context) - Manes - 1976
24
Partial objects in constructive type theory (context) - Constable, Smith - 1987
17
call-by-value and the -calculus (context) - Plotkin - 1975
16
Archiv der Mathematik (context) - Kock, monoidal - 1972
15
A type-theoretic alternative to CUCH (context) - Scott - 1969
15
The Partial Lambda-Calculus
- Moggi - 1988
7
Continuity and Eectiveness in Topoi (context) - Rosolini - 1986
6
Relating theories of the -calculus (context) - Scott - 1980
3
volume 661 of Lecture Notes in Mathematics (context) - Johnstone, Pare et al. - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.disi.unige.it/person/MoggiE/publications.html): More
The Partial Lambda-Calculus - Moggi (1988)
(Correct)
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996)
(Correct)
Typed Intermediate Languages for Shape-Analysis - Bellè, Moggi (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC