Dynamic slicing of lazy functional programs based on redex trails

DOI10.1007/s10990-008-9023-7zbMath1192.68139OpenAlexW2088821694MaRDI QIDQ2271904

Josep Silva, Claudio Ochoa, Germán Vidal

Publication date: 4 August 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.9841

zbMATH Keywords

debuggingslicinglazy functional programmingredex trails

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Slicing concurrent constraint programs ⋮ Functional Logic Programming: From Theory to Curry ⋮ Dynamic slicing of lazy functional programs based on redex trails ⋮ Explainable dynamic programming

Uses Software

• Haskell
• TOY
• Hat

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic program slicing
• Eliminating dead code on recursive data.
• Dynamic slicing of lazy functional programs based on redex trails
• Operational semantics for declarative multi-paradigm languages
• Static Slicing of Rewrite Systems
• Program Slicing
• The program dependence graph and its use in optimization
• Higher-order narrowing with definitional trees

This page was built for publication: Dynamic slicing of lazy functional programs based on redex trails