Algebraic specifications of computable and semicomputable data types
type: Item
instance of: scholarly article
title: Algebraic specifications of computable and semicomputable data types
zbMATH Open document ID: 0637.68013
DOI: 10.1016/0304-3975(87)90123-X
author: John V. Tucker
author: J. A. Bergstra
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
review text: The authors of this paper are well known contributors in the theory of the abstract data types. This paper is an extensive survey of various specification mechanisms based on initial algebra semantics. The mathematical basis of the algebraic approach to data type specification is reviewed. A proper mathematical analysis and classification of the algebraic specification methods are given. The equational and conditional equational specifications, with and without hidden functions or hidden sorts are described.
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4039257
zbMATH Keywords: abstract data types
zbMATH Keywords: initial algebra semantics
zbMATH Keywords: algebraic specification
MaRDI profile type: Publication
cites work: Q3912001
cites work: Q3217583
cites work: Q3208066
cites work: Q3853107
cites work: Q3896478
cites work: Q3851592
cites work: Q3854600
cites work: Q3854601
cites work: Q3917477
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: Expressiveness and the completeness of Hoare's logic
cites work: The axiomatic semantics of programs based on Hoare's logic
cites work: Q4190110
cites work: Partial abstract types
cites work: Q5515373
cites work: Q5572358
cites work: Q4168052
cites work: Q4178466
cites work: The algebraic specification of abstract data types
cites work: Partial evaluation and \(\omega\)-completeness of algebraic specifications
cites work: An axiomatic basis for computer programming
cites work: Proof of correctness of data representations
cites work: Q3681911
cites work: Q4747503
cites work: A constructive method for abstract algebraic software specification
cites work: Q4145882
cites work: Extended directed graphs, a formalism for structured data and data structures
cites work: Data types, abstract data types and their specification problem
cites work: CONSTRUCTIVE ALGEBRAS I
cites work: Q5596230
cites work: Q5682023
cites work: Q3687683
cites work: Q3248054
cites work: Computable Algebra, General Theory and Theory of Computable Fields
cites work: Q5573961
cites work: Q5677651
cites work: Q4934287
cites work: Data Type Specification: Parameterization and the Power of Specification Techniques
cites work: Q4039815
cites work: Final algebra semantics and data type extensions
cites work: Q3883462
cites work: Numerical analysis as an independent science
full work available at URL: 0304-3975(87)90123-x
OpenAlex ID: W2007898361
description: scientific article; zbMATH DE number 4039257