In this work, I address the so-called infinite functionals, which enable the exhaustive search of infinite compact sets. I implement a search function for predicates on the Cantor set in the lazy functional programming language Haskell. I implement optimizations using various techniques, some of which exploit lazy evaluation, I also implement pure functional memoization. I explain the operation of computational effects using monads and apply them for monadic optimizations of the search function.
|
