Final algebras, cosemicomputable algebras and degrees of unsolvability
- 29 June 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 100 (2) , 267-302
- https://doi.org/10.1016/0304-3975(92)90305-y
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Algebraic specifications of computable and semicomputable data typesTheoretical Computer Science, 1987
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization TheoremsSIAM Journal on Computing, 1983
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- I/O-computable data structuresACM SIGPLAN Notices, 1981
- Data types, abstract data types and their specification problemTheoretical Computer Science, 1979
- Final algebra semantics and data type extensionsJournal of Computer and System Sciences, 1979
- Realization is universalTheory of Computing Systems, 1972
- CONSTRUCTIVE ALGEBRAS IRussian Mathematical Surveys, 1961