Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion ? A… 
2007
2007
Tree patterns are one of the main abstractions used to access XML data. Tree patterns are used, for instance, to define XML… 
Review
2000
Review
2000
: We present an overview of eigen analysis methods and their applications to network analysis. We consider several network… 
2000
2000
Kamareddine, F., & Ríos (1997) conjecture that the λse-calculus preserves the strong normalisation of the λ-calculus. We prove… 
1997
1997
Although the use of expansionary η-rewrite has become increasingly common in recent years, one area where ν-contractions have… 
1995
1995
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols… 
1992
1992
Lambda Calculus is fundamental for the foundation of Logic, Mathematics, Computer and Cognitive Science. This makes it… 
Highly Cited
1990
Highly Cited
1990
Papers from a workshop held at Cornell University, Oct. 1989, and sponsored by Cornell's Mathematical Sciences Institute… 
1986
1986
The various known methods intended for continuous analysis of uncorrelated source fields (MEM-AR, Capon, Borgiotti-Lagunas…