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

PDF Document

Source URL: isabelle.in.tum.de

• Software
• Proof assistants
• Computing
• Logic in computer science
• JEdit
• Isabelle
• Standard ML
• Plug-in
• Selection
• Logic for Computable Functions
• HOL
• Isabel

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: isabelle.in.tum.de

• 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

• Logic
• Mathematical logic
• Mathematics
• Predicate logic
• Classical logic
• Proof theory
• Constructivism
• Semantics
• Propositional calculus
• First-order logic
• Intuitionistic logic
• Well-formed formula

PDF Document

Source URL: isabelle.in.tum.de

• Mathematical logic
• Logic
• Mathematics
• Automated theorem proving
• Proof theory
• Logic in computer science
• Proof assistants
• Type theory
• Isabelle
• Mathematical proof
• Automated reasoning
• Proof

Defining Nonprimitively (Co)recursive Functions in Isabelle/HOL Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, and Dmitriy Traytel 15 August 2018

Source URL: isabelle.in.tum.de

• Computer programming
• Declarative programming
• Software engineering
• Theoretical computer science
• Category theory
• Functional programming
• Recursion
• Type theory
• Corecursion
• Coinduction
• Fold
• SCons

PDF Document

Source URL: isabelle.in.tum.de

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