# A logic for abstract data types as existential types

Poll, Erik and Zwanenburg, Jan (1999) A logic for abstract data types as existential types. In: Girard, J.Y., ed. Typed Lambda Calculi and Applications 4th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 310-324. ISBN 978-3-540-65763-7. E-ISBN 978-3-540-48959-7. (doi:10.1007/3-540-48959-2_22)

PDF
 Preview
Postscript
 Preview
Official URL
http://dx.doi.org/10.1007/3-540-48959-2_22

## Abstract

The second-order lambda calculus allows an elegant formalisation of abstract data types (ADT's) using existential types. Plotkin and Abadi's logic for parametricity [PA93] then provides the useful proof principle of simulation for ADT's, which can be used to show equivalence of data representations. However, we show that this logic is not sufficient for reasoning about specifications of ADT's, and we present an extension of the logic that does provide the proof principles for ADT's that we want.

Item Type: Book section 10.1007/3-540-48959-2_22 Proceedings Paper Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer scienceQ Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, Faculties > Sciences > School of Computing F.D. Zabet 23 Apr 2009 11:46 UTC 06 Sep 2019 15:00 UTC https://kar.kent.ac.uk/id/eprint/16484 (The current URI for this page, for reference purposes)