Generating Bijections between HOAS and the Natural Numbers
A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a ``not equals'' relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term family to another. Sets and maps are useful in m...
Main Author: | John Tang Boyland |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1009.2790v1 |
Similar Items
-
Bijective, Non-Bijective and Semi-Bijective Translations on the Triangular Plane
by: Khaled Abuhmaidan, et al.
Published: (2019-12-01) -
A Bijective Proof of Catalan Number
by: Lee, Ing-Jye, et al.
Published: (1996) -
Catalan Numbers: Problems and Their Bijective Relations
by: Shiu-Kai Tsai, et al.
Published: (2015) -
Unusual and bijectively related manifolds
by: John G. Hocking
Published: (2003-10-01) -
On the Category of Partial Bijections
by: Emil Schwab
Published: (2008-01-01)