Higher-order equational logic for specification, simulation and testing

DOI10.1007/3-540-61254-8_23MaRDI QIDQ4645808zbMATH OpenOpenAlexFDO

Authors 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

computational logicexpressive powerspecification languageproof rulelogical query

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3888893 (Why is no real title available?)
• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3911679 (Why is no real title available?)
• scientific article; zbMATH DE number 3936465 (Why is no real title available?)
• scientific article; zbMATH DE number 3784848 (Why is no real title available?)
• scientific article; zbMATH DE number 42431 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)
• scientific article; zbMATH DE number 194509 (Why is no real title available?)
• A completeness theorem for the expressive power of higher-order algebraic specifications
• A recursive second order initial algebra specification of primitive recursion
• Algebraic specifications of computable and semicomputable data types
• Higher-order algebra, logic, and term rewriting. 1st International Workshop, HOA '93, Amsterdam, the Netherlands, September 23-24, 1993. Selected papers
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• On the power of higher-order algebraic specification methods
• Recursion on the countable functionals
• The completeness of the algebraic specification methods for computable data types
• Universal algebra in higher types

Cited in

(5)

• Verifying an infinite systolic algorithm using third-order equational methods
• scientific article; zbMATH DE number 3991419 (Why is no real title available?)
• scientific article; zbMATH DE number 139986 (Why is no real title available?)
• scientific article; zbMATH DE number 1617310 (Why is no real title available?)
• scientific article; zbMATH DE number 1086649 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645808)