palmskog / fitchLinks
Certified proof checker for Fitch-style propositional logic proofs
☆7Updated last year
Alternatives and similar repositories for fitch
Users that are interested in fitch are comparing it to the libraries listed below
Sorting:
- A termination checker for higher-order rewriting with dependent types☆12Updated 5 years ago
- Your happy place for learning APL☆16Updated 2 years ago
- A Scheme to Unlambda compiler☆18Updated 8 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- a self-hosting lambda calculus compiler☆36Updated 3 months ago
- Malfunction backend for Idris 2☆12Updated 3 years ago
- translations of a lambda abstraction to combinations of operators☆18Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Coq plugin for monomorphization and C code generation☆34Updated last month
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Calculus of Constructions Implementation☆15Updated 5 years ago
- The Cubicle model checker☆14Updated last year
- The Alms Programming Language☆44Updated 6 years ago
- A Literate Programming Tool inspired by NoWeb, implemented in OCaml☆35Updated 6 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- Racket-based implementation of Adapton☆22Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A synthesis-enabled solver for relational logic☆27Updated 7 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- An extended typed Lambda Calculus☆21Updated 11 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- Haskell binding for PADS☆19Updated 6 years ago
- ☆19Updated 8 years ago
- Type Theory in Type Theory using Cubical Agda☆13Updated 6 years ago
- Experimental functional language☆17Updated 3 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago