{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:22:55Z","timestamp":1693866175101},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90064-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"13-43","source":"Crossref","is-referenced-by-count":10,"title":["Towards a programming language based on the notion of two-level grammar"],"prefix":"10.1016","volume":"28","author":[{"given":"Jan","family":"Maluszy\u0144ski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90064-6_BIB1","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\/0304-3975(83)90064-6_BIB2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90064-6_BIB3","first-page":"511","article-title":"W-grammar","author":"de Chastellier","year":"1969","journal-title":"Proc. of the 24th Nat. ACM Conf."},{"key":"10.1016\/0304-3975(83)90064-6_BIB4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BFb0031371","article-title":"Metamorphosis grammars","volume":"63","author":"Colmerauer","year":"1978"},{"key":"10.1016\/0304-3975(83)90064-6_BIB5","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\/0304-3975(83)90064-6_BIB6","series-title":"Ph.D. Thesis","article-title":"Vollst\u00e4ndige formale Beschreibung von Programmiersprachen mit zweischichtigen Grammatiken","author":"Hesse","year":"1976"},{"key":"10.1016\/0304-3975(83)90064-6_BIB7","series-title":"Introduction to Automata Theory, Languages and Computations","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(83)90064-6_BIB8","series-title":"ALGOL 68 Implementation","first-page":"95","article-title":"Affix grammars","author":"Koster","year":"1971"},{"key":"10.1016\/0304-3975(83)90064-6_BIB9","series-title":"Proc. IPIP 74","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"key":"10.1016\/0304-3975(83)90064-6_BIB10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BFb0022519","article-title":"Van Wijngaarden grammars as a special information processing model","volume":"88","author":"Kupka","year":"1980"},{"key":"10.1016\/0304-3975(83)90064-6_BIB11","series-title":"Rept. ID 967","article-title":"A notion of grammatical unification applicable to logic programming languages","author":"Maluszy\u0144ski","year":"1981"},{"issue":"4","key":"10.1016\/0304-3975(83)90064-6_BIB12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90096-5","article-title":"Grammatical unification","volume":"15","author":"Maluszy\u0144ski","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(83)90064-6_BIB13","series-title":"1st Internat. Logic Progr. Conf.","first-page":"193","article-title":"A comparison of the logic programming language Prolog with two-level grammars","author":"Maluszy\u0144ski","year":"1982"},{"key":"10.1016\/0304-3975(83)90064-6_BIB14","series-title":"Prolog Programming Environments Workshop","article-title":"A version of Prolog based on the notion of two-level grammars","author":"Maluszy\u0144ski","year":"1982"},{"key":"10.1016\/0304-3975(83)90064-6_BIB15","series-title":"Conf. Record 1982 ACM Symp. on Lisp and Functional Programming","first-page":"67","article-title":"How to define a language using Prolog","author":"Moss","year":"1982"},{"key":"10.1016\/0304-3975(83)90064-6_BIB16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","article-title":"Definite clause grammars for language analysis\u2014A survey of the formalism and a comparison with augmented transition networks","volume":"13","author":"Pereira","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(83)90064-6_BIB17","series-title":"Information Processing 68, Proc. of the IFIP Congress","first-page":"1405","article-title":"A generalized resolution principle based upon context-free grammars","author":"Reynolds","year":"1968"},{"key":"10.1016\/0304-3975(83)90064-6_BIB18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90064-6_BIB19","series-title":"Proc. 14th Ann. Symp. on Switching and Automata Theory","first-page":"145","article-title":"Complexity of recognition in intermediate-level languages","author":"Rounds","year":"1973"},{"key":"10.1016\/0304-3975(83)90064-6_BIB20","series-title":"Th\u00e8se Et\u00e2t","article-title":"W grammaires et logique du premier ordre pour la definition et l'implantation des langages","author":"Simonet","year":"1981"},{"key":"10.1016\/0304-3975(83)90064-6_BIB21","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"},{"key":"10.1016\/0304-3975(83)90064-6_BIB22","series-title":"Proc. 3rd Internat. Coll. on Automata, Languages and Programming","first-page":"531","article-title":"Eliminating blind alleys from backtrack programs","author":"Sintzoff","year":"1976"},{"key":"10.1016\/0304-3975(83)90064-6_BIB23","series-title":"Ph.D. Thesis","article-title":"Analysis-oriented two-level grammars","author":"Watt","year":"1974"},{"key":"10.1016\/0304-3975(83)90064-6_BIB24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00288543","article-title":"On parsing two-level grammars","volume":"14","author":"Wegner","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(83)90064-6_BIB25","series-title":"Orthogonal design and description of formal languages","year":"1965"},{"key":"10.1016\/0304-3975(83)90064-6_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00265077","volume":"5","year":"1975","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:16Z","timestamp":1555127416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900646"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90064-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}