scientific article; zbMATH DE number 3649971

MaRDI QIDQ3208066zbMATH OpenFDO

Authors J. A. Bergstra, John V. Tucker

Publication date 1979

zbMATH Keywords

algebraic data typesalgebraic replacement systemsChurch-Rosser systemscomputable algebrasequational specifications

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Data structures (68P05)

Cited in

(11)

• Algebraic specifications of computable and semicomputable data types
• Complexity of algebraic implementations for abstract data types
• Algebraic implementation of abstract data types
• Partial abstract types
• Final algebras, cosemicomputable algebras and degrees of unsolvability
• Recursive unary algebras and trees
• Restrictions of congruences generated by finite canonical string-rewriting systems
• Semantics of non-terminating rewrite systems using minimal coverings
• Defining algorithmically presented structures in first order logic
• Implementation of data types by algebraic methods
• A constructive method for abstract algebraic software specification

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 Q3208066)