boyland / sasylfLinks
Educational Proof Assistant for Type Theory
☆74Updated 10 months ago
Alternatives and similar repositories for sasylf
Users that are interested in sasylf are comparing it to the libraries listed below
Sorting:
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- A monadic library for symbolic evaluation☆66Updated 2 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
- Unification and type inference algorithms☆125Updated 10 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 2 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- Gallina to Bedrock2 compilation toolkit☆54Updated this week
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆51Updated 2 weeks ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- HoTT in Lean 3☆80Updated 4 years ago
- Programming Language Foundations in Lean☆37Updated last month
- ☆49Updated 3 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆70Updated last month
- A mechanisation of Wasm in Isabelle.☆27Updated last week
- ☆33Updated 7 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- A formalisation of the Calculus of Constructions☆69Updated 10 months ago
- ☆36Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Convert Haskell source code to Coq source code.☆85Updated 9 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago