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:
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A formalization of System Fω in Agda☆17Updated 4 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Coherence typechecker for infinity categories☆19Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Formalization of type theory☆22Updated 3 years ago
- ☆23Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆29Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- ☆12Updated 5 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
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year