skip to main content
Skip header Section
Performance and evaluation of LISP systemsOctober 1985
Publisher:
  • Massachusetts Institute of Technology
  • 201 Vassar Street, W59-200 Cambridge, MA
  • United States
ISBN:978-0-262-07093-5
Published:30 October 1985
Pages:
285
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Henning J, Felgentreff T and Hirschfeld R VM Wrapping Proceedings of the 12th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems, (1-4)
  2. Morazán M Bytecode and Memoized Closure Performance Revised Selected Papers of the 14th International Symposium on Trends in Functional Programming - Volume 8322, (58-75)
  3. ACM
    Tobin-Hochstadt S, St-Amour V, Culpepper R, Flatt M and Felleisen M (2019). Languages as libraries, ACM SIGPLAN Notices, 46:6, (132-141), Online publication date: 4-Jun-2011.
  4. ACM
    Tobin-Hochstadt S, St-Amour V, Culpepper R, Flatt M and Felleisen M Languages as libraries Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (132-141)
  5. ACM
    Ugawa T, Iwasaki H and Yuasa T Improved replication-based incremental garbage collection for embedded systems Proceedings of the 2010 international symposium on Memory management, (73-82)
  6. ACM
    Ugawa T, Iwasaki H and Yuasa T (2010). Improved replication-based incremental garbage collection for embedded systems, ACM SIGPLAN Notices, 45:8, (73-82), Online publication date: 1-Aug-2010.
  7. ACM
    Herzeel C and Costanza P Dynamic parallelization of recursive code Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (377-396)
  8. ACM
    Yasugi M, Komiya T, Hiraishi T and Umatani S Managing continuations for proper tail recursion Proceedings of the 2010 international conference on Lisp, (65-72)
  9. ACM
    Herzeel C and Costanza P (2010). Dynamic parallelization of recursive code, ACM SIGPLAN Notices, 45:10, (377-396), Online publication date: 17-Oct-2010.
  10. ACM
    Boyer R and Hunt W Function memoization and unique object representation for ACL2 functions Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications, (81-89)
  11. Waddell O, Sarkar D and Dybvig R (2019). Fixing Letrec, Higher-Order and Symbolic Computation, 18:3-4, (299-326), Online publication date: 1-Dec-2005.
  12. ACM
    Kranz D, Kelsey R, Rees J, Hudak P, Philbin J and Adams N (2004). Orbit, ACM SIGPLAN Notices, 39:4, (175-191), Online publication date: 1-Apr-2004.
  13. ACM
    Appel A (2004). Real-time concurrent collection on stock multiprocessors, ACM SIGPLAN Notices, 39:4, (205-216), Online publication date: 1-Apr-2004.
  14. ACM
    Wall D (2004). Register windows vs. register allocation, ACM SIGPLAN Notices, 39:4, (270-282), Online publication date: 1-Apr-2004.
  15. ACM
    Lopes R, Castro L and Costa V (2019). From simulation to practice, ACM SIGPLAN Notices, 38:2 supplement, (56-64), Online publication date: 15-Feb-2003.
  16. ACM
    Aycock J (2003). A brief history of just-in-time, ACM Computing Surveys (CSUR), 35:2, (97-113), Online publication date: 1-Jun-2003.
  17. ACM
    Gómez G and Liu Y Automatic time-bound analysis for a higher-order language Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (75-86)
  18. ACM
    Gómez G and Liu Y (2002). Automatic time-bound analysis for a higher-order language, ACM SIGPLAN Notices, 37:3, (75-86), Online publication date: 1-Mar-2002.
  19. ACM
    Hansen L and Clinger W An experimental study of renewal-older-first garbage collection Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, (247-258)
  20. ACM
    Hansen L and Clinger W (2002). An experimental study of renewal-older-first garbage collection, ACM SIGPLAN Notices, 37:9, (247-258), Online publication date: 17-Sep-2002.
  21. ACM
    Lopes R, Castro L and Costa V From simulation to practice Proceedings of the 2002 workshop on Memory system performance, (56-64)
  22. Aoki T and Eto T On the software virtual machine for the real hardware stack machine Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1, (24-24)
  23. Clinger W, Hartheimer A and Ost E (1999). Implementation Strategies for First-Class Continuations, Higher-Order and Symbolic Computation, 12:1, (7-45), Online publication date: 1-Apr-1999.
  24. ACM
    Larose M and Feeley M (2019). A compacting incremental collector and its performance in a production quality compiler, ACM SIGPLAN Notices, 34:3, (1-9), Online publication date: 1-Mar-1999.
  25. ACM
    Larose M and Feeley M A compacting incremental collector and its performance in a production quality compiler Proceedings of the 1st international symposium on Memory management, (1-9)
  26. ACM
    Ashley J and Dybvig R (1998). A practical and flexible flow analysis for higher-order languages, ACM Transactions on Programming Languages and Systems (TOPLAS), 20:4, (845-868), Online publication date: 1-Jul-1998.
  27. Jacobs J and Swanson M (2019). UCL+P—Defining and Implementing Persistent Common Lisp, Lisp and Symbolic Computation, 10:1, (5-38), Online publication date: 1-Jun-1997.
  28. ACM
    Clinger W and Hansen L Generational garbage collection and the radioactive decay model Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, (97-108)
  29. ACM
    Clinger W and Hansen L (2019). Generational garbage collection and the radioactive decay model, ACM SIGPLAN Notices, 32:5, (97-108), Online publication date: 1-May-1997.
  30. Anderson S Simulation of multiple time-pressured agents Proceedings of the 29th conference on Winter simulation, (397-404)
  31. ACM
    Bruggeman C, Waddell O and Dybvig R Representing control in the presence of one-shot continuations Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, (99-107)
  32. ACM
    Sperber M and Thiemann P Realistic compilation by partial evaluation Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, (206-214)
  33. ACM
    Durham A and Johnson R A framework for run-time systems and its visual programming language Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (406-420)
  34. ACM
    Durham A and Johnson R (1996). A framework for run-time systems and its visual programming language, ACM SIGPLAN Notices, 31:10, (406-420), Online publication date: 1-Oct-1996.
  35. ACM
    Anderson S and Cohen P (1996). Timed Common Lisp, ACM SIGART Bulletin, 7:2, (11-15), Online publication date: 1-Apr-1996.
  36. ACM
    Bruggeman C, Waddell O and Dybvig R (2019). Representing control in the presence of one-shot continuations, ACM SIGPLAN Notices, 31:5, (99-107), Online publication date: 1-May-1996.
  37. ACM
    Sperber M and Thiemann P (2019). Realistic compilation by partial evaluation, ACM SIGPLAN Notices, 31:5, (206-214), Online publication date: 1-May-1996.
  38. ACM
    Steele G and Gabriel R The evolution of Lisp History of programming languages---II, (233-330)
  39. Anderson S and Cohen P On-line planning simulation Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, (3-10)
  40. ACM
    Baker H (1995). “Use-once” variables and linear objects, ACM SIGPLAN Notices, 30:1, (45-52), Online publication date: 3-Jan-1995.
  41. ACM
    Burger R, Waddell O and Dybvig R Register allocation using lazy saves, eager restores, and greedy shuffling Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, (130-138)
  42. ACM
    Burger R, Waddell O and Dybvig R (2019). Register allocation using lazy saves, eager restores, and greedy shuffling, ACM SIGPLAN Notices, 30:6, (130-138), Online publication date: 1-Jun-1995.
  43. ACM
    Anderson K (1994). Courage in profiles, ACM SIGPLAN Lisp Pointers, VIII:1, (11-29), Online publication date: 1-Jan-1995.
  44. ACM
    Gonçalves M and Appel A Cache performance of fast-allocating programs Proceedings of the seventh international conference on Functional programming languages and computer architecture, (293-305)
  45. ACM
    Ashley J and Dybvig R An efficient implementation of multiple return values in Scheme Proceedings of the 1994 ACM conference on LISP and functional programming, (140-149)
  46. ACM
    Clinger W and Hansen L Lambda, the ultimate label or a simple optimizing compiler for Scheme Proceedings of the 1994 ACM conference on LISP and functional programming, (128-139)
  47. ACM
    Jacobs J and Swanson M Syntax and semantics of a persistent Common Lisp Proceedings of the 1994 ACM conference on LISP and functional programming, (103-112)
  48. ACM
    Ashley J and Dybvig R (2019). An efficient implementation of multiple return values in Scheme, ACM SIGPLAN Lisp Pointers, VII:3, (140-149), Online publication date: 1-Jul-1994.
  49. ACM
    Clinger W and Hansen L (2019). Lambda, the ultimate label or a simple optimizing compiler for Scheme, ACM SIGPLAN Lisp Pointers, VII:3, (128-139), Online publication date: 1-Jul-1994.
  50. ACM
    Jacobs J and Swanson M (1994). Syntax and semantics of a persistent Common Lisp, ACM SIGPLAN Lisp Pointers, VII:3, (103-112), Online publication date: 1-Jul-1994.
  51. ACM
    Anderson K Courage in profiles Papers of the fourth international conference on LISP users and vendors, (11-29)
  52. ACM
    Anderson K and Rettig D (1994). Performing Lisp analysis of the FANNKUCH benchmark, ACM SIGPLAN Lisp Pointers, VII:4, (2-12), Online publication date: 1-Oct-1994.
  53. ACM
    Baker H (1994). Minimizing reference count updating with deferred and anchored pointers for functional data structures, ACM SIGPLAN Notices, 29:9, (38-43), Online publication date: 1-Sep-1994.
  54. ACM
    Feeley M Polling efficiently on stock hardware Proceedings of the conference on Functional programming languages and computer architecture, (179-187)
  55. ACM
    Sastry A, Clinger W and Ariola Z Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates Proceedings of the conference on Functional programming languages and computer architecture, (266-275)
  56. ACM
    Hodgkinson J (1992). Sleeping with the enemy, ACM SIGPLAN Lisp Pointers, VI:2, (16-22), Online publication date: 1-Apr-1993.
  57. ACM
    Baker H (1993). The Boyer benchmark meets linear logic, ACM SIGPLAN Lisp Pointers, VI:4, (3-10), Online publication date: 1-Oct-1993.
  58. ACM
    Baker H (1993). Sparse polynomials and linear logic, ACM SIGSAM Bulletin, 27:4, (10-14), Online publication date: 1-Dec-1993.
  59. ACM
    Hodgkinson J Sleeping with the enemy Proceedings of the 1992 conference on Lisp users and vendors, (16-22)
  60. ACM
    Nagasaka A, Shintani Y, Ito T, Gomi H and Takahashi J Tachyon Common Lisp Proceedings of the 1992 ACM conference on LISP and functional programming, (270-277)
  61. ACM
    Nagasaka A, Shintani Y, Ito T, Gomi H and Takahashi J (1992). Tachyon Common Lisp, ACM SIGPLAN Lisp Pointers, V:1, (270-277), Online publication date: 1-Jan-1992.
  62. ACM
    André P and Royer J (2019). Optimizing method search with lookup caches and incremental coloring, ACM SIGPLAN Notices, 27:10, (110-126), Online publication date: 31-Oct-1992.
  63. ACM
    Diwan A, Moss E and Hudson R Compiler support for garbage collection in a statically typed language Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, (273-282)
  64. ACM
    Diwan A, Moss E and Hudson R (2019). Compiler support for garbage collection in a statically typed language, ACM SIGPLAN Notices, 27:7, (273-282), Online publication date: 1-Jul-1992.
  65. ACM
    Baker H (1992). The Boyer Benchmark at warp speed, ACM SIGPLAN Lisp Pointers, V:3, (13-14), Online publication date: 1-Aug-1992.
  66. ACM
    Baker H (1992). The Gabriel “Triangle” Benchmark at warp speed, ACM SIGPLAN Lisp Pointers, V:3, (15-17), Online publication date: 1-Aug-1992.
  67. ACM
    Baker H (1992). Speeding up the “Puzzle” Benchmark a “bit”, ACM SIGPLAN Lisp Pointers, V:3, (18-21), Online publication date: 1-Aug-1992.
  68. ACM
    Baker H (1992). A tachy “TAK”, ACM SIGPLAN Lisp Pointers, V:3, (22-23), Online publication date: 1-Aug-1992.
  69. ACM
    Baker H (1992). Lively linear Lisp, ACM SIGPLAN Notices, 27:8, (89-98), Online publication date: 1-Aug-1992.
  70. ACM
    André P and Royer J Optimizing method search with lookup caches and incremental coloring Conference proceedings on Object-oriented programming systems, languages, and applications, (110-126)
  71. ACM
    Costa V, Warren D and Yang R Andorra I Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, (83-93)
  72. ACM
    Costa V, Warren D and Yang R (2019). Andorra I, ACM SIGPLAN Notices, 26:7, (83-93), Online publication date: 1-Jul-1991.
  73. ACM
    Morris W CCG Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (45-58)
  74. ACM
    Boehm H, Demers A and Shenker S Mostly parallel garbage collection Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (157-164)
  75. ACM
    Morris W (2019). CCG, ACM SIGPLAN Notices, 26:6, (45-58), Online publication date: 1-Jun-1991.
  76. ACM
    Boehm H, Demers A and Shenker S (2019). Mostly parallel garbage collection, ACM SIGPLAN Notices, 26:6, (157-164), Online publication date: 1-Jun-1991.
  77. ACM
    Ponder C (1991). Benchmark semantics, ACM SIGMETRICS Performance Evaluation Review, 18:4, (20-24), Online publication date: 1-Mar-1991.
  78. ACM
    Ponder C (1991). Performance variation across benchmark suites, ACM SIGARCH Computer Architecture News, 19:4, (30-36), Online publication date: 1-Jul-1991.
  79. ACM
    Maegawa H Memory organization and management for linked data structures Proceedings of the 19th annual conference on Computer Science, (105-112)
  80. Cheung K, Sohi G, Saluja K and Pradhan D (2019). Design and Analysis of a Gracefully Degrading Interleaved Memory System, IEEE Transactions on Computers, 39:1, (63-71), Online publication date: 1-Jan-1990.
  81. ACM
    Ponder C (1990). Performance variation across benchmark suites, ACM SIGMETRICS Performance Evaluation Review, 18:3, (42-48), Online publication date: 2-Nov-1990.
  82. ACM
    Feeley M and Miller J A parallel virtual machine for efficient scheme compilation Proceedings of the 1990 ACM conference on LISP and functional programming, (119-130)
  83. ACM
    Osborne R Speculative computation in multilisp Proceedings of the 1990 ACM conference on LISP and functional programming, (198-208)
  84. ACM
    Stansifer R (1990). Imperative versus functional, ACM SIGPLAN Notices, 25:4, (69-72), Online publication date: 1-Apr-1990.
  85. Chow J and Harrison W Switch-stacks Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (190-199)
  86. ACM
    Nuth P and Halstead R (1989). A study of LISP on a multiprocessor preliminary version, ACM SIGPLAN Lisp Pointers, 2:3-4, (15-32), Online publication date: 1-Jan-1989.
  87. ACM
    Taylor S, Shapiro R and Shapiro E FCP: a summary of performance results Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2, (1364-1373)
  88. ACM
    Klaassen A and van Wezenbeek A (1989). A three-processor Lisp machine architecture based on statistical analysis of Common Lisp programs, ACM SIGPLAN Notices, 24:9, (86-91), Online publication date: 11-Aug-1989.
  89. ACM
    Kranz D, Halstead R and Mohr E Mul-T: a high-performance parallel Lisp Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (81-90)
  90. ACM
    Wilson P and Moher T Demonic memory for process histories Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (330-343)
  91. ACM
    Kranz D, Halstead R and Mohr E (1989). Mul-T: a high-performance parallel Lisp, ACM SIGPLAN Notices, 24:7, (81-90), Online publication date: 1-Jul-1989.
  92. ACM
    Wilson P and Moher T (2019). Demonic memory for process histories, ACM SIGPLAN Notices, 24:7, (330-343), Online publication date: 1-Jul-1989.
  93. ACM
    Sato M, Ichikawa S and Goto E Run-time checking in Lisp by integrating memory addressing and range checking Proceedings of the 16th annual international symposium on Computer architecture, (290-297)
  94. ACM
    Sato M, Ichikawa S and Goto E (1989). Run-time checking in Lisp by integrating memory addressing and range checking, ACM SIGARCH Computer Architecture News, 17:3, (290-297), Online publication date: 1-Jun-1989.
  95. ACM
    Demers A, Weiser M, Hayes B, Boehm H, Bobrow D and Shenker S Combining generational and conservative garbage collection: framework and implementations Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (261-269)
  96. ACM
    Peterson J Untagged data in tagged environments: choosing optimal representations at compile time Proceedings of the fourth international conference on Functional programming languages and computer architecture, (89-99)
  97. ACM
    Bartlett J (1988). Compacting garbage collection with ambiguous roots, ACM SIGPLAN Lisp Pointers, 1:6, (3-12), Online publication date: 1-Apr-1988.
  98. ACM
    Dussud P (1988). Lisp hardware architecture, ACM SIGPLAN Lisp Pointers, 1:6, (13-18), Online publication date: 1-Apr-1988.
  99. ACM
    Smith D Alexi — a case study in design issues for LISP capabilities in Ada Proceedings of the fifth Washington Ada symposium on Ada, (109-116)
  100. ACM
    Ponder C (1988). Benchmark semantics, ACM SIGPLAN Notices, 23:2, (44-48), Online publication date: 1-Feb-1988.
  101. ACM
    Ponder C (1988). Benchmark semantics, ACM SIGPLAN Notices, 23:6, (157-161), Online publication date: 1-Jun-1988.
  102. ACM
    Appel A, Ellis J and Li K Real-time concurrent collection on stock multiprocessors Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (11-20)
  103. ACM
    Wall D Register windows vs. register allocation Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (67-78)
  104. ACM
    Harrison L Parcel: project for the automatic restructuring and concurrent evaluation of LISP Proceedings of the 2nd international conference on Supercomputing, (527-538)
  105. ACM
    Goldman R and Gabriel R Qlisp: experience and new directions Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (111-123)
  106. ACM
    Goldman R and Gabriel R (1988). Qlisp: experience and new directions, ACM SIGPLAN Notices, 23:9, (111-123), Online publication date: 1-Sep-1988.
  107. ACM
    Okuno H, Osato N and Takeuchi I (1988). Firmware approach to fast Lisp interpreter, ACM SIGMICRO Newsletter, 19:1-2, (5-10), Online publication date: 1-Jun-1988.
  108. ACM
    Park S and Miller K (1988). Random number generators: good ones are hard to find, Communications of the ACM, 31:10, (1192-1201), Online publication date: 1-Oct-1988.
  109. ACM
    Appel A, Ellis J and Li K (2019). Real-time concurrent collection on stock multiprocessors, ACM SIGPLAN Notices, 23:7, (11-20), Online publication date: 1-Jul-1988.
  110. ACM
    Wall D (2019). Register windows vs. register allocation, ACM SIGPLAN Notices, 23:7, (67-78), Online publication date: 1-Jul-1988.
  111. ACM
    Goldman R and Gabriel R Preliminary results with the initial implementation of Qlisp Proceedings of the 1988 ACM conference on LISP and functional programming, (143-152)
  112. ACM
    Swanson M, Kessler R and Lindstrom G An implementation of portable standard LISP on the BBN butterfly Proceedings of the 1988 ACM conference on LISP and functional programming, (132-142)
  113. ACM
    Clinger W, Hartheimer A and Ost E Implementation strategies for continuations Proceedings of the 1988 ACM conference on LISP and functional programming, (124-131)
  114. ACM
    Berlin A and Wu H Scheme86: a system for interpreting scheme Proceedings of the 1988 ACM conference on LISP and functional programming, (116-123)
  115. ACM
    Bacher S (1987). ZIL, ACM SIGPLAN Lisp Pointers, 1:2, (12-21), Online publication date: 1-Jun-1987.
  116. ACM
    Andre D (1987). Minimizing paging in Lisp applications, ACM SIGPLAN Lisp Pointers, 1:1, (13-23), Online publication date: 1-Apr-1987.
  117. ACM
    Pumplin B (1987). Compiling LISP procedures, ACM SIGART Bulletin:99, (27-31), Online publication date: 1-Jan-1987.
  118. ACM
    Pumplin B (1987). Compiling LISP procedures, ACM SIGSMALL/PC Notes, 13:1, (16-30), Online publication date: 1-Feb-1987.
  119. ACM
    Halstead R (1987). Overview of concert multilisp: a multiprocessor symbolic computing system, ACM SIGARCH Computer Architecture News, 15:1, (5-14), Online publication date: 1-Mar-1987.
  120. ACM
    Okuno H, Osato N and Takeuchi I Firmware approach to fast Lisp interpreter Proceedings of the 20th annual workshop on Microprogramming, (1-11)
  121. ACM
    Shebs S and Kessler R Automatic design and implementation of language data types Papers of the Symposium on Interpreters and interpretive techniques, (26-37)
  122. ACM
    Cheung K, Sohi G, Saluja K and Pradhan D Organization and analysis of a gracefully-degrading interleaved memory system Proceedings of the 14th annual international symposium on Computer architecture, (224-231)
  123. ACM
    Shebs S and Kessler R (2019). Automatic design and implementation of language data types, ACM SIGPLAN Notices, 22:7, (26-37), Online publication date: 1-Jul-1987.
  124. McKeown K and Paris C Functional unification grammar revisited Proceedings of the 25th annual meeting on Association for Computational Linguistics, (97-103)
  125. Takeuchi I, Okuno H, Osato N, Kamio M and Yamazaki K A concurrent multiple-paradigm list processor TAO/ELIS Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, (167-174)
  126. ACM
    Steenkiste P and Hennessy J (1987). Tags and type checking in LISP: hardware and software approaches, ACM SIGARCH Computer Architecture News, 15:5, (50-59), Online publication date: 1-Nov-1987.
  127. ACM
    Steenkiste P and Hennessy J Tags and type checking in LISP: hardware and software approaches Proceedings of the second international conference on Architectual support for programming languages and operating systems, (50-59)
  128. ACM
    Steenkiste P and Hennessy J (1987). Tags and type checking in LISP: hardware and software approaches, ACM SIGOPS Operating Systems Review, 21:4, (50-59), Online publication date: 1-Oct-1987.
  129. ACM
    Steenkiste P and Hennessy J (1987). Tags and type checking in LISP: hardware and software approaches, ACM SIGPLAN Notices, 22:10, (50-59), Online publication date: 1-Oct-1987.
  130. ACM
    Kessler R, Peterson J, Carr H, Duggan G and Knell J EPIC - a retargetable, highly optimizing Lisp compiler Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (118-130)
  131. ACM
    Adams N, Kranz D, Kelsey R, Rees J, Hudak P and Philbin J ORBIT: an optimizing compiler for scheme Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (219-233)
  132. ACM
    Larus J and Hilfinger P Register allocation in the SPUR Lisp compiler Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (255-263)
  133. ACM
    Kessler R, Peterson J, Carr H, Duggan G and Knell J (2019). EPIC - a retargetable, highly optimizing Lisp compiler, ACM SIGPLAN Notices, 21:7, (118-130), Online publication date: 1-Jul-1986.
  134. ACM
    Adams N, Kranz D, Kelsey R, Rees J, Hudak P and Philbin J (2019). ORBIT: an optimizing compiler for scheme, ACM SIGPLAN Notices, 21:7, (219-233), Online publication date: 1-Jul-1986.
  135. ACM
    Larus J and Hilfinger P (2019). Register allocation in the SPUR Lisp compiler, ACM SIGPLAN Notices, 21:7, (255-263), Online publication date: 1-Jul-1986.
  136. ACM
    Lichtman Z (1986). Sometimes an FEXPR is better than a macro, ACM SIGART Bulletin:97, (20-22), Online publication date: 1-Jul-1986.
  137. ACM
    Yuhara M, Hattori A, Niwa M, Kishimoto M and Hayashi H (1986). Evaluation of the FACOM ALPHA Lisp machine, ACM SIGARCH Computer Architecture News, 14:2, (184-190), Online publication date: 1-May-1986.
  138. ACM
    Vuong I, Wozniak A, Krishna S and Filotti I KOALA Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems, (53-63)
  139. ACM
    Brooks R, Posner D, McDonald J, White J, Benson E and Gabriel R Design of an optimizing, dynamically retargetable compiler for common Lisp Proceedings of the 1986 ACM conference on LISP and functional programming, (67-85)
  140. ACM
    Bartley D and Jensen J The implementation of PC Scheme Proceedings of the 1986 ACM conference on LISP and functional programming, (86-93)
  141. ACM
    Steenkiste P and Hennessy J LISP on a reduced-instruction-set-processor Proceedings of the 1986 ACM conference on LISP and functional programming, (192-201)
  142. Yuhara M, Hattori A, Niwa M, Kishimoto M and Hayashi H Evaluation of the FACOM ALPHA Lisp machine Proceedings of the 13th annual international symposium on Computer architecture, (184-190)
  143. Kushner B and Neff J Optical symbolic computing Proceedings of 1986 ACM Fall joint computer conference, (434-440)
Contributors
  • IBM Research

Recommendations

Teodor Rus

LISP is the first programming language designed on a formal scheme in which a mathematical object was given as the semantics (recursive functions of symbolic expressions) and an appropriate syntax was associated to represent it (s-expressions). LISP has been implemented as a programming system for handling nonnumerical applications. The interpretation technique was usually used for LISP implementation, although the compiling facilities have been added, particularly in the newer versions. It took rather long since its first version proposed by McCarthy in early 1960 until it gained acceptance in the computer science community. Its acceptance is a consequence of the maturation of the need for a formal concept of a programming language required by the necessity of developing a software technology. This book presents a study of the LISP dialects in use today. The declared purpose of this study is, as its title says, to offer to its reader information concerning the performance of the LISP systems, as well as approaches for their evaluation. The mechanism of the benchmarking is used in this respect. However, the author succeeds in covering a larger purpose by collecting into one volume a description of the major LISP systems in use, by providing a set of criteria for their performance evaluation, and by offering a mechanism for understanding the technical tradeoff made during the implementation of a LISP system. The benchmarks used for LISP performance evaluation are LISP packages which have an intrinsic value beyond the measurement purposes discussed in the book. The material is discussed following a methodological approach and is organized on the logical basis in three chapters: (1)A discussion of various computer architectures supporting LISP systems. It provides the theoretical background for performance evaluation and outlines the architectural characteristics that go into the evaluation of a LISP system. (2)The design and implementation of the major LISP systems in use today. (3)A collection of LISP packages used as benchmarks. It discusses the performance of the LISP systems presented in Chapter 2 when executed on these benchmarks. The author emphasizes both the usefulness of a LISP system and its performance. He ends the book with the following conclusion: “The final arbiter of the usefulness of a LISP implementation is the ease that the user and programmer have with that implementation. Performance is an issue, but it is not the only issue.”

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.