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
Science of Computer Programming - Special issue on mathematics of program construction
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Theoretical Computer Science
Ranking and unranking permutations in linear time
Information Processing Letters
On Simple Goedel Numberings and Translations
Proceedings of the 2nd Colloquium on Automata, Languages and 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)
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
Two mechanisms for generating infinite families of pairing bijections
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Binary trees as a computational framework
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
As a variation on the known theme of Gödel numberings, isomorphisms defining data type transformations in a strongly typed functional language are organized as a finite groupoid using a higher order combinator language that unifies popular data types as diverse as natural numbers, finite sequences, digraphs, hypergraphs and finite permutations with more exotic ones like hereditarily finite functions, sets and permutations.