Question

Recursive Definition of Normal Form with explicit substitution

score 212 · Answer 1 · 2019-03-16 11:17:27

212

Views

Recursive Definition of Normal Form with explicit substitution

Published on 16 Mar 2019 - 11:17

score 321 · Answer 2 · 2019-03-19 00:46:53

321

Views

Brackets in Lambda Calculus with multiple lambdas

Published on 19 Mar 2019 - 0:46

score 821 · Answer 3 · 2026-03-25 03:01:48

821

Views

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

Published on 25 Mar 2026 - 3:01

score 62 · Answer 4 · 2019-03-30 05:18:33

62

Views

Is expression evaluated before assigning type?

Published on 30 Mar 2019 - 5:18

score 59 · Answer 5 · 2019-04-07 13:33:12

59

Views

Are these 2 lambda calculus terms equivalent?

Published on 07 Apr 2019 - 13:33

score 115 · Answer 6 · 2019-04-14 20:46:41

115

Views

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

Published on 14 Apr 2019 - 20:46

score 46 · Answer 7 · 2019-04-26 19:29:14

46

Views

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

Published on 26 Apr 2019 - 19:29

score 492 · Answer 8 · 2019-05-09 18:20:15

492

Views

Don't understand unbound variables in a lambda calculus expression

Published on 09 May 2019 - 18:20

score 238 · Answer 9 · 2019-05-12 14:19:05

238

Views

Overriding order of substitution in a lambda calculus expression

Published on 12 May 2019 - 14:19

score 99 · Answer 10 · 2019-05-26 23:23:18

99

Views

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

Published on 26 May 2019 - 23:23

score 41 · Answer 11 · 2019-06-09 22:08:30

41

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 09 Jun 2019 - 22:08

score 54 · Answer 12 · 2019-06-11 14:19:26

54

Views

Can Lambda Calculus be used to represent a Riemann sum?

Published on 11 Jun 2019 - 14:19

score 122 · Answer 13 · 2019-06-25 11:07:55

122

Views

Unification of functions

Published on 25 Jun 2019 - 11:07

score 117 · Answer 14 · 2019-06-26 11:01:55

117

Views

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

Published on 26 Jun 2019 - 11:01

score 139 · Answer 15 · 2026-03-25 06:10:47

139

Views

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

Published on 25 Mar 2026 - 6:10

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