Normalization property (abstract rewriting)

Known as: Normalization property (lambda-calculus), Weakly normalising, Strongly normalising 
In mathematical logic and theoretical computer science, a rewrite system has the (strong) normalization property or is terminating if every term is… (More)
Wikipedia

Related topics

Related topics

17 relations
Calculus of constructionsCoq (software)Induction-recursionNewman's lemma
(More)

Broader (2)

Lambda calculusLogic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Variational Inference with Normalizing Flows
The choice of approximate posterior distribution is one of the core problems in variational inference. Most applications of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 3
Is this relevant?
2010
2010
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normali zation (SN) for full second order linear logic (LL): Girard’s… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Iterated Sigma Point Kalman Filter with Applications to Long Range Stereo
This paper investigates the use ofstatistical linearization to improve iterative non-linear least squares estimators. In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Context-Sensitive Rewriting Strategies
Context-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Objective estimation of perceived speech quality .II. Evaluation of the measuring normalizing block technique
Part I of this paper describes a new approach to the objective estimation of perceived sp ech qua lity. This new approach uses a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Structural Recursive Definitions in Type Theory
We introduce an extension of the Calculus of Construction with indu ctive and co-inductive types that preserves strong… (More)
Is this relevant?
1995
1995
Approximation and Normalization Results for Typeable Term Rewriting Systems
We consider an intersection type assignment system for term rewriting systems extended with application, and define a notion of… (More)
Is this relevant?
1994
1994
A CPS-Translation of the λ μ-Calculus
We present a translation of Parigot’s λμ-calculus [10] into the usual λ-calculus. This translation, which is based on the so… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Inductive Definitions in the system Coq - Rules and Properties
In the pure Calculus of Constructions, it is possible to represent data structures and predicates using higher-order… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
ECC, an Extended Calculus of Constructions
We present a higher-order calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong… (More)
Is this relevant?