Computability Closure: Ten Years Later

DOI10.1007/978-3-540-73147-4_4MaRDI QIDQ3608812zbMATH OpenOpenAlexFDO

Authors Frédéric Blanqui

Publication date 6 March 2009

Published in Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00161092/file/main.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• HORPO with Computability Closure: A Reconstruction
• The Computability Path Ordering: The End of a Quest
• The computability path ordering
• Normal higher-order termination

Cited in

(4)

• The Computability Path Ordering: The End of a Quest
• Normal higher-order termination
• The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility

This page was built for publication: Computability Closure: Ten Years Later

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608812)