A completeness theorem for the expressive power of higher-order algebraic specifications
From MaRDI portal
Publication:1362341
DOI10.1006/JCSS.1997.1489zbMATH Open0906.68095OpenAlexW2047222889MaRDI QIDQ1362341FDOQ1362341
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Correctness of dataflow and systolic algorithms using algebras of streams
- Title not available (Why is that?)
- Universal algebra in higher types
- On the power of higher-order algebraic specification methods
- Title not available (Why is that?)
- Algebraic specifications of computable and semicomputable data types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- The completeness of the algebraic specification methods for computable data types
- Title not available (Why is that?)
- A recursive second order initial algebra specification of primitive recursion
Cited In (8)
- Verifying an infinite systolic algorithm using third-order equational methods
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
- Title not available (Why is that?)
- On the power of higher-order algebraic specification methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Higher-order algebra with transfinite types
- Higher-order equational logic for specification, simulation and testing
This page was built for publication: A completeness theorem for the expressive power of higher-order algebraic specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362341)
