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

PDF Document

Source URL: mirror.clarkson.edu

• 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

PDF Document

Source URL: mirror.clarkson.edu

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

PDF Document

Source URL: mirror.clarkson.edu

• Mathematical proof
• Isabelle

Tobias Nipkow Markus Wenzel Lawrence C. Paulson lle

Source URL: mirror.clarkson.edu

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

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

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

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

PDF Document

Source URL: mirror.clarkson.edu

• 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

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

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

• Software engineering
• Computer programming
• Computing
• Functional languages
• Semigroup theory
• Abstract data types
• Algebraic structures
• Programming language comparisons
• Double-ended queue
• Queue
• Monoid
• Semigroup