Lazy call-by-value evaluation

DOI10.1145/1291151.1291193zbMATH Open1291.68110OpenAlexW2015675686MaRDI QIDQ5168933FDOQ5168933

Authors: Bernd Braßel, Michael Hanus, Sebastian Fischer, Frank Huch, Germán Vidal 

Publication date: 21 July 2014

Published in: Proceedings of the 12th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

Recommendations

• From Stack Traces to Lazy Rewriting Sequences
• scientific article; zbMATH DE number 2000444
• Adapting combinator and SECD machines to display snapshots of functional computations
• Dynamic slicing of lazy functional programs based on redex trails
• scientific article; zbMATH DE number 1691462

zbMATH Keywords

lazinessdebugging techniques

Mathematics Subject Classification ID

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

Cited In (6)

• Lazy variable-renumbering makes substitution cheap
• Title not available (Why is that?)
• Dynamic slicing of lazy functional programs based on redex trails
• How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger
• Implementing open call-by-value
• Adapting combinator and SECD machines to display snapshots of functional computations

Uses Software

• Hat

This page was built for publication: Lazy call-by-value evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168933)