logic-tools / nadea
NaDeA (Natural Deduction Assistant) - With a Formalization in Isabelle
☆15Updated 2 years ago
Alternatives and similar repositories for nadea:
Users that are interested in nadea are comparing it to the libraries listed below
- A termination checker for higher-order rewriting with dependent types☆10Updated 4 years ago
- A formalization of synthetic algebraic geometry in Agda☆14Updated 6 years ago
- ☆19Updated 8 years ago
- Automatically exported from code.google.com/p/full-maude☆15Updated last year
- The Aldor Programming Language☆34Updated last month
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- Multinomials for the Mathematical Components library.☆14Updated 3 weeks ago
- Matita (proof assistant) with embedded elpi☆12Updated 7 years ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 6 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Paradox model finder and equinox theorem prover for first-order logic.☆20Updated last year
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆35Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- My old Agda code for Homotopy Type Theory. (Halted. See HoTT/HoTT-Agda for the new one.)☆26Updated 10 years ago
- Formal semantics of LLVM IR in K☆44Updated 9 years ago
- ☆29Updated 9 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 3 months ago
- Library classes for the Twelf Proof System☆21Updated 4 years ago
- αProlog☆17Updated last year
- A Literate Programming Tool inspired by NoWeb, implemented in OCaml☆34Updated 6 years ago
- A type theory based theorem proving library☆25Updated 13 years ago
- OBSOLETE, ARCHIVED mirror of the OCaml manual☆15Updated last year
- Coq plugin for monomorphization and C code generation☆34Updated last week
- An OCaml javascript kernel for the IPython notebook☆58Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated 3 weeks ago
- Simple implementation of a parsing algorithm inspired by Earley☆14Updated 2 years ago
- SML The Living Language☆11Updated 11 years ago
- formalization of theorems of higher algebraic K-theory☆8Updated 10 years ago
- An algebra for Matrix Expressions written in Maude☆24Updated 12 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago