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:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆53Updated last month
- HoTT in Lean 3☆80Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- ☆36Updated 3 years ago
- A monadic library for symbolic evaluation☆68Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated this week
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- ☆36Updated 2 weeks ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- A cost-aware logical framework, embedded in Agda.☆64Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- ☆55Updated 4 months ago
- EGraphs in OCaml☆66Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 weeks ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 4 months ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆38Updated 2 months ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- Convert Haskell source code to Coq source code.☆86Updated 2 months ago