On a conjecture of Bergstra and Tucker
type: Item
instance of: scholarly article
title: On a conjecture of Bergstra and Tucker
zbMATH Open document ID: 0678.68015
DOI: 10.1016/0304-3975(89)90024-8
author: G. Marongiu
author: Sauro Tulipani
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q99
zbMATH DE Number: 4111988
zbMATH Keywords: abstract) data type
zbMATH Keywords: initial algebra semantics
Wikidata QID: Q122927864
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90024-8
OpenAlex ID: W2093902255
cites work: The lambda calculus, its syntax and semantics
cites work: Q3853107
cites work: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
cites work: The completeness of the algebraic specification methods for computable data types
cites work: Algebraic specifications of computable and semicomputable data types
cites work: Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
cites work: Classifying positive equivalence relations
cites work: Q3221381
cites work: Positive equivalences
cites work: Q4722037
cites work: An axiomatic basis for computer programming
cites work: A Note on Positive Equivalence Relations
cites work: Data types, abstract data types and their specification problem
cites work: CONSTRUCTIVE ALGEBRAS I
cites work: Q4728229
cites work: Computable Algebra, General Theory and Theory of Computable Fields
cites work: Functionals defined by recursion
cites work: Data Type Specification: Parameterization and the Power of Specification Techniques
cites work: Q3922646
description: scientific article; zbMATH DE number 4111988