<--- Back to Details
First PageDocument Content
Automated theorem proving / Logic in computer science / Mathematical logic / Proof assistant / Logic for Computable Functions / Coq / Mathematical proof / HOL Light / Theorem / Mathematics / Logic / Theoretical computer science
Date: 2009-08-21 09:46:49
Automated theorem proving
Logic in computer science
Mathematical logic
Proof assistant
Logic for Computable Functions
Coq
Mathematical proof
HOL Light
Theorem
Mathematics
Logic
Theoretical computer science

Introduction Articles of Proof Compression

Add to Reading List

Source URL: www.gilith.com

Download Document from Source Website

File Size: 232,84 KB

Share Document on Facebook

Similar Documents

Theoretical 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 t

DocID: 1rlXv - View Document

Mathematical logic / Software engineering / Theoretical computer science / Type theory / Computability theory / Logic in computer science / Proof assistants / Logic for Computable Functions / HOL / Lambda calculus / Primitive recursive function / Recursion

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

DocID: 1rjEK - View Document

Theoretical computer science / Logic in computer science / Software engineering / Computer science / Hardware description languages / Synchronous programming languages / Formal methods / Denotational semantics / Esterel / Robin Milner / Milner / Logic for Computable Functions

Reconciling Semantics, Implementation and Users Gérard Berry INRIA Sophia-Antipolis http://www-sop.inria.fr/Gerard.Berry

DocID: 1r68x - View Document

Theoretical computer science / Models of computation / Logic in computer science / Mathematical logic / Software engineering / Denotational semantics / Computability theory / Symbol / Proof theory / Lambda calculus / Generalised Whitehead product / Programming Computable Functions

Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel†

DocID: 1qvnK - View Document

Theoretical computer science / Mathematical logic / Logic in computer science / Automated theorem proving / Proof assistants / Formal methods / Type theory / Isabelle / First-order logic / Logic for Computable Functions / Unification / HOL

LEO-II and Satallax on the Sledgehammer Test Bench Nik Sultanaa,∗, Jasmin Christian Blanchetteb , Lawrence C. Paulsona a Computer b Institut Laboratory, University of Cambridge, United Kingdom

DocID: 1qfS7 - View Document