scientific article; zbMATH DE number 1456960

zbMATH Open0938.68643MaRDI QIDQ4954449FDOQ4954449

Authors: Zurab Khasidashvili 

Publication date: 7 June 2000

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (12)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• Minimal relative normalization in orthogonal expression reduction systems
• The conflict-free reduction geometry
• On equal \(\mu \)-terms
• Reductional programming of functions represented by recurrent relations of the first order
• Perpetual reductions in \(\lambda\)-calculus
• On the longest perpetual reductions in orthogonal expression reduction systems
• The geometry of orthogonal reduction spaces
• Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
• A short proof of the decidability of normalization in recursive program schemes
• IO vs OI in higher-order recursion schemes
• Verification, Model Checking, and Abstract Interpretation

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)