Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms

Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms (1997)

Cached

Download Links

by Peter Selinger

Citations:

BibTeX

@TECHREPORT{Selinger97functionality,polymorphism,,
    author = {Peter Selinger},
    title = {Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms},
    institution = {},
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

426	The chemical abstract machine - Berry, Boudol - 1990
421	Categories for the working mathematician - MacLane - 1971
402	Domain Theory, in - Abramsky, Jung - 1994
379	Introduction to higher order categorical logic - Lambek, Scott - 1986
341	An object calculus for asynchronous communication - Honda, Tokoro - 1991
339	Towards a theory of type structure - Reynolds
250	A calculus of mobile agents - Fournet, Gonthier, et al. - 1996
195	Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types - Girard - 1970
159	The Category-theoretic Solution of Recursive Domain Equations - Smyth, Plotkin - 1982
146	Fundamental concepts in programming languages - Strachey - 2000
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
129	The system F of variable types, fifteen years later - Girard - 1986
118	Operational and algebraic semantics of concurrent processes - Milner - 1990
88	Categories of Asynchronous Systems - Bednarczyk - 1988
87	Decoding Choice Encodings - Nestmann, Pierce - 2000
83	G.: The reflexive CHAM and the Join-calculus - Fournet, Gonthier - 1996
66	On bisimulations for the asynchronous -calculus - Amadio, Castellani, et al. - 1996
63	Some properties of conversion - Church, Rosser
55	A proof of the Kahn principle for input/output automata - Lynch, Stark - 1989
53	Equality between functionals - Friedman - 1975
46	A Simple Calculus for - Laneve, Tarissan - 2007
45	Polymorphism is not set-theoretic - Reynolds - 1984
44	What is a model of the lambda calculus - Meyer - 1982
42	Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1991
39	The chemical abstract machine. Theoretical Computer Science, 96:217–248 - Berry, Boudol - 1992
34	Integration Categories and Communicating Sequential Processes - Abramsky - 1994
33	Categorical Semantics for Higher Order Polymorphic Lambda Calculus - Seely
27	Stable models of typed -calculi - Berry - 1978
25	An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus - Honsell - 1992
22	First-order axioms for asynchrony - Selinger - 1997
21	Relating theories of the -calculus - Scott - 1980
15	Filter models with polymorphic types - Jacobs, Margaria, et al. - 1992
15	Une extension de l'interpr'etation de G"odel `a l'analyse et son application `a l'elimination de coupures dans l'analyse et la th'eorie des types - Girard - 1971
13	Models of the lambda calculus - Koymans - 1982
13	Hyperdoctrines, natural deduction and the Beck condition - Seely - 1983
12	Empty types in polymorphic lambda calculus - Meyer, Mitchell, et al. - 1987
10	On a question of H - Plotkin - 1996
9	A semantics for static type inference - Plotkin - 1993
8	Embedding of a free cartesian closed category into the category of sets - Čubrić - 1998
8	On n-permutable congruences - Hagemann, Mitschke - 1973
8	Order-incompleteness and finite lambda models. Extended abstract - Selinger - 1996
6	Interaction categories and typed concurrent programming - Abramsky, Gay, et al. - 1994
6	Universal Algebra, revised edition, D - Cohn - 1981
5	Countable non-determinism and uncountable limits - Gianantonio, Honsell, et al. - 1994
4	A type-free system extending (ZFC - Myhill, Flagg - 1989
4	Concurrent machines. Theoretical Computer Science, 28:449–465 - Shields - 1985
4	On n-permutable congruences, Algebra Universalis 3 - Hagemann, Mitschke - 1973
3	The semantics of second-order polymorphic lambda calculus - Bruce, Meyer - 1984
3	K obˇsčeǐ teorii algebraičeskih sistem - Mal’cev - 1954
3	The -calculus is !-incomplete - Plotkin - 1974