DavePearce / FeatherweightRustLinks
Provides a reference implementation of FeatherweightRust in Java.
☆15Updated 4 years ago
Alternatives and similar repositories for FeatherweightRust
Users that are interested in FeatherweightRust are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Updated last year
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 10 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Library for Classical Coq☆40Updated 2 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- proof script associated to tutorial material☆17Updated 2 years ago
- Luck -- A Language for Property-Based Generators☆36Updated 11 months ago
- Logical Relation for MLTT in Coq☆29Updated 3 weeks ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- a version of the 2048 game for Coq☆22Updated last week
- An enhanced unification algorithm for Coq☆58Updated last week
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Quasi-quoting library for agda☆18Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- ☆14Updated 9 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Relation algebra library for Coq☆50Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A formalisation of the Calculus of Constructions☆70Updated last year