scientific article; zbMATH DE number 1953288

MaRDI QIDQ4414741zbMATH OpenFDO

Authors Peter Sestoft

Publication date 27 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2566/25660420.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1424037
• \(\lambda_{\beta'}\) -- a \(\lambda\)-calculus with a generalized \(\beta\)-reduction rule
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
• Refining reduction in the lambda calculus
• Encoding left reduction in the λ-calculus with interaction nets

Cited in

(12)

• scientific article; zbMATH DE number 7204429 (Why is no real title available?)
• On randomised strategies in the -calculus
• scientific article; zbMATH DE number 1868923 (Why is no real title available?)
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• Effective longest and infinite reduction paths in untyped λ-calculi
• Evaluating lambda terms with traversals
• scientific article; zbMATH DE number 50753 (Why is no real title available?)
• Anagopos: a reduction graph visualizer for term rewriting and lambda calculus
• Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• Shrinking lambda expressions in linear time
• Refining reduction in the lambda calculus

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 Q4414741)