Pruning with improving sequences in lazy functional programs

DOI10.1007/S10990-012-9086-3zbMATH Open1256.68033OpenAlexW2044761658MaRDI QIDQ1929352FDOQ1929352

Authors: Hideya Iwasaki, Takeshi Morimoto, Yasunao Takano 

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

Recommendations

• A short cut to optimal sequences
• Improvement theory and its applications
• Possibilities and limitations of call-by-need space improvement
• Improving lazy non-deterministic computations by demand analysis
• scientific article; zbMATH DE number 3960968

zbMATH Keywords

pruningfunctional programminglazy evaluationbranch-and-bound searchHaskell library

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Branch-and-Bound Methods: A Survey
• Title not available (Why is that?)
• An analysis of alpha-beta pruning
• Optimistic evaluation
• Title not available (Why is that?)
• Monads for incremental computing
• Encapsulating non-determinacy in an abstract data type with determinate semantics
• Deriving structural hylomorphisms from recursive definitions

Cited In (2)

• Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations
• A short cut to optimal sequences

Uses Software

• Haskell

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

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