Structure and Properties of Traces for Functional Programs

DOI10.1016/j.entcs.2006.10.032zbMath1278.68058OpenAlexW2153842012MaRDI QIDQ2867898

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

zbMATH Keywords

Haskelldebuggingtracingaugmented redex trail

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items

Tracking CSP computations ⋮ Declarative Debugging of Rewriting Logic Specifications ⋮ Declarative debugging of rewriting logic specifications ⋮ Structure and Properties of Traces for Functional Programs

Uses Software

• Haskell
• Freja
• Hat
• Hood

Cites Work

• Typer inference builds a short cut to deforestation
• Structure and Properties of Traces for Functional Programs
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Essentials of Term Graph Rewriting
• Optimistic evaluation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structure and Properties of Traces for Functional Programs