sstucki / f-omega-int-agda
F-omega with interval kinds mechanized in Agda
☆13Updated 7 months ago
Alternatives and similar repositories for f-omega-int-agda:
Users that are interested in f-omega-int-agda are comparing it to the libraries listed below
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆12Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 11 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆12Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ☆16Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆18Updated 2 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Collaborative work on reversible computing☆18Updated 2 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago