From 1cbeb5d866fe30411c2ffc929bf2f1f7009b7417 Mon Sep 17 00:00:00 2001 From: Simon Forman Date: Tue, 19 May 2020 14:09:00 -0700 Subject: [PATCH] Mention the situation with the type code. I removed it but it's still there in tag v0.4.0 if you want to look at it. The Prolog code is just sooooooooo much more elegant. it's a rare case, and a hard decision, but the right thing to do is throw away working code. Wow. --- docs/sphinx_docs/types.rst | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/docs/sphinx_docs/types.rst b/docs/sphinx_docs/types.rst index 6b1e4d2..5491f3a 100644 --- a/docs/sphinx_docs/types.rst +++ b/docs/sphinx_docs/types.rst @@ -2,6 +2,11 @@ Type Inference of Joy Expressions ================================= +UPDATE: May 2020 - I removed the type inference code in `joy.utils.types` +but you can find it in the `v0.4.0` tag here: +https://osdn.net/projects/joypy/scm/hg/Joypy/tags + + Two kinds of type inference are provided, a simple inferencer that can handle functions that have a single stack effect (aka "type signature") and that can generate Python code for a limited subset of those @@ -80,11 +85,6 @@ auto-compiled to Python):: unswons = ([a1 ...1] -- [...1] a1) * -.. automodule:: joy.utils.types - :members: - - - Example output of the ``infer()`` function. The first number on each line is the depth of the Python stack. It goes down when the function backtracks. The next thing on each line is the currently-computed stack -- 2.11.0