{"id":26560746,"url":"https://github.com/nilqed/mma","last_synced_at":"2026-01-05T05:06:00.654Z","repository":{"id":283086087,"uuid":"950634669","full_name":"nilqed/mma","owner":"nilqed","description":"Mock-Mma by Richard J. Fateman","archived":false,"fork":false,"pushed_at":"2025-03-18T13:59:08.000Z","size":586,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-18T14:27:17.540Z","etag":null,"topics":["common-lisp","computer-algebra-system","mma"],"latest_commit_sha":null,"homepage":"https://people.eecs.berkeley.edu/~fateman/lisp/mma4max/","language":"Mathematica","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nilqed.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-03-18T13:13:36.000Z","updated_at":"2025-03-18T13:59:11.000Z","dependencies_parsed_at":"2025-03-19T01:15:43.307Z","dependency_job_id":null,"html_url":"https://github.com/nilqed/mma","commit_stats":null,"previous_names":["nilqed/mma"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nilqed%2Fmma","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nilqed%2Fmma/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nilqed%2Fmma/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nilqed%2Fmma/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nilqed","download_url":"https://codeload.github.com/nilqed/mma/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244959784,"owners_count":20538699,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["common-lisp","computer-algebra-system","mma"],"created_at":"2025-03-22T13:20:07.053Z","updated_at":"2026-01-05T05:06:00.614Z","avatar_url":"https://github.com/nilqed.png","language":"Mathematica","funding_links":[],"categories":[],"sub_categories":[],"readme":"# mma\nMock-Mma by Richard J. Fateman\n\nThis is a version that can be loaded using [Quicklisp](https://www.quicklisp.org/beta/)\nwhen this repo is cloned into the `~/quicklisp/local-projects/` folder[^1].\n\n\n## Installation\n\n    $ cd :~/quicklisp/local-projects/\n    $ git clone https://github.com/nilqed/mma.git\n\n## Running\nStart your *lisp* (tested with ABCL, ECL, SBCL so far): \n\n    (ql::quickload :cl-package-locks)\n    (cl-package-locks::unlock-package :common-lisp)\n    (ql::quickload :mma)\n    (cl-package-locks::lock-package :common-lisp)\n    (in-package :mma)\n    (tl)\n\nFor convenience there is a file `run-mma.lisp` in the `mma` folder that\ndoes exactly as above when\n\n     your-lisp --load \"path-to/run-mma\"\n\n*Note* that it is assumed that `quicklisp` is available in your Lisp, otherwise you have\nto issue a\n\n    (load \"~/quicklisp/setup\")\n\nbefore the other commands (e.g. see `test-abcl.txt`).\n\n## Example\n\n\n        kfp@omega:~/quicklisp/local-projects/mma$ sbcl --load \"run-mma\"\n        This is SBCL 2.2.9.debian, an implementation of ANSI Common Lisp.\n        More information about SBCL is available at \u003chttp://www.sbcl.org/\u003e.\n        \n        SBCL is free software, provided as is, with absolutely no warranty.\n        It is mostly in the public domain; some portions are provided under\n        BSD-style licenses.  See the CREDITS and COPYING files in the\n        distribution for more information.\n        To load \"cl-package-locks\":\n          Load 1 ASDF system:\n            cl-package-locks\n        ; Loading \"cl-package-locks\"\n        \n        To load \"mma\":\n          Load 1 ASDF system:\n            mma\n        ; Loading \"mma\"\n        \n        Mock-Mma  14: 9 Tuesday, Mar 18, 2025\n        \n        In[1] := D[x^p*Sin[x],x]\n        \n                  p\n                 x  (p Sin[x] + x Cos[x])\n        Out[1] = ------------------------\n                            x\n        In[2] := Quit[]\n        \n        Exited to Lisp\n        * (quit)\n        kfp@omega:~/quicklisp/local-projects/mma$kfp@omega:~/quicklisp/local-projects/mma$\n        \nSee also `test-abcl.txt` and `test-ecl.txt`. Other CL's should work as well. Using `npt`\nshowed a problem with loading `ASDF 3.0+` which is unrelated with `mma`, though.\n\n\n### Changelog\n\n  * new mma.asd\n  * mma.lisp\n      fix: issue with incomplete prompt \n      https://stackoverflow.com/questions/45803936/call-finish-output-from-format\n    \n      A suggestion from Rob Warnock\n  * eval.lisp\n      using the ~/fo/ nil directive from above.\n  * rat1.lisp\n      commented\n      ;; (eval-when (:compile-toplevel) (load \"c:/lisp/mma4max/poly.lisp\")) \n\n  * using cl-package-locks to circumvent the ... (not nice but effective ;-)\n\n\n ### Tests \n tbd. (Rubi, Batch , ...)\n\n :date:\n\n[^1]: where `~` has to be adjusted accordingly if Quicklisp is installed elsewhere.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnilqed%2Fmma","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnilqed%2Fmma","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnilqed%2Fmma/lists"}