The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Computational lambda-calculus and monads
Abstract
The lambda -calculus is considered a 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. The author gives 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.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Categories for the Working Mathematician
Lane, S. M. (1971) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9839-7 · Cited by 8,817
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Basic concepts of enriched category theory
Kelly, G. M. (1982) · Cited by 1,229
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Curry, H. B., Hindley, J. R., & Seldin, J. P. (1980) · Academic Press eBooks · Cited by 924
Edinburgh LCF: A mechanised logic of computation
Gordon, M. J. C. (1979) · Medical Entomology and Zoology · Cited by 606
Linear logic, *-autonomous categories and cofree coalgebras
Seely, R. A. G. (1989) · Contemporary Mathematics · doi:10.1090/conm/092/1003210 · Cited by 172
Lafont, Y. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90074-6 · Cited by 132
Lafont, Y. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90100-4 · Cited by 127
Cited by
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Self-citationImperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
The essence of functional programming
Wadler, P. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143169 · Cited by 679
Wadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
The revised report on the syntactic theories of sequential control and state
Felleisen, M., & Hieb, R. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90014-7 · Cited by 523
Building domain-specific embedded languages
Hudak, P. (1996) · ACM Computing Surveys · doi:10.1145/242224.242477 · Cited by 477
Danvy, O., & Filinski, A. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91622 · Cited by 403
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
Dependent types and multi-monadic effects in F*
Swamy, N., Hriţcu, C., Keller, C., Rastogi, A., Delignat-Lavaud, A., Forest, S., Bhargavan, K., Fournet, C., Strub, P.-Y., Kohlweiss, M., et al. (2016) · Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2837614.2837655 · Cited by 314
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
Notions of Computation Determine Monads
Plotkin, G., & Power, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45931-6_24 · Cited by 280
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
Algebraic Operations and Generic Effects
Plotkin, G., & Power, J. (2003) · Applied Categorical Structures · doi:10.1023/a:1023064908962 · Cited by 250
“Eugenio Moggi, in [13, 15], introduced the idea of giving a unified category theoretic semantics for computational effects, modelling each of them in the Kleisli category of an appropriate strong monad T on a base category C with finite products.”
BackgroundPlotkin, G., & Pretnar, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00590-9_7 · Cited by 225
Computational types from a logical perspective
BENTON, P. N., BIERMAN, G. M., & DE PAIVA, V. C. V. (1998) · Journal of Functional Programming · doi:10.1017/s0956796898002998 · Cited by 110
“The computational lambda calculus was introduced by Moggi (1989; 1991) as a metalanguage for denotational semantics which more faithfully models real programming language features such as non-termination, di(cid:11)ering evaluation strategies, non-determinism and side-e(cid:11)ects than does the…”
BackgroundA Core Quantitative Coeffect Calculus
Brunel, A., Gaboardi, M., Mazza, D., & Zdancewic, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54833-8_19 · Cited by 90
“The use of monads in programming languages, originally introduced in category theory, was pioneered by Moggi [28] as a way to structure the semantics of his computational lambda calculus.”
BackgroundCombining effects and coeffects via grading
Gaboardi, M., Katsumata, S.-Y., Orchard, D., Breuvart, F., & Uustalu, T. (2016) · Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming · doi:10.1145/2951913.2951939 · Cited by 63
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
Metadata
- Authors
- Moggi, E.
- Venue
- [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-07
- Pages
- 14-23
- OpenAlex
- W2156876717
- Cited by
- 842
- References
- 9
- FWCI
- 27.25
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.