scientific article; zbMATH DE number 1456960
From MaRDI portal
Publication:4954449
Recommendations
- A short proof of the decidability of normalization in recursive program schemes
- Krivine machines and higher-order schemes
- Recursive schemes, Krivine machines, and collapsible pushdown automata
- Decidable subcases of the equivalence problem for recursive program schemes
- Krivine machines and higher-order schemes
Cited in
(12)- The geometry of orthogonal reduction spaces
- Verification, Model Checking, and Abstract Interpretation
- The conflict-free reduction geometry
- On equal \(\mu \)-terms
- A short proof of the decidability of normalization in recursive program schemes
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Reductional programming of functions represented by recurrent relations of the first order
- Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
- IO vs OI in higher-order recursion schemes
- Minimal relative normalization in orthogonal expression reduction systems
- Perpetual reductions in \(\lambda\)-calculus
- On the longest perpetual reductions in orthogonal expression reduction systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954449)
