scientific article; zbMATH DE number 4003501
From MaRDI portal
zbMATH Open0618.68016MaRDI QIDQ4728229FDOQ4728229
Authors: G. Marongiu, Sauro Tulipani 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4078769
- On a conjecture of Bergstra and Tucker
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Algebraic specifications of computable and semicomputable data types
- scientific article; zbMATH DE number 3936489
algebraic specificationsequational theoryconditional equationsdata typesinitial algebra semanticsCombinatory Logicsemicomputable data algebra
Data structures (68P05) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80)
Cited In (15)
- The data type variety of stack algebras
- Final algebras, cosemicomputable algebras and degrees of unsolvability
- Title not available (Why is that?)
- Algebraic specifications of computable and semicomputable data types
- Computer Science Logic
- Title not available (Why is that?)
- Which data types have \(\omega\)-complete initial algebra specifications?
- Formal Methods in Software and Systems Modeling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic specifiability of data types with minimal computable parameters
- Title not available (Why is that?)
- A Unified Formal Description of Arithmetic and Set Theoretical Data Types
- On a conjecture of Bergstra and Tucker
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728229)
