leuschel / logenLinks
Offline partial evaluation system for Prolog written using the cogen approach
☆20Updated 9 years ago
Alternatives and similar repositories for logen
Users that are interested in logen are comparing it to the libraries listed below
Sorting:
- miniKanren with a first-order representation of the search space☆17Updated last year
- αProlog☆18Updated 2 years ago
- The Ciao Preprocessor☆11Updated 4 months ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 2 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Logic for story telling!☆34Updated 7 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆61Updated 2 weeks ago
- Racket bindings for Z3☆24Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Course on Metaprogramming☆72Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆12Updated 2 years ago
- A model of the WebAssembly language in Redex☆21Updated 4 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 6 months ago
- ☆14Updated 6 years ago
- A Redex tutorial with a focus on how to do work in Redex☆11Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Library for Classical Coq☆39Updated 5 months ago
- Racket bindings for Z3☆20Updated 13 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- Faceted execution in Racket☆12Updated 7 years ago
- TPTP linear logic version☆15Updated 8 months ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 3 weeks ago
- EGraphs in OCaml☆75Updated last year
- A Lustre compiler in Coq☆71Updated 4 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago