minitt 0.4.3

Mini-TT, a dependently-typed lambda calculus, extended and (re)implemented in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

let maybe: Type -> Type = \lambda t. Sum { Just t | Nothing };

let the: \Pi t: Type. (t -> t) = \lambda _. \lambda a. a;

let unwrap_type (t : Type): (maybe t) -> Type = split
  { Just _ => t
  | Nothing => 1
  };

let unwrap_bad: \Pi t: Type. \Pi mt: maybe t. (unwrap_type t) mt = \lambda t.
  (the (\Pi mt: maybe t. ((unwrap_type t) mt))) split
    { Just a => a
    | Nothing => 0
    };

-- A cubicaltt-like replacement:

let unwrap (t : Type): \Pi mt: maybe t. (unwrap_type t) mt = split
  -- I'm so sorry for the dumb parser, function application is accidentally
  -- right-associative.
  { Just a => a
  | Nothing => 0
  };