1 citations · 2 across the 5 of their papers we have counts for
5 papers
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
Paul Tarau
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact co…
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
Paul Tarau
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmeti…
Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes
Paul Tarau
Using specializations of unfold and fold on a generic tree data type we derive unranking and ranking functions providing natural number encodings for various Hereditarily Finite da…
Logic Engines as Interactors
Paul Tarau
We introduce a new programming language construct, Interactors, supporting the agent-oriented view that programming is a dialog between simple, self-contained, autonomous building…
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Paul Tarau
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranki…