A semantic basis for Quest

Journal of Functional Programming

Volumn 1, Issue 4, 1991, Pages 417-458

  Longo, Giuseppe ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974399408     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800000198     Document Type: Article

References (41)

1. Abadi, M. and Plotkin, G. D. 1990. A Per model of polymorphism and recursive types. Proc. Fifth Annual Symposium on Logic in Computer Science.
2. Amadio, R. 1989a. Recursion over realizability structures. Information and Computation, 1991.
3. Amadio, R. 1989b. Formal theories of inheritance for typed functional languages. Note interne TR 28/89, Dipartimento di Informatica, Universita di Pisa, Italy.
4. Asperti, A. and Longo, G. 1991. Categories, Types and Structures: an introduction to category theory for the working computer scientist, MIT Press.
5. Asperti, A. and Martini, S. 1989. Categorical models of polymorphism. Information and Computation (to appear).
6. Bainbridge, E. S., Freyd, P. J., Scedrov, A. and Scott, P. J. 1987. Functional polymorphism, preliminary report. Proc. Programming Institute on Logical Foundations of Functional Programming, Austin, Texas.
7. Barendregt, H. 1984. The lambda calculus; its syntax and semantics, (revised and expanded edition), North-Holland.
8. Breazu-Tannen, V., Coquand, T., Gunter, C. and Scedrov, A. 1989. Inheritance and explicit coercion. Proc. Fourth Annual Symposium on Logic in Computer Science.
9. Bruce, K. and Longo, G. 1989. Modest models of records, inheritance and bounded quantification. Information and Computation, 87 (1-2).
10. Carboni, A., Freyd, P. J. and Scedrov, A. 1987. A categorical approach to realizability and polymorphic types. Proc. Third Symposium on Mathematical Foundations of Programming Language Semantics, New Orleans, USA (to appear).
11. Cardelli, L. 1988. A semantics of multiple inheritance. Information and Computation, 76: 138–164.
12. Cardelli, L. 1989. Typeful programming. Lecture Notes for the IFIP Advanced Seminar on Formal Methods in Programming Language Semantics, Rio de Janeiro, Brazil. (SRC Report #45, Digital Equipment Corporation, 1989.)
13. Cardelli, L., Donahue, J., Glassman, L., Jordan, M., Kalsow, B. and Nelson, G. 1988. Modula-3 report. Research Report n.31, DEC Systems Research Center (September 1988).
14. Cardelli, L. and Mitchell, J. C. 1989. Operations on records. Proc. Fifth Conference on Mathematical Foundations of Programming Language Semantics, New Orleans, USA (to appear in Mathematical Structures in Computer Science, 1.)
15. Cardelli, L. and Wegner, P. 1985. On understanding types, data abstraction and polymorphism. Computing Surveys, 17 (4): 471–522.
16. Cook, W., Hill, W. and Canning, P. 1990. Inheritance is not subtyping. Proc. POPU90, San Francisco, USA.
17. Curien, P. L. and Ghelli, G. 1990. Coherence of subsumption, Mathematical Structures in Computer Science, 1 no. 3.
18. Ehrhard, T. 1988. A categorical semantics of constructions. Proc. 3rd Annual Symposium on Logic in Computer Science, Edinburgh, UK.
19. Fairbaim, J. 1989. Some types with inclusion properties in V,→, µ. Technical Report No. 171, University of Cambridge Computer Laboratory, UK.
20. Feferman, S. 1987. Weyl Vindicated: Das Kontinuum, 70 Years Later. Preprint, Stanford University. Proc. Cesena Conf. on Logic and Philosophy of Science (to appear).
21. Feferman, S. 1988. Polymorphic typed lambda-calculi in a type-free axiomatic framework. J. ACM, 151, 185, 30, 1 January.
22. Freyd, P. J., Mulry, P., Rosolini, G. and Scott, D. 1990. Domains in Per. Proc. 5th Annual Symposium on Logic in Computer Science.
23. Girard, J.-Y. 1972. Interpretation Fonctionelle et Élimination des Coupures dans VArithmétique d'Ordre Superieur. These de doctorat d'etat, Universite Paris VII, France.
24. Hindley, R. and Longo, G. 1980. Lambda-calculus models and extensionality. Zeit. Math. Logik Grund. Math. 26: 289–310.
25. Hyland, J. M. E. 1987. A small complete category. Annals of Pure and Applied Logic, 40.
26. Hyland, J. M. E. and Pitts, A. M. 1987. The theory of constructions: categorical semantics and topos-theoretic models, Categories in Computer Science and Logic (Proc. Boulder 87), Providence, USA.
27. Hyland, M. 1982. The effective topos. In A. Troelstra and Van Dalen (editors), The Brower Symposium, North-Holland.
28. Longo, G. 1988. Some aspects of impredicativity: notes on WeyVs philosophy of mathematics and today's Type Theory. CMU Report CS-88-135. In Ebbinghaus et al. (editors), North-Holland.
29. Longo, G. and Moggi, E. 1988. Constructive Natural Deduction and its “ω-Set” interpretation. CMU report CS-88-131, Mathematical Structures in C.S., 1 no. 2, 1991.
30. Luo, Z. 1988. ECC, an Extended Calculus of Constructions. Report, LFCS, Department of Computer Science University of Edinburgh, UK.
31. Martini, S. 1988. Bounded quantifiers have interval models. ACM Conf. Lisp and Functional Programming Languages, Snowbird, USA.
32. Meseguer, J. 1988. Relating Models of Polymorphism. SRI-CSL-88-13, October, SRI Projects 2316, 4415 and 6729, SRI International.
33. Mitchell, J. C. 1984. Coercion and type inference. Proc. POPL 84.
34. Mitchell, J. C. 1986. A type-inference approach to reduction properties and semantics of polymorphic expressions. ACM Conf. LISP and Functional Programming, Boston, USA, 308–319.
35. Mitchell, J. C. 1988. Polymorphic type inference and containment. Information and Computation, 76 (2-3): 211–249.
36. Mitchell, J. C. and Plotkin, G. D. 1985. Abstract types have existential type. Proc. POPL 85. Ohori, A. 1987. Orderings and types in databases. Proc. Workshop on Database Programming Languages, Roscoff, France (September 1987).
37. Pitts, A. 1987. Polymorphism is Set theoretic, constructively. Symposium on Category Theory and Computer Science, SLNCS 283, Edinburgh, UK.
38. Reynolds, J. C. 1984. Polymorphism is not set-theoretic. Symposium on Semantics of Data Types, Volume 173 of Lecture Notes in Computer Science, Springer-Verlag.
39. Rosolini, G. 1986. Continuity and effectiveness in Topoi. DPhil. Thesis, Oxford University, UK. Scedrov, A.A Guide to Polymorphic Types. CIME Lectures Montecatini Terme, June, (revised version).
40. Troelstra, A. 1973. Metamathematical investigation of Intuitionistic Arithmetic and Analysis. Volume 344 of Lecture Notes in Mathematics, Springer-Verlag.
41. Wand, M. Type inference for record concatenation and multiple inheritance. Proc. Fourth Annual Symposium on Logic in Computer Science.