leuschel / logenLinks
Offline partial evaluation system for Prolog written using the cogen approach
☆21Updated 9 years ago
Alternatives and similar repositories for logen
Users that are interested in logen are comparing it to the libraries listed below
Sorting:
- αProlog☆18Updated 2 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- Racket bindings for Z3☆24Updated 6 years ago
- The Ciao Preprocessor☆13Updated 7 months ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated 3 weeks ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Updated 9 months ago
- A Redex tutorial with a focus on how to do work in Redex☆11Updated last year
- A model of the WebAssembly language in Redex☆21Updated 4 years ago
- Partial Commutative Monoids☆32Updated 7 months ago
- EGraphs in OCaml☆80Updated 2 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated 2 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 3 weeks ago
- The Mechanization of Standard ML☆75Updated 3 years ago
- ☆15Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- ☆12Updated 2 years ago
- TPTP linear logic version☆15Updated last year
- Logic for story telling!☆36Updated 7 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 6 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- software archaeology of reflective towers of interpreters☆16Updated 7 months ago
- Course on Metaprogramming☆75Updated 7 months ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆39Updated 3 months ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆19Updated 11 months ago