(Enter summary)
Abstract: This paper describes a
type-theoretical and denotational semantics foundation for Pebble-like languages. (Update)
Context of citations to this paper: More
.... this assumption is carefully avoided, whereas in programming languages like those studied by Burstall and Lampson [5] or by Cardelli [6], it is explicitly used. Models of such calculi with the axiom Type: Type have been constructed using finitary retractions and or...
...whereas we use a domain theoretic semantics. Another inspiration is Cardelli s early work on a partial type theory based on Type:Type [Car86]. The way the matching operator is used in the latest version of the COQ system seems to be closely related to our general case...
Cited by: More
Polytypic Functional Programming and Data Abstraction - Iglesias (2006)
(Correct)
An Implementation of Type:Type Thierry Coquand and Makoto.. - Department Of Computing
(Correct)
Programming Metalogics with a Fixpoint Type - Crole (1992)
(Correct)
Active bibliography (related documents): More All
2.5: A Polymorphic lambda-calculus with Type:Type - Cardelli (1986)
(Correct)
1.3: On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)
(Correct)
0.7: Basic Polymorphic Typechecking - Cardelli (1988)
(Correct)
Similar documents based on text: More All
0.6: Operations on Records - Cardelli, Mitchell (1991)
(Correct)
0.5: An implementation of F<: - Cardelli (1993)
(Correct)
0.2: Typechecking is Undecidable When 'type' is a Type - Reinhold (1989)
(Correct)
Related documents from co-citation: More All
2: The effective topos (context) - Hyland - 1982
2: An intuitionistic theory of types (context) - Martin-Lof - 1971
2: Implementing Mathematics with the Nuprl Proof Development System
- Constable - 1986
BibTeX entry: (Update)
Cardelli L. [1986] "A polymorphic lambda-calculus with Type:Type", Preprint, Syst. Res. http://citeseer.ist.psu.edu/cardelli86polymorphic.html More
@techreport{ cardelli86polymorphic,
author = "Luca Cardelli",
title = "A Polymorphic Lambda Calculus with Type:Type",
number = "10",
address = "Palo Alto, California",
year = "1986",
url = "citeseer.ist.psu.edu/cardelli86polymorphic.html" }
Citations (may not include all citations):
37
A kernel language for abstract data types and modules (context) - Burstall, Lampson - 1984 DBLP
14
Journal of Computer and System Science (context) - Milner, of et al. - 1978
13
Plotkin: Abstract types have existential type (context) - Mitchell - 1985
10
University of Stockholm (context) - Martin-Lf, of et al. - 1971
9
et son application l'limination des coupures dans l'analyse .. (context) - Girard, de l'interprtation et al. - 1971
9
Symposium on Lisp and Functional Programming (context) - MacQueen, Standard et al. - 1984
8
ACM Symposium on Lisp and Functional Programming (context) - Milner, for et al. - 1984
7
Meyer: The semantics of second order polymorphic lambda calc.. (context) - Bruce - 1984
7
Huet: Constructions: a higher order proof system for mechani.. (context) - Coquand - 1985
4
SIAM Journal of Computing (context) - Scott, as - 1976
3
Symposium on Automatic Demonstration (context) - Scott, validity - 1970
3
O'Donnell: The expressiveness of simple and second-order typ.. (context) - Fortune, Leivant - 1983
3
Technical Report No (context) - Cardelli, Wegner et al.
3
Demers: Data types are values (context) - Donahue - 1985
2
Donahue: An informal description of Russell (context) - Boehm, Demers - 1980
2
Notes by Giovanni Sambin of a series of lectures given in Pa.. (context) - Martin-Lf, theory - 1980
2
Syracuse University (context) - McCracken, of et al. - 1979
2
a first attempt (context) - Hook, Russell - 1984
2
Technical Report No (context) - Paulson, operators et al. - 1984
2
Longo: The finitary projection model for second order lambda.. (context) - Amadio, Bruce - 1985
2
Longo: A type-free look at types as parameters (context) - Amadio
2
Rezus: Semantics for classical Automath and related systems (context) - Barendregt - 1983
1
Thse de doctorat d'Etat (context) - Girard, et et al. - 1972
1
Khamiss: The while-rule in Martin-Lf's theory of types (context) - Backhouse - 1984
1
Reinhold: 'Type' is not a type (context) - Meyer - 1986
1
Lecture Notes in Computer Science No (context) - Constable, in et al. - 1983
1
Zlatin: The type theory of PL/CV (context) - Constable - 1984
1
Plotkin: An ideal model for recursive polymorphic types (context) - MacQueen, Sethi - 1984
1
Informatics Department (context) - Rezus, constructive et al. - 1985
1
Thse prsente l'Universit Paris VII pour obtenir le Diplme de.. (context) - Coquand, des
1
to appear in Information and Control (context) - McCracken, retract et al.
Documents on the same site (http://www.luca.demon.co.uk/Bibliography.html): More
On Binary Methods - Bruce, Cardelli, Castagna, Eifrig.. (1995)
(Correct)
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993)
(Correct)
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)
(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