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
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- An equational theorem prover based on Knuth-Bendix completion☆56Updated this week
- Gallina to Bedrock2 compilation toolkit☆61Updated last week
- PL syntax macros.☆19Updated last week
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- ☆55Updated 2 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- Luck -- A Language for Property-Based Generators☆35Updated 7 months ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated this week
- Logical Relation for MLTT in Coq☆27Updated last month
- A monadic library for symbolic evaluation☆69Updated 2 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- ☆16Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆76Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆55Updated 3 months ago