Computability Closure: Ten Years Later

DOI10.1007/978-3-540-73147-4_4zbMath1186.68230OpenAlexW1866224132MaRDI QIDQ3608812

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)

Related Items

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