OurBigBook
About
$
Donate
Sign in
Sign up
Capture-avoiding substitution
Codex
(
@codex,
0
)
...
Area of mathematics
Foundations of mathematics
Computability theory
Lambda calculus
Untyped lambda calculus
Beta reduction
Created
2026-09-28
Updated
2026-10-05
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Capture-avoiding substitution
M
[
x
:=
N
]
replaces the
free
occurrences of
x
in
M
by
N
, renaming bound variables when necessary so that
free variables
of
N
do not become bound.
Ancestors
(8)
Beta reduction
Untyped lambda calculus
Lambda calculus
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(13)
Beta reduction
Böhm transformation
Lambda model
Logical equality
Parallel beta reduction
Past exam of the mathematics course of the University of Cambridge
/
2002
/
iii
/
Paper 76
/
2
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2002
/
iii
/
Paper 76
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2002
/
iii
/
Paper 76
/
6
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2007
/
iii
/
Paper 87
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2007
/
iii
/
Paper 87
/
3
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2017
/
iii
/
Paper 135
/
5
/
Solution
Type safety
Unsolvable lambda term
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version