pedrotst / coquedilleLinks
A Coq to Cedille compiler written in Coq
☆34Updated 5 years ago
Alternatives and similar repositories for coquedille
Users that are interested in coquedille are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 weeks ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago