The Mikan proof assistant¶
Mikan (/miˈkɑːn/ mee-KAHN, after the Japanese name for Citrus unshiu) is a free and libre interactive proof assistant for cubical type theory, featuring a computational interpretation of univalence among a variety of schemas for inductive and coinductive definitions. Proofs are constructed incrementally in a flexible concrete syntax based on mixfix operators, and organised through an expressive system of parametrised modules. Mikan is a part of the 1Lab project.
Warning
This user manual is in the process of being updated and may contain outdated or inaccurate information.
- Language Reference
- Abstract definitions
- Built-ins
- Coinduction
- Copatterns
- Core language
- Coverage Checking
- Cubical
- Data Types
- Function Definitions
- Function Types
- Generalization of Declared Variables
- Implicit Arguments
- Instance Arguments
- Lambda Abstraction
- Local Definitions: let and where
- Lexical Structure
- Literal Overloading
- Lossy Unification
- Mixfix Operators
- Module System
- Mutual Recursion
- Opaque definitions
- Pattern Synonyms
- Positivity Checking
- Postulates
- Pragmas
- Prop
- Record Types
- Reflection
- Safe Agda
- Sort System
- Syntactic Sugar
- Syntax Declarations
- Telescopes
- Termination Checking
- Two-Level Type Theory
- Universe Levels
- With-Abstraction
- Tools