{"title":"Useful functions: a definition of the inverse quote function","authors":"J. Laubsch","doi":"10.1145/1411798.1411806","DOIUrl":null,"url":null,"abstract":"It frequently happens that a LISP programmer wants a function to produce a data-structure or function containing constant and variable substructures. The usual solution is to program a form containing a lot of data-structure composing functions (like LIST, CONS and APPEND). The resulting expression is hard to decipher for humans unless more mnemonic constructor-functions are defined. A simple way out is to write the resulting structure with its variable substructures especially marked.","PeriodicalId":404213,"journal":{"name":"ACM Lisp Bulletin","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Lisp Bulletin","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1411798.1411806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
It frequently happens that a LISP programmer wants a function to produce a data-structure or function containing constant and variable substructures. The usual solution is to program a form containing a lot of data-structure composing functions (like LIST, CONS and APPEND). The resulting expression is hard to decipher for humans unless more mnemonic constructor-functions are defined. A simple way out is to write the resulting structure with its variable substructures especially marked.