Minimal relative normalization in orthogonal expression reduction systems
From MaRDI portal
Recommendations
Cites work
- An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
- Combinatory reduction systems: Introduction and survey
- Full abstraction in the lazy lambda calculus
- Higher-order families
- scientific article; zbMATH DE number 4179330 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 512788 (Why is no real title available?)
- scientific article; zbMATH DE number 1479634 (Why is no real title available?)
- scientific article; zbMATH DE number 1499112 (Why is no real title available?)
- scientific article; zbMATH DE number 1761894 (Why is no real title available?)
- scientific article; zbMATH DE number 1456960 (Why is no real title available?)
- Minimal and Optimal Computations of Recursive Programs
- Needed reduction and spine strategies for the lambda calculus
- Optimal normalization in orthogonal term rewriting systems
- Programming in equational logic: Beyond strong sequentiality
- Relative normalization in Deterministic Residual Structures
- Sequential evaluation strategies for parallel-or and related reduction systems
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Transfinite reductions in orthogonal term rewriting systems
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)
