Question

Recursive Definition of Normal Form with explicit substitution

score 215 · Answer 1 · 2026-04-13 19:27:35

215

Views

Recursive Definition of Normal Form with explicit substitution

Published on 13 Apr 2026 - 19:27

score 324 · Answer 2 · 2026-04-10 22:05:12

324

Views

Brackets in Lambda Calculus with multiple lambdas

Published on 10 Apr 2026 - 22:05

score 823 · Answer 3 · 2026-05-10 15:51:37

823

Views

Syntactic proof that Peirce's law doesn't hold in simply-typed lambda calculus

Published on 10 May 2026 - 15:51

score 65 · Answer 4 · 2026-04-12 11:52:36

65

Views

Is expression evaluated before assigning type?

Published on 12 Apr 2026 - 11:52

score 62 · Answer 5 · 2026-04-09 02:49:07

62

Views

Are these 2 lambda calculus terms equivalent?

Published on 09 Apr 2026 - 2:49

score 118 · Answer 6 · 2026-04-10 17:51:01

118

Views

Relation of self-application to non termination in the untyped lambda calculus.

Published on 10 Apr 2026 - 17:51

score 51 · Answer 7 · 2026-04-16 16:43:23

51

Views

How to define inferiority relation on natural numbers in a dependently typed lambda-calculus?

Published on 16 Apr 2026 - 16:43

score 495 · Answer 8 · 2026-04-13 23:59:43

495

Views

Don't understand unbound variables in a lambda calculus expression

Published on 13 Apr 2026 - 23:59

score 241 · Answer 9 · 2026-04-14 15:05:43

241

Views

Overriding order of substitution in a lambda calculus expression

Published on 14 Apr 2026 - 15:05

score 102 · Answer 10 · 2026-04-15 19:31:20

102

Views

Show that there does not exist $F$ such that $F(MN) = M$ for all $M$ and $N$.

Published on 15 Apr 2026 - 19:31

score 44 · Answer 11 · 2026-04-14 07:46:56

44

Views

Are there any theorems giving a bound on the size of the type of an expression in the simply typed lambda calculus?

Published on 14 Apr 2026 - 7:46

score 57 · Answer 12 · 2026-04-10 08:53:22

57

Views

Can Lambda Calculus be used to represent a Riemann sum?

Published on 10 Apr 2026 - 8:53

score 126 · Answer 13 · 2026-04-10 20:49:24

126

Views

Unification of functions

Published on 10 Apr 2026 - 20:49

score 120 · Answer 14 · 2026-04-10 21:31:09

120

Views

In intensional MLTT, are a function and its lambda abstraction propositionally equal?

Published on 10 Apr 2026 - 21:31

score 142 · Answer 15 · 2026-05-10 18:01:19

142

Views

Doesn't cut elimination make intuitionistic logic equivalent to classical logic?

Published on 10 May 2026 - 18:01

List Question

Recursive Definition of Normal Form with explicit substitution

Brackets in Lambda Calculus with multiple lambdas

Syntactic proof that Peirce's law doesn't hold in simply-typed lambda calculus

Is expression evaluated before assigning type?

Are these 2 lambda calculus terms equivalent?

Relation of self-application to non termination in the untyped lambda calculus.

How to define inferiority relation on natural numbers in a dependently typed lambda-calculus?

Don't understand unbound variables in a lambda calculus expression

Overriding order of substitution in a lambda calculus expression

Show that there does not exist $F$ such that $F(MN) = M$ for all $M$ and $N$.

Are there any theorems giving a bound on the size of the type of an expression in the simply typed lambda calculus?

Can Lambda Calculus be used to represent a Riemann sum?

Unification of functions

In intensional MLTT, are a function and its lambda abstraction propositionally equal?

Doesn't cut elimination make intuitionistic logic equivalent to classical logic?

Trending Questions

Popular # Hahtags

Popular Questions