webyrd / linear-logic-multiset-rewritingLinks
Logic for story telling!
☆36Updated 7 years ago
Alternatives and similar repositories for linear-logic-multiset-rewriting
Users that are interested in linear-logic-multiset-rewriting are comparing it to the libraries listed below
Sorting:
- ☆62Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- miniKanren with a first-order representation of the search space☆17Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- Miller/pattern unification in Agda☆67Updated last month
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- The Mechanization of Standard ML☆74Updated 3 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- Prolog implementation of microKanren☆44Updated 10 years ago
- Abstracting Definitional Interpreters☆74Updated 8 years ago
- microkanren in sml☆27Updated 10 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Standard ML compiler based on typed intermediate languages.☆50Updated 11 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- software archaeology of reflective towers of interpreters☆16Updated 6 months ago
- Examples from the class CMSC 330 during Summer 2015☆49Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago