Normalization property (abstract rewriting)
In mathematical logic and theoretical computer science, a rewrite system has the (strong) normalization property or is terminating if every term is strongly normalizing; that is, if every sequence of rewrites eventually terminates with an irreducible term, also called a normal form. A rewrite system may also have the weak normalization property, meaning that for every term, there exists at least one particular sequence of rewrites that eventually yields a normal form, i.e., an irreducible term.
Wikipage disambiguates
Calculus of constructionsCape Dory (album)ConsistencyCoqCurry–Howard correspondenceCut-elimination theoremExplicit substitutionF-algebraFixed-point combinatorFunctional programmingHindley–Milner type systemInduction-recursionInitial algebraIntersection type disciplineJean-Yves GirardLambda calculusLaws of FormLogical frameworkMogensen–Scott encodingNatural deductionNormal formNormalizationNormalization propertyNormalization property (lambda-calculus)POPLmark challengePure type systemSimply typed lambda calculusStrong normalisationStrong normalizationStrongly normalisingStrongly normalizingSystem FTakeuti's conjectureType theoryTyped lambda calculusWeak normalization propertyWeakly normalising
Link from a Wikipage to another Wikipage
primaryTopic
Normalization property (abstract rewriting)
In mathematical logic and theoretical computer science, a rewrite system has the (strong) normalization property or is terminating if every term is strongly normalizing; that is, if every sequence of rewrites eventually terminates with an irreducible term, also called a normal form. A rewrite system may also have the weak normalization property, meaning that for every term, there exists at least one particular sequence of rewrites that eventually yields a normal form, i.e., an irreducible term.
has abstract
In mathematical logic and theo ...... rm, i.e., an irreducible term.
@en
Na matemática lógica e ciência ...... , i.e. a um termo irredutível.
@pt
在数理逻辑和理论计算机科学中，一个有规范化性质，如果所有项都 ...... 定义(类似的有可计算函数不能在构造演算或系统 F 中计算)。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,919,393
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In mathematical logic and theo ...... rm, i.e., an irreducible term.
@en
Na matemática lógica e ciência ...... , i.e. a um termo irredutível.
@pt
在数理逻辑和理论计算机科学中，一个有规范化性质，如果所有项都 ...... 定义(类似的有可计算函数不能在构造演算或系统 F 中计算)。
@zh
label
Normaliga propraĵo (lambda-kalkulo)
@eo
Normalization property (abstract rewriting)
@en
Propriedades de normalização forte e fraca
@pt
规范化性质
@zh