{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:26Z","timestamp":1759638926626},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0304-3975(97)00268-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"57-86","source":"Crossref","is-referenced-by-count":3,"title":["Polymorphic syntax definition"],"prefix":"10.1016","volume":"199","author":[{"given":"Eelco","family":"Visser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00268-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(89)90026-9","article-title":"How to make algebraic specifications more understandable: an experiment with the PLUSS specification language","volume":"12","author":"Bidoit","year":"1989","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB2","article-title":"ATerms: representing structured data for exchange between heterogeneous tools","author":"Van den Brand","year":"1997","journal-title":"Technical report, Programming Research Group, University of Amsterdam"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB3","series-title":"Proc. Conf. Record 9th Ann. ACM Symp. Principles of Programming Languages, ACM","first-page":"207","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00264566","article-title":"A decidability criterion for van Wijngaarden grammars","volume":"5","author":"Deussen","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB5","series-title":"Proc. Conf. Record 12th Ann. ACM Symp. on Principles of Programming Languages, ACM","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(97)00268-5_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/01969727608927525","article-title":"Context-free algebras","volume":"6","author":"Hatcher","year":"1976","journal-title":"J. Cybernet."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB8","article-title":"The design and implementation of typed languages for algebraic specification","author":"Hearn","year":"1995"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB9","series-title":"Proc. 1st Internat. Workshop on Higher-Order, Algebra, Logic and Term Rewriting (HOA '93)","first-page":"146","article-title":"ATLAS: a typed language for algebraic specification","volume":"vol. 816","author":"Hearn","year":"1994"},{"issue":"11","key":"10.1016\/S0304-3975(97)00268-5_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/71605.71607","article-title":"The syntax definition formalism SDF \u2014 reference manual","volume":"24","author":"Heering","year":"1989","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/mana.19630270108","article-title":"Algebras with a scheme of operators","volume":"27","author":"Higgins","year":"1963","journal-title":"Math. Nachr."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB12","series-title":"Proc. ASMICS Workshop on Parsing Theory","first-page":"1","article-title":"Using filters for the disambiguation of context-free grammars","author":"Klint","year":"1994"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(83)90064-6","article-title":"Towards a programming language based on the notion of two-level grammar","volume":"28","author":"Maluszynski","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB14","series-title":"Computer Science Logic \u2014 CSL'91","first-page":"257","article-title":"Equational specification of abstract types and combinators","volume":"vol. 626","author":"Meinke","year":"1992"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0304-3975(92)90310-C","article-title":"Universal algebra in higher types","volume":"100","author":"Meinke","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB16","series-title":"Mathematical Structures","first-page":"141","article-title":"Universal algebra","volume":"vol. 1","author":"Meinke","year":"1992"},{"issue":"3","key":"10.1016\/S0304-3975(97)00268-5_BIB17","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. System Sci."},{"key":"10.1016\/S0304-3975(97)00268-5_BIB18","series-title":"Program Specification and Transformation","first-page":"367","article-title":"Algebraic specification with higher-order operators","author":"M\u00f6ller","year":"1987"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","article-title":"Definite clause grammars for language analysis \u2014 a survey of the formalism and a comparison with augmented transition networks","volume":"13","author":"Pereira","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB20","series-title":"Proc. 21st Ann. Meeting of the Assoc. Computational Linguistics, Massachusetts Institute of Technology","article-title":"Parsing as deduction","author":"Pereira","year":"1983"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80027-4","article-title":"On specifications, theories, and models with higher types","volume":"68","author":"Poign\u00e9","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB22","series-title":"Algebraic Methods in Language Processing AMiLP'95","first-page":"65","article-title":"Multi-layered pipeline parsing from multi-axiom grammars","volume":"vol. 10","author":"Rus","year":"1995"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB23","first-page":"115","article-title":"Existence of a van Wijngaarden syntax for every recursively enumerable set","volume":"81","author":"Sintzoff","year":"1967","journal-title":"Ann. Soc. Sci. Bruxelles Ser. II"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB24","series-title":"Efficient Parsing for Natural Languages. A Fast Algorithm for Practical Systems","author":"Tomita","year":"1985"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB25","article-title":"Combinatory algebraic specification & compilation of list matching","author":"Visser","year":"1993"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB26","series-title":"Language Prototyping. An Algebraic Specification Approach","first-page":"105","article-title":"Multi-level specifications","volume":"vol. 5","author":"Visser","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(97)00268-5_BIB27","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/131295.131299","article-title":"Memoing for Logic Programs","volume":"35","author":"Warren","year":"1992","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(97)00268-5_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00276181","article-title":"The parsing problem for affix grammars","volume":"8","author":"Watt","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(97)00268-5_BIB29","year":"1976"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002685?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002685?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:42:01Z","timestamp":1704152521000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0304397597002685"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00268-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}