tsung-ju / SystemFLinks
An Agda formalization of System F and the Brown-Palsberg self-interpreter
☆25Updated 4 years ago
Alternatives and similar repositories for SystemF
Users that are interested in SystemF are comparing it to the libraries listed below
Sorting:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆21Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated 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
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- my phd thesis☆26Updated 11 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 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
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated 11 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- ☆36Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆16Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago