sstucki / pts-agdaLinks
A formalization of Pure Type Systems (PTS) in Agda
☆27Updated 2 months ago
Alternatives and similar repositories for pts-agda
Users that are interested in pts-agda are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- ☆16Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- ☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆21Updated 3 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆17Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Relative Monad Library for Agda☆24Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- ☆29Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago