plclub / cbpv-effects-coeffects
Formalization of CBPV extended with effect and coeffect tracking
☆12Updated 8 months ago
Alternatives and similar repositories for cbpv-effects-coeffects:
Users that are interested in cbpv-effects-coeffects are comparing it to the libraries listed below
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ModTT in Agda☆11Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- A formalization of System Fω in Agda☆17Updated 2 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Experimental type-checker for internally parametric type theory☆32Updated last month
- my phd thesis☆26Updated 8 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 4 months ago
- Session types in Idris2!☆27Updated 4 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 11 months ago
- 🩺 A library for compiler diagnostics☆44Updated 3 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated 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 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Deadlock freedom by type checking☆20Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- ☆21Updated 3 years ago
- ☆23Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Graded Dependent Type systems☆24Updated last year