Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in proof

Prove the efficiency of repeated calls to successor() in binary trees?

algorithm binary-search-tree proof

Using Ogden’s Lemma versus regular Pumping Lemma for Context-Free Grammars

string math context-free-grammar proof pumping-lemma

How to prove False from obviously contradictory assumptions

coq proof

prove n = Big-O(1) using induction

complexity-theory big-o proof

How can I have Idris automatically prove that two values are not equal?

proof idris

Generalizing fold such that it becomes expressive enough to define any finite recursion?

haskell functional-programming generic-programming fold proof

Context Free Language Question (Pumping Lemma)

theory automata proof language-theory

Using big-O to prove N^2 is O(2^N)

big-o proof

Why Coq doesn't allow inversion, destruct, etc. when the goal is a Type?

coq proof inversion

How to prove this invariant?

ada proof invariants proof-of-correctness spark-ada

How or is that possible to prove or falsify `forall (P Q : Prop), (P -> Q) -> (Q -> P) -> P = Q.` in Coq?

equality coq proof dependent-type curry-howard

Core of Verifier in Isabelle/HOL

proof isabelle

How can we prove by induction that binary search is correct?

algorithm search binary-search proof

Proving the Functor laws for free monads; am I doing it right?

haskell monads proof free-monad

What laws are the standard Haskell type classes expected to uphold?

haskell interface proof

Would the ability to declare Lisp functions 'pure' be beneficial?

lisp computer-science compiler-optimization proof purely-functional

Proofs of Applicative laws for haskell instances

haskell proof applicative

Sorted list in idris (insertion sort)

list sorting proof idris
« Newer Entries Older Entries »