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:
- Experimental type-checker for internally parametric type theory☆32Updated 10 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
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- 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
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- ☆38Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Algebraic proof discovery in Agda☆35Updated 4 years ago