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
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- my phd thesis☆26Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Coherence typechecker for infinity categories☆20Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago