- step the
leftmost of the
innermost redexes is contracted,
where an
innermost redex is a
redex not
containing any
redexes leftmost-outermost: in each step...
- x ) , y ) {\displaystyle f(g(x),y)} . The
result of
reducing different redexes is
described in a what is
known as a
critical pair; the
critical pair arising...
-
feature of this
notation is that
abstractor and
applicator wagons of β-
redexes are
paired like parentheses. For example,
consider the
stages in the β-reduction...
- due to β-reduction per se but
rather the
handling of the
duplication of
redexes during β-reduction. It is not
known if
optimal reduction implementations...
-
clause form in the last line) as
follows (highlighting
replacement rule
redexes in red {\displaystyle {\color {red}{\text{red}}}} ): Informally, the Skolem...
-
appear inside a
lambda body. In general, a
given term can
contain several redexes,
hence several different beta
reductions could be applied. We may specify...
- "enough" type annotations. And in fact,
annotations are
needed only at β-
redexes.
Given the
standard semantics, the
simply typed lambda calculus is strongly...
-
property that all
reducible expressions (
redexes)
within a term are
completely disjoint—that is, the
redexes share no
common function symbol. For example...
- a (non empty)
sequence of
contractions of a term
which contracts head
redexes. A head
reduction of a term t (which is
supposed not to be in head normal...
- n -> Lit n;; The
smallest potentially reducible expressions (potential
redexes) are
operations over values, and they are
carried out with a contraction...
