The following pages link to miniKanren (Q31904):
Displaying 9 items.
- Debugging hygienic macros (Q608231) (← links)
- The first-order syntax of variadic functions (Q1934953) (← links)
- Scheduling complexity of interleaving search (Q2163166) (← links)
- A functional account of probabilistic programming with possible worlds. Declarative pearl (Q2163171) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- Typed Relational Conversion (Q5056070) (← links)
- Review of “The Little Prover” by Daniel P. Friedman and Carl Eastlund, MIT Press, 2015 (Q5110929) (← links)
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl) (Q5458428) (← links)
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic (Q5504659) (← links)
