Question

TypeScript recursive union function type

score 45 · Answer 1 · 2024-02-13T19:39:37.177000

45

Views

TypeScript recursive union function type

Published on 13 February 2024 at 19:39

score 99 · Answer 2 · 2024-01-10T17:57:51.353000

99

Views

What is the paradigm of wrapping generic parameters into nested structures called?

Published on 10 January 2024 at 17:57

score 61 · Answer 3 · 2023-12-12T18:41:40.863000

61

Views

Parity of nested function type and recursive call

Published on 12 December 2023 at 18:41

score 133 · Answer 4 · 2023-10-26T21:37:43.363000

133

Views

Why can some disjoint and exhaustive patterns not be represented as definitional equalities?

Published on 26 October 2023 at 21:37

score 45 · Answer 5 · 2023-08-16T12:32:04.397000

45

Views

List without gaps in Coq

Published on 16 August 2023 at 12:32

score 118 · Answer 6 · 2023-08-14T05:40:06.580000

118

Views

In cubical type theory, why are there function types that accept intervals as arguments when there are already a path type?

Published on 14 August 2023 at 05:40

score 79 · Answer 7 · 2023-06-08T15:19:05.967000

79

Views

How to prove Theorem euclid_gcd : forall a b z, euclid a b z -> gcd a b z. using coq?

Published on 08 June 2023 at 15:19

score 185 · Answer 8 · 2023-04-21T12:30:09.247000

185

Views

Rust is the automatic dereference of Box types prohibative?

Published on 21 April 2023 at 12:30

score 122 · Answer 9 · 2023-04-13T10:36:39.613000

122

Views

Is there a library for sets that works with bool in Coq?

Published on 13 April 2023 at 10:36

score 165 · Answer 10 · 2023-03-31T22:51:32.360000

165

Views

Type theory with an Any/Variant type

Published on 31 March 2023 at 22:51

score 116 · Answer 11 · 2023-03-04T13:52:26.833000

116

Views

Why can't all existential binders be replaced by unique constants during skolemization?

Published on 04 March 2023 at 13:52

score 337 · Answer 12 · 2023-01-31T01:12:17.397000

337

Views

In intuitionistic type theory, can any proof written in CoC be rewritten in system λP2? Or, does CoC = λP2?

Published on 31 January 2023 at 01:12

score 240 · Answer 13 · 2022-10-22T16:21:28.623000

240

Views

It is possible to define a function in haskell that takes one parameter, ignores it, and returns itself?

Published on 22 October 2022 at 16:21

score 79 · Answer 14 · 2022-09-05T11:06:08.467000

79

Views

Why can't I define this rewrite rule for type elimination of proof-irrelevant disjunctions in Agda

Published on 05 September 2022 at 11:06

score 197 · Answer 15 · 2022-09-02T00:48:09.483000

197

Views

Non-determinism on a set defined by the characteristic function

Published on 02 September 2022 at 00:48

score 1.4k · Answer 16 · 2022-07-12T14:53:19.873000

1.4k

Views

How to write "twice" so it can accept "swap" without restricting their type

Published on 12 July 2022 at 14:53

score 300 · Answer 17 · 2022-07-01T22:39:03.367000

300

Views

Agda: Failed to solve the following constraints: P x <= _X_53 (blocked on _X_53)

Published on 01 July 2022 at 22:39

score 241 · Answer 18 · 2022-05-11T04:05:30.657000

241

Views

Scala variance positions - theory behind it?

Published on 11 May 2022 at 04:05

score 102 · Answer 19 · 2022-05-02T20:31:37.433000

102

Views

Why coq doesn't use subtyping for logical or?

Published on 02 May 2022 at 20:31

score 1.2k · Answer 20 · 2022-04-20T19:31:41.187000

1.2k

Views

Proof by contradiction in Coq

Published on 20 April 2022 at 19:31

List Question

TypeScript recursive union function type

What is the paradigm of wrapping generic parameters into nested structures called?

Parity of nested function type and recursive call

Why can some disjoint and exhaustive patterns not be represented as definitional equalities?

List without gaps in Coq

In cubical type theory, why are there function types that accept intervals as arguments when there are already a path type?

How to prove Theorem euclid_gcd : forall a b z, euclid a b z -> gcd a b z. using coq?

Rust is the automatic dereference of Box types prohibative?

Is there a library for sets that works with bool in Coq?

Type theory with an Any/Variant type

Why can't all existential binders be replaced by unique constants during skolemization?

In intuitionistic type theory, can any proof written in CoC be rewritten in system λP2? Or, does CoC = λP2?

It is possible to define a function in haskell that takes one parameter, ignores it, and returns itself?

Why can't I define this rewrite rule for type elimination of proof-irrelevant disjunctions in Agda

Non-determinism on a set defined by the characteristic function

How to write "twice" so it can accept "swap" without restricting their type

Agda: Failed to solve the following constraints: P x <= _X_53 (blocked on _X_53)

Scala variance positions - theory behind it?

Why coq doesn't use subtyping for logical or?

Proof by contradiction in Coq

Trending Questions

Popular # Hahtags

Popular Questions