2000
DOI: 10.1016/s0020-0190(00)00071-5
|View full text |Cite
|
Sign up to set email alerts
|

Gödelization in the lambda calculus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2002
2002
2014
2014

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…There is a general consensus that normalization by evaluation is an art because one must invent a non-standard, extensional evaluation function and its left inverse [1,6,7,10,12,14,16,26,32,35,37,44].…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…There is a general consensus that normalization by evaluation is an art because one must invent a non-standard, extensional evaluation function and its left inverse [1,6,7,10,12,14,16,26,32,35,37,44].…”
Section: Resultsmentioning
confidence: 99%
“…Instead of repeatedly reducing a term towards its normal form, as in the traditional reduction-based approach, one uses an extensional normalization function that does not construct any intermediate term and directly yields a normal form, if there is any [22]. Normalization by evaluation has been developed in intuitionistic type theory [14,37,44], proof theory [9,10], category theory [5,16,41], λ-definability [32], partial evaluation [18,19,26], and formal semantics [1,29,30]. The more complicated the terms and the notions of reduction, the more complicated the normalization functions.…”
Section: Introductionmentioning
confidence: 99%
“…This type-directed specification naturally arises in offline partial evaluation for functional languages with sums and computational effects [15,17,20,22]. Other normalization functions have also been developed [1,25,43].…”
Section: Virtual Machines For Normalization Functionsmentioning
confidence: 99%
“…Also at the turn of the 1990's, at Indiana University [188], Mayer Goldberg studied Gödelization in Scheme [189], pioneering the first functions that would decompile proper combinators into their source code and eventually extending Gödelization to all strongly normalizing combinators.…”
Section: Related Work and Alternativesmentioning
confidence: 99%