Higher-order equational logic for specification, simulation and testing
From MaRDI portal
Publication:4645808
DOI10.1007/3-540-61254-8_23zbMATH Open1407.68310OpenAlexW1877230773MaRDI QIDQ4645808FDOQ4645808
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
Grammars and rewriting systems (68Q42) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursion on the countable functionals
- Universal algebra in higher types
- On the power of higher-order algebraic specification methods
- Algebraic specifications of computable and semicomputable data types
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- The completeness of the algebraic specification methods for computable data types
- A recursive second order initial algebra specification of primitive recursion
- Higher-order algebra, logic, and term rewriting. 1st International Workshop, HOA '93, Amsterdam, the Netherlands, September 23-24, 1993. Selected papers
- A completeness theorem for the expressive power of higher-order algebraic specifications
Cited In (3)
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)
