boyland / sasylfLinks
Educational Proof Assistant for Type Theory
☆75Updated 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☆58Updated last week
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 3 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- A monadic library for symbolic evaluation☆71Updated 3 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Gallina to Bedrock2 compilation toolkit☆61Updated 3 weeks ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 3 weeks ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- Convert Haskell source code to Coq source code.☆88Updated 4 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆36Updated 4 years ago
- ☆39Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- # A simple variable binding library based on well-scoped indices and environments☆25Updated 2 weeks ago
- Hoare Type Theory☆81Updated 4 months ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 6 months ago