Structure and properties of traces for functional programs
From MaRDI portal
Publication:2867898
DOI10.1016/J.ENTCS.2006.10.032zbMATH Open1278.68058OpenAlexW2153842012MaRDI QIDQ2867898FDOQ2867898
Authors: Olaf Chitil, Yong Luo 
Publication date: 20 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.032
Recommendations
Cites Work
- Title not available (Why is that?)
- Optimistic evaluation
- Title not available (Why is that?)
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Title not available (Why is that?)
- Title not available (Why is that?)
- Typer inference builds a short cut to deforestation
- Structure and properties of traces for functional programs
- Essentials of Term Graph Rewriting
- Title not available (Why is that?)
- Using term-graph rewriting models to analyse relative space efficiency
Cited In (11)
- Declarative Debugging of Rewriting Logic Specifications
- Tracking CSP computations
- Title not available (Why is that?)
- Adaptable Traces for Program Explanations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Program Transformation for Tracing Functional Logic Computations
- Dynamic slicing of lazy functional programs based on redex trails
- Structure and properties of traces for functional programs
- Feedback, trace and fixed-point semantics
- Declarative debugging of rewriting logic specifications
Uses Software
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)
