Algebraic specifiability of data types with minimal computable parameters

DOI10.1016/0304-3975(91)90049-8zbMath0751.68037OpenAlexW1998217516MaRDI QIDQ1183572

P. H. Rodenburg

Publication date: 28 June 1992

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

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

zbMATH Keywords

algebraic specification for parametrized data typesparametrized data types

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Cites Work

• Algebraic specifications of computable and semicomputable data types
• The completeness of the algebraic specification methods for computable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Fast Decision Procedures Based on Congruence Closure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic specifiability of data types with minimal computable parameters