Stable results and relative normalization

DOI10.1093/LOGCOM/10.3.323MaRDI QIDQ4500174zbMATH OpenOpenAlexFDO

Authors John Glauert, Richard Kennaway, Zurab Khasidashvili

Publication date 16 August 2001

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/10.3.323

zbMATH Keywords

orthogonal expression reduction systems

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• On Normalisation of Infinitary Combinatory Reduction Systems
• Relative normalization in Deterministic Residual Structures
• Optimal normalization in orthogonal term rewriting systems
• An abstract Böhm-normalization
• Decidable call-by-need computations in term rewriting

Cited in

(11)

• Relating conflict-free stable transition and event models via redex families
• The conflict-free reduction geometry
• An abstract Böhm-normalization
• Minimality in a linear calculus with iteration
• Discrete normalization and standardization in deterministic residual structures
• Union of Reducibility Candidates for Orthogonal Constructor Rewriting
• The geometry of orthogonal reduction spaces
• Redexes are stable in the -calculus
• Relative normalization in Deterministic Residual Structures
• Minimal relative normalization in orthogonal expression reduction systems
• On abstract normalisation beyond neededness

This page was built for publication: Stable results and relative normalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500174)