Pruning with improving sequences in lazy functional programs

DOI10.1007/S10990-012-9086-3zbMath1256.68033OpenAlexW2044761658MaRDI QIDQ1929352

Yasunao Takano, Takeshi Morimoto, Hideya Iwasaki

Publication date: 8 January 2013

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

Full work available at URL: https://doi.org/10.1007/s10990-012-9086-3

zbMATH Keywords

lazy evaluationpruningfunctional programmingbranch-and-bound searchHaskell library

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of alpha-beta pruning
• Deriving structural hylomorphisms from recursive definitions
• Monads for incremental computing
• Encapsulating non-determinacy in an abstract data type with determinate semantics
• Optimistic evaluation
• Branch-and-Bound Methods: A Survey

This page was built for publication: Pruning with improving sequences in lazy functional programs