Question

Is equality decidable on any coinductive type?

score 272 · Answer 1 · 2015-06-18 08:10:55

272

Views

Is equality decidable on any coinductive type?

Published on 18 June 2015 at 08:10

score 1.1k · Answer 2 · 2014-11-17 00:14:36

1.1k

Views

Is an infinite list of ones sane?

Published on 17 November 2014 at 00:14

score 132 · Answer 3 · 2020-12-01 19:45:37

132

Views

corecursive Agda functions without sized types

Published on 01 December 2020 at 19:45

score 91 · Answer 4 · 2020-12-11 10:51:01

91

Views

Is the only difference between Inductive and CoInductive the well-formedness checks on their uses (in Coq)?

Published on 11 December 2020 at 10:51

score 151 · Answer 5 · 2020-07-28 10:12:24

151

Views

Eliminating erased argument with only one valid case

Published on 28 July 2020 at 10:12

score 47 · Answer 6 · 2016-02-01 15:37:42

47

Views

Unexpected corecursive call

Published on 01 February 2016 at 15:37

score 598 · Answer 7 · 2015-05-26 02:49:31

598

Views

Proof of stream's functor laws

Published on 26 May 2015 at 02:49

score 502 · Answer 8 · 2015-06-06 23:25:07

502

Views

Termination check of a recursive function call in agda

Published on 06 June 2015 at 23:25

score 699 · Answer 9 · 2013-07-15 15:23:42

699

Views

Coinduction and dependent types

Published on 15 July 2013 at 15:23

score 104 · Answer 10 · 2019-12-25 00:14:29

104

Views

Coinduction not of form A -> A?

Published on 25 December 2019 at 00:14

score 154 · Answer 11 · 2021-08-26 06:12:46

154

Views

Can I prove "coinductive principles" about coinductive type?

Published on 26 August 2021 at 06:12

score 100 · Answer 12 · 2021-02-28 12:57:57

100

Views

Proving coinductive theorems with coinductive assumptions

Published on 28 February 2021 at 12:57

score 111 · Answer 13 · 2023-06-25 23:23:35

111

Views

Reading a string from the command line in Agda 2

Published on 25 June 2023 at 23:23

score 335 · Answer 14 · 2017-02-05 13:50:08

335

Views

Trouble to understand Agda's Coinduction

Published on 05 February 2017 at 13:50

score 166 · Answer 15 · 2019-04-02 04:47:15

166

Views

Termination checker fails after abstracting the call site

Published on 02 April 2019 at 04:47

score 163 · Answer 16 · 2021-11-23 14:45:20

163

Views

How to define constant heterogeneous streams in Haskell?

Published on 23 November 2021 at 14:45

score 758 · Answer 17 · 2021-11-26 18:20:52

758

Views

Are codatatypes really terminal algebras?

Published on 26 November 2021 at 18:20

score 219 · Answer 18 · 2017-07-10 12:42:44

219

Views

Proving a coinduction principle for co-natural numbers

Published on 10 July 2017 at 12:42

score 472 · Answer 19 · 2016-06-15 21:26:41

472

Views

Compute an (infinite) tree from fixpoint operator using delay modality

Published on 15 June 2016 at 21:26

score 207 · Answer 20 · 2016-06-16 20:38:37

207

Views

Compute infinite tree from rooted paths using delay modality

Published on 16 June 2016 at 20:38

List Question

Is equality decidable on any coinductive type?

Is an infinite list of ones sane?

corecursive Agda functions without sized types

Is the only difference between Inductive and CoInductive the well-formedness checks on their uses (in Coq)?

Eliminating erased argument with only one valid case

Unexpected corecursive call

Proof of stream's functor laws

Termination check of a recursive function call in agda

Coinduction and dependent types

Coinduction not of form A -> A?

Can I prove "coinductive principles" about coinductive type?

Proving coinductive theorems with coinductive assumptions

Reading a string from the command line in Agda 2

Trouble to understand Agda's Coinduction

Termination checker fails after abstracting the call site

How to define constant heterogeneous streams in Haskell?

Are codatatypes really terminal algebras?

Proving a coinduction principle for co-natural numbers

Compute an (infinite) tree from fixpoint operator using delay modality

Compute infinite tree from rooted paths using delay modality

Trending Questions

Popular # Hahtags

Popular Questions