An introduction to the theory of lists
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Combinators for breadth-first search
Journal of Functional Programming
Relating models of backtracking
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Backtracking, interleaving, and terminating monad transformers: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Composable discovery engines for interactive theorem proving
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
An analytical inductive functional programming system that avoids unintended programs
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A combinator language for theorem discovery
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
Combinatorial search strategies including depth-first, breadth-first and depth-bounded search are shown to be different implementations of a common algebraic specification that emphasizes the compositionality of the strategies. This specification is placed in a categorical setting that combines algebraic specifications and monads.