TechQA.

Question

Associativity proof on Nats vs. Lists

score 130 · Answer 1 · 2018-02-27T19:15:41.087000

0

Answer

130

Views

Associativity proof on Nats vs. Lists

130 views Asked by Niki At 27 February 2018 at 19:15

score 545 · Answer 2 · 2018-02-20T22:15:57.053000

Proving the correctness of brute force maximum sub array algorithm

545 views Asked by Honda At 20 February 2018 at 22:15

score 619 · Answer 3 · 2017-11-12T00:05:08.893000

How to prove a Ada/SPARK precondition on a function embedded in a double loop

619 views Asked by LT 'syreal' Jones At 12 November 2017 at 00:05

score 100 · Answer 4 · 2017-10-18T00:08:14.193000

Type inferencing help in OCaml

100 views Asked by user3460123 At 18 October 2017 at 00:08

score 1205 · Answer 5 · 2017-09-03T14:56:03.897000

How do you use induction with tactics/Isar in Isabelle/HOL?

1.2k views Asked by neoDaedalus At 03 September 2017 at 14:56

score 253 · Answer 6 · 2017-08-17T12:27:11.287000

proof of API response

253 views Asked by VsM At 17 August 2017 at 12:27

score 276 · Answer 7 · 2017-04-25T07:06:22.197000

Partition of natural numbers in sets

276 views Asked by user7917727 At 25 April 2017 at 07:06

score 222 · Answer 8 · 2017-01-20T15:55:41.053000

How to prove a combination of asymptotic notations?

222 views Asked by helpmeeeee At 20 January 2017 at 15:55

score 3154 · Answer 9 · 2016-04-03T04:44:50.300000

Worst Case for stable matchings

3.1k views Asked by a_123 At 03 April 2016 at 04:44

score 525 · Answer 10 · 2016-02-17T03:21:41.540000

Propositional Logic and Proofs

525 views Asked by Eric Johnson At 17 February 2016 at 03:21

score 1389 · Answer 11 · 2016-01-06T05:13:31.757000

Consider the numbers 1,2,...,1000. Show that among any 501 of them, two numbers exist such that one divides the other one.

1.3k views Asked by a_123 At 06 January 2016 at 05:13

score 198 · Answer 12 · 2015-04-28T18:47:24.193000

Z3 proofs: Are hypothesis and lemma rules always cleanly nested?

198 views Asked by Jasmin Blanchette At 28 April 2015 at 18:47

score 22419 · Answer 13 · 2011-03-28T20:44:59.127000

Proving Big-Theta notation

22.4k views Asked by Zee At 28 March 2011 at 20:44

score 636 · Answer 14 · 2011-03-07T00:41:29.320000

Proving some monad laws on an error monad I wrote

636 views Asked by Cody Bonney At 07 March 2011 at 00:41

score 1287 · Answer 15 · 2010-11-07T00:53:54.117000

Prove that n! is not in O(n^p) for any constant natural number p

1.2k views Asked by AudioBubble At 07 November 2010 at 00:53

score 3743 · Answer 16 · 2009-10-21T23:43:40.883000

Why is (a | b ) equivalent to a - (a & b) + b?

3.7k views Asked by Brandon Yarbrough At 21 October 2009 at 23:43

TechQA.

List Question

Associativity proof on Nats vs. Lists

Proving the correctness of brute force maximum sub array algorithm

How to prove a Ada/SPARK precondition on a function embedded in a double loop

Type inferencing help in OCaml

How do you use induction with tactics/Isar in Isabelle/HOL?

proof of API response

Partition of natural numbers in sets

How to prove a combination of asymptotic notations?

Worst Case for stable matchings

Propositional Logic and Proofs

Consider the numbers 1,2,...,1000. Show that among any 501 of them, two numbers exist such that one divides the other one.

Z3 proofs: Are hypothesis and lemma rules always cleanly nested?

Proving Big-Theta notation

Proving some monad laws on an error monad I wrote

Prove that n! is not in O(n^p) for any constant natural number p

Why is (a | b ) equivalent to a - (a & b) + b?

Popular Questions

Trending Questions