On a conjecture of Bergstra and Tucker

DOI10.1016/0304-3975(89)90024-8zbMath0678.68015OpenAlexW2093902255WikidataQ122927864 ScholiaQ122927864MaRDI QIDQ1124321

G. Marongiu, Sauro Tulipani

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90024-8

zbMATH Keywords

initial algebra semanticsabstract) data type

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Theory of computing (68Q99)

Related Items (1)

Which data types have \(\omega\)-complete initial algebra specifications?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic specifications of computable and semicomputable data types
• The lambda calculus, its syntax and semantics
• Data types, abstract data types and their specification problem
• Positive equivalences
• Functionals defined by recursion
• A Note on Positive Equivalence Relations
• Classifying positive equivalence relations
• The completeness of the algebraic specification methods for computable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
• Data Type Specification: Parameterization and the Power of Specification Techniques
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• An axiomatic basis for computer programming

This page was built for publication: On a conjecture of Bergstra and Tucker