Improving lazy non-deterministic computations by demand analysis

DOI10.4230/LIPICS.ICLP.2012.130MaRDI QIDQ5398051zbMATH OpenOpenAlexFDO

Authors Michael Hanus

Publication date 25 February 2014

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.130

zbMATH Keywords

functional logic programmingimplementationprogram analysis

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 512891
• scientific article; zbMATH DE number 512881
• Purely functional lazy non-deterministic programming
• scientific article; zbMATH DE number 2040977
• Improving the efficiency of non-deterministic computations

Cited in

(7)

• Pruning with improving sequences in lazy functional programs
• Improving the efficiency of non-deterministic computations
• Purely functional lazy non-deterministic programming
• scientific article; zbMATH DE number 512881 (Why is no real title available?)
• scientific article; zbMATH DE number 512891 (Why is no real title available?)
• scientific article; zbMATH DE number 1942455 (Why is no real title available?)
• The logic of demand in Haskell

Describes a project that uses

Uses Software

• SmallCheck
• TOY

This page was built for publication: Improving lazy non-deterministic computations by demand analysis

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