Introduction Core Features Selected Extensions Conclusion Isabelle/HOL:

Source URL: user.it.uu.se

• Theoretical computer science
• Proof assistants
• Logic in computer science
• Mathematics
• Mathematical logic
• Formal methods
• Isabelle
• HOL
• Automated theorem proving
• Ordinal number
• Theorem

PDF Document

Source URL: isabelle.in.tum.de

• Mathematical logic
• Logic
• Theoretical computer science
• Logic in computer science
• Proof assistants
• Type theory
• Quantification
• Philosophical logic
• Isabelle
• First-order logic
• Logic for Computable Functions
• Logical framework

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: mirror.clarkson.edu

• 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

Tobias Nipkow Programming and Proving in Isabelle/HOL le l

Source URL: isabelle.in.tum.de

• 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

Bounded Model Generation for Isabelle/HOL and Related Applications of SAT Solvers in Interactive Theorem Proving Tjark Weber

Source URL: user.it.uu.se

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

Defining (Co)datatypes and Primitively (Co)recursive Functions in Isabelle/HOL Julian Biendarra, Jasmin Christian Blanchette, Martin Desharnais, Lorenz Panny, Andrei Popescu, and Dmitriy Traytel 15 August 2018

Source URL: isabelle.in.tum.de

• Computer programming
• Software engineering
• Computing
• Recursion
• Type theory
• Data types
• Theoretical computer science
• Functional programming
• Recursive data type
• Inductive data type
• Corecursion
• Mutual recursion

What’s in Main Tobias Nipkow August 15, 2018 Abstract This document lists the main types, functions and syntax provided by theory Main. It is meant as a quick overview of what is available.

Source URL: isabelle.in.tum.de

Tobias Nipkow Markus Wenzel Lawrence C. Paulson lle

Source URL: isabelle.in.tum.de

• Mathematics
• Logic
• Mathematical logic
• Recursion
• Theoretical computer science
• Mathematical proofs
• Type theory
• Mathematical induction
• Structural induction
• Recursive definition
• Automated theorem proving
• Natural deduction

PDF Document

Source URL: isabelle.in.tum.de

• Software engineering
• Computer programming
• Programming language theory
• Functional languages
• Proof assistants
• Procedural programming languages
• Logic in computer science
• Type theory
• Isabelle
• Logic for Computable Functions
• Standard ML
• ML

Defining (Co)datatypes and Primitively (Co)recursive Functions in Isabelle/HOL Julian Biendarra, Jasmin Christian Blanchette, Martin Desharnais, Lorenz Panny, Andrei Popescu, and Dmitriy Traytel 15 August 2018

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

• Computer programming
• Software engineering
• Computing
• Recursion
• Type theory
• Data types
• Theoretical computer science
• Functional programming
• Recursive data type
• Inductive data type
• Corecursion
• Mutual recursion