ACM Conference on LISP and Functional Programming
1994
- Sweet Harmony: The Talk/C++ Connectionby: Harley Davis, Pierre Parquier, Nitsan Séniak
- Signatures for a Network Protocol Stack: A Systems Application of Standard MLby: Edoardo Biagioni, Robert Harper, Peter Lee, Brian Milnes
- Using Hindley-Milner Type Inference to Optimise List Representationby: Cordelia V. Hall
- Set-Based Analysis of ML Programsby: Nevin Heintze
- Collecting More Garbageby: Pascal Fradet
- A Randomized Implementation of Multiple Functional Arraysby: Tyng-Ruey Chuang
- Semantics of Type Classes Revisitedby: Satish R. Thatte
- Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creationby: Lorenz Huelsbergen, James R. Larus, Alexander Aiken
- Type Reconstruction for Variable-Arity Proceduresby: Hsianlin Dzeng, Christopher T. Haynes
- Talking About Modules and Deliveryby: Harley Davis, Pierre Parquier, Nitsan Séniak
- An Equational Framework for the Flow Analysis of Higher Order Functional Programsby: Dan C. Stefanescu, Yuli Zhou
- A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculusby: A. J. Kfoury, J. B. Wells
- Towards Better Inlining Decisions Using Inlining Trialsby: Jeffrey Dean, Craig Chambers
- Tag-Free Garbage Collection Using Explicit Type Parametersby: Andrew P. Tolmach
- An Efficient Implementation of Multiple Return Values in Schemeby: J. Michael Ashley, R. Kent Dybvig
- Static Dependent Costs for Estimating Execution Timeby: Brian Reistad, David K. Gifford
- A Practical Soft Type System for Schemeby: Andrew K. Wright, Robert Cartwright
- Locality, Causality and Continuationsby: Christian Queinnec
- Analyzing Stores and References in a Parallel Symbolic Languageby: Suresh Jagannathan, Stephen Weeks
- Space-Efficient Closure Representationsby: Zhong Shao, Andrew W. Appel
- Complete Proof Systems for Algebraic Simply-Typed Termsby: Stavros S. Cosmadakis
- Parallel Destructive Updating in Strict Functional Languagesby: A. V. S. Sastry, William D. Clinger
- Unrolling Listsby: Zhong Shao, John H. Reppy, Andrew W. Appel
- Concurrent Replicating Garbage Collectionby: James O'Toole, Scott Nettles
- Lambda, the Ultimate Label or a Simple Optimizing Compiler for Schemeby: William D. Clinger, Lars Thomas Hansen
- Characterization of Object Behaviour in Standard ML of New Jerseyby: Darko Stefanovic, J. Eliot B. Moss
- In-Place Updates in the Presence of Control Operatorsby: Sandip K. Biswas
- Garbage Collection for Strongly-Typed Languages Using Run-Time Type Reconstructionby: Shail Aditya, Christine H. Flood, James E. Hicks
- Continuation-Based Partial Evaluationby: Julia L. Lawall, Olivier Danvy
- Syntax and Semantics of a Persistent Common Lispby: J. H. Jacobs, Mark R. Swanson
- Safe Fusion of Functional Expressionsby: Wei-Ngan Chin
- Parametric Type Classesby: Kung Chen, Paul Hudak, Martin Odersky
- Global Tagging Optimization by Type Inferenceby: Fritz Henglein
- Fast Parallel Implementation of Lazy Languages - The EQUALS Experienceby: Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
- Proving the Correctness of Storage Representationsby: Mitchell Wand, Dino Oliva
- Analysis of Recursive Types in Lisp-Like Languagesby: Edward Wang, Paul N. Hilfinger
- Type Inference in the Presence of Overloading, Subtyping and Recursive Typesby: Stefan Kaes
- Projective MLby: Didier Rémy
- A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysisby: Marc Neuberger, Prateek Mishra
- A Confluent Calculus of Macro Expansion and Evaluationby: Ana Bove, Laura Arbilla
- Improving Binding Times Without Explicit CPS-Conversionby: Anders Bondorf
- Interactive Modular Programming in Schemeby: Sho-Huan Simon Tung
- Finiteness Conditions for Fixed Point Iterationby: Flemming Nielson, Hanne Riis Nielson
- Tachyon Common Lisp: An Efficient and Portable Implementation of CLtL2by: Atsushi Nagasaka, Yoshihiro Shintani, Tanji Ito, Hiroshi Gomi, Junichi Takahashi
- Improving the Performance of SML Garbage Collection Using Application-Specific Virtual Memory Managementby: Eric Cooper, Scott Nettles, Indira Subramanian
- On Extending Computational Adequacy by Data Abstractionby: Val Tannen, Ramesh Subrahmanyam
- The Python Compiler for CMU Common Lispby: Robert A. MacLachlan
- Dynamic Program Parallelizationby: Lorenz Huelsbergen, James R. Larus
- A Foundation for an Efficient Multi-Threaded Scheme Systemby: Suresh Jagannathan, Jim Philbin
- Integrating the Scheme and C Languagesby: John R. Rose, Hans Muller
- Taming the Y Operatorby: Guillermo Juan Rozas
- A Syntactic Approach to Fixed Point Computation on Finite Domainsby: Tyng-Ruey Chuang, Benjamin Goldberg
- Reasoning About Programs in Continuation-Passing Styleby: Amr Sabry, Matthias Felleisen
- Compiling Lazy Pattern Matchingby: Luc Maranget
- Caching Considerations for Generational Garbage Collectionby: Paul R. Wilson, Michael S. Lam, Thomas G. Moher
- Back to Direct Style II: First-Class Continuationsby: Olivier Danvy, Julia L. Lawall
- Global Analysis for Partitioning Non-Strict Programs into Sequential Threadsby: Kenneth R. Traub, David E. Culler, Klaus E. Schauser
- WCL: Delivering Efficient Common Lisp Applications Under Unixby: Wade Henessey
- Proving Memory Management Invariants for a Language Based on Linear Logicby: Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke
- Polymorphic Type Reconstruction for Garbage Collection Without Tagsby: Benjamin Goldberg, Michael Gloger
- A Calculus for Overloaded Functions with Subtypingby: Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo
- Parsers in MLby: Daniel de Rauglaudre, Michel Mauny
- Abstract Interpretation in Weak Powerdomainsby: Robert Muller, Yuli Zhou
- Reasoning with Continuations II: Full Abstraction for Models of Controlby: Dorai Sitaram, Matthias Felleisen
- Using Projection Analysis of Evaluation-Order and Its Applicationby: Geoffrey L. Burn
- Unify and Conquerby: Henry G. Baker
- Comprehending Monadsby: Philip Wadler
- Trap Architectures for Lisp Systemsby: Douglas Johnson
- Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programsby: Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
- Efficient Stack Allocation for Tail-Recursive Languagesby: Chris Hanson
- Partial Evaluation Applied to Numerical Computationby: Andrew Berlin
- Binding Time Analysis for High Order Untyped Functional Languagesby: Charles Consel
- Context Information for Lazy Code Generationby: Hanne Riis Nielson, Flemming Nielson
- A Module System for Schemeby: Pavel Curtis, James Rauen
- Debugging Standard ML Without Reverse Engineeringby: Andrew P. Tolmach, Andrew W. Appel
- Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collectionby: Benjamin G. Zorn
- Compiling Pattern Matching by Term Decompositionby: Laurence Puel, Ascánder Suárez
- A Parallel Virtual Machine for Efficient Scheme Compilationby: Marc Feeley, James S. Miller
- Continuing into the Future: On the Interaction of Futures and First-Class Continuationsby: Morry Katz, Daniel Weise
- From Operational Semantics to Abstract Machines: Preliminary Resultsby: John Hannan, Dale Miller
- Efficient Method Dispatch in PCLby: Gregor Kiczales, Luis Rodriguez
- Discrete Polymorphismby: Daniel Leivant
- An Abstract Machine for Lambda-Terms Normalizationby: Pierre Crégut
- A Semantic Basis for Questby: Luca Cardelli, Giuseppe Longo
- Partial Type Inference for Untyped Functional Programsby: Carsten K. Gomard
- Speculative Computation in Multilispby: Randy B. Osborne
- Abstracting Controlby: Olivier Danvy, Andrzej Filinski
- A Compositional Analysis of Evaluation-Order and Its Applicationby: M. Draghicescu, S. Purushothaman
- Computing with Coercionsby: Val Tannen, Carl A. Gunter, Andre Scedrov
- Static Dependent Types for First Class Modulesby: Mark A. Sheldon, David K. Gifford
- Continuation-Based Parallel Implementation of Functional Programming Languagesby: J.-F. Giorgi, Daniel Le Métayer
- A Representation of Lambda Terms Suitable for Operations on Their Intensionsby: Gopalan Nadathur, Debra Sue Wilson
- Operational and Axiomatic Semantics of PCFby: Brian T. Howard, John C. Mitchell
- Incremental Reduction in the lambda Calculusby: John Field, Tim Teitelbaum
- A Functional Programming Language Compiler for Massively Parallel Computersby: Clifford Walinsky, Deb Banerjee
- An Implementation of Portable Standard LISP on the BBN Butterflyby: Mark R. Swanson, Robert R. Kessler, Gary Lindstrom
- Type Inference and Semi-Unificationby: Fritz Henglein
- Parallel Execution of Sequential Scheme with ParaTranby: Pete Tinker, Morry Katz
- Syntactic Closuresby: Alan Bawden, Jonathan Rees
- Implementation Strategies for Continuationsby: William D. Clinger, Anne Hartheimer, Eric Ost
- An Improved Replacement Strategy for Function Aachingby: William Pugh
- Object-Oriented Programming in Schemeby: Norman Adams, Jonathan Rees
- Type Inference in a Database Programming Languageby: Atsushi Ohori, Peter Buneman
- Partial Polymorphic Type Inference and Higher-Order Unificationby: Frank Pfenning
- An Implementation of Standard ML Modulesby: David B. MacQueen
- Objects as Closures: Abstract Semantics of Object-Oriented Languagesby: Uday S. Reddy
- The Spineless G-Machineby: Geoffrey L. Burn, Simon L. Peyton Jones, J. D. Robson
- Expressing Mathematical Subroutines Constructivelyby: Gerald Roylance
- An Open-Ended Data Representation Model for EU_LISPby: Christian Queinnec, Pierre Cointe
- A Simple and Efficient Implmentation Approach for Single Assignment Languagesby: Kourosh Gharachorloo, Vivek Sarkar, John L. Hennessy
- A Unified System of Parameterization for Programming Languagesby: John Lamping
- Reification without Evaluationby: Alan Bawden
- The Common Lisp Object System Metaobject Kernel: A Status Reportby: Daniel G. Bobrow, Gregor Kiczales
- Buckwheat: Graph Reduction on a Shared-Memory Multiprocessorby: Benjamin Goldberg
- Intensions and Extensions in a Reflective Towerby: Olivier Danvy, Karoline Malmkjær
- ML with Extended Pattern Matching and Subtypesby: Lalita Jategaonkar, John C. Mitchell
- Faster Combinator Reduction Using stock Hardwareby: A. C. Norman
- Continuations May be Unreasonableby: Albert R. Meyer, Jon G. Riecke
- Preliminary Results with the Initial Implementation of Qlispby: Ron Goldman, Richard P. Gabriel
- Abstract Continuations: A Mathematical Semantics for Handling Full Jumpsby: Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba
- Graphinators and the Duality of SIMD and MIMDby: Paul Hudak, Eric Mohr
- Tutorial: Abstraction in Numerical Methodsby: Gerald J. Sussman, Matthew Halfant
- Exact Real Computer Arithmetic with Continued Fractionsby: Jean Vuillemin
- Bounded Quantifiers Have Interval Modelsby: Simon Martini
- A Variable-Arity Procedural Interfaceby: R. Kent Dybvig, Robert Hieb
- lambda-V-CS: An Extended lambda-Calculus for Schemeby: Matthias Felleisen
- Scheme86: A System for Interpreting Schemeby: Andrew Berlin, Henry Wu
- Concrete Syntax for Data Objects in Functional Languagesby: Annika Aasa, Kent Petersson, Dan Synek
- Hygienic Macro Expansionby: Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba
- The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Towerby: Mitchell Wand, Daniel P. Friedman
- On the Use of LISP in Implementing Denotational Semanticsby: Peter Lee, Uwe F. Pleban
- Variations on Strictness Analysisby: Adrienne Bloss, Paul Hudak
- A Semantic Model of Reference Counting and its Abstraction (Detailed Summary)by: Paul Hudak
- Reconfigurable, Retargetable Bignums: A Case Study in Efficient, Portable Lisp System Buildingby: Jon L. White
- Integrating Functional and Imperative Programmingby: David K. Gifford, John M. Lucassen
- Implementing Functional Languages in the Categorical Abstract Machineby: Michel Mauny, Ascánder Suárez
- LISP on a Reduced-Instruction-Set-Processorby: Peter Steenkiste, John L. Hennessy
- Towards a Semantic Theory for Equational Programming Languagesby: Satish R. Thatte
- Code Generation Techniques for Functional Languagesby: Jon Fairbairn, Stuart Wray
- Semantics Directed Compiling for Functional Languagesby: Hanne Riis Nielson, Flemming Nielson
- Partitioning Parallel Programs for Macro-Dataflowby: Vivek Sarkar, John L. Hennessy
- Laws in Mirandaby: Simon J. Thompson
- The CURRY Chipby: John D. Ramsdell
- Experience with an Uncommon LISPby: Cyril N. Alberga, Chris Bosman-Clark, Martin Mikelsons, Mary S. Van Deusen, Julian A. Padget
- Mechanisms for Efficient Multiprocessor Combinator Reductionby: Michel Lemaître, Michel Castan, M.-H. Durand, Guy Durrieu, Bernard Lecussan
- Expansion-Passing Style: Beyond Conventional Macrosby: R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes
- Desiderata for the Standardization of LISPby: Julian A. Padget, et al.
- The Four-Stroke Reduction Engineby: Chris D. Clack, Simon L. Peyton Jones
- A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary)by: John C. Mitchell
- Connection Graphsby: Alan Bawden
- A Protocol for Distributed Reference Countingby: Claus-Werner Lermen, Dieter Maurer
- The Implementation of PC Schemeby: David H. Bartley, John C. Jensen
- Equations, Sets, and Reduction Semantics for Functional and Logic Programmingby: Bharat Jayaraman, Frank S. K. Silbermann
- Design of an Optimizing, Dynamically Retargetable Compiler for Common Lispby: Rodney A. Brooks, David B. Posner, James L. McDonald, Jon L. White, Eric Benson, Richard P. Gabriel
- An Architecture for Mostly Functional Languagesby: Thomas F. Knight
- NORMA: A Graph Reduction Processorby: Mark Scheevel
- Connection Machine LISP: Fine-Grained Parallel Symbolic Processingby: Guy L. Steele Jr., W. Daniel Hillis
- A Simple Applicative Language: Mini-MLby: Dominique Clément, Joëlle Despeyroux, Th. Despeyroux, Gilles Kahn
- Distributed Copying Garbage Collectionby: Martin Rudalics
- Exact Real Arithmetic: A Case Study in Higher Order Programmingby: Hans-Juergen Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell
- Engines Build Process Abstractionsby: Christopher T. Haynes, Daniel P. Friedman
- Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardwareby: Rodney A. Brooks
- Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Timeby: Philip Wadler
- A Powerful Strategy for Deriving Efficient Programs by Transformationby: Alberto Pettorossi
- DIALISP - A Lisp Machineby: G. Stefan, Andrei Paun, V. Bistriceanu, A. Birnbaum
- Recursion is More Efficient than Iterationby: Emmanuel Saint-James
- Garbage Collection in a Large Lisp Systemby: David A. Moon
- Expression Evaluation in the ICON Programming Languageby: Ralph E. Griswold
- Formes: an Object and Time Oriented System for Music Composition and Synthesisby: Pierre Cointe, Xavier Rodet
- TABLOG: The Deductive-Tableau Programming Languageby: Yonathan Malachi, Zohar Manna, Richard J. Waldinger
- A Proposal for Standard MLby: Robin Milner
- Reification: Reflection without Metaphysicsby: Daniel P. Friedman, Mitchell Wand
- The Design of an Instruction Set for Common Lispby: Skef Wholey, Scott E. Fahlman
- Modules for Standard MLby: David B. MacQueen
- Continuations and Coroutinesby: Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
- The Scheme 311 Compiler: An Exercise in Denotational Semanticsby: William D. Clinger
- A Critique of Common Lispby: Rodney A. Brooks, Richard P. Gabriel
- Implementation of Multilisp: Lisp on a Multiprocessorby: Robert H. Halstead Jr.
- Arctic: A Functional Language for Real-Time Controlby: Roger B. Dannenberg
- Compiling a Functional Languageby: Luca Cardelli
- Type Inference and Type Checking for Functional Programming Languages: A Reduced Computation Approachby: Takuya Katayama
- Some Practical Methods for Rapid Combinator Reductionby: W. R. Stoye, T. J. W. Clarke, A. C. Norman
- Steps Toward Better Debugging Tools for Lispby: Henry Lieberman
- muFP, A Language for VLSI Designby: Mary Sheeran
- Making Control and Data Flow in Logic Programs Explicitby: Gert Smolka
- Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yieldby: Françoise Bellegarde
- Early LISP History (1956-1959)by: Herbert Stoyan
- TAO: Afst Interpreter-Centered Lisp System on Lisp Machine ELISby: Hiroshi G. Okuno, Ikuo Takeuchi, Nobuyasu Ohsato, Yasushi Hibino, Kazufumi Watanabe
- A Compiler for Lazy MLby: Lennart Augustsson
- The Implementation of Procedurally Reflective Languagesby: Jim des Rivières, Brian Cantwell Smith
- Schema Recognition for Program Transformationsby: John S. Givler, Richard B. Kieburtz
- Recent Developments in ISI-Interlispby: Raymond L. Bates, David Dyer, Mark Feber
- Busy and Lazy FP with Infinite Objectsby: Walter Dosch, Bernhard Möller
- Experiments in Diffused Combinator Reductionby: Paul Hudak, Benjamin Goldberg
- Stream Processingby: Allen Goldberg, Robert Paige
- Queue-based Multi-processing Lispby: Richard P. Gabriel, John L. McCarthy
- LE LISP, a Portable and Efficient LISP Systemby: Jérôme Chailloux, Matthieu Devin, Jean-Marie Hullot
- Combinatory Foundation of Functional Programmingby: Corrado Böhm
- A Semantic Model of Types for Applicative Languagesby: David B. MacQueen, Ravi Sethi
- Toward an Algebra of Nondeterministic Programsby: A. Toni Cohen, Thomas J. Myers
- Data Sharing in an FFP Machineby: Gyula Magó
- How to Define a Language Using PROLOGby: Christopher D. S. Moss
- Logic Enhancement: A Metho for Extending Logic Programming Languagesby: Paul R. Eggert, D. Val Schorre
- Constant Time Interpretation for Shallow-bound Variables in the Presence of Mixed SPECIAL/LOCAL Declarationsby: Jon L. White
- Functional Specifications of a Text Editorby: Gary Feldman
- A Parallel Prolog: The Construction of a Data Driven Modelby: Michael J. Wise
- The Semantics of Lazy (and Industrious) Evaluationby: Robert Cartwright, James E. Donahue
- An Investigation of the Relative Efficiencies of Combinators and Lambda Expressionsby: Simon L. Peyton Jones
- T: A Dialect of Lisp or, LAMBDA: The Ultimate Software Toolby: Jonathan Rees, Norman Adams
- Nondeterministic Call by Need is Neither Lazy Nor by Nameby: William D. Clinger
- An Overview of Common Lispby: Guy L. Steele Jr.
- PSL: A Portable LISP Systemby: Martin L. Griss, Eric Benson, Gerald Q. Maguire Jr.
- Expressions as Processesby: Richard Kennaway, M. Ronan Sleep
- Prolog Compared with Lispby: Claudio Gutiérrez 0002
- Experiments with a Supercompilerby: Valentin F. Turchin, Robert M. Nirenberg, Dimitri V. Turchin
- Design of a Lisp Machine - FLATSby: Eiichi Goto, T. Soma, N. Inada, Tetsuo Ida, M. Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov
- Implementation of Interlisp on the VAXby: Raymond L. Bates, David Dyer, Johannes A. G. M. Koomen
- S-1 Common Lisp Implementationby: Rodney A. Brooks, Richard P. Gabriel, Guy L. Steele Jr.
- Improved Effectiveness from a Real Time Lisp Garbage Collectorby: Jeffrey L. Dawson
- Garbage Collection and Task Deletion in Distributed Applicative Processing Systemsby: Paul Hudak, Robert M. Keller
- Functional Geometryby: Peter Henderson
- Performance of Lisp Systemsby: Richard P. Gabriel, Larry Masinter
- A Scheme for Implementing Functional Values on a Stack Machineby: Michael P. Georgeff
- Super Combinators: A New Implementation Method for Applicative Languagesby: R. J. M. Hughes
- A Fixed-Program Machine for Combinator Expression Evaluationby: Steven S. Muchnick, Neil D. Jones
- Overview and Status of DoradoLISPby: Richard R. Burton, Larry Masinter, Daniel G. Bobrow, W. Haugeland, Ronald M. Kaplan, B. A. Sheil
- Prose and CONS - Multics Emacs: A Commercial Text-processing System in LISPby: B. Greenberg
- HOPE: An Experimental Applicative Languageby: Rod M. Burstall, David B. MacQueen, Donald Sannella
- Address/Memory Management for a Gigantic LISP Environmentby: J. White
- Special Forms in LISPby: Kent M. Pitman
- Computing Cyclic List Structuresby: L. Morris, J. Schwarz
- Continuation-Based Multiprocessingby: Mitchell Wand
- MODLISPby: James H. Davenport, Richard D. Jenks
- Symbolic Computing with and without Lispby: J. Campbell, John Fitch
- Explicit Parallelism in LISP-like Languagesby: G. Print
- Extenting Object Oriented Programming in Smalltalkby: Ira P. Goldstein, Daniel G. Bobrow
- Strategies for Data Abstraction in LISPby: B. Steele
- An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped LISPby: Drew V. McDermott
- Divide and CONCer: Data Structuring in Applicative Multiprocessing Systemsby: R. Keller
- A Constructive Alternative to Axiomatic Data Type Definitionsby: Robert Cartwright
- Computing with Text-Graphics Formsby: Fred Lakin
- A LISP Compiler Producing Compact Codeby: W. Rowan
- The Function-Classby: Toshiaki Kurokawa
- Compilation Techniques for a Control-Flow Concurrent LISP Systemby: J. Marti
- ByteLisp and its Alto Implementationby: L. Peter Deutsch
- SKIM - The S, K, I Reduction Machineby: T. J. W. Clarke, P. Gladstone, C. MacLean, A. C. Norman
- The Dream of Lifetime: A Lazy Variable Extent Mechanismby: Guy L. Steele Jr., Gerald J. Sussman
- On Compiling Embedded Languages in LISPby: P. Emanuelson, Anders Haraldsson
- Multiprocessing via Intercommunicating LISP Systemsby: M. Model
- Design of the APIARY for Actor Systemsby: Carl Hewitt
- Local Optimization in a Compiler for Stack-based LISP Machinesby: Larry Masinter, L. Peter Deutsch
- A System of Communicating Residential Environmentsby: Erik Sandewall, H. Sorensen, C. Stromberg
- MULTI - A LISP Based Multiprocessing Systemby: Donald P. McKay, Stuart C. Shapiro
- A Semantic Comparison of LISP and Schemeby: Steven S. Muchnick, Uwe F. Pleban
- A Session with Tinker: Interleaving Program Testing with Program Writingby: Henry Lieberman, Carl Hewitt
![[SWISH++]](/docis/swish-powered.gif){kind=small}
