From reduction-based to reduction-free normalization

MaRDI QIDQ2849585zbMATH OpenFDO

Authors Olivier Danvy

Publication date 20 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105001301

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• From reduction-based to reduction-free normalization
• From outermost reduction semantics to abstract machine
• scientific article; zbMATH DE number 2090724
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1722652

Cited in

(9)

• Reducing t-norms and augmenting t-conorms
• From outermost reduction semantics to abstract machine
• Inter-deriving Semantic Artifacts for Object-Oriented Programming
• From reduction-based to reduction-free normalization
• Correcting the Normalization Shift of Redundant Binary Representations
• What Is the Limit of Redundancy Reduction with Divisive Normalization?
• Language transformations in the classroom
• Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
• A syntactic correspondence between context-sensitive calculi and abstract machines

This page was built for publication: From reduction-based to reduction-free normalization

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