Minimal relative normalization in orthogonal expression reduction systems
From MaRDI portal
Publication:6567775
DOI10.1007/3-540-62034-6_53zbMATH Open1541.68174MaRDI QIDQ6567775FDOQ6567775
Zurab Khasidashvili, John Glauert
Publication date: 5 July 2024
Cites Work
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Combinatory reduction systems: Introduction and survey
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Full abstraction in the lazy lambda calculus
- Minimal and Optimal Computations of Recursive Programs
- Transfinite reductions in orthogonal term rewriting systems
- Higher-order families
- Needed reduction and spine strategies for the lambda calculus
- Sequential evaluation strategies for parallel-or and related reduction systems
- Programming in equational logic: Beyond strong sequentiality
- Optimal normalization in orthogonal term rewriting systems
- Relative normalization in Deterministic Residual Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Minimal relative normalization in orthogonal expression reduction systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567775)
