pedrotst / coquedilleLinks
A Coq to Cedille compiler written in Coq
☆34Updated 4 years ago
Alternatives and similar repositories for coquedille
Users that are interested in coquedille are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 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
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- a version of the 2048 game for Coq☆22Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 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 10 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Lenses in Coq☆19Updated 2 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆36Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years 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.☆22Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆23Updated 11 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week