home.social

#lispmachine — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #lispmachine, aggregated by home.social.

  1. 👾 The lost cause of the Lisp machines

    「 The common idea was that the arrival of RISC machines had killed it, but in fact machines like the Sun 3/260 in its ‘AI’ configuration were already hammering nails in its coffin 」

    tfeb.org/fragments/2025/11/18/

    #LispMachine #symbolics #retrocomputing

  2. @screwlisp

    You can pick up the document 'Signalling and Handling Conditions' from this index page:

    nhplace.com/kent/ZL/

    It was longer than I thought it would be, but I think you'll find it interesting to see what the Zetalisp condition system (which inspired the Common Lisp condition system) looked like.

    In spirit, it was much the same. The biggest differences are:

    * The CL system has 'active' restarts, where the ZL system had a passive thing where you returned a value to the case context and hoped that it would do the thing you wanted. It felt quite a bit more error-prone (if you'll pardon the reuse of 'error' here, maybe I should say 'mistake-prone').

    * The ZL condition system offers a lot of really low-level stuff that did not seem proper for CL.

    * The set of operations offered in ZL was richer, but also a lot more complicated, I thought, and I worried people would not really see what it was trying to do.

    * Obviously, the ZL system was based on Flavors, not CLOS, and made reference to a lot of LispM-specific packages.

    * The document was published in January, 1983 and identifies itself as part of Symbolics Release 4.0.

    There are other differences as well.

    #Zetalisp #LispMachine #LispMachines #Symbolics #LispM
    #ConditionHandling #ConditionSystem #ErrorSystem #ErrorHandling #CommonLisp #CL #Flavors #CLOS #History #ComputerHistory
    #InternetArchive #Bitsavers

  3. @screwlisp

    You can pick up the document 'Signalling and Handling Conditions' from this index page:

    nhplace.com/kent/ZL/

    It was longer than I thought it would be, but I think you'll find it interesting to see what the Zetalisp condition system (which inspired the Common Lisp condition system) looked like.

    In spirit, it was much the same. The biggest differences are:

    * The CL system has 'active' restarts, where the ZL system had a passive thing where you returned a value to the case context and hoped that it would do the thing you wanted. It felt quite a bit more error-prone (if you'll pardon the reuse of 'error' here, maybe I should say 'mistake-prone').

    * The ZL condition system offers a lot of really low-level stuff that did not seem proper for CL.

    * The set of operations offered in ZL was richer, but also a lot more complicated, I thought, and I worried people would not really see what it was trying to do.

    * Obviously, the ZL system was based on Flavors, not CLOS, and made reference to a lot of LispM-specific packages.

    * The document was published in January, 1983 and identifies itself as part of Symbolics Release 4.0.

    There are other differences as well.

    #Zetalisp #LispMachine #LispMachines #Symbolics #LispM
    #ConditionHandling #ConditionSystem #ErrorSystem #ErrorHandling #CommonLisp #CL #Flavors #CLOS #History #ComputerHistory
    #InternetArchive #Bitsavers

  4. @screwlisp

    You can pick up the document 'Signalling and Handling Conditions' from this index page:

    nhplace.com/kent/ZL/

    It was longer than I thought it would be, but I think you'll find it interesting to see what the Zetalisp condition system (which inspired the Common Lisp condition system) looked like.

    In spirit, it was much the same. The biggest differences are:

    * The CL system has 'active' restarts, where the ZL system had a passive thing where you returned a value to the case context and hoped that it would do the thing you wanted. It felt quite a bit more error-prone (if you'll pardon the reuse of 'error' here, maybe I should say 'mistake-prone').

    * The ZL condition system offers a lot of really low-level stuff that did not seem proper for CL.

    * The set of operations offered in ZL was richer, but also a lot more complicated, I thought, and I worried people would not really see what it was trying to do.

    * Obviously, the ZL system was based on Flavors, not CLOS, and made reference to a lot of LispM-specific packages.

    * The document was published in January, 1983 and identifies itself as part of Symbolics Release 4.0.

    There are other differences as well.

    #Zetalisp #LispMachine #LispMachines #Symbolics #LispM
    #ConditionHandling #ConditionSystem #ErrorSystem #ErrorHandling #CommonLisp #CL #Flavors #CLOS #History #ComputerHistory
    #InternetArchive #Bitsavers

  5. @screwlisp

    You can pick up the document 'Signalling and Handling Conditions' from this index page:

    nhplace.com/kent/ZL/

    It was longer than I thought it would be, but I think you'll find it interesting to see what the Zetalisp condition system (which inspired the Common Lisp condition system) looked like.

    In spirit, it was much the same. The biggest differences are:

    * The CL system has 'active' restarts, where the ZL system had a passive thing where you returned a value to the case context and hoped that it would do the thing you wanted. It felt quite a bit more error-prone (if you'll pardon the reuse of 'error' here, maybe I should say 'mistake-prone').

    * The ZL condition system offers a lot of really low-level stuff that did not seem proper for CL.

    * The set of operations offered in ZL was richer, but also a lot more complicated, I thought, and I worried people would not really see what it was trying to do.

    * Obviously, the ZL system was based on Flavors, not CLOS, and made reference to a lot of LispM-specific packages.

    * The document was published in January, 1983 and identifies itself as part of Symbolics Release 4.0.

    There are other differences as well.

    #Zetalisp #LispMachine #LispMachines #Symbolics #LispM
    #ConditionHandling #ConditionSystem #ErrorSystem #ErrorHandling #CommonLisp #CL #Flavors #CLOS #History #ComputerHistory
    #InternetArchive #Bitsavers

  6. @screwlisp

    You can pick up the document 'Signalling and Handling Conditions' from this index page:

    nhplace.com/kent/ZL/

    It was longer than I thought it would be, but I think you'll find it interesting to see what the Zetalisp condition system (which inspired the Common Lisp condition system) looked like.

    In spirit, it was much the same. The biggest differences are:

    * The CL system has 'active' restarts, where the ZL system had a passive thing where you returned a value to the case context and hoped that it would do the thing you wanted. It felt quite a bit more error-prone (if you'll pardon the reuse of 'error' here, maybe I should say 'mistake-prone').

    * The ZL condition system offers a lot of really low-level stuff that did not seem proper for CL.

    * The set of operations offered in ZL was richer, but also a lot more complicated, I thought, and I worried people would not really see what it was trying to do.

    * Obviously, the ZL system was based on Flavors, not CLOS, and made reference to a lot of LispM-specific packages.

    * The document was published in January, 1983 and identifies itself as part of Symbolics Release 4.0.

    There are other differences as well.

    #Zetalisp #LispMachine #LispMachines #Symbolics #LispM
    #ConditionHandling #ConditionSystem #ErrorSystem #ErrorHandling #CommonLisp #CL #Flavors #CLOS #History #ComputerHistory
    #InternetArchive #Bitsavers

  7. Any attempt to reimagine a (viable) #LispMachine would not just recreate what was, it would have to imagine what could've been and how lisp machines may have evolved since 1990s… eg: support for GUI, multitasking, WiFi, internet, World Wide Web, multi-gesture touchpads, touchscreens, multi-core cpus, 8 GB RAM, virtual machines, … just to name a few

  8. This 1981 paper described an online help browser and authoring environment for TI or MIT Lisp Machines. The paper is interesting as it also briefly reviewed the state of online help systems at the time.

    dl.acm.org/doi/abs/10.1145/101

    #retrocomputing #lisp #LispMachine

  9. @screwlisp Thought you would be interested in this.

    On the ex-Symbolics employees mailing list somebody posted a link to a "history of the Lisp machine".

    youtu.be/sV7C6Ezl35A?si=S4uh4-

    It's kind of long and so I didn't watch the whole thing, but just skipped around a little bit. Somebody else who did watch it said,

    'Fascinating exposition. Given his mispronunciations of "CADR" and "Macsyma", it's clear that he wasn't in the room where it happened, nor spoke to anyone who was. But I can't quarrel with his research or cause-and-effect analysis of both the industry as a whole and Symbolics in particular.'

    #symbolics #lispMachine

  10. The document preparation system of Symbolics Lisp Machines consisted of two main hypertext tools, the Concordia authoring environment and the Document Examiner documentation browser and delivery interface. These papers describe the tools.

    Supporting Document Development with Concordia
    archive.org/details/smbx-conco

    Document Examiner: delivery interface for hypertext documents
    dl.acm.org/doi/abs/10.1145/317

    #LispMachine #symbolics #lisp #retrocomputing

  11. @a_cubed @cstross

    Back in the 1980s, when my then-office-mate was developing the Japanese product for the Symbolics lisp machine, we had an electronic version of this.

    It was a big pad, about 50cm x 50cm, with a stylus to pick out individual characters. This was for kanji; the hiragana and katakana were handled separately.

    To watch him use it was amazing... and slow.

    #lispm
    #lispmachine
    #genera
    #symbolics

  12. #lisp #commonlisp #lispworks #symbolics #lispmachine

    Made the KR frame system from the UIMS Garnet for two Common Lisp implementations work: LispWorks 8 and Portable Genera. I used this version: github.com/ury-marshak/kr

    Typical problem porting code:: the initial value for structure slots is undefined in CL. The code assumes NIL.

    Attached a screenshot of the KR examples in Portable Genera, a Virtual Lisp Machine on an Apple Mac mini with M4 Pro.

  13. @amoroso #symbolics #genera naturally also has graph drawing features. Attached screenshot shows a simple example. In the Listener (-> #lisp #repl) I define a new command Show Flavor Tree. It displays the inherited Flavors. Flavors are early classes on the #lispmachine. The Listener is also a drawing plane. The command takes the name of a flavor class, then calls the graph formatter with arguments. PRESENT-FLAVOR prints the flavor and makes it mouse sensitive.

  14. #lisp #commonlisp #lispmachine #genera

    Then checking the list of compiler warnings, using the Zmacs command „Edit Compiler Warnings“.

  15. #lisp #commonlisp #lispmachine #genera

    Compiling the ALEXANDRIA library on a Lisp Machine, actually using ASDF.

  16. @amoroso #lisp #commonlisp #lispmachine #symbolics #genera
    2) I've compiled the LOOP alternative ITERATE (written by Jonathan Amsterdam) on the VLM. It actually works. ITERATE has even more features than LOOP, but uses a more Lisp-like syntax.

    In the right X11 window there is a Zmacs and a Lisp Listener. The left X11 window is from the same VLM, but displays the documentation browser in its own X11 window. The documentation content comes from another VLM.

  17. @amoroso
    #lisp #commonlisp #lispmachine #symbolics #genera
    1) Thanks, I just updated my Genera to the latest release 9.0.6. The installation is slightly unusual. It's a virtual lisp machine (VLM), here running on a Mac with an M1 Pro cpu. UI is via X11, using the XQuartz application. The VLM talks to another VLM on the network, which provides various server functionality. But it also has its own file system, which is actually a Lisp Machine File System (LMFS). -> 2)

  18. #lisp #lispmachine #symbolics #genera #pascal #niklauswirth Niklaus Wirth's PASCAL made it to unusual systems: Here is a screenshot of a Lisp Machine, browsing the original Pascal User Manual and Report, but in a hypertext browser, with a PASCAL implementation loaded...

  19. In the 1980s some Xerox Lisp Machines came with an IBM PC/XT expansion card that allowed running MS-DOS software from the Interlisp-D environment, like the black window of a spreadsheet program at the bottom left. This screenshot is from a flyer of the Xerox 1186 AI workstation.

    groups.google.com/g/lispcore/c

  20. @demiguru

    As far as I know, in Lisp Machine, the entire software, from the operating system into user applications are all available as gigantic Lisp functions.

    We can use the functions in our code. We can also edit the code, even the code of the program we are currently running, save the code, then reload it.

    Yes, the operating system itself can be edited, saved and reloaded.

    But it is different with Emacs. It is basically an elisp interpreter with some functionalities to aid text editing. These two are all C code.

    They cannot be edited, saved and reload.

    Emacs in Unix possibly is different with Emacs (EINE, ZWEINE) on Lisp Machine.

    #GNUEmacs #Emacs #LispMachine

    @crandel @alerque @Zenie @weavejester

  21. @simon_brooke

    GNU Emacs as a Lisp Machine surely is very nice. But Daniel Weinreb himself disagree with that.

    Is it possible that Emacs is only Lisp Machine in spirit only?

    Here is the link: web.archive.org/web/2025042707

    Note: on the debate about the original creator of Emacs, whether it is David Moon & Guy Steele or Richard Stallman, I am completely neutral.

    Edit: I have ever heard somewhere that Maxima is quite similar with GNU Emacs. At the core of Maxima is an implementation of Common Lisp. Maxima is just sitting on top of the Common Lisp.

    #GNUEmacs #Emacs #LispMachine #Symbolic #LMI #RMS #DavidMoon #Maxima #CommonLisp

    @demiguru @Zenie @weavejester

  22. It's 1986 and you want to use Interlisp-D on your Xerox workstation. This primer will get you up to speed with booting a Lisp image, handling floppy disks, using the mouse, transferring files to a VAX, and interacting with the environment. Some of the material is obsolete but gives an idea of what it was like to use a Lisp Machine in the 1980s.

    bitsavers.org/pdf/xerox/interl

  23. Android 31.0.50 / Termux screencast, running Phel web application in localhost for development: nc.contabo-storage-1.lti.la/s/

  24. So how cool is this. I have been reading a lot about the #lispmachine, but I never attempted to get an instance running on my GNU/Linux system. Thanks to @amszmidt this is really absolutely trivial: Clone the fossil repo and type "./m -s". And it works, I get a Y2K compliant instance! 🙏 🧙

    tumbleweed.nu/r/l/doc/trunk/RE

    1/2

  25. I expected better from Cameron Kaiser of all people than being a self-described “anti-capper.”

    If you have old computers, you need to ensure the electrolytic capacitors aren’t leaking and destroying them. This is preventative maintenance, and unless you’re really getting directly under the capacitor when inspecting a system, you can’t tell if it’s leaking—it may still be performing its function sufficiently while slowly eating away at traces.

    #retrocomputing #lispmachine #lispm

  26. 1994 Indiana U., Robert G. Berger: “The Scheme Machine”

    This paper describes the design and implementation of the Scheme Machine, a symbolic computer derived from an abstract Scheme interpreter. The derivation is performed in several transformation passes. First, the interpreter is factored into a compiler and an abstract CPU. Next, the CPU specification is refined so that it can be used with the Digital Design Derivation system. Finally, the DDD system assists in the transformation into hardware. The resulting CPU, implemented in field programmable gate arrays and PALs, is interfaced to a garbage-collecting heap to form a complete Scheme system.

    #Scheme #SchemeLang #LispM #LispMachine

  27. @amszmidt

    No clue.

    I did use CADR lisp machines*, but I am not sure I ever used the remote debugger. I don't think I did.

    I can speculate a little, but I emphasize that I know exactly zero about this and am just completely guessing.

    The form of the text is like that of an FTP or HTTP response code: a three-digit code and some other text that perhaps doesn't matter. If it's related to that, 105 is in the 1xx range, which is informational. FOOBAR in that case may just be someone inserting non-null text for something that had no specific better text.

    Searching an early draft of the LispM manual (suitable for CADR) at bitsavers.org/pdf/mit/cadr/Wei for "105 foobar" does reveal a match, but it's in the description of si:lisp-top-level1, where it says:

    «Preliminary Lisp Machine Manual, page 267, The Lisp Top Level:

    si:lisp-top-level1
    This is the actual top level loop. It prints out ·"105 FOOBAR" and then goes into a
    loop reading a form from standard-input. evaluating it. and printing the result
    (with slashification) to standard-output. If several values are returned by the form
    all of them will be printed. Also the values of *, +, and - are maintained (see
    below).»

    Based on all of this, I'm reaching even further but wondering if perhaps someone wanted to use the informational output of the si:lisp-top-level1 command having been successfully invoked as input on the other end of some pipe saying to go ahead and start a debugger session.

    As I said, just a wild guess. I could be VERY wrong. :)

    #LispM #LispMachine

    *I used the CADR lisp machines at MIT in the early 1980s as part of the programmer's Apprentice project, where I named machine Avatar (long before the movie, more inspired on a theme akin to the Sorcerer's Apprentice) and at the Open University (summer 1984, I think) in Milton Keynes, UK, where I named my machine Alan Turing.

    (Cadrs were hand-built machines, as I recall, so they were each much more like individuals and their naming was much more important than machines that were mass produced.)

    The name Turing was chosen for the machine at the OU because of the building we were in, which was referred to as "Turing's hut". It was said to be a temporary building erected in World War II where Turing did his work. (This was long after WWII, but MIT also had "temporary" buildings built for the war that survived much longer.) I've more recently struggled to reconcile the claim that Turing worked in that building against the information in the movie The Imitation Game, which puts Turing's work in Bletchley Park, but the OU is not far from Bletchley Park, so there's probably some element of truth in one or the other. In that time (mid 1980s), Turing's contribution was more obscure and no one really questioned such details. It was just nerdy trivia.

    #Turing

  28. #lisp #lispmachine #lispm #symbolics
    A Graphics Editor on a Lisp Machine, changing the attributes of a circle.

  29. @alchemist
    many of us ! In particular I have been awed by @surabax 's recent toot series on symbolics era #lispMachine stuff, who is working on launching #lispIreland lisp.ie (WIP) monthly broadcasted talks as well.

    @amszmidt for #lispm #MITCADR , @amoroso for #interlisp
    as well are centrepoints for me here.