How to use a refutation to direct the type checker in Haskell?...
Read MoreIn Coq, are there tactics for working with Rabs, Rineq?...
Read MoreWhat kind of functions preserve properties of closure?...
Read MoreTransform `not A` into `A -> False` in Coq...
Read MoreSimple equality proofs on lists in idris (prooving xs ++ [x] = ys ++ [y] -> x = y -> xs = ys)...
Read MoreWhy is pattern matching sometimes "essential" in Agda?...
Read MoreWhy doesn't this proof require extensionality? (Agda)...
Read MoreInduction on a datatype with non-uniform type parameters produces ill-typed terms...
Read MoreSuperposition calculus and ordering of equations...
Read MoreProving that a reversible list is a palindrome in Coq...
Read MoreUnderstanding the induction on evidence in coq...
Read MoreHow to prove that "Type <> Set" (i.e. Type is not equal to Set) in Coq?...
Read MoreStuck proving lemma with unprovable subgoals...
Read MoreCoq: prove that an inductive type w/o a non-recursive constructor is uninhabitated...
Read MoreShorter notation for matching hypotheses in Coq?...
Read MoreIdris Type mismatch that occurs even from template...
Read MoreI want to prove some theorem using Prolog, however, it always returns "Out of global stack"...
Read MoreIsabelle: Sledgehammer finds a proof but it fails...
Read MoreProving `forall x xs ys, subseq (x :: xs) ys -> subseq xs ys` in Coq...
Read MoreKnowing when an Isar-style proof is actually valid in Isabelle...
Read MoreNon-empty list append theorem in Coq...
Read MoreGeneralising a set of proofs in coq...
Read MoreSmart constructor pattern while proving with Isabelle...
Read MoreCoq can't find subterm when using rewrite tactic...
Read MoreHow to prove that a relation property holds for a transitive closure of this relation?...
Read MoreVerifiedFunctor - prove map (map g) x = x...
Read MoreRewriting in simple theorem proof...
Read More"rewriting did not change type" error for visually same types...
Read More