boyland / sasylfLinks
Educational Proof Assistant for Type Theory
☆74Updated last year
Alternatives and similar repositories for sasylf
Users that are interested in sasylf are comparing it to the libraries listed below
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆52Updated last month
- Gallina to Bedrock2 compilation toolkit☆58Updated 3 weeks ago
- A cost-aware logical framework, embedded in Agda.☆64Updated 2 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- ☆35Updated 10 months ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- HoTT in Lean 3☆80Updated 5 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆44Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A monadic library for symbolic evaluation☆68Updated 3 weeks ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Convert Haskell source code to Coq source code.☆86Updated last month
- Constructive Galois connections☆34Updated 7 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆75Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆71Updated last month
- A formalisation of the Calculus of Constructions☆71Updated last year
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Synthesis of Heap-Manipulating Programs from Separation Logic☆127Updated 2 years ago
- ☆36Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆55Updated 4 months ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- Coq plugin embedding elpi☆173Updated last week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago