leuschel / logen
Offline partial evaluation system for Prolog written using the cogen approach
☆19Updated 8 years ago
Alternatives and similar repositories for logen:
Users that are interested in logen are comparing it to the libraries listed below
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- miniKanren with a first-order representation of the search space☆16Updated 9 months ago
- ☆14Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- αProlog☆17Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 6 months ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated last month
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆42Updated last week
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- software archaeology of reflective towers of interpreters☆16Updated 6 months ago
- The Ciao Preprocessor☆11Updated 5 months ago
- Logic for story telling!☆34Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Racket bindings for Z3☆19Updated 12 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- ☆10Updated 6 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆48Updated 6 months ago
- SIGPLAN website☆11Updated this week
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Partial Commutative Monoids☆28Updated 3 weeks ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆18Updated 4 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- A termination checker for higher-order rewriting with dependent types☆10Updated 4 years ago
- Reason about Term Rewriting Systems☆16Updated 2 years ago