tsung-ju / SystemF
An Agda formalization of System F and the Brown-Palsberg self-interpreter
☆24Updated 4 years ago
Alternatives and similar repositories for SystemF:
Users that are interested in SystemF are comparing it to the libraries listed below
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 4 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
- ModTT in Agda☆11Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 10 months ago
- ☆21Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 3 weeks ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- my phd thesis☆26Updated 8 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 weeks ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆18Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆12Updated 7 months ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- ☆12Updated 5 years ago
- ☆29Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Notes (and implementation) of unification with binders☆14Updated 2 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year