An automated theorem prover that uses Büchi automata.
☆44Sep 22, 2021Updated 4 years ago
Alternatives and similar repositories for Pecan
Users that are interested in Pecan are comparing it to the libraries listed below
Sorting:
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- ☆16Feb 18, 2025Updated last year
- Benchmarking algebraic effect handler implementations☆27Jun 6, 2021Updated 4 years ago
- A controlled natural language for calculus of inductive constructions, based on Forthel.☆14Mar 2, 2021Updated 5 years ago
- The Slate Interactive Theorem Prover☆23Jan 9, 2023Updated 3 years ago
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- An experimental programming language.☆19May 16, 2019Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Sep 15, 2021Updated 4 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Sep 7, 2025Updated 5 months ago
- A web-based graphical proof assistant for LK and Hoare logic.☆41Jan 10, 2026Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆32Jan 11, 2022Updated 4 years ago
- An Agda library for programming with ternary relations☆18Apr 9, 2025Updated 10 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- ☆40Aug 5, 2024Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- An experimental language server for SomewhatML☆24Dec 30, 2022Updated 3 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- A formally verified compiler for a simple language with numbers and sums☆28Nov 29, 2020Updated 5 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A server for the forester tool☆17Dec 10, 2024Updated last year
- (CL)S - Combinatory Logic Synthesizer☆12Oct 1, 2021Updated 4 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- Isabelle LLVM Code Generator and Refinement☆29Nov 10, 2025Updated 3 months ago
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- Arete is an experimental programming language.☆12Oct 6, 2023Updated 2 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- Basic Unicode support for Lean 4☆15Updated this week
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago