pedrotst / coquedille
A Coq to Cedille compiler written in Coq
☆33Updated 4 years ago
Alternatives and similar repositories for coquedille:
Users that are interested in coquedille are comparing it to the libraries listed below
- a version of the 2048 game for Coq☆22Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- IO using sized types and copatterns☆33Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated this week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Revised Omega-categorical Typechecker☆26Updated 4 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 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
- my phd thesis☆26Updated 7 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Implementation of sprintf for Coq☆18Updated 4 years ago
- ☆23Updated 8 months ago
- Organize mathematical thoughts☆20Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Formalising session types in Coq☆17Updated 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 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A simple supercompiler formally verified in Agda☆32Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A personal library, formalizing cohesive homotopy type theory in Agda.☆12Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- ☆36Updated 3 years ago