Date: 2015-05-21 06:02:19Theoretical computer science Software engineering Programming language theory Logic in computer science Proof assistants Formal methods Automated theorem proving Isabelle Satisfiability modulo theories ACL2 Curry Logic for Computable Functions | | Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive tAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 207,13 KBShare Document on Facebook
|