ACM Home Page
Please provide us with feedback. Feedback
A semantic basis for quest
Full text PdfPdf (1.64 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1990 ACM conference on LISP and functional programming table of contents
Nice, France
Pages: 30 - 43  
Year of Publication: 1990
ISBN:0-89791-368-X
Authors
Luca Cardelli  DEC Systems Research Center
Giuseppe Longo  LIENS, Ecole Normale Supérieure, Paris
Sponsors
INRIA : Institut Natl de Recherche en Info et en Automatique
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 17,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/91556.91586
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Abadi Plotkin 90
M.Abadi, G.D.Plotkin: A Per model of polymorphism and recursive types, Proc. LICS '90.
 
Amadio 89
 
Amadio 89a
R.Amadio: Formal theories of inheritance for typed functional languages, Note interne TR 28/89, Dipartimento di Informatica, Universit~ di Pisa.
 
Asperti Longo 90
 
Asperti Martini 89
A.Asperti, S.Martini: Categorical models of polymorphism, Note interne, Dipartimento di Informatica, Universit~i di Pisa.
 
Bainbridge Freyd Scedrov Scott 87
E.S.Bainbridge, P.j. Freyd, A.Scedrov, P.J.Scott: Functorial polymorphism, preliminary report, Proc. of the Programming institute on Logical Foundations of Functional Programming, Austin, Texas, June 1987, to appear.
 
Barendregt 84
H. Barendregt: The lambda calculus; its syntax and semantics, Revised and expanded edition, North Holland.
 
Breazu-Tannen Coquand Gunter Scedrov 89
 
Bruce Longo 89
 
Carboni Freyd Scedrov 87
 
Cardelli 88
 
Cardelli 89
L.Cardelli: Typeful programming, Lecture Notes for the IFIP Advanced Seminar on Formal Methods in Programming Language Semantics, Rio de Janeiro, Brazil, 1989. SRC Report #45, Digital Equipment Corporation, 1989.
 
Cardelli Donahue Glassman Jordan Kalsow Nelson 88
L.Cardelli, J.Donahue, L.Glassman, M.jordan, B.Kalsow, G.Nelson: Modula-3 report, Research Report n.31, DEC Systems Research Center, 1988.
 
Cardelli Longo 90
L.Cardelli, G.Longo: A semantic basis for Quest, Report #55, DEC SRC, 130 Lytton Ave, Palo Alto CA 94301.
 
Cardelli Mitchell 89
Cardelli Wegner 85
Cook Hill Canning 90
 
Curien Ghelli 90
P.L. Curien, G. GheUi: Coherence of subsumption, to appear.
 
Ehrhard 88
T. Ehrhard: A Categorical Semantics of Constructions Proceedings of LICS'88, Edinburgh.
 
Fairbairn 89
J. Fairbairn: Some types with inclusion properties in V, -~, g, Technical Report No. 171, University of Cambridge, Computer Laboratory..
 
Feferman 87
S. Feferman: Weyl Vindicated: Das Kontinuum, 70 Years Later, preprint, Stanford University (Proceedings of the Cesena Conference on Logic and Philosophy of Science, to appear).
 
Feferman 88
S.Feferman: Polymorphic typed lambda..calculi in a type-free axiomatic framework, Dept. of Mathematics, Journal of the ACM 151,185,30,1 January.
 
Freyd Mulry Rosolini Scott 90
P.J.Freyd, PaMulry, G.Rosolini, D.Scott: Domains in Per, Proc. LICS '90.
 
Girard 72
J-Y.Girard: Interprttation fonctlonelle et tlimination des coup~s darts l'arithmttique d'ordre sup~rieur, Th~;e de doctorat d'~tat, Universitd Paris VII, 1972.
 
Hindlay Longo 80
R. Hinctley, G. Longo: Lambda-calculus models and extensionality Zeit. Math. Logik Grund. Math. 26-2 (289-310).
 
Hyland 82
M.Hyland: The effective topos, in The Brower Sympo~um, Troelstra and Van Dalen ecls., North-Holland 1982.
 
Hyland 87
M.Hyland: A small complete category, lecture delivered at the conference: Church's Thesis after 50 years, Zeias (NL), June 1986. Annals of Pure and Applied Logic, 40,1988.
 
Hyland Pitts 87
J.M.E.Hyland, A.M.Pitts: The theory of constructions: categorical semantics and topos-theoretic models, in Categories in Computer Science and Logic (Proc. Boulder '87), Contemporary Math., Amer. Math. Soc,, Providence ILl.
 
Longo 88
G.Longo: Some aspects of irnpredicativity: notes on Weyl's philosophy of mathematics and today's Type Theory, CMU Report CS-88-135, Lech~e delivered at the Logic Colloquium 87, Ebbinghaus et al. eds, North Holland, Studies in Logic.
 
Longo Moggi 88
G.Longo, E.Moggi: Constructive Natural Deduction and its "{a. Set" interpretation, CMU report CS-88-131, 1988.
 
Luo 88
Z. Luo: ECC, an Extended Calculus of Constructions, Report, LFCS, Department of Computer Science University of Edinburgh.
Martini 88
 
Meseguer 88
J.Meseguer: Relating Models of Polymorphism, $RI-CSL- 88-13, October, SRI Projects 2316, 4415 and 6729, SRI International, Comp. sci. Lab.
Mitchell 84
Mitchell 86
 
Mitchell 88
Mitchell Plotkin 85
 
Ohori 87
A.Ohori: Orderings and types in databases, Proc. of the Workshop on Database Programming Languages, Roscoff, France, September 1987.
 
Pitts 87
 
Reynolds 84
J C.Reynolds: Polymorphism is not set-theoretic, Symposium on Semantics of Data Types (Kahn, MacQueen, and Plotkin eds.) Lecture Notes in Computer Science 173, Springer- Verlag, 1984, pp. 145-156.
 
Rosolini 86
G.Rosolini: Continuity and effectiveness in Topoi, D. Phil. Thesis, Oxford University.
 
Scedrov 88
A.Scedrov: A Guide to Polymorphic Types, CIME Lectures Montecatini Terme, June, (revised version).
 
Troelstra 73
A.Troelstra: Metamathematical investigation of Intuitionistic Arithmetic and Analysis. LNM 344, Springer-Verlag, Berlin.
 
Wand 89

CITED BY  10

Collaborative Colleagues:
Luca Cardelli: colleagues
Giuseppe Longo: colleagues