Questions tagged [normalization]
Use this tag for normalization: the process of reducing something (e.g. a formula) to a better form by a given criterion.
12
questions
18
votes
1
answer
1k
views
How much of trouble is Lean's failure of normalization, given that logical consistency is not obviously broken?
This document showed that Lean's impredicative universe of strict propositions breaks normalization (of proofs) in a way that canonicity and logical consistency are unaffected, because the ...
- 6,346
18
votes
1
answer
282
views
What are the advantages of normalization by evaluation over traditional reduction-based normalization?
I think in NBE, you get rid of certain substitutions, and it solves the problem of binding representation (so you don't have to use indices or capture-avoiding substitution or something). But I ...
- 6,346
11
votes
1
answer
307
views
Normalization by evaluation for extensional type theories
Is there material on how to implement normalization for (any flavor of) ETT?
This describes techniques related to doing untyped normalization. But there are (operational and semantic) problems when ...
- 4,077
10
votes
2
answers
1k
views
Constructive proof of strong normalization for simply typed lambda calculus
I'm reading Girard's Proofs and Types, and in section 4.4 he writes:
Lemma: t is strongly normalisable iff there is a number ...
- 345
8
votes
1
answer
346
views
What is a neutral term?
A neutral/normal term in the lambda calculus is typically defined
data nf = Lam of nf | Neu of ne
data ne = Var of int | App of ne * nf
Now the question is what to ...
- 2,320
6
votes
0
answers
106
views
What are "empty compositions", and why are they bad?
Empty hcomps and empty systems are often mentioned in the context of cubical type theory, in particular related to the efficiency of evaluation, for example here and here. What exactly are they, and ...
- 4,077
4
votes
1
answer
248
views
Comparison of normal forms in Normalization by Evaluation
From what I understand of Normalization by Evaluation (NbE) as a technique to implement conversion, it 1) computes (some representation of) normal forms for each of the terms to compare, and 2) ...
- 5,620
3
votes
1
answer
97
views
Is unguarded fixpoint reduction consistent?
In Coq, there are two restrictions on fixpoints to retain normalization:
Recursive calls can only be done on structurally smaller arguments, enforced by a guard condition during type checking; and
...
- 1,026
2
votes
2
answers
198
views
Canonical forms of combinators
Binders are painful when dealing with metatheory. Combinators are one potential approach to avoid the pain of binders. But it'd be nice if I could normalize combinators to canonical forms. Is there ...
- 2,868
2
votes
1
answer
199
views
Conflicting terminology for completeness/soundness of normalization algorithm
While reading some articles about formalization of various normalization algorithms, I found that these two papers use the term completeness/soundness in opposite way.
Hereditary Substitutions for ...
- 123
2
votes
1
answer
210
views
Higher Observational Type Theory: variables becoming free in reduction rules
This question is based on the talks given by Mike Shulman on higher observational type theory (part 1, part 2, part 3).
In trying to understand the reduction rules of the calculus, I tried to work ...
- 73
-1
votes
1
answer
112
views
Implementability of proof assistants for Infinitary logics with finite many terms
Infinitary logic is a natural consequence of extending the length of proofs of first-order logic to a infinite ordinal level.
By definition, since proof lengths are infinitely long, one should not ...
- 279