scientific article; zbMATH DE number 1953288

zbMATH Open1026.68506MaRDI QIDQ4414741FDOQ4414741

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

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4945227
• \(\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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective longest and infinite reduction paths in untyped λ-calculi
• Anagopos: a reduction graph visualizer for term rewriting and lambda calculus
• Title not available (Why is that?)
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
• 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)