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.
9
questions
2
votes
1
answer
151
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
4
votes
1
answer
198
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) ...
- 4,153
2
votes
1
answer
133
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,768
7
votes
1
answer
277
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,171
11
votes
1
answer
246
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 ...
- 3,688
16
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 ...
- 5,877
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
3
votes
1
answer
91
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
...
- 906
18
votes
1
answer
236
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 ...
- 5,877