My Pop-11 / Poplog page

Poplog is a integrated toolkit providing a highly extendable collection of languages and tools for teaching, research and development. By default it includes incremental compilers for three powerful AI programming languages
* Pop-11--the core language -- used to implement itself and the others;
* Common Lisp; and
* Prolog;
as well as
* Standard ML, a widely used functional language.

My Pop-11/Poplog programs

• compile_test.p: Demonstration how to:
  - compile a Pop-11 program to a saved (.psv) image,
  - compile to an executable program.
  (This was tested on Linux.)
• concord.p: Reads a file and show the number of occurrence of the words (sorted in order of occurrence). Requires GOSPL (see below).
• euler_project.p: My Pop-11 solutions of the first 16 Euler Project problems. Some solutions requires newmemo.p, and GOSPL (see below).
  
  Here are some solutions of Project Euler problems in separate files (the later one is not included in euler_project.p)
  • euler1.p
  • euler2.p
  • euler3.p
  • euler4.p
  • euler5.p
  • euler6.p
  • euler7.p
  • euler8.p
  • euler9.p
  • euler10.p
  • euler11.p
  • euler12.p
  • euler13.p
  • euler14.p
  • euler15.p
  • euler16.p
  • euler17.p
  • euler18.p
  • euler19.p
  • euler20.p
  • euler21.p
  • euler22.p
  • euler23.p
  • euler24.p
  • euler25.p
  • euler26.p
  • euler27.p
  • euler28.p
  • euler29.p
  • euler30.p
  • euler31.p
  • euler32.p
  • euler33.p
  • euler34.p
  • euler35.p
  • euler36.p
  • euler37.p
  • euler38.p
  • euler39.p
  • euler40.p
  • euler41.p
  • euler42.p
  • euler43.p
  • euler44.p
  • euler45.p
  • euler46.p
  • euler47.p
  • euler48.p
  • euler49.p
• init.p: My init.p file.
• join.p: join(string, separator), e.g. join('hello,world','|') results in h|e|l|l|o|,| |w|o|r|l|d. This is used for example in read_test.p.
• lisp_in_pop11_test.p: Simple demonstration how to run (Poplog's) Lisp code in Pop-11.
• mygram.p: Generates some swedish sentences given a simple grammar and lexicon.
• n_puzzle.p: n-puzzle, e.g. 8-puzzle and 15-puzzle using the library SOLVEMS.
• newmemo.p: Memo function (from Robin Popplestone's Pop-11 book)
• pop11_in_lisp_test.lsp: Simple demonstration how to run Pop-11 code in (Poplog's) Lisp.
• pop11_in_prolog_test.pl: Simple demonstration how to run Pop-11 code in (Poplog's) Prolog.
• primes.p: Generation of prime numbers using a dynamic ("lazy") list.
• prolog_in_pop11_test.p: Simple demonstration how to run (Poplog's) Prolog code in Pop-11.
• read_test.p: Read a word list and test each words against regular expressions of consecutive characters, e.g. ".*a.*.b.*c.*" (in Pop-11 'a@.@*b@.@*c@.@*'), ".*b.*c.*d.*", ".*c.*d.*e.*", etc. Requires join.p.
• read_test_strmatches.p: Read a word list and test each words against a string pattern of consecutive characters. Same as read_test.p, but uses the strmatches function (not in the standard Poplog distribution). This version is much slower than using regular expression.
• solver_banana_problem.p: (GPS) Banana problem using SOLVER library (schema and problem from Norvig "Paradigms of Artificial Intelligence Programming").
• solver_blocks_world.p: (GPS) Blocks world problem using SOLVER library (schema and problem from TEACH SOLVER).
• solver_maze_problem.p: (GPS) Maze problem using SOLVER library (schema and problem from Norvig "Paradigms of Artificial Intelligence Programming").
• solver_school_problem.p: (GPS) School problem using SOLVER library (schema and problem from Norvig "Paradigms of Artificial Intelligence Programming").
• timing_test.p: Two timing functions which only run the procedure once (as opposed to the builtin timing which runs many times). One definition is a syntax word, the other is a procedure proper. Includes a simple test.
• tparse_test_swe.p: Test of parsing swedish sentences given a simple grammar and lexicon. Uses the TPARSE library.