Question

Idris totality check

score 151 · Answer 1 · 2022-08-29T02:04:56.850000

151

Views

Idris totality check

Published on 29 August 2022 at 02:04

score 58 · Answer 2 · 2021-11-27T16:49:25.563000

58

Views

How to crash on internal bug and force totality

Published on 27 November 2021 at 16:49

score 158 · Answer 3 · 2021-10-03T14:41:16.357000

158

Views

Why is this Idris function not total and what could be done to make it check total?

Published on 03 October 2021 at 14:41

score 344 · Answer 4 · 2021-07-08T05:00:14.223000

344

Views

Can any additional axiom make Coq Turing complete?

Published on 08 July 2021 at 05:00

score 100 · Answer 5 · 2020-03-21T12:30:58.530000

100

Views

Can I avoid explicitly discharging invalid cases in total functions in Idris?

Published on 21 March 2020 at 12:30

score 341 · Answer 6 · 2019-07-04T22:46:32.053000

341

Views

Defining recursive function over product type

Published on 04 July 2019 at 22:46

score 273 · Answer 7 · 2019-02-16T10:25:24.733000

273

Views

Convince Idris about recursive call totality

Published on 16 February 2019 at 10:25

score 154 · Answer 8 · 2018-12-09T18:15:55.167000

154

Views

totality checking with indirect mutually recursive datatypes in Idris

Published on 09 December 2018 at 18:15

score 239 · Answer 9 · 2018-09-05T01:25:17.660000

239

Views

Proving totality of a function taking at most n recursive calls

Published on 05 September 2018 at 01:25

score 478 · Answer 10 · 2018-04-15T20:47:29.437000

478

Views

Coq can't compute well-founded defined with Fix, but can if defined with Program Fixpoint

Published on 15 April 2018 at 20:47

score 229 · Answer 11 · 2018-01-16T20:12:38.407000

229

Views

Cannot determine termination

Published on 16 January 2018 at 20:12

score 1.4k · Answer 12 · 2018-01-09T17:40:08.733000

1.4k

Views

Teach coq to check termination

Published on 09 January 2018 at 17:40

score 291 · Answer 13 · 2018-01-05T21:17:39.710000

291

Views

Finding a well founded relation to prove termination of a function that stops decreasing at some point

Published on 05 January 2018 at 21:17

score 137 · Answer 14 · 2017-12-22T21:51:27.587000

137

Views

How can I write a function of the following form in Coq?

Published on 22 December 2017 at 21:51

score 149 · Answer 15 · 2017-12-20T15:35:39.857000

149

Views

Program Fixpoint: recursive call in `let` and hypothesis of the obligation

Published on 20 December 2017 at 15:35

score 110 · Answer 16 · 2017-12-16T14:57:03.910000

110

Views

Strange pattern matching behavior in Idris

Published on 16 December 2017 at 14:57

score 2.8k · Answer 17 · 2017-12-14T15:20:21.413000

2.8k

Views

Decreasing argument (and what is a Program Fixpoint)

Published on 14 December 2017 at 15:20

score 168 · Answer 18 · 2017-10-04T10:01:12.400000

168

Views

Why does this 'with' block spoil the totality of this function?

Published on 04 October 2017 at 10:01

score 48 · Answer 19 · 2017-08-08T22:54:17.460000

48

Views

Making strIndex total in Quick Search?

Published on 08 August 2017 at 22:54

score 619 · Answer 20 · 2017-06-28T02:42:45.760000

619

Views

Coq best practice: mutual recursion, only one function is structurally decreasing

Published on 28 June 2017 at 02:42

List Question

Idris totality check

How to crash on internal bug and force totality

Why is this Idris function not total and what could be done to make it check total?

Can any additional axiom make Coq Turing complete?

Can I avoid explicitly discharging invalid cases in total functions in Idris?

Defining recursive function over product type

Convince Idris about recursive call totality

totality checking with indirect mutually recursive datatypes in Idris

Proving totality of a function taking at most n recursive calls

Coq can't compute well-founded defined with Fix, but can if defined with Program Fixpoint

Cannot determine termination

Teach coq to check termination

Finding a well founded relation to prove termination of a function that stops decreasing at some point

How can I write a function of the following form in Coq?

Program Fixpoint: recursive call in `let` and hypothesis of the obligation

Strange pattern matching behavior in Idris

Decreasing argument (and what is a Program Fixpoint)

Why does this 'with' block spoil the totality of this function?

Making strIndex total in Quick Search?

Coq best practice: mutual recursion, only one function is structurally decreasing

Trending Questions

Popular # Hahtags

Popular Questions