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

New posts in theorem-proving

printing internal solver formulas in z3

z3 smt theorem-proving formal-verification

Proving substitution property of successor over equality

dependent-type theorem-proving formal-verification lean

What is the best way to search through general definitions, theorems, functions, etc for Isabelle?

isabelle theorem-proving

How to implement Floyd's Hare and Tortoise algorithm in Agda?

haskell functional-programming agda theorem-proving floyd-cycle-finding

Avoiding quantifiers in Z3

z3 smt theorem-proving

Interactive math proof system

math coq theorem-proving isabelle proof-system

Isabelle: Sledgehammer finds a proof but it fails

isabelle theorem-proving

Coq can't find subterm when using rewrite tactic

coq theorem-proving

Using theorem provers to find attacks

security theorem-proving

Proving that a reversible list is a palindrome in Coq

coq palindrome theorem-proving logical-foundations

Non-empty list append theorem in Coq

ocaml coq theorem-proving coq-tactic formal-verification

Coq simpl for Program Fixpoint

coq theorem-proving totality

How should the general type of a "lemma" function be understood?

haskell theorem-proving dependent-type higher-rank-types

Has anyone tried proving Z3 with Z3 itself?

z3 theorem-proving theorem

Formalizing computability theory in Coq

math types coq theorem-proving

How do I prove a "seemingly obvious" fact when relevant types are abstracted by a lambda in Idris?

agda theorem-proving idris

Is it possible to program and check invariants in Haskell?

haskell types invariants theorem-proving

How to learn agda

type-systems theorem-proving agda

Z3: finding all satisfying models

z3 smt theorem-proving
« Newer Entries Older Entries »