A completeness theorem for the expressive power of higher-order algebraic specifications
From MaRDI portal
(Redirected from Publication:1362341)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3655328 (Why is no real title available?)
- scientific article; zbMATH DE number 3784848 (Why is no real title available?)
- scientific article; zbMATH DE number 3577197 (Why is no real title available?)
- scientific article; zbMATH DE number 217097 (Why is no real title available?)
- A recursive second order initial algebra specification of primitive recursion
- Algebraic specifications of computable and semicomputable data types
- Correctness of dataflow and systolic algorithms using algebras of streams
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- On the power of higher-order algebraic specification methods
- The completeness of the algebraic specification methods for computable data types
- Universal algebra in higher types
Cited in
(8)- Higher-order equational logic for specification, simulation and testing
- Verifying an infinite systolic algorithm using third-order equational methods
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
- scientific article; zbMATH DE number 4078768 (Why is no real title available?)
- On the power of higher-order algebraic specification methods
- scientific article; zbMATH DE number 4078770 (Why is no real title available?)
- scientific article; zbMATH DE number 18648 (Why is no real title available?)
- Higher-order algebra with transfinite types
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)