Logic for Computable Functions - PDFSEARCH.IO - Document Search Engine

Logic for Computable Functions
Results: 37

#	Item
1	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 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-21 06:02:19 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
2	A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi Add to Reading List Source URL: www.di.univaq.it Language: English - Date: 2011-02-08 09:50:34 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
3	Reconciling Semantics, Implementation and Users Gérard Berry INRIA Sophia-Antipolis http://www-sop.inria.fr/Gerard.Berry Add to Reading List Source URL: events.inf.ed.ac.uk Language: English - Date: 2012-10-10 03:52:00 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
4	Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel† Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2014-12-08 09:42:38 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
5	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 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-01-25 16:18:54 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
6	Interactive Theorem Proving in Industry John Harrison Intel Corporation 16 April 2012 Add to Reading List Source URL: events.inf.ed.ac.uk Language: English - Date: 2012-10-10 03:52:01 Automated theorem proving Logic in computer science Proof assistants Logic for Computable Functions E theorem prover HOL Robin Milner Interactive Theorem Proving Type theory
7	Can the computer really help us to prove theorems? Add to Reading List Source URL: www.cs.ru.nl Language: English - Date: 2011-11-17 12:13:56 Proof assistants Automated theorem proving Logic in computer science Type theory Automath Logic for Computable Functions Nqthm Proof theory ACL2 Mathematical proof Andrzej Trybulec Isabelle
8	A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2 1 Department Add to Reading List Source URL: www.paultaylor.eu Language: English - Date: 2009-02-12 12:32:31 Theoretical computer science Theory of computation Functions and mappings Function Computable function Algorithm characterizations Primitive recursive function Mathematics Computability theory Mathematical logic
9	Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel† Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2014-12-08 09:42:38 Mathematical logic Computer science Denotational semantics Lambda calculus Symbol Combinatory logic Orbifold Programming Computable Functions Theoretical computer science Logic in computer science Programming language semantics
10	Preface Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2009-09-05 02:34:00 Mathematical logic Computable function Computable number Computable analysis Computable real function Specker sequence Enumeration Computability Numbering Computability theory Theory of computation Theoretical computer science

UPDATE