boyland / sasylf
Educational Proof Assistant for Type Theory
☆74Updated 8 months ago
Alternatives and similar repositories for sasylf:
Users that are interested in sasylf are comparing it to the libraries listed below
- A monadic library for symbolic evaluation☆60Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆57Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆65Updated last year
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆50Updated last month
- A verified compiler for a lazy functional language☆35Updated 2 weeks ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- A mechanisation of Wasm in Isabelle.☆26Updated this week
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆48Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- The Penn Locally Nameless Metatheory Library☆74Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A bottom-up approach to a verified implementation of MLTT☆17Updated last month
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- PL conference deadline countdowns☆60Updated 3 weeks ago
- ☆55Updated 2 weeks ago
- A deterministic parser with fused lexing☆72Updated last year
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- ☆36Updated 3 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 6 months ago
- Verified C programming in Agda☆16Updated 4 years ago
- EGraphs in OCaml☆64Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- A formalisation of the Calculus of Constructions☆68Updated 8 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- An enhanced unification algorithm for Coq☆55Updated last week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 9 months ago