Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Bananas in space: extending fold and unfold to exponential types
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Science of Computer Programming - Special issue on mathematics of program construction
Testing monadic code with QuickCheck
ACM SIGPLAN Notices
On Simple Goedel Numberings and Translations
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
A Concrete Final Coalgebra Theorem for ZF Set Theory
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
A tutorial on the universality and expressiveness of fold
Journal of Functional Programming
Ackermann encoding, bisimulations and OBDDs
Theory and Practice of Logic Programming
There and back again: arrows for invertible programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
Composable memory transactions
Communications of the ACM - Designing games with a purpose
Declarative modeling of finite mathematics
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Hereditarily finite representations of natural numbers and self-delimiting codes
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
On arithmetic computations with hereditarily finite sets, functions and types
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A unified formal description of arithmetic and set theoretical data types
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Emulating primality with multiset representations of natural numbers
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A declarative specification of tree-based symbolic arithmetic computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Binary trees as a computational framework
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, bitstrings, finite functions) and their extension to hereditarily finite universes through hylomorphisms derived from ranking and unranking operations. The paper is part of a larger effort to cover in a declarative programming paradigm some fundamental combinatorial generation algorithms along the lines of Knuth's recent work [10]. The self-contained source code of the paper, as generated from a literate Haskell program, is available at http://logic.csci.unt.edu/tarau/research/2008/sfISO.zip.