Higher-order equational logic for specification, simulation and testing

DOI10.1007/3-540-61254-8_23zbMath1407.68310OpenAlexW1877230773MaRDI QIDQ4645808

Karl Meinke

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61254-8_23

zbMATH Keywords

expressive powerspecification languagecomputational logicproof rulelogical query

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42)

Related Items (1)

Verifying an infinite systolic algorithm using third-order equational methods

Cites Work

• Algebraic specifications of computable and semicomputable data types
• Recursion on the countable functionals
• Universal algebra in higher types
• Higher-order algebra, logic, and term rewriting. 1st International Workshop, HOA '93, Amsterdam, the Netherlands, September 23-24, 1993. Selected papers
• A recursive second order initial algebra specification of primitive recursion
• A completeness theorem for the expressive power of higher-order algebraic specifications
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher-order equational logic for specification, simulation and testing