See this document in CiteSeerX!

Notions of Computation and Monads (1989)  (Make Corrections)  (87 citations)
Eugenio Moggi
Information and Computation



  Home/Search   Context   Related

 
View or download:
disi.unige.it/person/Moggi...ic91.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  disi.unige.it/pers...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Similar documents based on text:   More   All
0.1:   Categorical Semantics as a Basis for Program Transformation - Verwer (1990)   (Correct)
0.1:   Computational Lambda-Calculus and Monads - Moggi (1988)   (Correct)
0.1:   Monads and Effects - Benton, Hughes, Moggi (2000)   (Correct)

Related documents from co-citation:   More   All
29:   Computational lambda-calculus and monads - Moggi - 1989
17:   A powerdomain construction (context) - Plotkin - 1976
14:   An abstract view of programming languages (context) - Moggi - 1990

BibTeX entry:   (Update)

Moggi, E. (1989). Notions of computations and monads. Information and Computation 93, 55--92. Earlier version in LICS'89. http://citeseer.ist.psu.edu/moggi89notions.html   More

@article{ moggi91notions,
    author = "Eugenio Moggi",
    title = "Notions of Computation and Monads",
    journal = "Information and Computation",
    volume = "93",
    number = "1",
    pages = "55--92",
    year = "1991",
    url = "citeseer.ist.psu.edu/moggi89notions.html" }
Citations (may not include all citations):
359   Introduction to Higher-Order Categorical Logic (context) - Lambek, Scott - 1986
291   Computational lambda-calculus and monads - Moggi - 1989
291   Theoretical Computer Science (context) - Lafont, abstract - 1988
236   Categories for the Working Mathematician (context) - MacLane - 1971
221   Denotational Semantics: a Methodology for Language Developme.. (context) - Schmidt - 1986
156   Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
150   Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Milner et al. - 1979
121   Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
72   An abstract view of programming languages (context) - Moggi - 1989
69   Triples and Theories (context) - Barr, Wells - 1985
51   autonomous categories and cofree coalgebras (context) - Seely - 1987
43   Identity and existence in intuitionistic logic (context) - Scott - 1979
34   Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
31   The formal theory of monads (context) - Street - 1972
30   The theory of constructions: Categorical semantics and topos.. (context) - Hyland, Pitts - 1987
30   A syntactic theory of sequential state (context) - Felleisen, Friedman - 1989
29   A category-theoretic account of program modules - Moggi - 1989
28   Doctrines in categorical logic (context) - Kock, Reyes - 1977
26   volume 26 of Graduate Texts in Mathematics (context) - Manes - 1976
25   First Order Categorical Logic (context) - Makkai, Reyes - 1977
24   Partial objects in constructive type theory (context) - Constable, Smith - 1987
24   Denotational semantics with partial functions (context) - Plotkin - 1985
21   on and C. Talcott. Programming, transforming, and proving wi.. (context) - Mas - 1989
17   call-by-value and the -calculus (context) - Plotkin - 1975
16   The category-theoretic solution of recursive domain equation.. (context) - Smith, Plotkin - 1982
16   Archiv der Mathematik (context) - Kock, monoidal - 1972
15   A type-theoretic alternative to CUCH (context) - Scott - 1969
15   Computational foundations of basic recursive function theory - Constable, Smith - 1988
15   The Partial Lambda-Calculus - Moggi - 1988
14   The logic of topoi (context) - Fourman - 1977
8   A sound and complete axiomatization of operational equivalen.. - Mason, Talcott - 1989
7   Continuity and E ectiveness in Topoi (context) - Rosolini - 1986
7   Syntactic aspects of the non-deterministic lambda calculus (context) - Sharma - 1984
6   Relating theories of the -calculus (context) - Scott - 1980
5   Verication of programs that destructively manipulate data (context) - Mason - 1988
3   volume 661 of Lecture Notes in Mathematics (context) - Johnstone, Pare et al. - 1978
2   to appear in North Holland Handbook of Theoretical Computer .. (context) - Gunter, Scott et al. - 1989
2   New foundations for xpoint computations - Crole, Pitts - 1990
2   to appear in North Holland Handbook of Theoretical Computer .. (context) - Mosses, Technical et al. - 1989



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