Structure and properties of traces for functional programs
From MaRDI portal
Publication:2867898
Recommendations
Cites work
- scientific article; zbMATH DE number 1691462 (Why is no real title available?)
- scientific article; zbMATH DE number 1692897 (Why is no real title available?)
- scientific article; zbMATH DE number 1692948 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 1231448 (Why is no real title available?)
- Essentials of term graph rewriting
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Optimistic evaluation
- Structure and properties of traces for functional programs
- Typer inference builds a short cut to deforestation
- Using term-graph rewriting models to analyse relative space efficiency
Cited in
(11)- Declarative Debugging of Rewriting Logic Specifications
- Tracking CSP computations
- scientific article; zbMATH DE number 4030949 (Why is no real title available?)
- Adaptable Traces for Program Explanations
- scientific article; zbMATH DE number 2000444 (Why is no real title available?)
- scientific article; zbMATH DE number 1691462 (Why is no real title available?)
- Dynamic slicing of lazy functional programs based on redex trails
- A Program Transformation for Tracing Functional Logic Computations
- Structure and properties of traces for functional programs
- Feedback, trace and fixed-point semantics
- Declarative debugging of rewriting logic specifications
This page was built for publication: Structure and properties of traces for functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867898)