<--- Back to Details
First PageDocument Content
Software / Proof assistants / Computing / Logic in computer science / JEdit / Isabelle / Standard ML / Plug-in / Selection / Logic for Computable Functions / HOL / Isabel
Date: 2018-08-15 07:19:03
Software
Proof assistants
Computing
Logic in computer science
JEdit
Isabelle
Standard ML
Plug-in
Selection
Logic for Computable Functions
HOL
Isabel

Add to Reading List

Source URL: isabelle.in.tum.de

Download Document from Source Website

File Size: 2,09 MB

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