Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- 1 May 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (2) , 366-387
- https://doi.org/10.1137/0212024
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Terminal algebra semantics and retractions for abstract data typesPublished by Springer Nature ,1980
- A characterisation of computable data types by means of a finite equational specification methodPublished by Springer Nature ,1980
- On the adequacy of finite equational methods for data type specificationACM SIGPLAN Notices, 1979
- Final algebra semantics and data type extensionsJournal of Computer and System Sciences, 1979
- Existential quantifiers in abstract data typesPublished by Springer Nature ,1979
- The algebraic specification of abstract data typesActa Informatica, 1978
- The Type Free Lambda CalculusPublished by Elsevier ,1977
- A Course in Mathematical LogicPublished by Springer Nature ,1977
- Specification techniques for data abstractionsIEEE Transactions on Software Engineering, 1975
- CONSTRUCTIVE ALGEBRAS IRussian Mathematical Surveys, 1961