Union of Reducibility Candidates for Orthogonal Constructor Rewriting

DOI10.1007/978-3-540-69407-6_54zbMath1142.03336OpenAlexW1485460217MaRDI QIDQ3507467

Colin Riba

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_54

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Size-based termination of higher-order rewriting ⋮ Completeness of second-order intuitionistic propositional logic with respect to phase semantics for proof-terms ⋮ On the Values of Reducibility Candidates

Uses Software

• Automath

This page was built for publication: Union of Reducibility Candidates for Orthogonal Constructor Rewriting