miniKanren

swMATH20082MaRDI QIDQ31904FDOQ31904

Author name not available (Why is that?)

Official website: http://minikanren.org/

Cited In (19)

• α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
• A functional account of probabilistic programming with possible worlds. Declarative pearl
• 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
• Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
• Typed Relational Conversion
• HiLog
• Scheduling complexity of interleaving search
• Mercury
• aleanTAP
• OpenRuleBench
• FLORA
• Datafun
• KANREN
• PFLP
• PRIZ
• The first-order syntax of variadic functions
• MzScheme

This page was built for software: miniKanren