Poll, E. and Zwanenburg, J. (1999) A logic for abstract data types as existential types. In: 4th International Conference on Typed Lambda Calculi and Applications (TLCA 99), Apr 07-09, 1999, Laquila, Italy.
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:||Conference or workshop item (Paper)|
|Additional information:||Proceedings Paper|
Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing|
|Depositing User:||F.D. Zabet|
|Date Deposited:||23 Apr 2009 11:46|
|Last Modified:||06 Sep 2011 02:04|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/16484 (The current URI for this page, for reference purposes)|
- Depositors only (login required):