HOL with Definitions: Semantics, Soundness, and a Verified Implementation Ramana Kumar1 , Rob Arthan2 , Magnus O. Myreen1 , and Scott Owens3 2 1

Source URL: cakeml.org

• Mathematical logic
• Metalogic
• Logic
• Model theory
• Logic in computer science
• Proof theory
• Proof assistants
• Programming language semantics
• HOL
• Operational semantics
• Gdel's completeness theorem
• Type theory

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

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: www.cl.cam.ac.uk

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

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

Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1 2

Source URL: cakeml.org

• Mathematical logic
• Metalogic
• Logic
• Model theory
• Type theory
• Proof assistants
• Proof theory
• Higher-order logic
• Theoretical computer science
• Isabelle
• Simply typed lambda calculus
• Gdel's incompleteness theorems

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

Steps Towards Verified Implementations of HOL Light Magnus O. Myreen1 , Scott Owens2 , and Ramana Kumar1 1 Computer Laboratory, University of Cambridge, UK

Source URL: cakeml.org

• Software engineering
• Computer programming
• Computing
• Proof assistants
• Logic in computer science
• Functional languages
• Automated theorem proving
• Theoretical computer science
• HOL
• Logic for Computable Functions
• Automated reasoning
• ML

A Verified Compiler from Isabelle/HOL to CakeML

Source URL: lars.hupel.info

• Mathematics
• Theoretical computer science
• Software engineering
• Mathematical logic
• Data types
• Automated theorem proving
• Logic programming
• Lambda calculus
• Substitution
• De Bruijn index
• Term
• Standard ML

Hol Installatietechniek VeenweidewegLD Nieuw-Lekkerland Tel Faxe-mail: internet: www.holbv.nl Rabobank Nieuw-Lekkerland rek. nr

Source URL: www.holbv.nl

PLA axioms PLA001-0.ax Blocks world axioms (holds(x, state) and holds(y, state)) ⇒ holds(and(x, y), state) cnf(and definition, axiom) (holds(empty, state) and holds(clear(x), state) and differ(x, table)) ⇒ holds(hol

Source URL: math.chapman.edu