1,674 research outputs found
Monad Transformers for Backtracking Search
This paper extends Escardo and Oliva's selection monad to the selection monad
transformer, a general monadic framework for expressing backtracking search
algorithms in Haskell. The use of the closely related continuation monad
transformer for similar purposes is also discussed, including an implementation
of a DPLL-like SAT solver with no explicit recursion. Continuing a line of work
exploring connections between selection functions and game theory, we use the
selection monad transformer with the nondeterminism monad to obtain an
intuitive notion of backward induction for a certain class of nondeterministic
games.Comment: In Proceedings MSFP 2014, arXiv:1406.153
Applying G\"odel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant
but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result
is a concise constructive proof of the lemma (for arbitrary decidable
well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly
present, along with an explicit program for finding an embedded pair in
sequences of words.Comment: In Proceedings CL&C 2012, arXiv:1210.289
Computational interpretations of analysis via products of selection functions
We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to two closely related infinite products of selection functions
- …