How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger

DOI10.1017/S095679680100418XzbMath1037.68039OpenAlexW2115737686MaRDI QIDQ3150209

Henrik Nilsson

Publication date: 2001

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s095679680100418x

zbMATH Keywords

lazy functional languagesevaluation dependence tree

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (8)

Declarative Debugging of Rewriting Logic Specifications ⋮ Algorithmic debugging generalized ⋮ Declarative debugging of rewriting logic specifications ⋮ Declarative Debugging of Membership Equational Logic Specifications ⋮ A Logical Framework for Debugging in Declarative Constraint Programming ⋮ A Generalized Model for Algorithmic Debugging ⋮ A Declarative Debugger for Maude Functional Modules ⋮ A core Erlang semantics for declarative debugging

Uses Software

• Haskell
• Freja
• Hat
• Hood

This page was built for publication: How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger