Cited in
(20)- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
- Typed Relational Conversion
- Scheduling complexity of interleaving search
- Review of “The Little Prover” by Daniel P. Friedman and Carl Eastlund, MIT Press, 2015
- Executable relational specifications of polymorphic type systems using Prolog
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- lolliCoP
- HiLog
- Mercury
- aleanTAP
- OpenRuleBench
- FLORA
- Debugging hygienic macros
- Datafun
- KANREN
- PFLP
- PRIZ
- MzScheme
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- The first-order syntax of variadic functions
This page was built for software: miniKanren
