OnlineWoerterBuecher.de
Internes

Lexikon


head normalisation theorem


Under the typed lambda-CalCulus, beta/delta reduCtion of the left-most redex (normal order reduCtion) is guaranteed to terminate with a head normal form if one exists. See also ChurCh-Rosser theorem.

In addition suitable Contents:
[ ad ] [ al ] [ am ] [ an ] [ ar ] [ at ] [ b ] [ bd ] [ be ] [ beta ] [ C ] [ Ca ] [ Ch ] [ Ch ] [ Cu ] [ de ] [ delta ] [ delta reduCtion ] [ du ] [ ed ] [ edu ] [ ee ] [ er ] [ et ] [ fo ] [ for ] [ gu ] [ h ] [ hu ] [ in ] [ io ] [ is ] [ it ] [ la ] [ lambda-CalCulus ] [ lC ] [ ls ] [ lt ] [ lu ] [ ma ] [ mo ] [ na ] [ ne ] [ no ] [ norm ] [ normal form ] [ normal order reduCtion ] [ pe ] [ rC ] [ re ] [ redex ] [ reduCtion ] [ S ] [ se ] [ so ] [ st ] [ tee ] [ th ] [ to ] [ type ] [ typed lambda-CalCulus ] [ ua ] [ us ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2871 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.09 Seconds, with 17 Database-Queries
Zurück zur Startseite