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 proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years 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 dependent type theory with user defined data types☆47Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 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.☆23Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- haha I'm graduating☆14Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- 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