Abstract

The i.-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with I-terms. However, if one goes further and uses bn-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from calues to values) that may jeopardise the applicability of theoretical results, In this paper we introduce calculi. based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation.

Citations

421	Categories for the working mathematician - MacLane - 1971
401	Computational lambda-calculus and monads - Moggi - 1989
316	Basic concepts of enriched category theory - Kelly - 1982
303	Denotational Semantics: A Methodology for Language Development - SCHMIDT - 1986
219	Call-by-name, call-by-value, and the -calculus - Plotkin - 1975
174	Call-by-name, call-by-value and the λ-calculus - Plotkin - 1976
164	Toposes, Triples and Theories - Barr, Wells - 1985
158	The category-theoretic solution of recursive domain equations - Smyth, Plotkin - 1982
153	An abstract view of programming languages - Moggi - 1989
141	Denotational semantics - Mosses - 1990
136	Semantic Domains - Gunter, Scott - 1990
130	Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
123	Introduction to Higher-Order Categorical Logic - Lambek, Scott - 1986
109	The formal theory of monads - Street - 1972
97	Linear logic, ∗-autonomous categories and cofree coalgebras - Seely - 1989
89	The linear abstract machine - Lafont - 1988
69	Edinburgh LCF: A Mechanized Logic - Gordon, Milner, et al. - 1979
53	Reasoning with continuations - Felleisen, Friedman, et al. - 1986
47	Identity and existence in intuitionistic logic - Scott - 1979
42	Continuity and effectiveness in topoi - Rosolini - 1986
40	Strong functors and monoidal monads - Kock - 1972
38	The theory of constructions: Categorical semantics and topos-theoretic models - Hyland, Pitts - 1985
38	First order categorical logic - Makkai, Reyes - 1977
37	A type-theoretical alternative to - Scott - 1993
36	Doctrines in categorical logic - Kock, Reyes - 1977
35	D.P.: A syntactic theory of sequential state - Felleisen, Friedman - 1989
32	Partial Objects in Constructive Type Theory - Constable, Smith - 1987
32	Denotational Semantics with Partial Functions. Unpublished lecture notes - Plotkin - 1985
26	The Partial Lambda Calculus - Moggi - 1988
24	Algebraic Theories, Volume 26 of Graduate Texts in Mathematics - Manes - 1976
24	Programming, transforming, and proving with function abstractions and memories - Mason, Talcott - 1989
23	A category-theoretic account of program modules - Moggi - 1989
21	Relating theories of the -calculus - Scott - 1980
19	Computational foundations of basic recursive function theory - Constable, Smith - 1993
19	The logic of topoi - Fourman - 1977
16	Continuity and E#ectivity in Topoi - Rosolini - 1986
14	Algebraic theories, Graduate Texts - Manes - 1976
13	Relating theories of the λ-calculus - Scott - 1980
12	Verification of programs that destructively manipulate data - Mason - 1988
12	New foundations for fixpoint computations - Crole, Pitts - 1990
10	Categories of partial morphisms and the partial lambda-calculus - MOGGI - 1986
9	A sound and complete axiomatization of operational equivalence between programs with memory - Mason, Talcott - 1989
6	Syntactic Aspects of the Non-deterministic Lambda Calculus - Sharma - 1984
4	Toposes, triples and theories, Springer-Verlag - Barr, Wells - 1985
4	Strong functors and monoidal - KOCK - 1972
4	Identity and existence in intuitionistic logic, in “Applications of Sheaves - SCOTT - 1979
2	New foundations for computations - Crole, Pitts - 1990
2	Indexed Categories and their Applications - Johnstone, Pare - 1978
1	New foundations for tixpoint computations - CROLE, PITTS - 1990
1	Higher-order modules and the phase distinction - J, MOGGI - 1990