Specification Refinement with System F (1999)
| Venue: | In Proc. CSL'99, volume 1683 of LNCS |
| Citations: | 6 - 3 self |
BibTeX
@INPROCEEDINGS{Hannay99specificationrefinement,
author = {Jo Erskine Hannay},
title = {Specification Refinement with System F},
booktitle = {In Proc. CSL'99, volume 1683 of LNCS},
year = {1999},
pages = {530--545},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Essential concepts of algebraic specification refinement are translated into a type-theoretic setting involving System F and Reynolds' relational parametricity assertion as expressed in Plotkin and Abadi's logic for parametric polymorphism. At first order, the type-theoretic setting provides a canonical picture of algebraic specification refinement. At higher order, the type-theoretic setting allows future generalisation of the principles of algebraic specification refinement to higher order and polymorphism. We show the equivalence of the acquired type-theoretic notion of specification refinement with that from algebraic specification. To do this, a generic algebraic-specification strategy for behavioural refinement proofs is mirrored in the type-theoretic setting. 1 Introduction This paper aims to express in type theory certain essential concepts of algebraic specification refinement. The benefit to algebraic specification is that inherently first-order concepts are tra...
