jfeser / L2
λ² is a tool for synthesizing functional programs from input-output examples.
☆67Updated last year
Alternatives and similar repositories for L2:
Users that are interested in L2 are comparing it to the libraries listed below
- EGraphs in OCaml☆61Updated 11 months ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆128Updated 2 months ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2021☆18Updated 3 years ago
- Reference type checker for the Lean theorem prover☆61Updated 7 years ago
- ☆40Updated 5 years ago
- Synthesis of Heap-Manipulating Programs from Separation Logic☆126Updated last year
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 6 years ago
- ☆10Updated 6 years ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆67Updated last month
- A formalisation of the Calculus of Constructions☆66Updated 5 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Model finder for higher-order logic☆41Updated last year
- Educational Proof Assistant for Type Theory☆73Updated 5 months ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆139Updated 3 months ago
- Gallina to Bedrock2 compilation toolkit☆51Updated last week
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆34Updated 8 years ago
- Certified Machine Learning☆41Updated 3 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆34Updated last month
- Interpreter for the reversible functional language rFun☆36Updated 6 years ago
- A best-first-search theorem prover implemented in Isabelle☆34Updated 2 years ago
- An automated theorem prover that uses Büchi automata.☆40Updated 3 years ago
- A heuristic procedure for proving inequalities☆32Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆49Updated 7 months ago
- An automated deductive program verifier.☆41Updated last year
- The opentheory tool processes higher order logic theory packages☆15Updated last year
- An encyclopedia of proofs☆57Updated 2 months ago
- Distributed Separation Logic: a framework for compositional verification of distributed protocols and their implementations in Coq☆96Updated 5 months ago