A logic for abstract data types as existential types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1581, Issue , 1999, Pages 310-324

  Poll, Erik ^a   Zwanenburg, Jan ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); PATHOLOGY;

DATA REPRESENTATIONS; EXISTENTIAL TYPES; FORMALISATION; LAMBDA CALCULUS; PARAMETRICITY; SECOND ORDERS;

ABSTRACT DATA TYPES;

EID: 84947256092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_22     Document Type: Conference Paper

References (14)

1. H.P. Barendregt. Lambda calculi with types. In D.M. Gabbai, S. Abramsky, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1. Oxford University Press, 1992.
2. E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott. Functorial polymorphism. Theoretical Computer Science, 70 (1):35-64, 1990.
3. G. Barthe and J.H. Geuvers. Congruence types. In CSL’95, volume 1092 of Lecture Notes in Computer Science, pages 36-51. Springer, 1996.
4. R.L. Constable et al. Implementing Mathematics in the Nuprl proof development system. Prentice-Hall, 1986.
5. Thierry Coquand and Christine Paulin. Inductively Defined Types. In P. Martin-Löf and G. Mints, editors, COLOG-88, volume 417 of Lecture Notes in Computer Science, pages 50-66. Springer, 1990.
6. M. J. Gordon and T. F. Melham. Introduction to HOL. Cambridge, 1993.
7. Martin Hofmann. A simple model for quotient types. In TLCA’95, volume 902 of Lecture Notes in Computer Science, pages 216-234, 1995.
8. John C. Mitchell. On the equivalence of data representations. In Artificial Intelligence and Mathematical Theory of Computation, pages 305-330. Academic Press, 1991.
9. John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Trans. on Prog. Lang. and Syst., 10 (3):470-502, 1988.
10. Gordon Plotkin and Martin Abadi. A logic for parametric polymorphism. In TLCA’93, volume 664 of Lecture Notes in Computer Science, pages 361-375, 1993.
11. Christine Paulin-Mohring. Inductive definitions in the system Coq. In TLCA’93, volume 664 of Lecture Notes in Computer Science, pages 328-345. Springer, 1993.
12. Erik Poll. A Programming Logic based on Type Theory. PhD thesis, Technische Universiteit Eindhoven, 1994.
13. Izumi Takeuti. An axiomatic system of parametricity. In TLCA’97, volume 1130 of Lecture Notes in Computer Science, pages 354-372, 1997.
14. Jan Zwanenburg. The proof assistant Yarrow. Submitted for publication. See also http://www.win.tue.nl/cs/pa/janz/yarrow/, 1997.