epfl-lara / SystemFRLinks
System FR: Formalized Foundations for Stainless
☆12Updated this week
Alternatives and similar repositories for SystemFR
Users that are interested in SystemFR are comparing it to the libraries listed below
Sorting:
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Updated 4 months ago
- ☆19Updated 2 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Adding extensions to DOT calculus☆24Updated 6 years ago
- Dependent Object Types (DOT), bottom up☆89Updated 4 years ago
- ☆12Updated 6 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated 3 weeks ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Quasi-quoting library for agda☆18Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 5 years ago
- Dafny for Metatheory of Programming Languages☆28Updated 5 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A style guide for Coq☆18Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago