Beautiful, interactive visualizations of logical inference
☆152Mar 10, 2021Updated 5 years ago
Alternatives and similar repositories for logitext
Users that are interested in logitext are comparing it to the libraries listed below
Sorting:
- Regular expression matching in Idris☆11Apr 27, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆46May 14, 2016Updated 9 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- PeaCoq is a pretty Coq, isn't it?☆105Jul 26, 2021Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- A nano "theorem prover".☆63Feb 15, 2019Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆27Nov 27, 2023Updated 2 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- TODO☆23Oct 10, 2015Updated 10 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Alternative Core language for GHC plugins☆39Feb 15, 2016Updated 10 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Generates natural language versions of Coq proofs☆51Feb 11, 2018Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Feb 5, 2020Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 9 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- FFI-based byte buffers for Idris☆10Jun 21, 2019Updated 6 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- Calculus of Constructions☆18Jul 17, 2019Updated 6 years ago
- Example Coq plugin☆18Mar 23, 2018Updated 7 years ago