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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2007

We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion ? A…

2007

Tree patterns are one of the main abstractions used to access XML data. Tree patterns are used, for instance, to define XML…

2000

This paper presents the proofs of the strong normalization, subject reduction, and Church-Rosser theorems for a presentation of…

1997

Although the use of expansionary η-rewrite has become increasingly common in recent years, one area where ν-contractions have…

1996

This paper studies preservation of-strong normalization by two diierent connuent-calculi with explicit substitutions deened in…

1995

We extend pure type systems with quotient types and subset types and establish an equivalence between four strong normalisation…

1995

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols…

1992

Lambda Calculus is fundamental for the foundation of Logic, Mathematics, Computer and Cognitive Science. This makes it…

1989

1986

The various known methods intended for continuous analysis of uncorrelated source fields (MEM-AR, Capon, Borgiotti-Lagunas…