Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Powerlist: a structure for parallel recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
A unifying look at data structures
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Theoretical Computer Science
IEEE Transactions on Computers
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
Comparing Expressiveness of Set Constructor Symbols
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Ackermann encoding, bisimulations and OBDDs
Theory and Practice of Logic Programming
Declarative modeling of finite mathematics
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative 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 |
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutations, digraphs, DAGs, hypergraphs, etc.) and automatically derived extensions to hereditarily finite universes through ranking/unranking operations. An embedded higher order combinator language provides any-to-any encodings automatically. Applications range from stream iterators on combinatorial objects and uniform generation of random instances to succinct data representations and serialization of Prolog terms. The self-contained source code of the paper, as generated from a literate Prolog program, is available at http://logic.cse.unt.edu/tarau/research/2009/pISO.zip