{"title":"Minimizing paging in Lisp applications","authors":"David L. Andre","doi":"10.1145/1862396.1862398","DOIUrl":"https://doi.org/10.1145/1862396.1862398","url":null,"abstract":"Paging is an important aspect of performance in any program and can be the overriding consideration in a large system. When developing large applications, the programmer should be as aware of paging overhead as he is of runtime overhead. The programmer should seek to avoid large working sets that cause page faults, just as he avoids order n2 and exponential algorithms.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125244710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"(lambda (discussions) (report on X3J13)): (beginnings))","authors":"R. Mathis","doi":"10.1145/1862396.1862403","DOIUrl":"https://doi.org/10.1145/1862396.1862403","url":null,"abstract":"Interest in Lisp standardization has resulted in the formation of a new technical committee known as \"X3J13 Common Lisp.\" This is a technical subcommittee within the Accredited Standards Committee \"X3--Information Processing Systems\" which is sponsored by CBEMA (Computer and Business Equipment Manufacturers Association) and operates under the procedures of the American National Standards Institute (ANSI). X3 has a number of technical subcommittees which do the detailed technical work of standards development, including: X3J1 (PL/I), X3J2 (BASIC), X3J3 (FORTRAN), X3J4 (COBOL), X3J9 (Pascal), X3J10 (APL), X3J11 (C), and now X3J13 (Common Lisp). Although X3 has a large role in the development of programming language standards, some ANSI standard languages (like MUMPS and Ada) have not gone through the X3 route. The IEEE is also very active in developing computer standards. X3 also serves as the US technical committee that corresponds to ISO/TC97 (the Technical Committee on Information Processing within the International Organization for Standardization).","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133642008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The scheme environment","authors":"William D. Clinger","doi":"10.1145/1862396.1862399","DOIUrl":"https://doi.org/10.1145/1862396.1862399","url":null,"abstract":"I can think of no better way to introduce this department than to quote the first two paragraphs of the introduction to the new Scheme standard, the Revisea3 Report on the Algorithmic Language Scheme [4], which I will refer to as R3RS. The first paragraph conveys a sense of the Scheme philosophy, while the second paragraph lists technical features that distinguish Scheme from other programming languages. One of my goals for future articles will be to explain and illustrate those features, as well as some other features that were considered too experimental to be included in R3RS.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123232644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"XREF: a case study in Common Lisp portability","authors":"T. Gruber","doi":"10.1145/1862396.1862397","DOIUrl":"https://doi.org/10.1145/1862396.1862397","url":null,"abstract":"Experience in building XREF, a Common Lisp cross reference utility, has revealed several issues relevant to writing portable program analysis utilities and supporting portable application programs across implementations. XREF is a program analyzer that parses Lisp code, analyzes calls to macros and functions and the use of variables, and then produces reports on inter-dependencies among functions, macros, variables, and files. It was designed to be a portable Common Lisp program that could analyze any any program written entirely in Common Lisp; the standard specified in [1] (hereafter CLtL) is both its implementation language and domain.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The key of Lisp","authors":"Susan P. Ennis","doi":"10.1145/1317193.1317200","DOIUrl":"https://doi.org/10.1145/1317193.1317200","url":null,"abstract":"When asked to do this department, I didn't quite catch the fact that I would be required to produce two columns before I could expect some 'letters to the editor'. I do hope that there are some out there because there isn't much here that I haven't talked about before.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On listing list prefixes","authors":"O. Danvy","doi":"10.1145/1317258.1317263","DOIUrl":"https://doi.org/10.1145/1317258.1317263","url":null,"abstract":"The Lisp Puzzles feature in Lisp Pointers, Volume 1, Number 6 proposed the following exercise: given a list, compute the list of its prefixes. Surprisingly, the solutions proposed in later issues all used intermediary copies and/or traversed the original list repeatedly. This note presents a higher-order solution that does not use copies and that traverses the original list only once. Further, this solution can be simply expressed by abstracting control procedurally.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127621698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving the performance of SML garbage collection using application-specific virtual memory management","authors":"Eric Cooper, Scott Nettles, Indira Subramanian","doi":"10.1145/141478.141501","DOIUrl":"https://doi.org/10.1145/141478.141501","url":null,"abstract":"We improved the performance of garbage collection in the standard ML of New Jersey system by using the virtual memory facilities provided by the Mach kernel. We took advantage of Mach's support for...","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129853117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A newcomer's impressions of Scheme","authors":"G. V. Wilson","doi":"10.1145/192590.192596","DOIUrl":"https://doi.org/10.1145/192590.192596","url":null,"abstract":"In July and November of 1993 I posted a summary of my first impressions of Scheme to the Internet news group comp.lang.scheme. The articles engendered a great deal of follow-up, from which I learned a great deal more about the language. I am grateful to everyone who commented on the original postings, and hope that this article will stimulate as much discussion as they did.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126894956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A study of LISP on a multiprocessor preliminary version","authors":"P. Nuth, Robert H. Halstead","doi":"10.1145/1317258.1317260","DOIUrl":"https://doi.org/10.1145/1317258.1317260","url":null,"abstract":"Parallel symbolic computation has attracted considerable interest in recent years. Research groups building multiprocessors for such applications have been frustrated by the lack of data on how symbolic programs run on a parallel machine. This report describes the behavior of Multilisp programs running on a shared memory multiprocessor. Data was collected for a set of application programs on the frequency of different instructions, the type of objects accessed, and where the objects were located in the memory of the multiprocessor. The locality of data references for different multiprocessor organizations was measured. Finally, the effect of different task scheduling strategies on the locality of accesses was studied. This data is summarized here, and compared to other studies of LISP performance on uniprocessors.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121552286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On extending computational adequacy by data abstraction","authors":"Breazu-TannenVal, SubrahmanyamRamesh","doi":"10.1145/141478.141530","DOIUrl":"https://doi.org/10.1145/141478.141530","url":null,"abstract":"Given an abstract data type(ADT), and algebra that specifies it, and an implementation of the data type in a certain language, if the implementation is correct, a certain principle of modularity of...","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127400547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
