A completeness theorem for the expressive power of higher-order algebraic specifications

DOI10.1006/jcss.1997.1489zbMath0906.68095OpenAlexW2047222889MaRDI QIDQ1362341

Karl Meinke

Publication date: 16 February 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1489

zbMATH Keywords

universal algebraequational specifications

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (4)

Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. ⋮ Higher-order equational logic for specification, simulation and testing ⋮ Higher-order algebra with transfinite types ⋮ Verifying an infinite systolic algorithm using third-order equational methods

Cites Work

• Algebraic specifications of computable and semicomputable data types
• Universal algebra in higher types
• A recursive second order initial algebra specification of primitive recursion
• On the power of higher-order algebraic specification methods
• The completeness of the algebraic specification methods for computable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Correctness of dataflow and systolic algorithms using algebras of streams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A completeness theorem for the expressive power of higher-order algebraic specifications