Cited in
(13)- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- Review of “The Little Prover” by Daniel P. Friedman and Carl Eastlund, MIT Press, 2015
- Executable relational specifications of polymorphic type systems using Prolog
- Debugging hygienic macros
- lolliCoP
- HiLog
- aleanTAP
- miniKanren
- PRIZ
- MzScheme
- Typed Relational Conversion
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
- Scheduling complexity of interleaving search
This page was built for software: KANREN
