On observational equivalence and algebraic specification
Journal of Computer and System Sciences
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
Algebraic system specification and development
Algebraic system specification and development
On the equivalence of data representations
Artificial intelligence and mathematical theory of computation
Universal algebra in higher types
Theoretical Computer Science
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
On behavioural abstraction and behavioural satisfaction in higher-order logic
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Proof systems for structured specifications with observability operators
Theoretical Computer Science - Special issue: algebraic development techniques
The definition of extended ML: a gentle introduction
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
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simple Model for Quotient Types
TLCA '95 Proceedings of the Second 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
Algebraic Specification Languages: An Overview
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
Dependent Types Considered Necessary for Specification Languages
Proceedings of the 7th Workshop on Abstract Data Types: Recent Trends in Data Type Specification
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Outline of a Proof Theory of Parametricity
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Algebraic Specifications, Higher-Order Types, and Set-Theoretic Models
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
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.