Paper Info
Title
Bijective Term Encodings
Abstract
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 c) they work in low polynomial time in the bitsize of the representations d) the bitsize of our encodings is within constant factor of the syntactic representation of the input. We describe encodings of term algebras with finite signature as well as algorithms that separate the "structure" of a term, a natural number encoding of a list of balanced parenthesis, from its "content", a list of atomic terms and Prolog variables. The paper is organized as a literate Prolog program available from \url{http://logic.cse.unt.edu/tarau/research/2011/bijenc.pl}.
Year
Venue
Field
2011
CoRR
ENCODE,Natural number,Bijection,Computer science,Theoretical computer science,Prolog,Time complexity,Syntax,Parenthesis,Encoding (memory)
DocType
Volume
Citations 
Journal
abs/1112.3788
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Paul Tarau11529113.14