Computability Closure: Ten Years Later
From MaRDI portal
Publication:3608812
Recommendations
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)