Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.

DOI10.1016/S0022-0000(03)00048-5zbMath1054.68134OpenAlexW1972927864MaRDI QIDQ1401983

Karl Meinke

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00048-5

zbMATH Keywords

observational equivalence

Mathematics Subject Classification ID

Related Items (1)

A process calculus with finitary comprehended terms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On observational equivalence and algebraic specification
• Recursion on the countable functionals
• Universal algebra in higher types
• 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
• Completeness in the theory of types
• Correctness of dataflow and systolic algorithms using algebras of streams

This page was built for publication: Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.