{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:29Z","timestamp":1725663389444},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508205"},{"type":"electronic","value":"9783540460923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50820-1_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:33:45Z","timestamp":1330184025000},"page":"252-272","source":"Crossref","is-referenced-by-count":3,"title":["Compiling typol with attribute grammars"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Attali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"15_CR1","unstructured":"Aho A., Sethi R., & Ullman J. \u201cCompilers: Principles, Techniques, and Tools\u201d Addison-Wesley, Reading, Mass., 1986"},{"key":"15_CR2","first-page":"2","volume":"6","author":"I. Attali","year":"1985","unstructured":"Attali I. & Franchi-Zannettacci P. \u201cProlog-like schemes for Ada static semantics\u201d Ada UK news, 6, 2, 1985","journal-title":"Ada UK news"},{"key":"15_CR3","unstructured":"Attali I. & Franchi-Zannettaci P. \u201cUnification-free Execution of TYPOL Programs by Semantic Attribute Evaluation\u201d, Proceedings Fifth International Conference Symposium on Logic Programming, Seattle, August 1988, MIT Press."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"Berry G. & Sethi R. \u201cFrom regular expressions to deterministic automata\u201d TCS 48, 1, 1986","journal-title":"TCS"},{"issue":"2","key":"15_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/359997.359999","volume":"19","author":"G. Bochmann","year":"1976","unstructured":"Bochmann G. \u201cSemantic evaluation from left to right\u201d CACM 19, 2, 55\u201362, 1976","journal-title":"CACM"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Borras P., Cl\u00e9ment D., Despeyroux T., Incerpi J., Kahn G., Lang B., & Pascual V. \u201cCENTAUR: the system\u201d INRIA research report 777, 1987. To be published in proc. of SIGSOFT'88, Third Annual Symposium on Software Development Environments, Boston, 1988","DOI":"10.1145\/64135.65005"},{"key":"15_CR7","unstructured":"Bruynooghe M. \u201c A Framework for the abstract interpretation of logic programs\u201d Katholoeke Universiteit Leuven, Report CW 62, 1987"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Chirica L. & Martin D. \u201cAn order algebraic definition of Knuthian semantics\u201d Math. Systems Theory 13, 1979","DOI":"10.1007\/BF01744285"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Cl\u00e9ment D., Despeyroux J., Despeyroux T., & Kahn G. \u201cA simple applicative language: Mini-ml\u201d Symp. on Functional Programming Languages and Computer Architecture, 1986","DOI":"10.1145\/319838.319847"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","volume":"17","author":"B. Courcelle","year":"1980","unstructured":"Courcelle B. & Franchi-Zannettacci P. \u201cAttribute Grammars and Recursive Program Schemes\u201d TCS 17, 163, 1980","journal-title":"TCS"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Demers A., Reps T. & Teitelbaum T. \u201cIncremental evaluation for attribute grammars with application to syntax-directed editors\u201d in Conference Record of the 8th ACM Symposium on Principles of Programming Languages, Williamsburg, Va, 1981","DOI":"10.1145\/567532.567544"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(85)90015-9","volume":"2","author":"P. Deransart","year":"1985","unstructured":"Deransart P. & Maluszynski J. \u201cRelating Logic Programs and Attribute Grammars\u201d J. Logic Programming 2:119\u2013155, 1985","journal-title":"J. Logic Programming"},{"key":"15_CR13","unstructured":"Deransart P., Jourdan M., & Lorho B. \u201cAttribute Grammars: Definitions, Systems and Bibliography\u201d LNCS 323, Spinger Verlag, 1988"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Despeyroux T. \u201cExecutable Specification of static semantics\u201d Semantics of Data Types, LNCS 173, 1984","DOI":"10.1007\/3-540-13346-1_11"},{"key":"15_CR15","unstructured":"Despeyroux T. \u201cTYPOL: a formalism to implement Natural Semantics\u201d INRIA research report 94, 1988"},{"key":"15_CR16","unstructured":"Donzeau-Gouge V., Kahn G., & Lang B. \u201cA complete machine checked definition of a simple programming language using denotational semantics\u201d INRIA research report 330, 1978"},{"key":"15_CR17","unstructured":"Drabent W. \u201cDo logic programs resemble programs in conventional languages ?\u201d 1987 IEEE Symp. on Logic Programming, San Francisco, 1987"},{"key":"15_CR18","unstructured":"Engelfriet J. & File G. \u201cThe formal power of one-visit attribute grammars\u201d Proc. of the seventh ICALP, LNCS 85, 1980"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Ershov A. P. \u201cOn the partial computation principle\u201d Information Processing Letters, 6\u20132, 1977","DOI":"10.1016\/0020-0190(77)90078-3"},{"key":"15_CR20","unstructured":"Franchi-Zannettacci P. \u201cAttributs s\u00e9mantiques et sch\u00e9mas de programmes\u201d Th\u00e8se d'Etat, Univ. of Bordeaux I, 1982"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Fumatura Y. \u201cGeneralised Partial Computation\u201d Proc. workshop on Partial Evaluation and Mixed Computation, Denmark, Oct 1987. Also New Generation Computing Journal, Vol. 6, N os 2 & 3, 1988.","DOI":"10.1007\/BF03037143"},{"key":"15_CR22","unstructured":"Ganzinger H. & Hanus M. \u201cModular Logic Programming of Compilers\u201d Proc. Symp. on Logic Programming, Boston, Massachusetts, 242\u2013253, 1985"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Hasc\u00f6et L. \u201cPartial evaluation with inference rules\u201d Proc. workshop on Partial Evaluation and Mixed Computation, Denmark, Oct 1987. Also New Generation Computing Journal, Vol. 6, N os 2 & 3, 1988.","DOI":"10.1007\/BF03037137"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Johnsson T. \u201cAttribute Grammars as a Functional Programming Paradigm\u201d Symp. on Functional Programming Languages and Computer Architecture LNCS 274, Portland, 1987","DOI":"10.1007\/3-540-18317-5_10"},{"key":"15_CR25","unstructured":"Jones N. D., Setsoft P. & Sondergaard H. \u201cMIX: a self-applicable partial evaluator for experiments in compiler generation\u201d, report 87\/8, DIKU, University of Copenhagen, 1987"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Jourdan M. \u201cStrongly Non-Circular Attribute Grammars and their recursive evaluation\u201d ACM Sigplan Symp. on Compiler Construction, Montreal Sigplan Notices 19, 6, 1984","DOI":"10.1145\/502874.502882"},{"key":"15_CR27","unstructured":"Jourdan M. & Parigot D. \u201cThe FNC-2 system: advances in Attribute Grammar Technology\u201d INRIA research report to be published, 1988"},{"key":"15_CR28","unstructured":"Juli\u00e9 C. \u201cOptimisation de l'espace m\u00e9moire pour les compilateurs g\u00e9n\u00e9r\u00e9s selon la m\u00e9thode d'\u00e9valuation OAG: Etude des travaux de Kastens et propositions d'am\u00e9liorations\u201d Rapport de DEA, Univ. of Orl\u00e9ans, 1986"},{"key":"15_CR29","unstructured":"Kahn G. \u201cNatural Semantics\u201d Proc. of Symp on Theoretical Aspects of Computer Science, Passau, Germany, LNCS 247, 1987"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Kastens U. \u201cOrdered Attribute Grammars\u201d Acta Informatica 13, 1980","DOI":"10.1007\/BF00288644"},{"key":"15_CR31","unstructured":"Kastens U. \u201cThe GAG-system \u2014 A Tool for Compiler Construction\u201d in Methods and Tools for Compiler Construction, ed B. Lorho, 165\u2013182, Cambridge University Press, 1984"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy K. & Warren S. K. \u201cAutomatic generation of efficient evaluators for Attribute Grammars\u201d Proc. of the 3 rd ACM Conf on Principle of Programming Languages, Atlanta, 1976","DOI":"10.1145\/800168.811538"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Knuth D. E. \u201cSemantics of Context-Free Languages\u201d Math. Syst. Theory 2, 1968","DOI":"10.1007\/BF01692511"},{"key":"15_CR34","unstructured":"Komorowski H. J. & Maluszynski J. \u201cUnification-free execution of logic programs\u201d 1985 IEEE Symp. on Logic Programming, Boston, 1985"},{"key":"15_CR35","unstructured":"Lang B. \u201cThe Virtual Tree Processor\u201d in Generation of Interactive Programming Environments, Intermediate Report, J. Heering, J. Sidi, A. Verhoog (Eds), CWI Report CS-R8620, Amsterdam, May 1986"},{"key":"15_CR36","unstructured":"Naish L. \u201cNegation and Control in Prolog\u201d LNCS 238, 1986"},{"key":"15_CR37","unstructured":"Plotkin G. D. \u201cA structural approach to operational semantics\u201d Report DAIMI FN-19, Computer Science Dpt, Aarhus Univ., Aarhus, Denmark, 1981"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Prawitz D. \u201cIdeas and results in proof theory\u201d Proc. of the Second Scandinavian Logic Symposium, North Holland, 1971","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"15_CR39","unstructured":"Reddy U. S. \u201cOn the relationship between logic and functional languages\u201d in Logic Programming: Functions, Relations and Equations, DeGroot D., Lindstrom G. eds., Prentice Hall, 1986"},{"key":"15_CR40","volume-title":"Generating Language based Environments","author":"T. Reps","year":"1984","unstructured":"Reps T. \u201cGenerating Language based Environments\u201d M.I.T. Press, Cambridge, Mass, 1984"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Sethi R. \u201cComplete Register Allocation problems\u201d SIAM J. Comp 4, 1975","DOI":"10.1137\/0204020"},{"key":"15_CR42","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"Sethi R. & Ullman J. \u201cThe generation of optimal code for arithmetic expressions\u201d JACM 17, 4, 1970","journal-title":"JACM"},{"key":"15_CR43","volume-title":"Translating Natural Semantic Specifications to Attribute Grammars","author":"V. E. Tavernini","year":"1987","unstructured":"Tavernini V. E. \u201cTranslating Natural Semantic Specifications to Attribute Grammars\u201d Master's Thesis, University of Illinois, Urbana-Champaign, 1987"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Uhl J., Drossopoulou S., Persch G., Goos G., Dausmann M., & Winterstein G. \u201cAn Attribute Grammar for the semantic analysis of Ada\u201d LNCS 149, 1982","DOI":"10.1007\/3-540-11571-4"}],"container-title":["Lecture Notes in Computer Science","Programming Languages Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50820-1_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:55Z","timestamp":1605629935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50820-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508205","9783540460923"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-50820-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}