.. microkanrenpy documentation master file, created by
   sphinx-quickstart on Wed Apr 19 15:20:56 2017.
   You can adapt this file completely to your liking, but it should at least
   contain the root `toctree` directive.

=========
μkanrenpy
=========

Introduction
------------

Welcome to documentation of *μkanrenpy*, a *pythonic* implementation of a
*relational interpreter* and an effort to port the `original code written in
Scheme <microkanren_scheme_>`_ by Jason Hemann and Daniel P. Friedman. We report
their words to describe what this work is about:

    This paper presents μKanren, a minimalist language in the miniKanren family of
    relational (logic) programming languages. Its implementation comprises fewer
    than 40 lines of Scheme. We motivate the need for a minimalist miniKanren
    language, and iteratively develop a complete search strategy. Finally, we
    demonstrate that through sufficient user-level features one regains much of the
    expressiveness of other miniKanren languages. In our opinion its brevity and
    simple semantics make μKanren uniquely elegant.

Contents
--------
We organize our thoughts according to the following outline:


.. toctree::
   :maxdepth: 3

   write_the_doc
   primer
   reasoned_schemer
   mclock
   under_the_hood

This documentation is automatically generated using `Sphinx <sphinx_>`_, which
provides content search facilities, so a `dedicated page <search.html>`_ is provided
for free for open searches.

About
-----
My name is Massimo Nocentini, I'm: 
    * a PhD student @ `University of Florence <unifi_>`_
    * coding @ `GitHub <https://github.com/massimo-nocentini/>`_

..  * :ref:`modindex`
    * :ref:`genindex`
    * :ref:`search`

.. REFERENCES {{{


.. _microkanren_scheme: https://github.com/jasonhemann/microKanren
.. _sphinx: http://www.sphinx-doc.org/en/stable/
.. _unifi: http://www.unifi.it/

.. }}}