prefscript 1.1__tar.gz

prefscript-1.1/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 Balqui
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

prefscript-1.1/PKG-INFO

@@ -0,0 +1,60 @@
+Metadata-Version: 2.1
+Name: prefscript
+Version: 1.1
+Summary: Partial Recursive Functions for Scripting
+Author-email: José Luis Balcázar <jose.luis.balcazar@upc.edu>
+Project-URL: Homepage, https://github.com/balqui/prefscript
+Project-URL: Bug Tracker, https://github.com/balqui/prefscript/issues
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: pytokr>=1.0
+
+# PReFScript: 
+## Partial Recursive Functions for Scripting
+
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528
+
+Project started: mid Germinal 2003.
+
+Current version: 1.1, late Thermidor 2024.
+
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+A Python-based environment to explore and experiment with partial 
+recursive functions; naturally doubles as a (purely functional) 
+programming language, but it is not intended to be used much as such.
+
+### Scripts
+
+In PReFScript, a script is a sequence of functions defined in terms of each
+other and of a few basic functions via the partial recursion rules 
+of composition and minimization. All functions are from the
+natural numbers into the natural numbers and may be undefined
+for some inputs. In order to handle tuples or sequences of natural
+numbers, a Cantor-like encoding is used.
+The always available basic functions include: 
+`k_1`, the constant 1 function;
+`id`, the identity function;
+addition and multiplication, `add` and `mul` respectively,
+that interpret the single number received as the Cantor encoding
+of a pair `<x.y>` and compute the corresponding operation on `x` and 
+`y`; modified difference `diff` that receives likewise a Cantor-encoded
+pair  `<x.y>` and computes `max(0, x - y)` so that we always stay
+within the natural numbers; and two functions related to projections
+of Cantor-encoded sequences.
+
+Scripts are maintained in objects of the class PReFScript,
+that can be imported into your own Python program. 
+Alternatively, a stand-alone interpreter is also provided. 
+Thus, you have available two main ways of programming in PReFScript.
+
+### Installation and ways to use PReFScript functions
+
+See [doc.md](https://github.com/balqui/prefscript/blob/main/docs/doc.md) 
+for all the details (somewhat incomplete as of today).
+
+

prefscript-1.1/README.md

@@ -0,0 +1,45 @@
+# PReFScript: 
+## Partial Recursive Functions for Scripting
+
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528
+
+Project started: mid Germinal 2003.
+
+Current version: 1.1, late Thermidor 2024.
+
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+A Python-based environment to explore and experiment with partial 
+recursive functions; naturally doubles as a (purely functional) 
+programming language, but it is not intended to be used much as such.
+
+### Scripts
+
+In PReFScript, a script is a sequence of functions defined in terms of each
+other and of a few basic functions via the partial recursion rules 
+of composition and minimization. All functions are from the
+natural numbers into the natural numbers and may be undefined
+for some inputs. In order to handle tuples or sequences of natural
+numbers, a Cantor-like encoding is used.
+The always available basic functions include: 
+`k_1`, the constant 1 function;
+`id`, the identity function;
+addition and multiplication, `add` and `mul` respectively,
+that interpret the single number received as the Cantor encoding
+of a pair `<x.y>` and compute the corresponding operation on `x` and 
+`y`; modified difference `diff` that receives likewise a Cantor-encoded
+pair  `<x.y>` and computes `max(0, x - y)` so that we always stay
+within the natural numbers; and two functions related to projections
+of Cantor-encoded sequences.
+
+Scripts are maintained in objects of the class PReFScript,
+that can be imported into your own Python program. 
+Alternatively, a stand-alone interpreter is also provided. 
+Thus, you have available two main ways of programming in PReFScript.
+
+### Installation and ways to use PReFScript functions
+
+See [doc.md](https://github.com/balqui/prefscript/blob/main/docs/doc.md) 
+for all the details (somewhat incomplete as of today).
+
+

prefscript-1.1/pyproject.toml

@@ -0,0 +1,24 @@
+[build-system]
+requires = ["setuptools >= 61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "prefscript"
+version = "1.1"
+authors = [ { name = "José Luis Balcázar", email = "jose.luis.balcazar@upc.edu" }, ]
+description = "Partial Recursive Functions for Scripting"
+readme = "README.md"
+requires-python = ">=3.10"
+classifiers = [
+    "Programming Language :: Python :: 3",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+    ]
+dependencies = [ "pytokr>=1.0" ]
+
+[project.urls]
+"Homepage" = "https://github.com/balqui/prefscript"
+"Bug Tracker" = "https://github.com/balqui/prefscript/issues"
+
+[project.scripts]
+prefscript = "prefscript:run"

prefscript-1.1/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

prefscript-1.1/src/ascii7io.py

@@ -0,0 +1,43 @@
+'''
+Single-integer encoding and decoding of (printable) 7-bit ASCII strings
+'''
+
+TWO_pow_7 = 1 << 7
+
+def str2int(s):
+	'integer from any string, even with nonprintable chars'
+	r = 0
+	for c in s:
+		r = r * TWO_pow_7 + ord(c)
+	return r
+
+def int2raw_str(n):
+	'string from any integer, even with nonprintable chars'
+	r = list()
+	while n > 0:
+		r.append(chr(n % TWO_pow_7))
+		n //= TWO_pow_7
+	return ''.join(reversed(r))
+
+def int2str(n):
+	'string from any integer, nonprintable chars replaced by underscores'
+	r = list()
+	while n > 0:
+		c = n % TWO_pow_7
+		if 31 < c:
+			r.append(chr(c))
+		else:
+			r.append('_')
+		n //= TWO_pow_7
+	return ''.join(reversed(r))
+
+if __name__ == "__main__":
+	print(TWO_pow_7)
+	for s in ['', 'a', 'aa', 'abcde']:
+		n =  str2int(s)
+		print(s, n, int2str(n))
+	print(hw := str2int("Hello, World!"))
+	print(int2raw_str(hw))
+	print(int2str(hw))
+	for i in range(10000, 100000): print(int2str(i*103), end = ' ')
+	

prefscript-1.1/src/cantorpairs/__init__.py

@@ -0,0 +1 @@
+from .src.cantorpairs import __version__, dp, pr_L, pr_R, tup_e, tup_i, s_tup, pr

prefscript-1.1/src/cantorpairs/src/cantorpairs.py

@@ -0,0 +1,117 @@
+'''
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528, april 2023 onwards 
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+Ancillary functions for PReFScript, the Partial Recursive Functions lab.
+
+Implements a slight variant of Cantor's pair / unpair functions;
+adapted from `https://en.wikipedia.org/wiki/Pairing_function`
+The dotted pair is a bijection between `NxN` and `N-{0}`:
+the natural number zero is used as "nil".
+
+Project started: mid Germinal 2003.
+Current version: 0.2, early Thermidor 2024.
+Not pip-installable as of today. See README at `https://github.com/balqui/cantorpairs`
+
+After each push, the following extra incantation is most likely 
+necessary in the local copy of the git repo for `prefscript`:
+`git submodule update --remote`
+'''
+
+from functools import cache
+from math import isqrt
+
+__version__ = "0.3"
+
+@cache
+def _isqrt(n):
+	return isqrt(n)
+
+# ~ def _isqrt(n):
+    # ~ '''
+    # ~ int square root via binary search, own program
+    # ~ because math.sqrt fails with big numbers, e.g. the
+    # ~ decoding of dp(10, 10^17) comes out wrong.
+    # ~ '''
+    # ~ def rr(n, k):
+        # ~ """
+        # ~ Pre: k <= sqrt(n)
+        # ~ Post: a <= sqrt(n) < b and b - a = k
+        # ~ """
+        # ~ if 4*k*k > n:
+            # ~ return k, 2*k
+        # ~ a, b = rr(n, 2*k)
+        # ~ m = (a + b)//2 # m = a + k
+        # ~ if m*m <= n:
+            # ~ return m, b
+        # ~ else:
+            # ~ return a, m
+    # ~ assert n >= 0
+    # ~ if n == 0:
+        # ~ return 0
+    # ~ return rr(n, 1)[0]
+
+@cache
+def _unpair(z):
+    "local sq root instead of math.sqrt"
+    assert z > 0
+    w = (_isqrt(8*(z - 1) + 1) - 1)//2
+    t = (w*w + w)//2
+    x = z - 1 - t
+    return x, w - x
+
+@cache
+def dp(x, y):
+    return ((x + y)*(x + y + 1))//2 + x + 1
+
+def pr_L(z):
+    if z == 0:
+        return 0
+    return _unpair(z)[0]
+
+def pr_R(z):
+    if z == 0:
+        return 0
+    return _unpair(z)[1]
+
+def tup_e(*nums):
+    '''
+    nums: arbitrary quantity of numbers to encode the sequence;
+    fall back into the iterable version, the tuple cast will do nothing
+    '''
+    return tup_i(nums)
+
+def tup_i(nums):
+    '''
+    nums expected to be an iterable here;
+    the reversed nature of the encoding needs to 
+    expand it into a sequence;
+    end of sequence (= empty sequence) encoded 
+    by 0 in its role of # nil, out of dotted pair range
+    '''
+    t = 0 
+    for i in reversed(tuple(nums)):
+        t = dp(i, t)
+    return t
+
+@cache
+def s_tup(t, k):
+    '''
+    suffix tuple: t assumed a tuple of at least k components,
+    return the suffix tuple from k-th on;
+    t itself for k == 0, empty tuple 0 if k larger than len of t
+    '''
+    if t == 0:
+        "empty tuple or original k too large"
+        return 0
+    if k == 0:
+        "full suffix"
+        return t
+    return s_tup(pr_R(t), k-1)
+
+def pr(t, k):
+    '''
+    projection function: get the k-th component;
+    returns zero (meaning end of tuple) if k is too large
+    '''
+    return pr_L(s_tup(t, k))

prefscript-1.1/src/cantorpairs/src/cp_ex.py

@@ -0,0 +1,38 @@
+'''
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528, april 2023 onwards 
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+Ancillary functions for the Partial Recursive Functions lab.
+
+Examples of usage of pairing and tupling.
+'''
+
+import cantorpairs as cp
+
+for i in range(4):
+  for j in range(4):
+    print(i, j, cp.dp(i, j))
+
+for i in range(90, 100):
+  print(cp.pr_L(i), cp.pr_R(i), cp.dp(cp.pr_L(i), cp.pr_R(i)), i) 
+
+t = cp.tup_e(4, 7, 56, 101)
+for i in range(5):
+    'last call is actually out of range'
+    print(cp.pr(t, i))
+
+st = cp.s_tup(t, 2)
+print(st)
+for i in range(3):
+    print(cp.pr(st, i))
+
+while t:
+    print(t, cp.pr_L(t))
+    t = cp.pr_R(t)
+
+t = cp.tup_i(range(8, 16))
+while t:
+    print(t, cp.pr_L(t))
+    t = cp.pr_R(t)
+
+

prefscript-1.1/src/prefscript.egg-info/PKG-INFO

@@ -0,0 +1,60 @@
+Metadata-Version: 2.1
+Name: prefscript
+Version: 1.1
+Summary: Partial Recursive Functions for Scripting
+Author-email: José Luis Balcázar <jose.luis.balcazar@upc.edu>
+Project-URL: Homepage, https://github.com/balqui/prefscript
+Project-URL: Bug Tracker, https://github.com/balqui/prefscript/issues
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: pytokr>=1.0
+
+# PReFScript: 
+## Partial Recursive Functions for Scripting
+
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528
+
+Project started: mid Germinal 2003.
+
+Current version: 1.1, late Thermidor 2024.
+
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+A Python-based environment to explore and experiment with partial 
+recursive functions; naturally doubles as a (purely functional) 
+programming language, but it is not intended to be used much as such.
+
+### Scripts
+
+In PReFScript, a script is a sequence of functions defined in terms of each
+other and of a few basic functions via the partial recursion rules 
+of composition and minimization. All functions are from the
+natural numbers into the natural numbers and may be undefined
+for some inputs. In order to handle tuples or sequences of natural
+numbers, a Cantor-like encoding is used.
+The always available basic functions include: 
+`k_1`, the constant 1 function;
+`id`, the identity function;
+addition and multiplication, `add` and `mul` respectively,
+that interpret the single number received as the Cantor encoding
+of a pair `<x.y>` and compute the corresponding operation on `x` and 
+`y`; modified difference `diff` that receives likewise a Cantor-encoded
+pair  `<x.y>` and computes `max(0, x - y)` so that we always stay
+within the natural numbers; and two functions related to projections
+of Cantor-encoded sequences.
+
+Scripts are maintained in objects of the class PReFScript,
+that can be imported into your own Python program. 
+Alternatively, a stand-alone interpreter is also provided. 
+Thus, you have available two main ways of programming in PReFScript.
+
+### Installation and ways to use PReFScript functions
+
+See [doc.md](https://github.com/balqui/prefscript/blob/main/docs/doc.md) 
+for all the details (somewhat incomplete as of today).
+
+

prefscript-1.1/src/prefscript.egg-info/SOURCES.txt

@@ -0,0 +1,16 @@
+LICENSE
+README.md
+pyproject.toml
+src/ascii7io.py
+src/prefscript.py
+src/cantorpairs/__init__.py
+src/cantorpairs/src/cantorpairs.py
+src/cantorpairs/src/cp_ex.py
+src/prefscript.egg-info/PKG-INFO
+src/prefscript.egg-info/SOURCES.txt
+src/prefscript.egg-info/dependency_links.txt
+src/prefscript.egg-info/entry_points.txt
+src/prefscript.egg-info/requires.txt
+src/prefscript.egg-info/top_level.txt
+tests/test.py
+tests/test_fact.py

prefscript-1.1/src/prefscript.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

prefscript-1.1/src/prefscript.egg-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+prefscript = prefscript:run

prefscript-1.1/src/prefscript.egg-info/requires.txt

@@ -0,0 +1 @@
+pytokr>=1.0

prefscript-1.1/src/prefscript.egg-info/top_level.txt

@@ -0,0 +1,3 @@
+ascii7io
+cantorpairs
+prefscript

prefscript-1.1/src/prefscript.py

@@ -0,0 +1,437 @@
+'''
+PReFScript: A Partial Recursive Functions Lab
+
+Rather: Towards a Partial Recursive Functions lab.
+
+Author: Jose L Balcazar, ORCID 0000-0003-4248-4528, april 2023 onwards 
+Copyleft: MIT License (https://en.wikipedia.org/wiki/MIT_License)
+
+Project started: mid Germinal 2003.
+Current version: 0.5, mid Thermidor 2024.
+
+A Python-based environment to explore and experiment with partial 
+recursive functions; naturally doubles as a (purely functional) 
+programming language, but it is not intended to be used as such.
+
+Each function in a script has: associated Gödel number, nickname, 
+comments, and code (string); also, the last operation used to 
+construct it. Then, in a separate dict (used as namespace for 
+eval calls), a runnable version of the code.
+
+Nicknames are alphanum strings not starting with a number (no surprise).
+'''
+
+from collections import defaultdict as ddict
+from re import compile as re_compile, finditer as re_finditer
+from ascii7io import int2str, str2int, int2raw_str # users are not expected to need int2raw_str
+import cantorpairs
+cp = cantorpairs
+
+__version__ = "1.1"
+
+# ~ In order to omit Gödel numbers too high, around 300 decimal digits,
+# ~ LIMIT_GNUM set to 2**1000 but computed much faster via bit shift
+
+LIMIT_GNUM = 2 << 999
+
+class FunData(dict):
+    'Simple class for PReFScript functions data'
+
+    def __init__(self, nick = None, comment = None, how_def = None, def_on = None):
+        dict.__init__(self)
+        self["nick"] = nick # function name
+        self["comment"] = comment
+        self["how_def"] = how_def
+        self["def_on"] = def_on
+
+    def __str__(self):
+        return self["nick"] + "\n " + self["comment"] 
+
+    def how_def(self):
+        if self["how_def"] == "basic":
+            return "basic"
+        return self["how_def"] + ": " + ' '.join(on_what for on_what in self["def_on"])
+
+
+def mu(x, test):
+    "ancillary linear search function for implementing mu-minimization"
+    z = 0
+    while not test(cp.dp(x, z)):
+        z += 1
+    return z
+
+
+def prim_rec(is_base, base, recurse):
+	"ancillary course-of-values primitive recursion more efficient than by minimization"
+
+	def c_of_v(x):
+		"create the full course of values"
+		sq = 0
+		for y in range(x + 1):
+			new = base(y) if is_base(y) else recurse(cp.dp(y, sq))
+			sq = cp.dp(new, sq)
+		return sq
+
+	return lambda x: cp.pr_L(c_of_v(x))
+
+
+class Parser:
+    '''Prepare an re-based parser to be used upon reading scripts
+    The single Parser with single parse generator is likely to mess up
+    the recursive imports, I bet it does not work yet.
+    '''
+
+    def __init__(self):
+        "group names require Python >= 3.11"
+        from re import compile as re_compile, finditer as re_finditer
+        about = r"\s*\.about(?P<about>.*)\n"                           # arbitrary documentation
+        pragma = r"\s*\.pragma\s+(?P<which>\w+):?\s+(?P<what>\w+)\s*"  # compilation directives
+        importing = r"\s*\.import\s+(?P<to_import>[\w._-]+)\s*"        # additional external script
+        a7str = r'''(?P<quote>['"])(?P<a7str>.*)(?P=quote)'''
+        startdef = r"\d+\s+define\:\s*"
+        group1_nick = r"(?P<nick>\w+)\s+"
+        group2_comment = r"\[\s*(?P<comment>(\w|\s|[.,:;<>=)(?!/+*-])+)\]\s+" 
+        group4_how = r"(?P<how>pair|comp|mu|compair|primrec|ascii_const)\s+" 
+        group5_on_what = r"((?P<on_what>([a-zA-Z_]\w*\s+)+)|" + a7str + ")"  # nick args required not to start with a number
+        define = (startdef +  
+              group1_nick + 
+              group2_comment + 
+              group4_how +
+              group5_on_what)
+        self.the_parser = re_compile(define + '|' + about + '|' + pragma + '|' + importing)
+
+    def parse(self, source):
+        for thing in re_finditer(self.the_parser, source):
+            "can one find out non-matched portions to message the user about?"
+            things = thing.groupdict(default = '')
+            if about := things['about']:
+                yield 'about', about
+            if which := things['which']:
+                yield 'pragma', (which, things['what'])
+            if to_import := things['to_import']:
+                yield 'import', to_import
+            if nick := things['nick']:
+                if things['how'] == "ascii_const":
+                    on_what = [things['a7str']]
+                else:
+                    on_what = things['on_what'].split()
+                yield "define", FunData(nick, things['comment'], things['how'], on_what)
+
+
+class SyntErr:
+    "handle syntactic errors in the script - VERY PRIMITIVE for the time being"
+
+    def __init__(self):
+        from sys import stderr
+        self.e = stderr
+
+    def report(self, nonfatal = False, info = ''):
+        "return value to be given to the valid field / alt: fatal here and nonvalid at script"
+        p = 'Nonf' if nonfatal else 'F'
+        print(p + 'atal error in PReFScript:', info, sep = '\n  ', file = self.e)
+        return nonfatal
+
+
+
+class PReFScript:
+
+    def __init__(self, store_goedel_numbers = ""):
+        '''
+        Dicts for storing the functions:
+          main for the function data,
+          gnums for Gödel numbers,
+          pycode for Python runnable code, 
+          key is always nick for all of them;
+        include here the basic functions;
+        their implementation assumes 'import cantorpairs as cp'
+        '''
+        self.valid = True   # program is correct until proven wrong
+        self.main = dict()  # RENAME some day, as I am using also 'main' for the main function to be called
+        self.strcode = dict()
+        self.pycode = dict()
+        self.gnums = dict()
+        self.abouts = list()
+        self.pragmas = ddict(str)
+        self.store_gnums = store_goedel_numbers 
+        self.add_basic("k_1", "The constant 1 function", "lambda x: 1", 0)
+        self.add_basic("id", "The identity function", "lambda x: x", 1)
+        self.add_basic("s_tup", "Single-argument version of suffix tuple", 
+                       "lambda x: cp.s_tup(cp.pr_L(x), cp.pr_R(x))", 2)
+        self.add_basic("proj", "Single-argument version of projection", 
+                       "lambda x: cp.pr(cp.pr_L(x), cp.pr_R(x))", 3)
+        self.add_basic("add", "Addition x+y of the two components of input <x.y>", 
+                       "lambda x: cp.pr_L(x) + cp.pr_R(x)", 4)
+        self.add_basic("mul", "Multiplication x*y of the two components of input <x.y>", 
+                       "lambda x: cp.pr_L(x) * cp.pr_R(x)", 5)
+        self.add_basic("diff", "Modified difference max(0, x-y) of the two components of input <x.y>", 
+                       "lambda x: max(0, cp.pr_L(x) - cp.pr_R(x))", 6)
+        self.parser = Parser()
+        self.synt_err_handler = SyntErr()
+
+
+    def add_basic(self, nick, comment, code, num):
+        data = FunData()
+        data["nick"] = nick
+        data["comment"] = comment
+        data["how_def"] = "basic"
+        data["def_on"] = tuple()
+        if self.store_gnums:
+            self.gnums[nick] = cp.dp(0, num)
+        self.main[nick] = data
+        self.strcode[nick] = code
+        self.pycode[nick] = eval(code, globals() | self.pycode)
+
+
+    def list(self, what = None, w_code = 0):
+        '''
+        if what is None: list everything
+        else: search for that what on the dicts
+        w_code 0: no code, 1: how and on what, 2: strcode also
+        Gödel number printed depending on self.store_gnums and how big it is
+        '''
+        def list_one(nick, w_code):
+            print("\n" + str(self.main[nick]))
+            if w_code:
+                'print how it is defined'
+                print(" " + self.main[nick].how_def())
+            if w_code == 2:
+                'print also the Python code in this case only'
+                print(" " + self.strcode[nick])
+            if self.store_gnums:
+                if nick in self.gnums:
+                    gnum = self.gnums[nick]
+                    print(" Gödel number:", gnum,
+                          "= <" + str(cp.pr_L(gnum)) + "." + str(cp.pr_R(gnum)) + ">")
+                else:
+                    self.valid &= self.synt_err_handler(fatal = False, info = "Gödel number too large, omitted.")
+
+        if what is not None:
+            list_one(what, w_code)
+        else:
+            for nick in self.main:
+                list_one(nick, w_code)
+
+
+    def define(self, new_funct):
+        'here comes a new function to add to the collection'
+
+        if (nick := new_funct['nick']) in self.main:
+            'repeated nick, check for consistency'
+            if (self.main[nick]["how_def"] != new_funct['how_def'] or
+                self.main[nick]["def_on"] != new_funct['def_on']):
+                    self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                        info = f"Repeated, inconsistent definitions for function '{nick}' found.")
+        else:
+            self.main[nick] = new_funct
+            on_what = new_funct['def_on']
+
+            if new_funct['how_def'] == "comp":
+                self.strcode[nick] = "lambda x: " + on_what[0] + "(" + on_what[1] + "(x))"
+                if self.store_gnums and on_what[0] in self.gnums and on_what[1] in self.gnums:
+                    gnum = cp.dp(1, cp.dp(self.gnums[on_what[0]], self.gnums[on_what[1]]))
+                    if gnum < LIMIT_GNUM:
+                        self.gnums[nick] = gnum
+                    else:
+                        self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                            info = f"Gödel number for '{nick}' too large, omitted.")
+
+            elif new_funct['how_def'] == "pair":
+                self.strcode[nick] = "lambda x: cp.dp(" + on_what[0] + "(x), " + on_what[1] + "(x))"
+                if self.store_gnums and on_what[0] in self.gnums and on_what[1] in self.gnums:
+                    gnum = cp.dp(2, cp.dp(self.gnums[on_what[0]], self.gnums[on_what[1]]))
+                    if gnum < LIMIT_GNUM:
+                        self.gnums[nick] = gnum
+                    else:
+                        self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                            info = f"Gödel number for '{nick}' too large, omitted.")
+    
+            elif new_funct['how_def'] == "mu":
+                self.strcode[nick] = "lambda x: mu(x, " + on_what[0] + ")"
+                if self.store_gnums and on_what[0] in self.gnums:
+                    gnum = cp.dp(3, self.gnums[on_what[0]])
+                    if gnum < LIMIT_GNUM:
+                        self.gnums[nick] = gnum
+                    else:
+                        self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                            info = f"Gödel number for '{nick}' too large, omitted.")
+
+            elif new_funct['how_def'] == "compair":
+                if not self.pragmas['extended']:
+                    self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                                  info = "Use of compair requires '.pragma extended: True', changed.")
+                self.pragmas['extended'] = 'True'
+                self.strcode[nick] = "lambda x: " + on_what[0] + "( cp.dp(" + on_what[1] + "(x), " + on_what[2] + "(x)))"
+                if (self.store_gnums and on_what[0] in self.gnums and 
+                    on_what[1] in self.gnums and on_what[2] in self.gnums):
+                    gnum = cp.dp(1, cp.dp(self.gnums[on_what[0]],
+                           cp.dp(2, cp.dp(self.gnums[on_what[1]], self.gnums[on_what[2]]))))
+                    if gnum < LIMIT_GNUM:
+                        self.gnums[nick] = gnum
+                    else:
+                        self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                            info = f"Gödel number for '{nick}' too large, omitted.")
+
+            elif new_funct['how_def'] == "primrec":
+                if not self.pragmas['extended']:
+                    self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                                  info = "Use of primrec requires '.pragma extended: True', changed.")
+                self.pragmas['extended'] = 'True'
+                self.strcode[nick] = "prim_rec(" + on_what[0] + ", " + on_what[1] + ", " + on_what[2] + ")"
+                if (self.store_gnums and on_what[1] in self.gnums and on_what[2] in self.gnums):
+                    gnum = cp.dp(4, cp.dp(int(on_what[0]),
+                               cp.dp(self.gnums[on_what[1]], self.gnums[on_what[2]])))
+                    if gnum < LIMIT_GNUM:
+                        self.gnums[nick] = gnum
+                    else:
+                        self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                            info = f"Gödel number for '{nick}' too large, omitted.")
+
+            else:
+                "ascii_const, as no other 'how' captured by parser - kept out of the Goedel numbering for the time being"
+                if not self.pragmas['extended']:
+                    self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                                  info = "Use of ascii constants requires '.pragma extended: True', changed.")
+                self.pragmas['extended'] = 'True'
+                self.strcode[nick] = "lambda x: str2int( '" + on_what[0] + "' )"
+
+            self.pycode[nick] = eval(self.strcode[nick], globals() | self.pycode)
+
+
+    def to_python(self, what):
+        'returns the Python-runnable version of the function'
+        if what not in self.pycode:
+            self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                info = f"No Python code for function '{what}' found.")
+            return None
+        return self.pycode[what]
+
+
+    def find_script_in_file(self, filename, main):
+        try:
+            with open(filename) as infile:
+                 return infile.read()
+        except IOError:
+            if main:
+                self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                              info = f"Script {filename} not found.")
+            else:
+                self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                              info = f"Imported script {filename} not found.")
+
+
+    def load(self, filename, main = True):
+        'load in definitions from .prfs file(s) - use .import to recurse into further loading'
+        if filename.endswith('.prfs'):
+            self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                          info = f"File name {filename} NOT expected to include the '.prfs' extension.")
+        else:
+            filename += '.prfs'
+        script = self.find_script_in_file(filename, main)
+        if not script:
+            return None
+        lastread = None
+        for label, what in self.parser.parse(script):
+            'make the FunData or store the about or the pragma or the import'
+            if label == 'pragma':
+                if main:
+                    "pragmas in main file are stored"
+                    self.pragmas[what[0]] = what[1]
+                elif what[0] == 'extended' and what[1] == 'True':
+                    "pragmas in imported files are ignored except extended when set to True"
+                    if self.pragmas['extended'] != 'True':
+                        self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                            info = f"Warning: the .pragma extended declaration found in {filename} affects globally.")
+                    self.pragmas[what[0]] = what[1]
+            if label == 'about':
+                self.abouts.append('about ' + filename + ': ' + what) 
+            if label == 'define':
+                self.define(what)
+                lastread = what['nick'] # nickname of the last function defined, used for default main
+            if label == "import":
+                "non-main recursive call"
+                self.load(what, main = False)
+        if main and not self.pragmas['main']:
+            self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                 info = f"No main .pragma found in '{filename}'.")
+            if self.valid and lastread:
+                "warn that main assumed is lastread"
+                self.valid &= self.synt_err_handler.report(nonfatal = True, 
+                     info = f"Function '{lastread}' guessed to be the main function, cross fingers.")
+                self.pragmas['main'] = lastread
+            elif self.valid:
+                self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                     info = f"No guess available for the main function.")
+
+
+    def dialog(self):
+        nick = input("Function name? ")
+        comment = input("What is it? ")
+        how = input("How is it made? [pair or comp or mu] ")
+        on_what = input("Applied to what? [1 or 2 space-sep names] ")
+        self.define(FunData(nick.strip(), comment.strip(), how.strip(), tuple(on_what.split())))
+
+
+    def check_names(self):
+        "checks that all function names needed to run main have been defined"
+
+        def check_name(self, name, need = 'pragma main'):
+            if name not in checked:
+                checked.add(name)
+                if name in self.main:
+                    if self.main[name]['how_def'] != "ascii_const":
+                        for nname in self.main[name]['def_on']:
+                            check_name(self, nname, f"'{name}'")
+                else:
+                    "newly found undefined name"
+                    self.valid &= self.synt_err_handler.report(nonfatal = False, 
+                        info = f"Function '{name}' not found but needed by {need}.")
+
+        checked = set()
+        check_name(self, self.pragmas['main'])
+
+
+def run():
+    'Stand-alone CLI command to be handled as entry point - no Goedel numbers stored; handle the filename as argument'
+    from argparse import ArgumentParser
+    from pytokr import pytokr
+    read, loop = pytokr(iter = True)
+    aparser = ArgumentParser(prog = 'prefscript',
+              description = 'Partial Recursive Functions Scripting interpreter')
+    aparser.add_argument('filename', help = 'script filename to be run, extension .prfs assumed')
+    aparser.add_argument('-a', '--about', 
+            help = "show contents of .about directives in file and .import'd files before running",
+            action = "store_true")
+    aparser.add_argument('-v', '--version', 
+            action = "version", version = f'{__version__}')
+    args = aparser.parse_args()
+    f = PReFScript()
+    f.load(args.filename)
+    if f.valid:
+        f.check_names()
+    if f.valid:
+        'run it on data from stdin according to input/output/main pragmas'
+        if args.about:
+            print('\n'.join(f.abouts))
+
+        r = f.to_python(f.pragmas["main"])
+
+        if f.pragmas["output"] in ('', "int"):
+            post = lambda x: x
+        elif f.pragmas["output"] == "ascii":
+            post = int2str
+        elif f.pragmas["output"] == "bool":
+            post = bool
+
+        if f.pragmas["input"] in ('', "int"):
+            arg = int(input()) 
+        elif f.pragmas["input"] == "none":
+            arg = 666 # for one
+        elif f.pragmas["input"] == "intseq":
+            arg = cp.tup_i(map(int, loop()))
+
+    if f.valid:
+        print(post(r(arg)))
+
+
+if __name__ == "__main__":
+    run()

prefscript-1.1/tests/test.py

@@ -0,0 +1,17 @@
+# ~ import scaff.cantorpairs as cp
+# ~ from prefscript import PReFScript
+from prefscript import PReFScript, cp
+my_fs = PReFScript()
+# ~ my_fs = PReFScript("Store Gödel numbers")
+my_fs.load("script_sign.prfs")
+my_fs.list(w_code = 1)
+my_fs.load("script_proj.prfs")
+my_fs.load("script_bool.prfs")
+my_fs.load("script_compar.prfs")
+my_fs.load("script_division.prfs")
+my_fs.list()
+d = my_fs.to_python("div")
+print(d(cp.dp(14, 5)))
+print(d(cp.dp(15, 5)))
+my_fs.list("swap", w_code = 1)
+my_fs.list("sign", w_code = 2)

prefscript-1.1/tests/test_fact.py

@@ -0,0 +1,20 @@
+from time import process_time
+from prefscript import PReFScript
+import scaff.cantorpairs as cp
+
+ff = PReFScript()
+ff.load("fact_00.prfs")
+f = ff.to_python("fact")
+
+def t(n):
+	try:
+		start = process_time()
+		r = f(n)
+		tm = process_time() - start
+	except:
+		print(f"Stopped; time: {1000*(process_time() - start):3.6f} ms")
+	print(f"Outcome: {r}; time: {1000*(tm):3.6f} ms")
+
+t(int(input("n: ")))
+
+