jonsterling / coq-guarded-computational-type-theoryLinks
☆21Updated 7 years ago
Alternatives and similar repositories for coq-guarded-computational-type-theory
Users that are interested in coq-guarded-computational-type-theory are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆17Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- Work in progress☆37Updated 2 months ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- ☆18Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months 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
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago