scientific article; zbMATH DE number 3960968

MaRDI QIDQ3729997zbMATH OpenFDO

Authors Philip Wadler

Publication date 1986

zbMATH Keywords

bounded evaluationdomain theoryfunctional programlazy evaluation semanticslistless program

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Possibilities and limitations of call-by-need space improvement
• Generating function versions with rational strictness patterns
• More haste, less speed: lazy versus eager evaluation
• Formal efficiency analysis for tree transducer composition
• Using circular programs to eliminate multiple traversals of data

Cited in

(8)

• Rules + strategies for transforming lazy functional logic programs
• Pruning with improving sequences in lazy functional programs
• To be or not to be …lazy (In a Parallel Context)
• The HOL-CSP Refinement Toolkit
• HOL-CSP Version 2.0
• A Sound Type System for Physical Quantities, Units, and Measurements
• Using circular programs to eliminate multiple traversals of data
• Deforestation: Transforming programs to eliminate trees

This page was built for publication:

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