--- title: '‘Lisp’ directory' description: "Bibliography for directory cs/lisp, most recent first: 2 related tags, 86 annotations, & 56 links ()." thumbnail: /doc/cs/lisp/1988-walker-figure4-symbolicsdocumentexaminerscreen-demonstrationofbrowsingwithcurrentcandidatesbookmarksandcommands.png thumbnail-text: '' thumbnail-css: "outline" created: 2019-11-28 modified: 2026-07-14 status: in progress previous: /doc/cs/linkrot/archiving/index next: /doc/cs/lisp/emacs/index confidence: log importance: 0 css-extension: dropcaps-not index: True backlink: False ... # See Also ::: {#see-alsos .directory-indexes .columns} - [Parent ('*`CS`{=html}*' tag)](/doc/cs/index "Link to parent directory 'doc/cs/' (ascending)"){#_E6OE902I .link-annotated .link-tag .directory-indexes-upwards rel="tag"} - [*`Emacs`{=html}*](/doc/cs/lisp/emacs/index "‘Emacs’ directory"){#_88ifxOlv .link-annotated .link-tag .directory-indexes-downwards rel="tag"} - [*`Scheme`{=html}*](/doc/cs/lisp/scheme/index "‘Scheme’ directory"){#_6faPiIlH .link-annotated .link-tag .directory-indexes-downwards rel="tag"} ::: # Gwern {.display-pop-not} ## `“Nenex: A Neural Personal Wiki Idea”, Gwern 2023`{=html} {#gwern-nenex-section} **[`Nenex: A Neural Personal Wiki Idea`{=html}](/nenex "'Nenex: A Neural Personal Wiki Idea', Gwern 2023"){.link-annotated .id-not .include-annotation}** ## `“markdown.el: Experiment in Streamlining Link-Adding Interface”, Gwern 2023`{=html} {#gwern-2023-replace-once-section} **[`markdown.el: experiment in streamlining link-adding interface`{=html}](https://github.com/gwern/gwern.net/commit/8761dccc5b3fa4fff468db554813bf20e02702a8#diff-03ea4348bea7a138709946b85053309e32040dae6fd27039008063f290f7f138R102 "'markdown.el: experiment in streamlining link-adding interface', Gwern 2023"){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** # Links {.display-pop-not} ## `“CLRHack: Meta-Object Protocol”, Marshall 2026`{=html} {#marshall-2026-section} **[`CLRHack: Meta-object Protocol`{=html}](https://funcall.blogspot.com/2026/05/clrhack-meta-object-protocol.html "'CLRHack: Meta-object Protocol', Marshall 2026"){.link-annotated .id-not .include-annotation}** ## `“Revisiting Prechelt’s Paper and Follow-Ups Comparing Java, Lisp, C/C++ and Scripting Languages: A Discussion on Programming Languages’ Impact on Productivity and Program Efficiency [Common Lisp Still Productive, Succinct, & Efficient]”, Sat & 2021 2025`{=html} {#sat-2021-2025-section} **[`Revisiting Prechelt’s paper and follow-ups comparing Java, Lisp, C/C++ and scripting languages: A discussion on programming languages’ impact on productivity and program efficiency [Common Lisp still productive, succinct, & efficient]`{=html}](https://renato.athaydes.com/posts/revisiting-prechelt-paper-comparing-languages.html "'Revisiting Prechelt’s paper and follow-ups comparing Java, Lisp, C/C++ and scripting languages: A discussion on programming languages’ impact on productivity and program efficiency [Common Lisp still productive, succinct, & efficient]', Sat & 2021 2025"){.link-annotated-partial .id-not .include-annotation}** ## `“A Self-Actualized LLM (AI Content)”, Marshall 2025`{=html} {#marshall-2025-section} **[`A Self-actualized LLM (AI content)`{=html}](https://funcall.blogspot.com/2025/10/a-self-actualized-llm-ai-content.html "'A Self-actualized LLM (AI content)', Marshall 2025"){.link-annotated-partial .id-not .include-annotation}** ## `“Formatting Code Should Be Unnecessary, and We Knew This Back in the 1980s [The Rational R1000 Ada Competitor to Lisp Machines]”, Leiter 2025`{=html} {#leiter-2025-section} **[`Formatting code should be unnecessary, and we knew this back in the 1980s [the Rational R1000 Ada competitor to Lisp machines]`{=html}](https://maxleiter.com/blog/formatting "'Formatting code should be unnecessary, and we knew this back in the 1980s [the Rational R1000 Ada competitor to Lisp machines]', Leiter 2025"){.link-annotated-partial .id-not .include-annotation}** ## `“Analyzing Lisp Redux: One Form At a Time”, Marshall 2025`{=html} {#marshall-2025-section} **[`Analyzing Lisp Redux: One Form At a Time`{=html}](https://funcall.blogspot.com/2025/09/analyzing-lisp-redux-one-form-at-time.html "'Analyzing Lisp Redux: One Form At a Time', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/09/analyzing-lisp-redux-one-form-at-time.html`](https://funcall.blogspot.com/2025/09/analyzing-lisp-redux-one-form-at-time.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“Challenges of Pseudocode Expansion”, Marshall 2025`{=html} {#marshall-2025-section} **[`Challenges of Pseudocode Expansion`{=html}](https://funcall.blogspot.com/2025/08/challenges-of-pseudocode-expansion.html "'Challenges of Pseudocode Expansion', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/08/challenges-of-pseudocode-expansion.html`](https://funcall.blogspot.com/2025/08/challenges-of-pseudocode-expansion.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“Autodoc”, Marshall 2025`{=html} {#marshall-2025-section} **[`Autodoc`{=html}](https://funcall.blogspot.com/2025/08/autodoc.html "'Autodoc', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/08/autodoc.html`](https://funcall.blogspot.com/2025/08/autodoc.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“LLM in the Debugger”, Marshall 2025`{=html} {#marshall-2025-section} **[`LLM in the Debugger`{=html}](https://funcall.blogspot.com/2025/08/llm-in-debugger.html "'LLM in the Debugger', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/08/llm-in-debugger.html`](https://funcall.blogspot.com/2025/08/llm-in-debugger.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“REPL + Prompt”, Marshall 2025`{=html} {#marshall-2025-section} **[`REPL + Prompt`{=html}](https://funcall.blogspot.com/2025/08/repl-prompt.html "'REPL + Prompt', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/08/repl-prompt.html`](https://funcall.blogspot.com/2025/08/repl-prompt.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“Pseudo”, Marshall 2025`{=html} {#marshall-2025-section} **[`Pseudo`{=html}](https://funcall.blogspot.com/2025/07/pseudo.html "'Pseudo', Marshall 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://funcall.blogspot.com/2025/07/pseudo.html`](https://funcall.blogspot.com/2025/07/pseudo.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“Malleable Software: Restoring User Agency in a World of Locked-Down Apps”, Litt et al 2025`{=html} {#litt-et-al-2025-section} **[`Malleable software: Restoring user agency in a world of locked-down apps`{=html}](https://www.inkandswitch.com/essay/malleable-software/ "'Malleable software: Restoring user agency in a world of locked-down apps', Litt et al 2025"){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View External Link**: [`https://www.inkandswitch.com/essay/malleable-software/`](https://www.inkandswitch.com/essay/malleable-software/){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: ## `“Building Tools for Traders [At Jane Street]”, Henry & Minsky 2025`{=html} {#henry-minsky-2025-section} **[`Building Tools for Traders [at Jane Street]`{=html}](https://signalsandthreads.com/building-tools-for-traders/ "'Building Tools for Traders [at Jane Street]', Henry & Minsky 2025"){.link-annotated .id-not .include-annotation}** ## `“The Barium Experiment [Writing a Custom X.org GUI Library in Common Lisp]”, Szilagyi 2025`{=html} {#szilagyi-2025-section} **[`The Barium Experiment [writing a custom X.org GUI library in Common Lisp]`{=html}](https://tomscii.sig7.se/2025/04/The-Barium-Experiment "'The Barium Experiment [writing a custom X.org GUI library in Common Lisp]', Szilagyi 2025"){.id-not .include-annotation}** ## `“How to Get a Common Lisp Job In 2055”, Carlos 2025`{=html} {#carlos-2025-section} **[`How to Get a Common Lisp Job In 2055`{=html}](https://medium.com/@sebastiancarlos/common-lisp-in-2055-f3debf4df01c "'How to Get a Common Lisp Job In 2055', Carlos 2025"){.id-not .include-annotation link-icon="𝐌" link-icon-type="text"}** ## `“Common Lisp Is Not a Single Language, It Is Lots”, Bologov 2025`{=html} {#bologov-2025-section} **[`Common Lisp Is Not a Single Language, It Is Lots`{=html}](https://aartaka.me/cl-is-lots.html "'Common Lisp Is Not a Single Language, It Is Lots', Bologov 2025"){.link-annotated-partial .id-not .include-annotation}** ## `“ELIZA Reanimated: The World’s First Chatbot Restored on the World’s First Time Sharing System”, Lane et al 2025`{=html} {#lane-et-al-2025-section} **[`ELIZA Reanimated: The world’s first chatbot restored on the world’s first time sharing system`{=html}](https://arxiv.org/abs/2501.06707 "'ELIZA Reanimated: The world’s first chatbot restored on the world’s first time sharing system', Lane et al 2025"){.link-annotated .id-not .include-annotation link-icon="𝛘" link-icon-type="text" link-icon-color="#b31b1b"}** ## `“Float Self-Tagging”, Melançon et al 2024`{=html} {#melançon-et-al-2024-section} **[`Float Self-Tagging`{=html}](https://arxiv.org/abs/2411.16544 "'Float Self-Tagging', Melançon et al 2024"){.link-annotated .id-not .include-annotation link-icon="𝛘" link-icon-type="text" link-icon-color="#b31b1b"}** ## `“Lush: My Favorite Small Programming Language”`{=html} {#_Ps2GZEWx-section} **[`Lush: my favorite small programming language`{=html}](https://scottlocklin.wordpress.com/2024/11/19/lush-my-favorite-small-programming-language/ "Lush: my favorite small programming language"){.link-annotated-partial .id-not .include-annotation}** ## `“Refurb Weekend: the Symbolics MacIvory Lisp Machine”`{=html} {#_v4Wg9xYU-section} **[`Refurb weekend: the Symbolics MacIvory Lisp machine`{=html}](http://oldvcr.blogspot.com/2024/10/refurb-weekend-symbolics-macivory-lisp.html "Refurb weekend: the Symbolics MacIvory Lisp machine"){.id-not .include-annotation}** ## `The Way of Lisp or The Right Thing, Marshall 2024`{=html} {#marshall-2024-section} **[`The Way of Lisp or The Right Thing`{=html}](http://funcall.blogspot.com/2024/05/the-way-of-lisp-or-right-way.html "'The Way of Lisp or The Right Thing', Marshall 2024"){.link-annotated-partial .id-not .include-annotation}** ## `“The World’s Loudest Lisp Program to the Rescue [Designing a Network of Tunnel Alarms]”, Zaikonnikov 2024`{=html} {#zaikonnikov-2024-section} **[`The World’s Loudest Lisp Program to the Rescue [designing a network of tunnel alarms]`{=html}](https://blog.funcall.org/lisp%20psychoacoustics/2024/05/01/worlds-loudest-lisp-program/ "'The World’s Loudest Lisp Program to the Rescue [designing a network of tunnel alarms]', Zaikonnikov 2024"){.link-annotated-partial .id-not .include-annotation}** ## `“Common Lisp Community Survey 2024 Results”`{=html} {#_zUiVtof7-section} **[`Common Lisp Community Survey 2024 Results`{=html}](https://blog.djhaskin.com/blog/common-lisp-community-survey-2024-results/ "Common Lisp Community Survey 2024 Results"){.link-annotated-partial .id-not .include-annotation}** ## `“Functional Bits: Lambda Calculus Based Algorithmic Information Theory”, Tromp 2023`{=html} {#tromp-2023-section} **[`Functional Bits: Lambda Calculus based Algorithmic Information Theory`{=html}](https://tromp.github.io/cl/LC.pdf "'Functional Bits: Lambda Calculus based Algorithmic Information Theory', Tromp 2023"){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Peter Seibel’s Resume”, Seibel 2022`{=html} {#seibel-2022-section} **[`Peter Seibel’s Resume`{=html}](https://gigamonkeys.com/resume/ "'Peter Seibel’s Resume', Seibel 2022"){.link-annotated-partial .id-not .include-annotation}** ## `“An R7RS Compatible Module System for Termite Scheme”, Hamel & Feeley 2020`{=html} {#hamel-feeley-2020-section} **[`An R7RS Compatible Module System for Termite Scheme`{=html}](/doc/cs/lisp/2020-hamel.pdf "'An R7RS Compatible Module System for Termite Scheme', Hamel & Feeley 2020"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“MARKUP Provides a Reader-Macro to Read HTML Tags inside of Common Lisp Code”, Noronha 2019`{=html} {#noronha-2019-section} **[`MARKUP provides a reader-macro to read HTML tags inside of Common Lisp code`{=html}](https://github.com/moderninterpreters/markup "'MARKUP provides a reader-macro to read HTML tags inside of Common Lisp code', Noronha 2019"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“Collapsing Towers of Interpreters”, Amin & Rompf 2017`{=html} {#amin-rompf-2017-section} **[`Collapsing towers of interpreters`{=html}](/doc/cs/lisp/2017-amin.pdf "'Collapsing towers of interpreters', Amin & Rompf 2017"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Collapsing-Towers [Codebase for Amin & Rompf 2017]”, Amin & Rompf 2017`{=html} {#amin-rompf-2017-section} **[`collapsing-towers [codebase for Amin & Rompf 2017]`{=html}](https://github.com/TiarkRompf/collapsing-towers/tree/master/popl18 "'collapsing-towers [codebase for Amin & Rompf 2017]', Amin & Rompf 2017"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“Graphics Livecoding in Common Lisp”`{=html} {#_RkXX-Apt-section} **[`Graphics livecoding in Common Lisp`{=html}](https://kevingal.com/blog/cl-livecoding.html "Graphics livecoding in Common Lisp"){.link-annotated-partial .id-not .include-annotation}** ## `“SBCL: the Ultimate Assembly Code Breadboard”`{=html} {#_Xf96cKWi-section} **[`SBCL: the ultimate assembly code breadboard`{=html}](https://pvk.ca/Blog/2014/03/15/sbcl-the-ultimate-assembly-code-breadboard/ "SBCL: the ultimate assembly code breadboard"){.id-not .include-annotation}** ## `“Working With Generators—John Nash’s Cipherer”`{=html} {#_uoI-3TzX-section} **[`Working with generators—John Nash’s Cipherer`{=html}](https://blog.practical-scheme.net/gauche/20120715-nash-cipherer "Working with generators—John Nash’s Cipherer"){.id-not .include-annotation}** ## `“The International Obfuscated C Code Contest: 2012 ‘Most Functional’ Award”, Tromp 2012`{=html} {#tromp-2012-section} **[`The International Obfuscated C Code Contest: 2012 ‘Most functional’ Award`{=html}](https://www.ioccc.org/2012/tromp/ "'The International Obfuscated C Code Contest: 2012 ‘Most functional’ Award', Tromp 2012"){.link-annotated-partial .id-not .include-annotation}** ## `“Not Lisp Again…”, Marshall 2009`{=html} {#marshall-2009-section} **[`Not Lisp again…`{=html}](https://funcall.blogspot.com/2009/03/not-lisp-again.html "'Not Lisp again…', Marshall 2009"){.link-annotated-partial .id-not .include-annotation}** ## `“Common Lisp: The Untold Story”, Pitman 2008`{=html} {#pitman-2008-section} **[`Common Lisp: The Untold Story`{=html}](https://www.nhplace.com/kent/Papers/cl-untold-story.html "'Common Lisp: The Untold Story', Pitman 2008"){.link-annotated .id-not .include-annotation}** ## `“Open, Extensible Object Models”, Piumarta & Warth 2008`{=html} {#piumarta-warth-2008-section} **[`Open, Extensible Object Models`{=html}](/doc/cs/lisp/2008-piumarta.pdf "'Open, Extensible Object Models', Piumarta & Warth 2008"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“EDUCATIONAL PEARL: A Nanopass Framework for Compiler Education”, Sarkar et al 2005`{=html} {#sarkar-et-al-2005-section} **[`EDUCATIONAL PEARL: A Nanopass framework for compiler education`{=html}](/doc/cs/lisp/2005-sarkar.pdf "'EDUCATIONAL PEARL: A Nanopass framework for compiler education', Sarkar et al 2005"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Practical Common Lisp § 19. Beyond Exception Handling: Conditions and Restarts”, Seibel 2005`{=html} {#seibel-2005-section} **[`Practical Common Lisp § 19. Beyond Exception Handling: Conditions and Restarts`{=html}](https://gigamonkeys.com/book/beyond-exception-handling-conditions-and-restarts.html "'Practical Common Lisp § 19. Beyond Exception Handling: Conditions and Restarts', Seibel 2005"){.link-annotated-partial .id-not .include-annotation}** ## `“Some AI Koans”, Raymond 2003`{=html} {#raymond-2003-section} **[`Some AI Koans`{=html}](http://www.catb.org/jargon/html/koans.html "'Some AI Koans', Raymond 2003"){.link-annotated-partial .id-not .include-annotation link-icon="ESR" link-icon-type="text,tri,sans" link-icon-color="#0000ee"}** ## `“The Art of Unix Programming § The Right Size for an Editor”, Raymond 2003`{=html} {#raymond-2003-1-section} **[`The Art of Unix Programming § The Right Size for an Editor`{=html}](http://www.catb.org/~esr/writings/taoup/html/ch13s03.html "'The Art of Unix Programming § The Right Size for an Editor', Raymond 2003"){.link-annotated-partial .id-not .include-annotation link-icon="ESR" link-icon-type="text,tri,sans" link-icon-color="#0000ee"}** ## `“Software Fault Prevention by Language Choice: Why C Is Not My Favorite Language”, Fateman 2002`{=html} {#fateman-2002-section} **[`Software Fault Prevention by Language Choice: Why C is Not My Favorite Language`{=html}](/doc/cs/lisp/2002-fateman.pdf "'Software Fault Prevention by Language Choice: Why C is Not My Favorite Language', Fateman 2002"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Common Lisp in Web Based Applications”, Graham 2001`{=html} {#graham-2001-section} **[`Common Lisp in Web Based Applications`{=html}](/doc/cs/lisp/2001-04-paulgraham-bbnexcerpts-lispinwebbasedapplications.txt "'Common Lisp in Web Based Applications', Graham 2001"){.link-annotated-partial .id-not .include-annotation link-icon="txt" link-icon-type="svg"}** ## `“Evolution of Cooperative Problem Solving in an Artificial Economy”, Baum & Durdanovic 2000`{=html} {#baum-durdanovic-2000-section} **[`Evolution of Cooperative Problem Solving in an Artificial Economy`{=html}](/doc/reinforcement-learning/model-free/2000-baum.pdf "'Evolution of Cooperative Problem Solving in an Artificial Economy', Baum & Durdanovic 2000"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Duplication and Partial Evaluation: For a Better Understanding of Reflective Languages”, Asai et al 1996`{=html} {#asai-et-al-1996-section} **[`Duplication and partial evaluation: For a better understanding of reflective languages`{=html}](/doc/cs/lisp/1996-asai.pdf "'Duplication and partial evaluation: For a better understanding of reflective languages', Asai et al 1996"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Accelerating Hindsight: Lisp As a Vehicle for Rapid Prototyping”, Pitman 1994`{=html} {#pitman-1994-section} **[`Accelerating hindsight: Lisp as a vehicle for rapid prototyping`{=html}](/doc/cs/lisp/1994-pitman.pdf "'Accelerating hindsight: Lisp as a vehicle for rapid prototyping', Pitman 1994"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Oral History Interview With Terry Allen Winograd (OH #237) § SHRDLU”, Winograd & Norberg 1991 (page 7)`{=html} {#winograd-norberg-1991-page-7-section} **[`Oral History Interview with Terry Allen Winograd (OH #237) § SHRDLU`{=html}](/doc/ai/1991-winograd.pdf#page=7 "'Oral History Interview with Terry Allen Winograd (OH #237) § SHRDLU', Winograd & Norberg 1991 (page 7)"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Lisp: Good News, Bad News, How to Win Big [Worse Is Better]”, Gabriel 1991`{=html} {#gabriel-1991-section} **[`Lisp: Good News, Bad News, How to Win Big [Worse Is Better]`{=html}](https://www.dreamsongs.com/WIB.html "'Lisp: Good News, Bad News, How to Win Big [Worse Is Better]', Gabriel 1991"){.link-annotated-partial .id-not .include-annotation}** ## `“GNU Hyperbole”, Weiner 1989`{=html} {#weiner-1989-section} **[`GNU Hyperbole`{=html}](https://www.gnu.org/software/hyperbole/ "'GNU Hyperbole', Weiner 1989"){.link-annotated-partial .id-not .include-annotation}** ## `“Document Examiner: Delivery Interface for Hypertext Documents”, Walker 1987`{=html} {#walker-1987-section} **[`Document Examiner: delivery interface for hypertext documents`{=html}](/doc/cs/lisp/1987-walker.pdf "'Document Examiner: delivery interface for hypertext documents', Walker 1987"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“The Symbolics Ivory Processor: A 40 Bit Tagged Architecture Lisp Microprocessor”, Baker et al 1987`{=html} {#baker-et-al-1987-section} **[`The Symbolics Ivory Processor: A 40 Bit Tagged Architecture Lisp Microprocessor`{=html}](/doc/cs/hardware/1987-baker.pdf "'The Symbolics Ivory Processor: A 40 Bit Tagged Architecture Lisp Microprocessor', Baker et al 1987"){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Hashlife: Exploiting Regularities in Large Cellular Spaces”, Gosper 1984`{=html} {#gosper-1984-section} **[`Hashlife: Exploiting regularities in large cellular spaces`{=html}](/doc/cs/cellular-automaton/1984-gosper.pdf "'Hashlife: Exploiting regularities in large cellular spaces', Gosper 1984"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“A Retrospective on the Dorado, a High-Performance Personal Computer”, Pier 1983`{=html} {#pier-1983-section} **[`A Retrospective on the Dorado, a High-Performance Personal Computer`{=html}](https://bitsavers.trailing-edge.com/pdf/xerox/parc/techReports/ISL-83-1_A_Retrospective_on_the_Dorado_A_High-Performance_Personal_Computer.pdf "'A Retrospective on the Dorado, a High-Performance Personal Computer', Pier 1983"){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Procedural Reflection in Programming Languages”, Smith 1982`{=html} {#smith-1982-section} **[`Procedural Reflection in Programming Languages`{=html}](https://dspace.mit.edu/bitstream/handle/1721.1/15961/08995844-MIT.pdf?sequence=2&isAllowed=y "'Procedural Reflection in Programming Languages', Smith 1982"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Mutation Analysis Of Program Test Data”, Budd 1980`{=html} {#budd-1980-section} **[`Mutation Analysis Of Program Test Data`{=html}](/doc/cs/algorithm/1980-budd.pdf "'Mutation Analysis Of Program Test Data', Budd 1980"){.link-annotated .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** ## `“Shuffles, Bayes’ Theorem and Continuations.”`{=html} {#_SO70_tGf-section} **[`Shuffles, Bayes’ theorem and continuations.`{=html}](http://blog.sigfpe.com/2012/12/shuffles-bayes-theorem-and-continuations.html "Shuffles, Bayes’ theorem and continuations."){.link-annotated-partial .id-not .include-annotation link-icon="sgfp" link-icon-type="text,quad,mono"}** ## `“Ergonomics of the Symbolics Lisp Machine”`{=html} {#_zoe_XRp9-section} **[`Ergonomics of the Symbolics Lisp Machine`{=html}](http://lispm.de/symbolics-lisp-machine-ergonomics "Ergonomics of the Symbolics Lisp Machine"){.id-not .include-annotation}** ## `“Computers Doing The Right Thing”`{=html} {#_fGjqT6Fw-section} **[`Computers Doing The Right Thing`{=html}](https://amasad.me/right "Computers Doing The Right Thing"){.link-annotated-partial .id-not .include-annotation}** ## `“Restarts in Common Lisp”`{=html} {#_6-emfcfJ-section} **[`Restarts in Common Lisp`{=html}](https://blog.sulami.xyz/posts/common-lisp-restarts/ "Restarts in Common Lisp"){.link-annotated-partial .id-not .include-annotation}** ## `“Popularity”, Eich 2026`{=html} {#_qlc2ALZg-section} **[`Popularity`{=html}](https://brendaneich.com/2008/04/popularity/ "'Popularity', Eich 2026"){.id-not .include-annotation}** ## `“Paredit, a Visual Guide”`{=html} {#_K6gaSnj4-section} **[`Paredit, a Visual Guide`{=html}](https://calva.io/paredit/ "Paredit, a Visual Guide"){.id-not .include-annotation}** ## `“Introducing Coalton: How to Have Our (Typed) Cake and (Safely) Eat It Too, in Common Lisp”`{=html} {#_d_PmXHFi-section} **[`Introducing Coalton: How to Have Our (Typed) Cake and (Safely) Eat It Too, in Common Lisp`{=html}](https://coalton-lang.github.io/20211010-introducing-coalton/ "Introducing Coalton: How to Have Our (Typed) Cake and (Safely) Eat It Too, in Common Lisp"){.link-annotated-partial .id-not .include-annotation}** ## `“Pollen § 3. Backstory”, Butterick 2026`{=html} {#_Lcy4XWjR-section} **[`Pollen § 3. Backstory`{=html}](https://docs.racket-lang.org/pollen/Backstory.html "'Pollen § 3. Backstory', Butterick 2026"){.link-annotated-partial .id-not .include-annotation}** ## `“TemplatedPL: A Lisp Interpreter Written in C++ Template”, Cheukyin 2026`{=html} {#_SfCjAHP6-section} **[`TemplatedPL: A Lisp Interpreter Written in C++ Template`{=html}](https://github.com/Cheukyin/TemplatedPL "'TemplatedPL: A Lisp Interpreter Written in C++ Template', Cheukyin 2026"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“SquircleSpace/shcl: SHell in Common Lisp”`{=html} {#_wgmfyize-section} **[`SquircleSpace/shcl: SHell in Common Lisp`{=html}](https://github.com/SquircleSpace/shcl "SquircleSpace/shcl: SHell in Common Lisp"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“icl (Interactive Common Lisp): an Enhanced REPL”, atgreen 2026`{=html} {#_1GZpcZxO-section} **[`icl (Interactive Common Lisp): an enhanced REPL`{=html}](https://github.com/atgreen/icl "'icl (Interactive Common Lisp): an enhanced REPL', atgreen 2026"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“MalbolgeLisp Is a LISP Interpreter Written in Malbolge. It’s (As of 2020 and 2021), the Most Advanced, Usable Malbolge Program Ever Created. It Supports Everything Lisps Generally Tend to Support (Like cond, let, lambda, Etc…).”`{=html} {#_gzzDeFyr-section} **[`MalbolgeLisp is a LISP interpreter written in Malbolge. It’s (as of 2020 and 2021), the most advanced, usable Malbolge program ever created. It supports everything Lisps generally tend to support (like cond, let, lambda, etc…).`{=html}](https://github.com/kspalaiologos/malbolge-lisp "MalbolgeLisp is a LISP interpreter written in Malbolge. It’s (as of 2020 and 2021), the most advanced, usable Malbolge program ever created. It supports everything Lisps generally tend to support (like cond, let, lambda, etc…)."){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“unix-In-Lisp: Mount Unix System into Common Lisp Image”`{=html} {#_0AltQ4Yw-section} **[`unix-in-lisp: Mount Unix system into Common Lisp image`{=html}](https://github.com/neomacs-project/unix-in-lisp "unix-in-lisp: Mount Unix system into Common Lisp image"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“Rogue-Like That Rewrites Itself in a Lisp Each Run”, nooga 2026`{=html} {#_TiaIvkkn-section} **[`Rogue-like that rewrites itself in a Lisp each run`{=html}](https://github.com/nooga/xsofy "'Rogue-like that rewrites itself in a Lisp each run', nooga 2026"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“ZickStandardLisp: Lisp Evaluator in the LIsp for Zick’s Lisp Implementations”, zick 2026`{=html} {#_sY4bVkuy-section} **[`ZickStandardLisp: Lisp evaluator in the LIsp for Zick’s Lisp implementations`{=html}](https://github.com/zick/ZickStandardLisp "'ZickStandardLisp: Lisp evaluator in the LIsp for Zick’s Lisp implementations', zick 2026"){.link-annotated-partial .id-not .include-annotation link-icon="github" link-icon-type="svg"}** ## `“Y-Combinator Codex”`{=html} {#_1N2hDiIu-section} **[`Y-combinator codex`{=html}](https://gitlab.com/emacsomancer/ycombinator-codex "Y-combinator codex"){.id-not .include-annotation}** ## `“Upper Limits of Common Lisp [On the Norwegian Oil Industry]”`{=html} {#_n7ZShvb6-section} **[`Upper limits of Common Lisp [on the Norwegian oil industry]`{=html}](https://groups.google.com/g/comp.lang.lisp/c/wj79WtYilg8/m/DyIvUbdPsrMJ "Upper limits of Common Lisp [on the Norwegian oil industry]"){.id-not .include-annotation link-icon="✉" link-icon-type="text" link-icon-color="#4285f4"}** ## `“Lambda Calculus in 383 Bytes”`{=html} {#_N_3wU43C-section} **[`Lambda Calculus in 383 Bytes`{=html}](https://justine.lol/lambda/ "Lambda Calculus in 383 Bytes"){.link-annotated-partial .id-not .include-annotation}** ## `“LISP With GC in 436 Bytes”`{=html} {#_7VwnvNkk-section} **[`LISP with GC in 436 bytes`{=html}](https://justine.lol/sectorlisp2/ "LISP with GC in 436 bytes"){.id-not .include-annotation}** ## `“Writing a Truth Oracle in Lisp”`{=html} {#_uYwrPDRm-section} **[`Writing a truth oracle in Lisp`{=html}](https://lambda-cove.net/posts/truth-oracle-lisp/ "Writing a truth oracle in Lisp"){.link-annotated-partial .id-not .include-annotation}** ## `“MacroPy3: Syntactic Macros for Python3 ASTs”`{=html} {#_ULZWldqF-section} **[`MacroPy3: syntactic macros for Python3 ASTs`{=html}](https://macropy3.readthedocs.io/en/latest/ "MacroPy3: syntactic macros for Python3 ASTs"){.id-not .include-annotation}** ## `“I Built a Scheme Compiler With Claude AI in 4 Days”, Phillips 2026`{=html} {#_-qte-BMl-section} **[`I Built a Scheme Compiler with Claude AI in 4 Days`{=html}](https://matthewphillips.info/programming/posts/i-built-a-scheme-compiler-with-ai/ "'I Built a Scheme Compiler with Claude AI in 4 Days', Phillips 2026"){.link-annotated-partial .id-not .include-annotation}** ## `“The Y Combinator Codex”`{=html} {#_6TGc7sm0-section} **[`The Y Combinator Codex`{=html}](https://phoe.github.io/codex.html "The Y Combinator Codex"){.link-annotated-partial .id-not .include-annotation}** ## `“LIL: CLOS Reaches Higher-Order, Sheds Identity, and Has a Transformative Experience”`{=html} {#_s6SNz8SH-section} **[`LIL: CLOS reaches higher-order, sheds identity, and has a transformative experience`{=html}](https://research.google/pubs/lil-clos-reaches-higher-order-sheds-identity-and-has-a-transformative-experience/ "LIL: CLOS reaches higher-order, sheds identity, and has a transformative experience"){.id-not .include-annotation link-icon="alphabet" link-icon-type="svg" link-icon-color="#4285f4"}** ## `“Parinfer: Simpler Lisp Editing”`{=html} {#_PtUU5RKa-section} **[`Parinfer: simpler Lisp editing`{=html}](https://shaunlebron.github.io/parinfer/ "Parinfer: simpler Lisp editing"){.link-annotated-partial .id-not .include-annotation}** ## `“Cirkoban: Sokoban Meets Cellular Automata Written in Scheme”`{=html} {#_0879BAU1-section} **[`Cirkoban: Sokoban meets cellular automata written in Scheme`{=html}](https://spritely.institute/news/cirkoban-sokoban-meets-cellular-automata-written-in-scheme.html "Cirkoban: Sokoban meets cellular automata written in Scheme"){.link-annotated-partial .id-not .include-annotation}** ## `“Lisp64k”`{=html} {#_u-RVirGA-section} **[`lisp64k`{=html}](https://t3x.org/lisp64k/index.html "lisp64k"){.link-annotated-partial .id-not .include-annotation}** ## `“Binary Lambda Calculus”, Tromp 2026`{=html} {#_RUCY7Lhh-section} **[`Binary Lambda Calculus`{=html}](https://tromp.github.io/cl/Binary_lambda_calculus.html "'Binary Lambda Calculus', Tromp 2026"){.link-annotated-partial .id-not .include-annotation}** ## `“Eschewing Zshell for Emacs Shell”`{=html} {#_kR6Ib7lP-section} **[`Eschewing Zshell for Emacs Shell`{=html}](https://www.howardism.org/Technical/Emacs/eshell-fun.html "Eschewing Zshell for Emacs Shell"){.link-annotated-partial .id-not .include-annotation}** ## `“Common Lisp Screenshots”`{=html} {#_rq26Dz4d-section} **[`Common Lisp Screenshots`{=html}](https://www.lisp-screenshots.org/ "Common Lisp Screenshots"){.id-not .include-annotation}** ## `“Inline Previous Result and Why You Should Edebug”`{=html} {#_NKGF2v5M-section} **[`Inline previous result and why you should edebug`{=html}](https://xenodium.com/inline-previous-result-and-why-you-should-edebug/ "Inline previous result and why you should edebug"){.link-annotated-partial .id-not .include-annotation}** ## `“‘It’s Done in Hardware so It’s Cheap’”`{=html} {#_v6GbZZTV-section} **[`‘It’s done in hardware so it’s cheap’`{=html}](https://yosefk.com/blog/its-done-in-hardware-so-its-cheap.html "‘It’s done in hardware so it’s cheap’"){.link-annotated-partial .id-not .include-annotation}** ## `“Zyme—An Evolvable Language”`{=html} {#_XMzzrrFU-section} **[`Zyme—an evolvable language`{=html}](https://zyme.dev/ "Zyme—an evolvable language"){.link-annotated-partial .id-not .include-annotation}** ## Sort By Magic ::: {demo-type="sort-by-magic-preface"} Annotations sorted by machine learning into [inferred \'tags\'](/design#future-tag-features){#gwern-design--future-tag-features .link-annotated-partial}. This provides an alternative way to browse: instead of by *date* order, one can browse in *topic* order. The \'sorted\' list has been automatically clustered into multiple sections & auto-labeled for easier browsing. Beginning with the newest annotation, it uses the embedding of each annotation to attempt to create a list of nearest-neighbor annotations, creating a progression of topics. For more details, see the link. ::: ### `self-tagging-trading-tools` {.collapse title="Machine-generated tag name for the following cluster of links."} [\[see previous entry\]](#henry-minsky-2025-section){.include .include-even-when-collapsed} [\[see previous entry\]](#melançon-et-al-2024-section){.include .include-even-when-collapsed} ### `cooperative-economy` {.collapse title="Machine-generated tag name for the following cluster of links."} [\[see previous entry\]](#gosper-1984-section){.include .include-even-when-collapsed} [\[see previous entry\]](#baum-durdanovic-2000-section){.include .include-even-when-collapsed} ### `lisp-historical lisp-prototyping lisp-analysis reflective-languages meta-object reflective-systems lisp-historical` {.collapse title="Machine-generated tag name for the following cluster of links."} [\[see previous entry\]](#budd-1980-section){.include .include-even-when-collapsed} [\[see previous entry\]](#fateman-2002-section){.include .include-even-when-collapsed} [\[see previous entry\]](#pitman-1994-section){.include .include-even-when-collapsed} [\[see previous entry\]](#pitman-2008-section){.include .include-even-when-collapsed} [\[see previous entry\]](#smith-1982-section){.include .include-even-when-collapsed} [\[see previous entry\]](#asai-et-al-1996-section){.include .include-even-when-collapsed} [\[see previous entry\]](#amin-rompf-2017-section){.include .include-even-when-collapsed} [\[see previous entry\]](#piumarta-warth-2008-section){.include .include-even-when-collapsed} [\[see previous entry\]](#marshall-2026-section){.include .include-even-when-collapsed} [\[see previous entry\]](#hamel-feeley-2020-section){.include .include-even-when-collapsed} [\[see previous entry\]](#sarkar-et-al-2005-section){.include .include-even-when-collapsed} [\[see previous entry\]](#walker-1987-section){.include .include-even-when-collapsed} [\[see previous entry\]](#winograd-norberg-1991-page-7-section){.include .include-even-when-collapsed} [\[see previous entry\]](#lane-et-al-2025-section){.include .include-even-when-collapsed} ## Wikipedia (34) {#titled-links-wikipedia .collapse} 1. **[`Advice (programming)`{=html}](https://en.wikipedia.org/wiki/Advice_(programming) "Advice (programming)"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Advice_(programming)`](https://en.wikipedia.org/wiki/Advice_(programming) "Advice (programming)"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 2. **[`Allegro Common Lisp`{=html}](https://en.wikipedia.org/wiki/Allegro_Common_Lisp "Allegro Common Lisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Allegro_Common_Lisp`](https://en.wikipedia.org/wiki/Allegro_Common_Lisp "Allegro Common Lisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 3. **[`Brian Cantwell Smith`{=html}](https://en.wikipedia.org/wiki/Brian_Cantwell_Smith "Brian Cantwell Smith"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Brian_Cantwell_Smith`](https://en.wikipedia.org/wiki/Brian_Cantwell_Smith "Brian Cantwell Smith"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 4. **[`Canonical S-expressions`{=html}](https://en.wikipedia.org/wiki/Canonical_S-expressions "Canonical S-expressions"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Canonical_S-expressions`](https://en.wikipedia.org/wiki/Canonical_S-expressions "Canonical S-expressions"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 5. **[`Closure (computer programming)`{=html}](https://en.wikipedia.org/wiki/Closure_(computer_programming) "Closure (computer programming)"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 6. **[`Common Lisp Object System`{=html}](https://en.wikipedia.org/wiki/Common_Lisp_Object_System "Common Lisp Object System"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Common_Lisp_Object_System`](https://en.wikipedia.org/wiki/Common_Lisp_Object_System "Common Lisp Object System"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 7. **[`Common Lisp the Language`{=html}](https://en.wikipedia.org/wiki/Common_Lisp_the_Language "Common Lisp the Language"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Common_Lisp_the_Language`](https://en.wikipedia.org/wiki/Common_Lisp_the_Language "Common Lisp the Language"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 8. **[`Continuation`{=html}](https://en.wikipedia.org/wiki/Continuation "Continuation"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 9. **[`Emacspeak`{=html}](https://en.wikipedia.org/wiki/Emacspeak "Emacspeak"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Emacspeak`](https://en.wikipedia.org/wiki/Emacspeak "Emacspeak"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 10. **[`GNU Guile`{=html}](https://en.wikipedia.org/wiki/GNU_Guile "GNU Guile"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/GNU_Guile`](https://en.wikipedia.org/wiki/GNU_Guile "GNU Guile"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 11. **[`Game Oriented Assembly Lisp`{=html}](https://en.wikipedia.org/wiki/Game_Oriented_Assembly_Lisp "Game Oriented Assembly Lisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Game_Oriented_Assembly_Lisp`](https://en.wikipedia.org/wiki/Game_Oriented_Assembly_Lisp "Game Oriented Assembly Lisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 12. **[`Greenspun’s tenth rule`{=html}](https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule "Greenspun’s tenth rule"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 13. **[`Hal Abelson`{=html}](https://en.wikipedia.org/wiki/Hal_Abelson "Hal Abelson"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 14. **[`Higher-order function`{=html}](https://en.wikipedia.org/wiki/Higher-order_function "Higher-order function"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 15. **[`Lazy evaluation`{=html}](https://en.wikipedia.org/wiki/Lazy_evaluation "Lazy evaluation"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 16. **[`MIT Computer Science and Artificial Intelligence Laboratory`{=html}](https://en.wikipedia.org/wiki/MIT_Computer_Science_and_Artificial_Intelligence_Laboratory "MIT Computer Science and Artificial Intelligence Laboratory"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 17. **[`Maclisp`{=html}](https://en.wikipedia.org/wiki/Maclisp "Maclisp"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 18. **[`Meta-circular evaluator`{=html}](https://en.wikipedia.org/wiki/Meta-circular_evaluator "Meta-circular evaluator"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Meta-circular_evaluator`](https://en.wikipedia.org/wiki/Meta-circular_evaluator "Meta-circular evaluator"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 19. **[`Metaobject`{=html}](https://en.wikipedia.org/wiki/Metaobject "Metaobject"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Metaobject`](https://en.wikipedia.org/wiki/Metaobject "Metaobject"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 20. **[`NoteCards`{=html}](https://en.wikipedia.org/wiki/NoteCards "NoteCards"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/NoteCards`](https://en.wikipedia.org/wiki/NoteCards "NoteCards"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 21. **[`PDP-11`{=html}](https://en.wikipedia.org/wiki/PDP-11 "PDP-11"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 22. **[`PicoLisp`{=html}](https://en.wikipedia.org/wiki/PicoLisp "PicoLisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/PicoLisp`](https://en.wikipedia.org/wiki/PicoLisp "PicoLisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 23. **[`Planning Domain Definition Language`{=html}](https://en.wikipedia.org/wiki/Planning_Domain_Definition_Language "Planning Domain Definition Language"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 24. **[`Reflective programming`{=html}](https://en.wikipedia.org/wiki/Reflective_programming "Reflective programming"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Reflective_programming`](https://en.wikipedia.org/wiki/Reflective_programming "Reflective programming"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 25. **[`Rete expert-system algorithm`{=html}](https://en.wikipedia.org/wiki/Rete_algorithm "Rete expert-system algorithm"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 26. **[`S-expression`{=html}](https://en.wikipedia.org/wiki/S-expression "S-expression"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 27. **[`SLIME`{=html}](https://en.wikipedia.org/wiki/SLIME "SLIME"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/SLIME`](https://en.wikipedia.org/wiki/SLIME "SLIME"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 28. **[`Scheme (programming language)`{=html}](https://en.wikipedia.org/wiki/Scheme_(programming_language) "Scheme (programming language)"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 29. **[`Space-cadet keyboard`{=html}](https://en.wikipedia.org/wiki/Space-cadet_keyboard "Space-cadet keyboard"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Space-cadet_keyboard`](https://en.wikipedia.org/wiki/Space-cadet_keyboard "Space-cadet keyboard"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 30. **[`Spice Lisp`{=html}](https://en.wikipedia.org/wiki/Spice_Lisp "Spice Lisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Spice_Lisp`](https://en.wikipedia.org/wiki/Spice_Lisp "Spice Lisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 31. **[`Steel Bank Common Lisp`{=html}](https://en.wikipedia.org/wiki/Steel_Bank_Common_Lisp "Steel Bank Common Lisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/Steel_Bank_Common_Lisp`](https://en.wikipedia.org/wiki/Steel_Bank_Common_Lisp "Steel Bank Common Lisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 32. **[`StumpWM`{=html}](https://en.wikipedia.org/wiki/StumpWM "StumpWM"){.link-annotated-partial .id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** 33. **[`The Art of the Metaobject Protocol`{=html}](https://en.wikipedia.org/wiki/The_Art_of_the_Metaobject_Protocol "The Art of the Metaobject Protocol"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/The_Art_of_the_Metaobject_Protocol`](https://en.wikipedia.org/wiki/The_Art_of_the_Metaobject_Protocol "The Art of the Metaobject Protocol"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: 34. **[`VAX Common Lisp`{=html}](https://en.wikipedia.org/wiki/VAX_Common_Lisp "VAX Common Lisp"){.id-not .include-annotation link-icon="wikipedia" link-icon-type="svg"}** ::: aux-links-transclude-file [`https://en.wikipedia.org/wiki/VAX_Common_Lisp`](https://en.wikipedia.org/wiki/VAX_Common_Lisp "VAX Common Lisp"){.id-not .include-content include-template="$annotationFileIncludeTemplate"} ::: # Miscellaneous - **[`/doc/cs/lisp/1994-binstock-lucidlost.pdf`{=html}](/doc/cs/lisp/1994-binstock-lucidlost.pdf){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** - **[`/doc/cs/lisp/1988-borenstein.pdf`{=html}](/doc/cs/lisp/1988-borenstein.pdf){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** - **[`/doc/cs/lisp/1988-walker-figure4-symbolicsdocumentexaminerscreen-demonstrationofbrowsingwithcurrentcandidatesbookmarksandcommands.png`{=html}](/doc/cs/lisp/1988-walker-figure4-symbolicsdocumentexaminerscreen-demonstrationofbrowsingwithcurrentcandidatesbookmarksandcommands.png){.link-annotated-partial .id-not .include-annotation link-icon="image" link-icon-type="svg"}** - **[`/doc/cs/lisp/1988-walker-figure5-overviewwindowindocumentexaminerforsymbolicschatclientconverse.jpg`{=html}](/doc/cs/lisp/1988-walker-figure5-overviewwindowindocumentexaminerforsymbolicschatclientconverse.jpg){.link-annotated-partial .id-not .include-annotation link-icon="image" link-icon-type="svg"}** - **[`/doc/cs/lisp/1987-moon.pdf`{=html}](/doc/cs/lisp/1987-moon.pdf){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** - **[`/doc/cs/lisp/1986-bobrow.pdf`{=html}](/doc/cs/lisp/1986-bobrow.pdf){.link-annotated-partial .id-not .include-annotation link-icon="pdf" link-icon-type="svg" link-icon-color="#f40f02"}** - **[`http://anggtwu.net/eepitch.html`{=html}](http://anggtwu.net/eepitch.html){.id-not .include-annotation}** - **[`http://pt.withy.org/publications/VLM.html`{=html}](http://pt.withy.org/publications/VLM.html){.id-not .include-annotation}** - **[`https://awkravchuk.itch.io/cl-fast-ecs/devlog/622054/gamedev-in-lisp-part-1-ecs-and-metalinguistic-abstraction`{=html}](https://awkravchuk.itch.io/cl-fast-ecs/devlog/622054/gamedev-in-lisp-part-1-ecs-and-metalinguistic-abstraction){.link-annotated-partial .id-not .include-annotation}** - **[`https://borretti.me/article/astronomical-calculations-for-hard-sf-common-lisp`{=html}](https://borretti.me/article/astronomical-calculations-for-hard-sf-common-lisp "Borretti 2026"){.link-annotated-partial .id-not .include-annotation}** - **[`https://corecursive.com/lisp-in-space-with-ron-garret/#deep-space-failure`{=html}](https://corecursive.com/lisp-in-space-with-ron-garret/#deep-space-failure){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML (80MB)**: [`/doc/www/corecursive.com/5b40ba31c1eef9b6ef16b71a63e691fce9e609b7.html#deep-space-failure`](/doc/www/corecursive.com/5b40ba31c1eef9b6ef16b71a63e691fce9e609b7.html#deep-space-failure){.id-not .link-annotated-not .include-content .include-lazy link-icon="internet-archive" link-icon-type="svg"} ::: ::: - **[`https://coredumped.dev/2023/08/09/text-showdown-gap-buffers-vs-ropes/`{=html}](https://coredumped.dev/2023/08/09/text-showdown-gap-buffers-vs-ropes/){.id-not .include-annotation}** - **[`https://dl.acm.org/doi/pdf/10.1145/234286.1057818`{=html}](https://dl.acm.org/doi/pdf/10.1145/234286.1057818){.id-not .include-annotation link-icon="acm" link-icon-type="text,tri,sans" link-icon-color="#3795c4"}** - **[`https://dl.acm.org/doi/pdf/10.1145/3386324`{=html}](https://dl.acm.org/doi/pdf/10.1145/3386324){.link-annotated-partial .id-not .include-annotation link-icon="acm" link-icon-type="text,tri,sans" link-icon-color="#3795c4"}** - **[`https://erkin.party/blog/200715/evolution/`{=html}](https://erkin.party/blog/200715/evolution/){.link-annotated-partial .id-not .include-annotation}** - **[`https://flownet.com/gat/jpl-lisp.html`{=html}](https://flownet.com/gat/jpl-lisp.html){.id-not .include-annotation}** - **[`https://github.com/azzamsa/awesome-lisp-companies/?tab=readme-ov-file#awesome-lisp-company`{=html}](https://github.com/azzamsa/awesome-lisp-companies/?tab=readme-ov-file#awesome-lisp-company){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`/doc/www/github.com/9b46edf62705a7da52d604bc7115f1f3fa5b5e2e.html#awesome-lisp-company`](/doc/www/github.com/9b46edf62705a7da52d604bc7115f1f3fa5b5e2e.html#awesome-lisp-company){.id-not .link-annotated-not .include-content .include-lazy link-icon="github" link-icon-type="svg"} ::: ::: - **[`https://github.com/jrblevin/markdown-mode`{=html}](https://github.com/jrblevin/markdown-mode){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** - **[`https://github.com/saman-pasha/cicili/`{=html}](https://github.com/saman-pasha/cicili/){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** - **[`https://github.com/shaunlebron/history-of-lisp-parens/blob/master/editors.md`{=html}](https://github.com/shaunlebron/history-of-lisp-parens/blob/master/editors.md){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** - **[`https://github.com/yoshiki/yaml-mode`{=html}](https://github.com/yoshiki/yaml-mode){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** - **[`https://github.com/ywkim/gpt-commit`{=html}](https://github.com/ywkim/gpt-commit){.id-not .include-annotation link-icon="github" link-icon-type="svg"}** - **[`https://google.github.io/styleguide/lispguide.xml`{=html}](https://google.github.io/styleguide/lispguide.xml){.link-annotated-partial .id-not .include-annotation link-icon="alphabet" link-icon-type="svg" link-icon-color="#4285f4"}** - **[`https://huggingface.co/spaces/mullikine/ilambda`{=html}](https://huggingface.co/spaces/mullikine/ilambda){.id-not .include-annotation link-icon="🤗" link-icon-type="text" link-icon-color="#ffcc4d"}** - **[`https://ianthehenry.com/posts/generalized-macros/`{=html}](https://ianthehenry.com/posts/generalized-macros/){.link-annotated-partial .id-not .include-annotation}** - **[`https://ianthehenry.com/posts/my-kind-of-repl/`{=html}](https://ianthehenry.com/posts/my-kind-of-repl/){.id-not .include-annotation}** - **[`https://interlisp.org/history/timeline/#1970`{=html}](https://interlisp.org/history/timeline/#1970){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`/doc/www/interlisp.org/ff6b23ae00417901b749926458d3bd8a2462b81f.html#1970`](/doc/www/interlisp.org/ff6b23ae00417901b749926458d3bd8a2462b81f.html#1970){.id-not .link-annotated-not .include-content .include-lazy link-icon="internet-archive" link-icon-type="svg"} ::: ::: - **[`https://karthinks.com/software/a-consistent-structural-editing-interface/`{=html}](https://karthinks.com/software/a-consistent-structural-editing-interface/){.link-annotated-partial .id-not .include-annotation}** - **[`https://karthinks.com/software/latex-input-for-impatient-scholars/`{=html}](https://karthinks.com/software/latex-input-for-impatient-scholars/){.id-not .include-annotation}** - **[`https://lisp-journey.gitlab.io/blog/these-years-in-common-lisp-2022-in-review/`{=html}](https://lisp-journey.gitlab.io/blog/these-years-in-common-lisp-2022-in-review/){.id-not .include-annotation}** - **[`https://lispy.wordpress.com/category/scheme/`{=html}](https://lispy.wordpress.com/category/scheme/){.link-annotated-partial .id-not .include-annotation}** - **[`https://lukasatkinson.de/2015/mopping-it-up/`{=html}](https://lukasatkinson.de/2015/mopping-it-up/){.link-annotated-partial .id-not .include-annotation}** - **[`https://malisper.me/debugging-lisp-part-1-recompilation/`{=html}](https://malisper.me/debugging-lisp-part-1-recompilation/){.id-not .include-annotation}** - **[`https://malisper.me/debugging-lisp-part-2-inspecting/`{=html}](https://malisper.me/debugging-lisp-part-2-inspecting/){.id-not .include-annotation}** - **[`https://malisper.me/debugging-lisp-part-3-redefining-classes/`{=html}](https://malisper.me/debugging-lisp-part-3-redefining-classes/){.id-not .include-annotation}** - **[`https://malisper.me/debugging-lisp-part-4-restarts/`{=html}](https://malisper.me/debugging-lisp-part-4-restarts/){.id-not .include-annotation}** - **[`https://mprove.de/visionreality/text/2.1.7_concordia.html`{=html}](https://mprove.de/visionreality/text/2.1.7_concordia.html){.link-annotated-partial .id-not .include-annotation}** - **[`https://netzhansa.blogspot.com/2018/08/evaluating-vax-lisp-30.html`{=html}](https://netzhansa.blogspot.com/2018/08/evaluating-vax-lisp-30.html){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`https://netzhansa.blogspot.com/2018/08/evaluating-vax-lisp-30.html`](https://netzhansa.blogspot.com/2018/08/evaluating-vax-lisp-30.html){.id-not .link-annotated-not .include-content .include-lazy} ::: ::: - **[`https://parenscript.common-lisp.dev/`{=html}](https://parenscript.common-lisp.dev/){.link-annotated-partial .id-not .include-annotation}** - **[`https://project-mage.org/`{=html}](https://project-mage.org/){.link-annotated-partial .id-not .include-annotation}** - **[`https://sites.google.com/site/steveyegge2/tour-de-babel#h.p_ID_191`{=html}](https://sites.google.com/site/steveyegge2/tour-de-babel#h.p_ID_191){.id-not .include-annotation link-icon="alphabet" link-icon-type="svg" link-icon-color="#4285f4"}** ::: aux-links-transclude-file ::: collapse **View page**: [`/doc/www/sites.google.com/7f3adb25404c1c3fa7d4f956e808d63de437c105.html#h.p_ID_191`](/doc/www/sites.google.com/7f3adb25404c1c3fa7d4f956e808d63de437c105.html#h.p_ID_191){.id-not .link-annotated-not .include-content .include-lazy link-icon="alphabet" link-icon-type="svg" link-icon-color="#4285f4"} ::: ::: - **[`https://spritely.institute/news/hoot-wireworld-live-in-browser.html`{=html}](https://spritely.institute/news/hoot-wireworld-live-in-browser.html){.id-not .include-annotation}** - **[`https://stevelosh.com/blog/2018/08/a-road-to-common-lisp/`{=html}](https://stevelosh.com/blog/2018/08/a-road-to-common-lisp/){.link-annotated-partial .id-not .include-annotation}** - **[`https://stevelosh.com/blog/2021/03/small-common-lisp-cli-programs/`{=html}](https://stevelosh.com/blog/2021/03/small-common-lisp-cli-programs/){.id-not .include-annotation}** - **[`https://susam.net/maze/elisp-in-replacement-string.html`{=html}](https://susam.net/maze/elisp-in-replacement-string.html){.link-annotated-partial .id-not .include-annotation}** - **[`https://through-the-interface.typepad.com/through_the_interface/2008/09/an-interview--1.html`{=html}](https://through-the-interface.typepad.com/through_the_interface/2008/09/an-interview--1.html){.id-not .include-annotation}** - **[`https://tony-zorman.com/posts/my-phd-workflow.html`{=html}](https://tony-zorman.com/posts/my-phd-workflow.html "Zorman 2026"){.link-annotated-partial .id-not .include-annotation}** - **[`https://vanemden.wordpress.com/2014/06/18/how-recursion-got-into-programming-a-comedy-of-errors-3/`{=html}](https://vanemden.wordpress.com/2014/06/18/how-recursion-got-into-programming-a-comedy-of-errors-3/){.link-annotated-partial .id-not .include-annotation}** - **[`https://web.archive.org/web/20211106160816/https://ambrevar.xyz/lisp-repl-shell/index.html`{=html}](https://web.archive.org/web/20211106160816/https://ambrevar.xyz/lisp-repl-shell/index.html){.link-annotated-partial .id-not .include-annotation link-icon="internet-archive" link-icon-type="svg"}** - **[`https://www.flycheck.org/en/latest/`{=html}](https://www.flycheck.org/en/latest/){.link-annotated-partial .id-not .include-annotation}** - **[`https://www.nhplace.com/kent/Papers/Condition-Handling-2001.html`{=html}](https://www.nhplace.com/kent/Papers/Condition-Handling-2001.html){.id-not .include-annotation}** - **[`https://www.stylewarning.com/posts/brute-force-rubiks-cube/#brute-force-still-ignorant-but-kinda-smart`{=html}](https://www.stylewarning.com/posts/brute-force-rubiks-cube/#brute-force-still-ignorant-but-kinda-smart){.id-not .include-annotation}** ::: aux-links-transclude-file ::: collapse **View HTML**: [`/doc/www/www.stylewarning.com/225fbb0da219da552f563282bfda77459af4761f.html#brute-force-still-ignorant-but-kinda-smart`](/doc/www/www.stylewarning.com/225fbb0da219da552f563282bfda77459af4761f.html#brute-force-still-ignorant-but-kinda-smart){.id-not .link-annotated-not .include-content .include-lazy link-icon="internet-archive" link-icon-type="svg"} ::: ::: - **[`https://www.youtube.com/watch?v=72y2EC5fkcE`{=html}](https://www.youtube.com/watch?v=72y2EC5fkcE){.id-not .include-annotation link-icon="youtube" link-icon-type="svg" link-icon-color="#ff0033"}** ::: aux-links-transclude-file [`https://www.youtube.com/watch?v=72y2EC5fkcE`](https://www.youtube.com/watch?v=72y2EC5fkcE){.link-annotated-not .include-content .width-full} ::: - **[`https://www.youtube.com/watch?v=urcL86UpqZc`{=html}](https://www.youtube.com/watch?v=urcL86UpqZc){.id-not .include-annotation link-icon="youtube" link-icon-type="svg" link-icon-color="#ff0033"}** ::: aux-links-transclude-file [`https://www.youtube.com/watch?v=urcL86UpqZc`](https://www.youtube.com/watch?v=urcL86UpqZc){.link-annotated-not .include-content .width-full} ::: - **[`https://x.com/ShriramKMurthi/status/1672713972951179264`{=html}](https://x.com/ShriramKMurthi/status/1672713972951179264 "ShriramKMurthi 2026"){.link-annotated-partial .id-not .include-annotation link-icon="twitter" link-icon-type="svg" link-icon-color="#1da1f2"}** - **[`https://x.com/stylewarning/status/2076786798479733128`{=html}](https://x.com/stylewarning/status/2076786798479733128 "stylewarning 2026"){.id-not .include-annotation link-icon="twitter" link-icon-type="svg" link-icon-color="#1da1f2"}** ::: aux-links-transclude-file [`https://x.com/stylewarning/status/2076786798479733128`](https://x.com/stylewarning/status/2076786798479733128 "stylewarning 2026"){.id-not .include-content} ::: # Bibliography {#link-bibliography-section} 1. `https://arxiv.org/abs/2501.06707`: [`“ELIZA Reanimated: The World’s First Chatbot Restored on the World’s First Time Sharing System”`{=html}](https://arxiv.org/abs/2501.06707 "'ELIZA Reanimated: The world’s first chatbot restored on the world’s first time sharing system', Lane et al 2025"){#lane-et-al-2025 .link-annotated}, [Rupert Lane, Anthony Hay, Arthur Schwarz[, [David M. Berry](https://en.wikipedia.org/wiki/David_M._Berry "David M. Berry"){.id-not}, Jeff Shrager]{.collapse}]{.author} [[link-bibliography](/metadata/annotation/link-bibliography/https%253A%252F%252Farxiv.org%252Fabs%252F2501.06707.html "Directory-tag link-bibliography for link https://arxiv.org/abs/2501.06707"){.id-not .include-even-when-collapsed}]{.collapse .tag-index-link-bibliography-block} 2. `2020-hamel.pdf`: [`“An R7RS Compatible Module System for Termite Scheme”`{=html}](/doc/cs/lisp/2020-hamel.pdf "'An R7RS Compatible Module System for Termite Scheme', Hamel & Feeley 2020"){#hamel-feeley-2020 .link-annotated}, [Frédéric Hamel, Marc Feeley]{.author} [[link-bibliography](/metadata/annotation/link-bibliography/%252Fdoc%252Fcs%252Flisp%252F2020-hamel.pdf.html "Directory-tag link-bibliography for link /doc/cs/lisp/2020-hamel.pdf"){.id-not .include-even-when-collapsed}]{.collapse .tag-index-link-bibliography-block} 3. `1991-winograd.pdf#page=7`: [`“Oral History Interview With Terry Allen Winograd (OH #237) § SHRDLU”`{=html}](/doc/ai/1991-winograd.pdf#page=7 "'Oral History Interview with Terry Allen Winograd (OH #237) § SHRDLU', Winograd & Norberg 1991 (page 7)"){#winograd-norberg-1991-page-7 .link-annotated}, [[Terry Allen Winograd](https://en.wikipedia.org/wiki/Terry_Allen_Winograd "Terry Allen Winograd"){.id-not}, [Arthur L. Norberg](https://en.wikipedia.org/wiki/Arthur_L._Norberg "Arthur L. Norberg"){.id-not}]{.author} [[link-bibliography](/metadata/annotation/link-bibliography/%252Fdoc%252Fai%252F1991-winograd.pdf%2523page%253D7.html "Directory-tag link-bibliography for link /doc/ai/1991-winograd.pdf#page=7"){.id-not .include-even-when-collapsed}]{.collapse .tag-index-link-bibliography-block} 4. `1980-budd.pdf`: [`“Mutation Analysis Of Program Test Data”`{=html}](/doc/cs/algorithm/1980-budd.pdf "'Mutation Analysis Of Program Test Data', Budd 1980"){#budd-1980 .link-annotated}, [Timothy Alan Budd]{.author .cite-author} [[link-bibliography](/metadata/annotation/link-bibliography/%252Fdoc%252Fcs%252Falgorithm%252F1980-budd.pdf.html "Directory-tag link-bibliography for link /doc/cs/algorithm/1980-budd.pdf"){.id-not .include-even-when-collapsed}]{.collapse .tag-index-link-bibliography-block}