Volume 1: Logical Foundations
Table of Contents
Index
Roadmap
Preface
Welcome
Overview
Logic
Proof Assistants
Functional Programming
Rocq vs. Coq
Further Reading
Practicalities
System Requirements
Alternative Installation Methods
Exercises
Downloading the Rocq Files
Chapter Dependencies
Recommended Citation Format
Resources
Sample Exams
Lecture Videos
Note for Instructors and Contributors
Translations
Thanks
Functional Programming in Rocq (
Basics
)
Data and Functions
Enumerated Types
Days of the Week
Booleans
Types
New Types from Old
Modules
Tuples
Numbers
Proof by Simplification
Proof by Rewriting
Proof by Case Analysis
Optional: Testing Your Solutions
Proof by Induction (
Induction
)
Separate Compilation
Review
Proof by Induction
Proofs Within Proofs
More Exercises
Working with Structured Data (
Lists
)
Pairs of Numbers
Lists of Numbers
Reasoning About Lists
Induction on Lists
Options
Partial Maps
Polymorphism and Higher-Order Functions (
Poly
)
Polymorphic Lists
Polymorphic Pairs
Polymorphic Options
Functions as Data
Higher-Order Functions
Filter
Anonymous Functions
Map
Fold
Functions That Construct Functions
More Basic Tactics (
Tactics
)
The
apply
Tactic
The
apply
with
Tactic
The
injection
and
discriminate
Tactics
Using Tactics on Hypotheses
Specializing Hypotheses
Varying the Induction Hypothesis
Rewriting with conditional statements
Unfolding Definitions
Using
destruct
on Compound Expressions
Micro Sermon
Logic in Rocq (
Logic
)
The
Prop
Type
Logical Connectives
Conjunction
Disjunction
Falsehood and Negation
Truth
Logical Equivalence
Setoids and Logical Equivalence
Existential Quantification
Recap -- Logical connectives in Rocq
Programming with Propositions
Applying Theorems to Arguments
Working with Decidable Properties
The Logic of Rocq
Functional Extensionality
Classical vs. Constructive Logic
Inductively Defined Propositions (
IndProp
)
Inductively Defined Propositions
Example: The Collatz Conjecture
Example: Binary relation for comparing numbers
Example: Transitive Closure
Example: Reflexive and Transitive Closure
Example: Permutations
Example: Evenness (yet again)
Constructing Evidence for Permutations
Using Evidence in Proofs
Destructing and Inverting Evidence
Induction on Evidence
Case Study: Regular Expressions
Definitions
Examples
The
remember
Tactic
Case Study: Improving Reflection
Total and Partial Maps (
Maps
)
The Standard Library
Identifiers
Total Maps
Partial maps
The Curry-Howard Correspondence (
ProofObjects
)
Proof Scripts
Quantifiers, Implications, Functions
Programming with Tactics
Logical Connectives as Inductive Types
Conjunction
Disjunction
Existential Quantification
True
and
False
Equality
Rocq's Trusted Computing Base
Induction Principles (
IndPrinciples
)
Basics
Induction Principles for Propositions
Explicit Proof Objects for Induction (Optional)
Properties of Relations (
Rel
)
Relations
Basic Properties
Reflexive, Transitive Closure
Simple Imperative Programs (
Imp
)
Arithmetic and Boolean Expressions
Syntax
Evaluation
Optimization
Rocq Automation
Tacticals
Defining New Tactics
The
lia
Tactic
A Few More Handy Tactics
Evaluation as a Relation
Inference Rule Notation
Equivalence of the Definitions
Computational vs. Relational Definitions
Expressions With Variables
States
Syntax
Notations
Evaluation
Commands
Syntax
More Examples
Evaluating Commands
Evaluation as a Function (Failed Attempt)
Evaluation as a Relation
Determinism of Evaluation
Additional Exercises
Lexing and Parsing in Rocq (
ImpParser
)
Internals
Lexical Analysis
Parsing
Examples
An Evaluation Function for Imp (
ImpCEvalFun
)
A Broken Evaluator
A Step-Indexed Evaluator
Relational vs. Step-Indexed Evaluation
Determinism of Evaluation Again
Extracting OCaml from Rocq (
Extraction
)
Basic Extraction
Controlling Extraction of Specific Types
A Complete Example
Discussion
Going Further
More Automation (
Auto
)
The
auto
Tactic
Searching For Hypotheses
The
eapply
and
eauto
tactics
A Streamlined Treatment of Automation (
AltAuto
)
Tacticals
The
try
Tactical
The Sequence Tactical
;
(Simple Form)
The
repeat
Tactical
Tactics that Make Mentioning Names Unnecessary
The
assumption
tactic
The
contradiction
tactic
The
subst
tactic
The
constructor
tactic
Automatic Solvers
Linear Integer Arithmetic: The
lia
Tactic
Equalities: The
congruence
Tactic
Propositions: The
intuition
Tactic
Search Tactics
The
auto
Tactic
The
eauto
variant
Ltac: The Tactic Language
Ltac Functions
Ltac Pattern Matching
Review
Postscript
Looking Back
Looking Forward
Resources
Bibliography (
Bib
)
Resources cited in this volume
