Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract data types and the development of data structures
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Some extensions to algebraic specifications
Proceedings of an ACM conference on Language design for reliable software
Data Types
ACM SIGPLAN Notices
Limits of the "algebraic" specification of abstract data types
ACM SIGPLAN Notices
Computation: finite and infinite machines
Computation: finite and infinite machines
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Writing Larch interface language specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
Journal of the ACM (JACM)
Abstract Implementations and Their Correctness Proofs
Journal of the ACM (JACM)
Formal Specification of Graphic Data Types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data Type Specification: Parameterization and the Power of Specification Techniques
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics of First Order Parametric Specifications
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Classes of functions for computing on binary trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Complexity of implementations on the level of algebraic specifications
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A language for computational algebra
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Function level programs as mathematical objects
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
On the specification of behavioural constraints
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
On the power of conditional specifications
ACM SIGPLAN Notices
Some definitions for algebraic data type specifications
ACM SIGPLAN Notices
A language for computational algebra
ACM SIGPLAN Notices
Algebraic specification schemes for data base systems
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
SLAN-4: a language for the specification and design of large software systems
IBM Journal of Research and Development
Order-sorted parameterization and induction
Semantics and algebraic specification
| Hi-index | 0.00 |
This paper extends our earlier work on abstract data types by providing an algebraic treatment of parametrized data types (e.g., sets-of-(), stacks-of-(), etc.), as well as answering a number of questions on the power and limitations of algebraic specification techniques. In brief: we investigate the “hidden function” problem (the need to include operations in specifications which we want to be hidden from the user); we prove that conditional specifications are inherently more powerful than equational specifications; we show that parameterized specifications must contain “side conditions” (e.g., that finite-sets-of-d requires an equality predicate on d), and we compare the power of the algebraic approach taken here with the more categorical approach of Lehman and Smyth.