On observational equivalence and algebraic specification
Journal of Computer and System Sciences
Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Extensional models for polymorphism
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
On the equivalence of data representations
Artificial intelligence and mathematical theory of computation
Formal parametric polymorphism
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Foundations of programming languages
Foundations of programming languages
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Proof systems for structured specifications with observability operators
Theoretical Computer Science - Special issue: algebraic development techniques
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Verifying Properties of Module Construction in Type Theory
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Logic for Abstract Data Types as Existential Types
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Behavioural Specifications in Type Theory
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Existential Types: Logical Relations and Operational Equivalence
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Constructive Data Refinement in Typed Lambda Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Dependent Types Considered Necessary for Specification Languages
Proceedings of the 7th Workshop on Abstract Data Types: Recent Trends in Data Type Specification
Outline of a Proof Theory of Parametricity
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
| Hi-index | 0.00 |
The notion of data type specification refinement is discussed in a setting of System F and the logic for parametric polymorphism of Plotkin and Abadi. At first order, one gets a notion of specification refinement up to observational equivalence in the logic simply by using Luo's formalism. This paper generalises this notion to abstract data types whose signatures contain higher-order and polymorphic functions. At higher order, the tight connection in the logic between the existence of a simulation relation and observational equivalence ostensibly breaks down. We show that an alternative notion of simulation relation is suitable. This also gives a simulation relation in the logic that composes at higher order, thus giving a syntactic logical counterpart to recent advances on the semantic level.