Deductive lambda calculus
Deductive lambda calculus considers what happens when lambda terms are regarded as mathematical expressions. One interpretation of the untyped lambda calculus is as a programming language where evaluation proceeds by performing reductions on an expression until it is in normal form. In this interpretation, if the expression never reduces to normal form then the program never terminates, and the value is undefined. Considered as a mathematical deductive system, each reduction would not alter the value of the expression. The expression would equal the reduction of the expression.
Link from a Wikipage to another Wikipage
primaryTopic
Deductive lambda calculus
Deductive lambda calculus considers what happens when lambda terms are regarded as mathematical expressions. One interpretation of the untyped lambda calculus is as a programming language where evaluation proceeds by performing reductions on an expression until it is in normal form. In this interpretation, if the expression never reduces to normal form then the program never terminates, and the value is undefined. Considered as a mathematical deductive system, each reduction would not alter the value of the expression. The expression would equal the reduction of the expression.
has abstract
Deductive lambda calculus cons ...... e reduction of the expression.
@en
Wikipage page ID
41,976,836
page length (characters) of wiki page
Wikipage revision ID
1,020,694,542
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Deductive lambda calculus cons ...... e reduction of the expression.
@en
label
Deductive lambda calculus
@en