1cbeb5d866
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. |
||
|---|---|---|
| .. | ||
| Advent_of_Code_2017_December_3rd_files | ||
| dep-graphs | ||
| jupyter_kernel | ||
| sphinx_docs | ||
| with_sympy_files | ||
| 0._This_Implementation_of_Joy_in_Python.html | ||
| 0._This_Implementation_of_Joy_in_Python.ipynb | ||
| 0._This_Implementation_of_Joy_in_Python.md | ||
| 0._This_Implementation_of_Joy_in_Python.rst | ||
| 1._Basic_Use_of_Joy_in_a_Notebook.html | ||
| 1._Basic_Use_of_Joy_in_a_Notebook.ipynb | ||
| 1._Basic_Use_of_Joy_in_a_Notebook.md | ||
| 1._Basic_Use_of_Joy_in_a_Notebook.rst | ||
| 2._Library_Examples.html | ||
| 2._Library_Examples.ipynb | ||
| 2._Library_Examples.md | ||
| 2._Library_Examples.rst | ||
| 3._Developing_a_Program.html | ||
| 3._Developing_a_Program.ipynb | ||
| 3._Developing_a_Program.md | ||
| 3._Developing_a_Program.rst | ||
| Advent_of_Code_2017_December_1st.html | ||
| Advent_of_Code_2017_December_1st.ipynb | ||
| Advent_of_Code_2017_December_1st.md | ||
| Advent_of_Code_2017_December_1st.rst | ||
| Advent_of_Code_2017_December_2nd.html | ||
| Advent_of_Code_2017_December_2nd.ipynb | ||
| Advent_of_Code_2017_December_2nd.md | ||
| Advent_of_Code_2017_December_2nd.rst | ||
| Advent_of_Code_2017_December_3rd.html | ||
| Advent_of_Code_2017_December_3rd.ipynb | ||
| Advent_of_Code_2017_December_3rd.md | ||
| Advent_of_Code_2017_December_3rd.rst | ||
| Advent_of_Code_2017_December_4th.html | ||
| Advent_of_Code_2017_December_4th.ipynb | ||
| Advent_of_Code_2017_December_4th.md | ||
| Advent_of_Code_2017_December_4th.rst | ||
| Advent_of_Code_2017_December_5th.html | ||
| Advent_of_Code_2017_December_5th.ipynb | ||
| Advent_of_Code_2017_December_5th.md | ||
| Advent_of_Code_2017_December_5th.rst | ||
| Advent_of_Code_2017_December_6th.html | ||
| Advent_of_Code_2017_December_6th.ipynb | ||
| Advent_of_Code_2017_December_6th.md | ||
| Advent_of_Code_2017_December_6th.rst | ||
| Compiling_Joy.html | ||
| Compiling_Joy.ipynb | ||
| Compiling_Joy.md | ||
| Compiling_Joy.rst | ||
| Correcet_Programming.html | ||
| Correcet_Programming.ipynb | ||
| Correcet_Programming.md | ||
| Correcet_Programming.rst | ||
| Derivatives_of_Regular_Expressions.html | ||
| Derivatives_of_Regular_Expressions.ipynb | ||
| Derivatives_of_Regular_Expressions.md | ||
| Derivatives_of_Regular_Expressions.rst | ||
| Document.md | ||
| Generator_Programs.html | ||
| Generator_Programs.ipynb | ||
| Generator_Programs.md | ||
| Generator_Programs.rst | ||
| Hylo-,_Ana-,_Cata-,_and_Para-morphisms_-_Recursion_Combinators.html | ||
| Hylo-,_Ana-,_Cata-,_and_Para-morphisms_-_Recursion_Combinators.ipynb | ||
| Hylo-,_Ana-,_Cata-,_and_Para-morphisms_-_Recursion_Combinators.md | ||
| Hylo-,_Ana-,_Cata-,_and_Para-morphisms_-_Recursion_Combinators.rst | ||
| Library_Examples.pdf | ||
| Makefile | ||
| Newton-Raphson.html | ||
| Newton-Raphson.ipynb | ||
| Newton-Raphson.md | ||
| Newton-Raphson.rst | ||
| Ordered_Binary_Trees.html | ||
| Ordered_Binary_Trees.ipynb | ||
| Ordered_Binary_Trees.md | ||
| Ordered_Binary_Trees.rst | ||
| Quadratic.html | ||
| Quadratic.ipynb | ||
| Quadratic.md | ||
| Quadratic.rst | ||
| README.md | ||
| Recursion_Combinators.html | ||
| Recursion_Combinators.ipynb | ||
| Recursion_Combinators.md | ||
| Recursion_Combinators.rst | ||
| Replacing.html | ||
| Replacing.ipynb | ||
| Replacing.md | ||
| Replacing.rst | ||
| The_Four_Operations.html | ||
| The_Four_Operations.ipynb | ||
| The_Four_Operations.md | ||
| The_Four_Operations.rst | ||
| Trees.html | ||
| Trees.ipynb | ||
| Trees.md | ||
| Trees.rst | ||
| Treestep.html | ||
| Treestep.ipynb | ||
| Treestep.md | ||
| Treestep.rst | ||
| TypeChecking.html | ||
| TypeChecking.ipynb | ||
| TypeChecking.md | ||
| TypeChecking.rst | ||
| Types.html | ||
| Types.ipynb | ||
| Types.md | ||
| Types.rst | ||
| Zipper.html | ||
| Zipper.ipynb | ||
| Zipper.md | ||
| Zipper.rst | ||
| fun_with_scan.html | ||
| fun_with_scan.ipynb | ||
| fun_with_scan.md | ||
| fun_with_scan.rst | ||
| notebook_preamble.py | ||
| pe1.py | ||
| pe1.txt | ||
| repl.py | ||
| with_sympy.html | ||
| with_sympy.ipynb | ||
| with_sympy.md | ||
| with_sympy.rst | ||
README.md
Some Jupyter Notebooks and other material.
All of the notebooks are also available as HTML and Markdown files (generated using nbconvert) so you can view them without running Jupyter.
In order to run the Jupyter Notebooks you need Jupyter (obviously) and you should install Joypy. Here's an example using virtualenv from the project directory:
virtualenv --system-site-packages venv
source ./venv/bin/activate
pip install notebook
python ./setup.py install
Once that's done you should be able to start Jupyter Notebook server with, e.g.:
python -m notebook --ip=0.0.0.0
This starts it using the virtualenv version of Python so joy will be available. Navigate to the joypy/docs directory and the notebooks should be able to import the notebook_preamble.py file.
I find I have to include --ip=0.0.0.0 to workaround a bug where it tries to bind to an IPv6 address, YMMV.
Clean up when you're done:
deactivate
rm -rf venv
Table of Contents
-
- Basic Use of Joy in a Notebook
-
- Library Examples - Short examples of each word in the dictionary. Various formats.
-
- Developing a Program - Working with the first problem from Project Euler, "Find the sum of all the multiples of 3 or 5 below 1000", several forms of the program are derived.
-
- Replacing Functions in the Dictionary - Shows the basics of defining new "primitive" functions in Python or as definitions and adding them to the dictionary.
- Factorial Function and Paramorphisms - A basic pattern of recursive control-flow.
- Generator Programs - Using the x combinator to make generator programs which can be used to create unbounded streams of values.
- Hylo-, Ana-, Cata-morphisms - Some basic patterns of recursive control-flow structures.
- Quadratic - Not-so-annoying Quadratic Formula.
- Trees - Ordered Binary Trees in Joy and more recursion.
- Zipper - A preliminary examination of the idea of data-structure "zippers" for traversing datastructures.
- notebook_preamble.py - Imported into notebooks to simplify the preamble code.
- pe1.py pe1.txt - Set up and execute a Joy program for the first problem from Project Euler. The pe1.txt file is the trace. It's 2.8M uncompressed. Compressed with gzip it becomes just 0.12M.
- repl.py - Run this script to start a REPL. Useful for e.g. running Joy code in a debugger.
Notes
One of the things that interests me about Joy is how programming becomes less about writing code and more about sound reasoning about simple (almost geometric) programs. Many of the notebooks in this collection consist of several pages of discussion to arrive at a few lines of Joy definitions. I think this is a good thing. This is "literate programming". The "programs" resemble mathematical proofs. You aren't implementing so much as deriving. The structure of Joy seems to force you to think clearly about the task in a way that is reliable but extremely flexible. It feels like a puzzle game, and the puzzles are often simple, and the solutions build on each other.