touist / touist
TouIST, the IDE & Language for Logic (backed by SAT, SMT and QBF solvers)
☆64Updated 3 months ago
Related projects ⓘ
Alternatives and complementary repositories for touist
- An encyclopedia of proofs☆57Updated this week
- LVC verified compiler☆57Updated 6 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Monadic effects and equational reasonig in Coq☆68Updated 2 weeks ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A modular sat/smt solver with proof output.☆97Updated 10 months ago
- A formally verified compiler for a simple language with numbers and sums☆26Updated 3 years ago
- Implementation of the λΠ-calculus modulo rewriting☆199Updated this week
- A formalisation of the Calculus of Constructions☆66Updated 3 months ago
- An automatic theorem prover for first order logic with equality☆30Updated 4 years ago
- ☆50Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆49Updated 5 months ago
- Hoare Type Theory☆69Updated last month
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 3 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆97Updated last year
- Beginning of formal language theory☆23Updated 4 years ago
- A simple parser combinator library for Ocaml☆29Updated 3 years ago
- Binary logical relations library for the Coq proof assistant☆20Updated 2 weeks ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 3 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆34Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆28Updated last year
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆45Updated 2 years ago
- A simple BDD library for OCaml☆13Updated 2 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated 9 months ago
- Efficient binder representation in OCaml☆39Updated 4 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Dolmen provides a library and a binary to parse, typecheck, and evaluate languages used in automated deduction☆80Updated last month
- Coq Enhancement Proposals☆45Updated this week