b5dc88ee37
Fixes the problem described at #1216. This is an alternative fix that prevents the m_var_stack from being in an inconsistent state.
23 lines
717 B
Text
23 lines
717 B
Text
open nat
|
||
|
||
inductive Vec (X : Type*) : ℕ → Type*
|
||
| nil {} : Vec 0
|
||
| cons : X → Pi {n : nat}, Vec n → Vec (n + 1)
|
||
|
||
namespace Vec
|
||
def get₂ {A : Type} : Π {n : ℕ}, Vec A (succ $ succ n) → A
|
||
| n (cons x₁ (cons x₂ xs)) := x₂
|
||
|
||
def get₂a {A : Type} : Π {n : ℕ}, Vec A (n+2) → A
|
||
| 0 (cons x₁ (cons x₂ xs)) := x₂
|
||
| (n+1) (cons x₁ (cons x₂ xs)) := x₂
|
||
|
||
def get₂b {A : Type} : Π {n : ℕ}, Vec A (n+2) → A
|
||
| n (cons x₁ (cons x₂ xs)) := x₂
|
||
|
||
def get₂c {A : Type} : Π {n : ℕ}, Vec A (n+2) → A
|
||
| .n (@cons .A x₁ .(n+1) (@cons .A x₂ n xs)) := x₂
|
||
|
||
def get₂d {A : Type} : Π {n : ℕ}, Vec A (n+2) → A
|
||
| .n (@cons .A x₁ (n+1) (@cons .A x₂ .n xs)) := x₂
|
||
end Vec
|