Abstract data types and software validation
Communications of the ACM
Toward an understanding of data structures
Communications of the ACM
Existential Quantifiers in Abstract Data Types
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
ACM Transactions on Programming Languages and Systems (TOPLAS)
Executable specifications with quantifiers in the FASE system
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The semantics of lazy (and industrious) evaluation
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
I/O-computable data structures
ACM SIGPLAN Notices
Relating models of backtracking
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
A new specification method for data types is presented, which is distinguished by the semantic objects it specifies. In particular, only final data types [GGM,W] are specifiable. A final data type is one in which no two elements are "input-output equivalent". It is argued that the mathematical properties of final data types characterize abstractness on the semantic level.Examples are given to show that final data type specifications are easy to construct and use.