OCamlPro / mikino_bin
A simple induction and BMC engine.
☆22Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for mikino_bin
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- An experimental language server for SomewhatML☆24Updated last year
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆49Updated 5 months ago
- A dependently typed programming language, and verification tool☆26Updated 8 years ago
- Experimental functional language☆18Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆59Updated last week
- Documented version of a simple type-theoretic language: Mini-TT☆18Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Coq Enhancement Proposals☆49Updated 2 weeks ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- An interpreter of F-ing modules☆18Updated 5 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆14Updated 6 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A parser for ANSI C, in Lean4.☆20Updated last year
- Deadlock freedom by type checking☆19Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A type checker for the Lean theorem prover☆39Updated 3 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated 3 months ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆13Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- A pretty-printing combinator library for OCaml☆47Updated 3 months ago
- ☆20Updated 6 years ago
- embedding MLIR in LEAN☆47Updated 5 months ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated last week
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Rust-based Scheme Compiler, written in the Nanopass style☆11Updated 6 years ago
- Type-Level Programming in Rust☆26Updated 2 years ago