amelia
/
setoid
1
0
Fork 0
Code Issues 0 Pull Requests 0 Projects 0 Releases 0 Wiki Activity
a type theory with equality based on setoids
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 Commit
1 Branch
38 KiB
Branch: master
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'master'
${ noResults }
setoid/test3.stt

5 lines
137 B
Raw Permalink Normal View History

need to throw this stuff on git
3 years ago
​
​
​
​
​
 
  1. let
  2.   congComp : {A B : Type} (f : A -> B) {x : A}
  3.           -> cong f (refl {A} {x}) == refl {B} {f x};
  4.   congComp f = refl;
  5.   
  6. congComp