epfl-lara / SystemFRLinks
System FR: Formalized Foundations for Stainless
☆10Updated 3 years ago
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☆35Updated last month
- Dafny for Metatheory of Programming Languages☆27Updated 2 weeks ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Adding extensions to DOT calculus☆24Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- ☆12Updated 10 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Dependent Object Types (DOT), bottom up☆88Updated 3 years ago
- ☆12Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated this week
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆16Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆18Updated 3 years ago