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
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- The Penn Locally Nameless Metatheory Library☆75Updated 10 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- The Ynot Project source code.☆22Updated 11 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Library for Classical Coq☆40Updated 2 weeks ago
- a version of the 2048 game for Coq☆22Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Quasi-quoting library for agda☆18Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Updated last year
- ☆21Updated 4 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Logical relations proof in Agda☆27Updated 10 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A monadic library for symbolic evaluation☆73Updated 6 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 weeks ago