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 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- ☆55Updated 5 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated 11 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Gallina to Bedrock2 compilation toolkit☆59Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- PL syntax macros.☆19Updated last week
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆55Updated 2 months ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated this week