Rewriting Techniques and Applications
From MaRDI portal
Recommendations
Cited in
(17)- A complexity tradeoff in ranking-function termination proofs
- Strictness analysis of the untyped \(\lambda\)-calculus
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- Strong normalisation in -calculi with references
- The strength of the SCT criterion
- Call-by-value Termination in the Untyped lambda-calculus
- The Computability Path Ordering: The End of a Quest
- scientific article; zbMATH DE number 3557747 (Why is no real title available?)
- scientific article; zbMATH DE number 1301734 (Why is no real title available?)
- Dependency pairs termination in dependent type theory modulo rewriting
- The size-change termination principle for constructor based languages
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Programming Languages and Systems
- Termination of combined (rewrite and λ-calculus) systems
- A simplifier for untyped lambda expressions
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
This page was built for publication: Rewriting Techniques and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901559)