sergei-romanenko / agda-simple-scp
A simple supercompiler formally verified in Agda
☆33Updated 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:
- Experimental type-checker for internally parametric type theory☆32Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Verified C programming in Agda☆16Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- A bare-bones LCF-style proof assistant☆23Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Formalization of type theory☆22Updated 3 years ago
- A formalization of System Fω in Agda☆17Updated 3 months ago
- ☆12Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Anders: Cubical Type Checker☆24Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆21Updated 7 years ago