sergei-romanenko / agda-simple-scpLinks
A simple supercompiler formally verified in Agda
☆34Updated 8 years ago
Alternatives and similar repositories for agda-simple-scp
Users that are interested in agda-simple-scp are comparing it to the libraries listed below
Sorting:
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆50Updated 2 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Agda to C compiler☆10Updated last month
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago