Sciweavers

CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 5 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
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 arithmet...
Paul Tarau
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 5 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
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. ranki...
Paul Tarau
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 5 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
AML
2008
85views more  AML 2008»
13 years 5 months ago
A hierarchy of hereditarily finite sets
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already exis...
Laurence Kirby