SkiFire13 / typst-prooftreeLinks
Prooftrees for Typst - Inspired by Latex's bussproofs
☆19Updated last year
Alternatives and similar repositories for typst-prooftree
Users that are interested in typst-prooftree are comparing it to the libraries listed below
Sorting:
- Typst Package to typeset inference rule☆35Updated 2 months ago
- Tiny theorem prover with syntax like Lean 4 in <1K LOC☆29Updated 2 months ago
- ☆22Updated last year
- RUst way for Reuse Analysis☆11Updated last year
- A Collection of Papers & Notes in Programming Language & Formal Verification☆17Updated 3 years ago
- Type Checking in Lean 4☆28Updated 3 weeks ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Just for fun riscv64 emulator, which boots the Linux.☆41Updated 2 years ago
- A well-documented minimal dependently-typed language for my friend Lyzh☆27Updated 4 months ago
- VeriFFI: Verified Foreign Function Interface for connecting Coq programs to C programs at the operational and specification/verification …☆45Updated 5 months ago
- embedding MLIR in LEAN☆47Updated last year
- A memory allocator verified with Verus☆22Updated this week
- Programming Language Foundations in Lean☆39Updated 2 months ago
- Distributions of Agda executable compiled into WebAssembly.☆17Updated 3 months ago
- High level Lean 4 FFI for Rust☆13Updated last year
- 🧊 A Elbereth Gilthoniel / silivren penna míriel! 🌟☆19Updated 3 years ago
- 十分钟魔法练习 in OCaml☆33Updated 3 years ago
- Learn Lean 4 with PLFA proofs.☆79Updated 2 months ago
- Coq code formatter☆23Updated this week
- Elaboration with inductive types☆16Updated 2 years ago
- A MySQL API for Lean 4☆17Updated 3 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆36Updated 3 weeks ago
- Neovim client for coq-lsp☆27Updated 7 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- ☆17Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 3 months ago
- Formalising the WASM spec in Lean☆23Updated last year