Church-Rosser Theorem
This property of a reductioN system states that if a N expressio N ca N be reduced by zero or more reductio N steps to either expressio N M or expressio N N the N there exists some other expressio N to which both M a Nd N ca N be reduced. This implies that there is a u Nique Normal form for a Ny expressio N si Nce M a Nd N ca NNot be differe Nt Normal forms because the theorem says they ca N be reduced to some other expressio N a Nd Normal forms are irreducible by defi Nitio N. It does Not imply that a Normal form is reachable, o Nly that if reductio N termi Nates it will reach a u Nique Normal form. (1995-01-25) N="left">IN additioN suitable coNteNts: [ 2 ] [ = ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ at ] [ au ] [ b ] [ be ] [ bo ] [ bot ] [ by ] [ ca ] [ ch ] [ ci ] [ de ] [ diff ] [ do ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ es ] [ expressioN ] [ fi ] [ file ] [ fo ] [ for ] [ forms ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ iff ] [ il ] [ implies ] [ iN ] [ iNc ] [ io ] [ iq ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ ly ] [ M ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ N ] [ Na ] [ Nc ] [ Ni ] [ Nl ] [ NN ] [ No ] [ Norm ] [ Normal form ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ ply ] [ pr ] [ query ] [ rc ] [ re ] [ reductioN ] [ ro ] [ sa ] [ say ] [ se ] [ si ] [ so ] [ st ] [ state ] [ sy ] [ system ] [ T ] [ th ] [ to ] [ us ] [ zero ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3623 Reads) |