brownplt / ResugarerLinks
Lifting Reduction Semantics through Syntactic Sugar
☆13Updated 7 years ago
Alternatives and similar repositories for Resugarer
Users that are interested in Resugarer are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆56Updated this week
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- Coq library on rewriting theory and termination☆37Updated last month
- A formalisation of the Calculus of Constructions☆70Updated last year
- A cost-aware logical framework, embedded in Agda.☆70Updated 2 months ago
- Coq library for tactics, basic definitions, sets, maps☆51Updated 3 weeks ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Denotational semantics based on graph and filter models☆23Updated last year
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- PL syntax macros.☆21Updated last month
- An automated theorem prover for intuitionistic propostional logic☆14Updated 5 years ago
- Racket Equivalence Graph Library☆19Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Library for Classical Coq☆40Updated 7 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆57Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Logical Relation for MLTT in Coq☆28Updated last month
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Updated 2 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated 2 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Educational Proof Assistant for Type Theory☆81Updated this week