LATEX Sugar for Isabelle Documents Florian Haftmann, Gerwin Klein, Tobias Nipkow, Norbert Schirmer August 15, 2018 Abstract This document shows how to typset mathematics in Isabelle-based

Source URL: www.cl.cam.ac.uk

• Computer programming
• Software engineering
• Computing
• Fold
• Recursion
• LaTeX

Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber

Source URL: user.it.uu.se

• Mathematical logic
• Type theory
• Computability theory
• Lambda calculus
• Theoretical computer science
• Model theory
• Higher-order logic
• Constructible universe
• Mathematics

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

Source URL: user.it.uu.se

• Proof assistants
• Theoretical computer science
• Logic in computer science
• Mathematical logic
• Isabelle
• Logic for Computable Functions
• Mathematics
• Resolution
• Constructible universe
• Theorem prover
• LCF
• Formal methods

PDF Document

Source URL: isabelle.in.tum.de

• Mathematical logic
• Logic
• Proof theory
• Mathematics
• Proof assistants
• Logic in computer science
• Type theory
• Substructural logic
• Sequent
• First-order logic
• Isabelle
• Higher-order logic

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

Source URL: www.cl.cam.ac.uk

• Computer programming
• Recursion
• Mathematical logic
• Software engineering
• Computability theory
• Theory of computation
• Theoretical computer science
• -recursive function
• Recursive definition
• Well-founded relation
• Functional programming
• Pattern matching

PDF Document

Source URL: isabelle.in.tum.de

• Software
• Theoretical computer science
• Formal methods
• Logic in computer science
• Automated theorem proving
• Constraint programming
• Isabelle
• SPASS
• Satisfiability modulo theories
• Frama-C
• Alt-Ergo
• Vampire

Tobias Nipkow Programming and Proving in Isabelle/HOL le l

Source URL: mirror.clarkson.edu

• Type theory
• Theoretical computer science
• Proof assistants
• Mathematical logic
• Programming language theory
• Formal methods
• Lambda calculus
• Logic in computer science
• Isabelle
• HOL
• HindleyMilner type system
• Automated theorem proving

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: isabelle.in.tum.de

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

PDF Document

Source URL: isabelle.in.tum.de

• System software
• Software
• Computing
• Scripting languages
• System administration
• Cygwin
• Red Hat software
• Command shells
• Unix shell
• Environment variable
• Shell script
• Command-line interface

Integrating a SAT Solver with Isabelle/HOL Tjark Weber (joint work with Alwen Tiu et al.) First Munich-Nancy Workshop on

Source URL: user.it.uu.se