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:
- A monadic library for symbolic evaluation☆69Updated 2 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 4 months ago
- Benchmark repository of polyglot effect handler examples☆29Updated last month
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆55Updated 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 3 years ago
- Gallina to Bedrock2 compilation toolkit☆61Updated this week
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- EGraphs in OCaml☆75Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- ☆38Updated last month
- ☆36Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- Lecture notes on realizability☆74Updated 7 months ago
- Convert Haskell source code to Coq source code.☆88Updated 3 months ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆39Updated last month
- Luck -- A Language for Property-Based Generators☆35Updated 7 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- Constructive Galois connections☆35Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- HoTT in Lean 3☆82Updated 5 years ago
- A formalisation of the Calculus of Constructions☆70Updated last year