DavePearce / FeatherweightRust
Provides a reference implementation of FeatherweightRust in Java.
☆14Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for FeatherweightRust
- a version of the 2048 game for Coq☆22Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated 3 months ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 5 years ago
- Coq Enhancement Proposals☆49Updated 2 weeks ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- Logical Relation for MLTT in Coq☆19Updated this week
- A cost-aware logical framework, embedded in Agda.☆56Updated 3 months ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆21Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 9 months ago
- An enhanced unification algorithm for Coq☆49Updated 5 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 2 months ago
- ModTT in Agda☆11Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- Tiny verified SAT-solver☆28Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated 2 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated last year
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Experiments in formalizing refinement type systems in Coq☆17Updated 8 years ago
- ☆51Updated last month
- being an implementation of the calculus of constructions☆15Updated last year
- Deadlock freedom by type checking☆19Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago