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)

Related topics

Related topics

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

Broader (2)

Lambda calculusLogic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
A cloud decision framework in pure 2-tuple linguistic setting and its application for low-speed wind farm site selection
Highly Cited
2016
Highly Cited
2016
Black-box Importance Sampling
Importance sampling is widely used in machine learning and statistics, but its power is limited by the restriction of using… 
Highly Cited
2012
Highly Cited
2012
Developing a Speech Activity Detection System for the DARPA RATS Program
This paper describes the speech activity detection (SAD) system developed by the Patrol team for the first phase of the DARPA… 
Highly Cited
2010
Highly Cited
2010
Model clone detection in practice
Cloned code is considered harmful for two reasons: (1) multiple, possibly unnecessary, duplicates of code increase maintenance… 
Review
2009
Review
2009
Normativity and Normalization
This article illustrates ways in which the concepts of the norm and normativity are implicated in relations of power… 
Highly Cited
2008
Highly Cited
2008
Evidence-Based Audit
Authorization logics provide a principled and flexible approach to specifying access control policies. One of their compelling… 
Highly Cited
1999
Highly Cited
1999
Support Vector Machines for Multi-class Classification
Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is… 
Highly Cited
1995
Highly Cited
1995
Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection
In this paper we introduce and study a new-calculus with explicit substitution, xgc, which has two distinguishing features: rst… 
Highly Cited
1994
Highly Cited
1994
From λσ to λν: a journey through calculi of explicit substitutions
This paper gives a systematic description of several calculi of explicit substitutions. These systems are orthogonal and have… 
Highly Cited
1993
Highly Cited
1993
Linear Logic, Coherence, and Dinaturality
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)