Bijective Term Encodings

Details Bijective Term Encodings Bijective Term Encodings

2011-12-16

arxiv.org/abs/1112.3788v1

Computer Science

Programming Languages

Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 201

Scientific paper

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}.

Affiliated with

Also associated with

No associations

Rating

Bijective Term Encodings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bijective Term Encodings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijective Term Encodings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136766