9 citations · 37 across the 32 of their papers we have counts for
Showing 2011 · cs.PLShow all
2 papers · 2 filters
cs.PL2011★ 1 cited
Bijective Term Encodings
Paul Tarau
We encode/decode Prolog terms as unique natural numbers. Our encodings have the following properties: a) are bijective b) natural numbers always decode to syntactically valid terms…
cs.PL2011
Computing with Hereditarily Finite Sequences
Paul Tarau
e use Prolog as a flexible meta-language to provide executable specifications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are u…