Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
Lambda
Guides
Guide
Symbols
BetaPositionReductions
BetaReduceChain
BetaReduceList
BetaReduce
BetaReducePositions
BetaReduceSizes
BetaReduceStepPlot
BetaReduceTreeList
BetaReductions
BetaSubstitute
BLCLambda
ChurchNumeral
ColorizeLambda
CombinatorLambda
EnumerateLambdas
EnumerateLinearLambdas
EnumerateSizeLambdas
EtaReduce
EvalLambda
FindMinimalLambdaCombinator
FromChurchNumeral
FunctionLambda
HighlightLambdaTree
LambdaApplication
LambdaArrayPlot
LambdaBLC
LambdaBrackets
LambdaCausalEvolutionGraph
LambdaCausalGraph
LambdaCombinator
LambdaConvert
LambdaDepthArrayPlot3D
LambdaDepthArrayPlot
LambdaDiagram
LambdaFunction
LambdaGraph
LambdaLoopbackGraph
LambdaMultiwayCausalEvolutionGraph
LambdaMultiwayCausalGraph
LambdaMultiwayGraph
LambdaRightApplication
LambdaSmiles
LambdaStringDiagram
LambdaString
LambdaToHaskell
LambdaTreeDiagram
LambdaTree
LambdaVariableForm
ParseLambda
RandomLambda
RandomSizeLambda
SmoothLambdaStringDiagram
TagLambda
UncolorizeLambda
UntagLambda
$LambdaCombinatorStore
Guide
Functions for lambda expressions
Construction
R
a
n
d
o
m
L
a
m
b
d
a
— generate a random lambda expression
R
a
n
d
o
m
S
i
z
e
L
a
m
b
d
a
— generate a random lambda with a given size
E
n
u
m
e
r
a
t
e
L
a
m
b
d
a
s
— enumerate lambda expressions
E
n
u
m
e
r
a
t
e
S
i
z
e
L
a
m
b
d
a
s
— enumerate all lambdas with a given size
E
n
u
m
e
r
a
t
e
L
i
n
e
a
r
L
a
m
b
d
a
s
— enumerate all linear lambdas of a given size
E
n
u
m
e
r
a
t
e
A
f
f
i
n
e
L
a
m
b
d
a
s
— enumerate all affine lambdas of a given size
C
h
u
r
c
h
N
u
m
e
r
a
l
— lambda terms representing Church natural numbers
P
a
r
s
e
L
a
m
b
d
a
— parse various string forms of lambdas
Evaluation
B
e
t
a
S
u
b
s
t
i
t
u
t
e
— perform single beta substitution of reducible terms
λ
[body][arg]
B
e
t
a
R
e
d
u
c
e
— iterate beta substitution
B
e
t
a
R
e
d
u
c
e
P
o
s
i
t
i
o
n
s
— list of positions where beta substitution is possible
B
e
t
a
R
e
d
u
c
t
i
o
n
s
— list of possible single beta substitutions
B
e
t
a
P
o
s
i
t
i
o
n
R
e
d
u
c
t
i
o
n
s
— association with position and corresponding reduced terms
B
e
t
a
R
e
d
u
c
e
L
i
s
t
— list of iterated beta substitutions
B
e
t
a
R
e
d
u
c
e
S
i
z
e
s
— reduce lambda and return intermediate term sizes
E
v
a
l
L
a
m
b
d
a
— evaluate a lambda expression with delayed substitution
B
e
t
a
R
e
d
u
c
e
C
o
m
p
i
l
e
d
— compiled version of BetaReduce
B
e
t
a
R
e
d
u
c
e
L
i
s
t
C
o
m
p
i
l
e
d
— compiled version of BetaReduceList
B
e
t
a
R
e
d
u
c
e
S
i
z
e
s
C
o
m
p
i
l
e
d
— compiled version of BetaReduceSizes
Representation
L
a
m
b
d
a
C
o
n
v
e
r
t
— universal lambda converter into various forms
L
a
m
b
d
a
F
u
n
c
t
i
o
n
— convert lambda expression to a
F
u
n
c
t
i
o
n
L
a
m
b
d
a
V
a
r
i
a
b
l
e
F
o
r
m
— annotate lambdas with arguments
F
u
n
c
t
i
o
n
L
a
m
b
d
a
— convert nested Function and variable form lambda to a lambda expression
T
a
g
L
a
m
b
d
a
— tag lambda with variable names
U
n
t
a
g
L
a
m
b
d
a
— remove lambda tags
C
o
l
o
r
i
z
e
L
a
m
b
d
a
— colorize lambdas and variables of the lambda expression
U
n
c
o
l
o
r
i
z
e
L
a
m
b
d
a
— remove colors from lambda
L
a
m
b
d
a
A
p
p
l
i
c
a
t
i
o
n
— left associative lambda form
L
a
m
b
d
a
R
i
g
h
t
A
p
p
l
i
c
a
t
i
o
n
— right associative lambda form
L
a
m
b
d
a
B
r
a
c
k
e
t
s
— only brackets and parenthesis form
L
a
m
b
d
a
S
t
r
i
n
g
— lambda string form
L
a
m
b
d
a
B
L
C
—
B
i
n
a
r
y
L
a
m
b
d
a
C
a
l
c
u
l
u
s
bits
L
a
m
b
d
a
T
o
H
a
s
k
e
l
l
— Haskell source for
A
P
r
o
V
E
F
r
o
m
C
h
u
r
c
h
N
u
m
e
r
a
l
— integer corresponding to
C
h
u
r
c
h
N
u
m
e
r
a
l
lambda
Static visualization
L
a
m
b
d
a
S
m
i
l
e
s
— graphical representation of lambda term with lines connecting variables with
λ
s
L
a
m
b
d
a
T
r
e
e
— lambda tree representation
H
i
g
h
l
i
g
h
t
L
a
m
b
d
a
T
r
e
e
— highlight
L
a
m
b
d
a
T
r
e
e
subtrees with expression positions
L
a
m
b
d
a
G
r
a
p
h
— lambda graph representation
L
a
m
b
d
a
L
o
o
p
b
a
c
k
G
r
a
p
h
— tree graph with edges connecting each lambda and its variables
L
a
m
b
d
a
D
i
a
g
r
a
m
— Tromp's lambda diagram
L
a
m
b
d
a
T
r
e
e
D
i
a
g
r
a
m
—
L
a
m
b
d
a
T
r
e
e
on Tromp's diagram
L
a
m
b
d
a
A
r
r
a
y
P
l
o
t
— array plot of lambda expression characters
L
a
m
b
d
a
D
e
p
t
h
A
r
r
a
y
P
l
o
t
— array plot of a lambda expression with depth
L
a
m
b
d
a
D
e
p
t
h
A
r
r
a
y
P
l
o
t
3
D
— array plot of multiple lambdas expressions with depth
L
a
m
b
d
a
S
t
r
i
n
g
D
i
a
g
r
a
m
— string diagrammatic lambda object
S
m
o
o
t
h
L
a
m
b
d
a
S
t
r
i
n
g
D
i
a
g
r
a
m
— string diagram with smoothed wires
Dynamic visualization
B
e
t
a
R
e
d
u
c
e
C
h
a
i
n
— sequence of highlighted lambda terms
B
e
t
a
R
e
d
u
c
e
S
t
e
p
P
l
o
t
—
L
i
s
t
S
t
e
p
P
l
o
t
of lambda sizes with highlighted redex
B
e
t
a
R
e
d
u
c
e
T
r
e
e
L
i
s
t
— list of trees for iterated beta substitutions
L
a
m
b
d
a
C
a
u
s
a
l
G
r
a
p
h
— causal graph with beta substitution events for a single reduction sequence
L
a
m
b
d
a
C
a
u
s
a
l
E
v
o
l
u
t
i
o
n
G
r
a
p
h
— bipartite graph with events and states
L
a
m
b
d
a
M
u
l
t
i
w
a
y
G
r
a
p
h
— multiway graph of lambda beta reductions
L
a
m
b
d
a
M
u
l
t
i
w
a
y
C
a
u
s
a
l
G
r
a
p
h
— multiway causal graph
L
a
m
b
d
a
M
u
l
t
i
w
a
y
C
a
u
s
a
l
E
v
o
l
u
t
i
o
n
G
r
a
p
h
— multiway causal evolution graph
Query
B
e
t
a
N
o
r
m
a
l
Q
— true if no reductions possible
C
l
o
s
e
d
L
a
m
b
d
a
Q
— true if no free variables
L
i
n
e
a
r
L
a
m
b
d
a
Q
— true if every lambda uses its argument exactly once
A
f
f
i
n
e
L
a
m
b
d
a
Q
— true if every lambda uses its argument no more than once
Other
$
L
a
m
b
d
a
— main head for the lambda, by default is the formal lambda
λ
.
$
L
a
m
b
d
a
S
t
y
l
e
s
— association with styles used for visualization
$
L
a
m
b
d
a
G
r
i
d
S
t
y
l
e
R
u
l
e
s
— associated with nice grid styles for tables
$
L
a
m
b
d
a
R
e
s
u
l
t
s
— various pre-computed data
$
L
a
m
b
d
a
B
u
s
y
B
e
a
v
e
r
s
— list of busy beavers parsed
o
n
l
i
n
e
$
C
o
m
p
i
l
e
d
F
u
n
c
t
i
o
n
s
— association with compiled functions
$
L
a
m
b
d
a
C
o
m
b
i
n
a
t
o
r
S
t
o
r
e
—
E
n
t
i
t
y
S
t
o
r
e
with lambda combinators
"
"