In a dependently-typed Coq formalization, the adequacy lemma of classical realizability for the simply-typed lambda-calculus with sums is shown to be a normalization function, and the choice of truth and falsity witnesses determines whether it evaluates call-by-name or call-by-value.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dependent Pearl: Normalization by realizability
In a dependently-typed Coq formalization, the adequacy lemma of classical realizability for the simply-typed lambda-calculus with sums is shown to be a normalization function, and the choice of truth and falsity witnesses determines whether it evaluates call-by-name or call-by-value.