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
- Simply typed lambda calculus in cubical agda☆21Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- my phd thesis☆26Updated 6 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ☆36Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago