Gödelisation in the lambda-Calculus (Extended Version)
DOI:
https://doi.org/10.7146/brics.v3i5.19968Resumé
Gödelisation is a meta-linguistic encoding of terms in a language.
While it is impossible to define an operator in the lambda-calculus which
encodes all closed lambda-expressions, it is possible to construct restricted
versions of such an encoding operator modulo normalisation. In this
paper, we propose such an encoding operator for proper combinators.
Keywords: Programming Calculi; lambda-Calculus; G¨odelisation.
Downloads
Publiceret
1996-01-05
Citation/Eksport
Goldberg, M. (1996). Gödelisation in the lambda-Calculus (Extended Version). BRICS Report Series, 3(5). https://doi.org/10.7146/brics.v3i5.19968
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
