{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:23:27Z","timestamp":1648952607761},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0096-0551(94)90017-5","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"101-116","source":"Crossref","is-referenced-by-count":0,"title":["A practical approach to type-sensitive parsing"],"prefix":"10.1016","volume":"20","author":[{"given":"Ken","family":"Sailor","sequence":"first","affiliation":[]},{"given":"Carl","family":"McCrosky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(94)90017-5_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0096-0551(93)90018-V","article-title":"A synthesis of type-checking and parsing","volume":"18","author":"McCrosky","year":"1992","journal-title":"Comput. Lang."},{"issue":"5","key":"10.1016\/0096-0551(94)90017-5_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/130697.130699","article-title":"Report on the programming language Haskell","volume":"27","author":"Hudak","year":"1992","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0096-0551(94)90017-5_BIB3","series-title":"Conference on Functional Programming Languages and Computer Architecture","article-title":"Miranda\u2014a Non-strict Functional Language with Polymorphic Types","author":"Turner","year":"1985"},{"key":"10.1016\/0096-0551(94)90017-5_BIB4","series-title":"17th ACM Symposium on the Principles of Programming Languages","article-title":"Deciding ML typability is complete for deterministic exponential time","author":"Mairson","year":"1990"},{"key":"10.1016\/0096-0551(94)90017-5_BIB5","series-title":"The Theory and Practice of Compiler Writing","author":"Tremblay","year":"1985"},{"key":"10.1016\/0096-0551(94)90017-5_BIB6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0096-0551(94)90017-5_BIB7","series-title":"Prentice-Hall Series in Computer Science","article-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"key":"10.1016\/0096-0551(94)90017-5_BIB8","series-title":"16th ACM Symposium on the Principles of Programming Languages","article-title":"How to make ad hoc polymorphism less ad hoc","author":"Wadler","year":"1989"},{"key":"10.1016\/0096-0551(94)90017-5_BIB9","series-title":"9th ACM Symposium on the Principles of Programming Languages","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982"},{"issue":"2","key":"10.1016\/0096-0551(94)90017-5_BIB10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1093\/comjnl\/32.2.127","article-title":"The Chalmers lazy-ML compiler","volume":"32","author":"Augustsson","year":"1989","journal-title":"Comput. J."},{"key":"10.1016\/0096-0551(94)90017-5_BIB11","series-title":"Generating parallel distributed code for a functional array language","author":"Ghavamnia","year":"1993"},{"key":"10.1016\/0096-0551(94)90017-5_BIB12","series-title":"Static inference of permissible destructive updates in functional languages","author":"Wang","year":"1992"},{"key":"10.1016\/0096-0551(94)90017-5_BIB13","series-title":"Structures and Operations in Engineering and Management Systems","article-title":"Notes on the diagrams, logic, and operations of array theory","author":"More","year":"1981"},{"key":"10.1016\/0096-0551(94)90017-5_BIB14","series-title":"IEEE International Conference on Computer Languages","article-title":"The elimination of intermediate containers in the evaluation of first-class array expressions","author":"McCrosky","year":"1988"},{"key":"10.1016\/0096-0551(94)90017-5_BIB15","series-title":"Pascal User Manual and Report, ISO Pascal Standard","author":"Jensen","year":"1985"},{"key":"10.1016\/0096-0551(94)90017-5_BIB16","series-title":"Eiffel: The Language (Version 3.0)","author":"Meyer","year":"1992"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:26:42Z","timestamp":1552634802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055194900175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0096055194900175"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(94)90017-5","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}