From Stack Traces to Lazy Rewriting Sequences

DOI10.1007/978-3-642-34407-7_7MaRDI QIDQ2830049zbMATH OpenOpenAlexFDO

Authors Stephen F. Chang, Eli Barzilay, J. C. Clements, Matthias Felleisen

Publication date 9 November 2016

Published in Implementation and Application of Functional Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34407-7_7

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Lazy rewriting and context-sensitive rewriting
• Termination of lazy rewriting revisited
• Lazy rewriting and eager machinery
• Rewriting higher-order stack trees
• Rewriting higher-order stack trees
• scientific article; zbMATH DE number 1956543
• Trace rewriting systems

Cited in

(4)

• Adapting combinator and SECD machines to display snapshots of functional computations
• scientific article; zbMATH DE number 1692948 (Why is no real title available?)
• SequenceL provides a different way to view programming
• Lazy call-by-value evaluation

Describes a project that uses

Uses Software

• PLT Redex

This page was built for publication: From Stack Traces to Lazy Rewriting Sequences

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