{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:39Z","timestamp":1720437759049},"reference-count":112,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90008-0","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"99-241","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Transformational program development in a particular problem domain"],"prefix":"10.1016","volume":"7","author":[{"given":"H.","family":"Partsch","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90008-0_BIB1","author":"Aho","year":"1972"},{"key":"10.1016\/0167-6423(86)90008-0_BIB2","series-title":"Principles of Compiler Design","author":"Aho","year":"1978"},{"issue":"2","key":"10.1016\/0167-6423(86)90008-0_BIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/357162.357171","article-title":"Some techniques for recursion removal from recursive functions","volume":"4","author":"Arsac","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB4","series-title":"Proc. International Symposium on Proving and Improving Programs","first-page":"197","article-title":"Some generalization heuristics in proofs by induction","author":"Aubin","year":"1975"},{"key":"10.1016\/0167-6423(86)90008-0_BIB5","series-title":"Syntax of Programming Languages\u2014Theory and Practice","author":"Backhouse","year":"1979"},{"key":"10.1016\/0167-6423(86)90008-0_BIB6","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"696","article-title":"A breadth-first parsing model","author":"Baer","year":"1983"},{"key":"10.1016\/0167-6423(86)90008-0_BIB7","article-title":"Elimination von Existenzquantoren","author":"Bauer","year":"1982","journal-title":"Institut f\u00fcr Informatik der TU M\u00fcnchen, Internal Report"},{"key":"10.1016\/0167-6423(86)90008-0_BIB8","series-title":"Report on a wide spectrum language for program specification and development (tentative version)","author":"Bauer","year":"1981"},{"key":"10.1016\/0167-6423(86)90008-0_BIB9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6423(81)90006-X","article-title":"Programming in a wide spectrum language: a collection of examples","volume":"1","author":"Bauer","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90008-0_BIB10_1","author":"Bauer","year":"1983"},{"key":"10.1016\/0167-6423(86)90008-0_BIB10_2","volume":"183","author":"Bauer","year":"1985"},{"key":"10.1016\/0167-6423(86)90008-0_BIB11","series-title":"Software Engineering Techniques","first-page":"25","article-title":"Techniques for program development","volume":"34","author":"Bauer","year":"1977"},{"key":"10.1016\/0167-6423(86)90008-0_BIB12","series-title":"Algorithmic Language and Program Development","author":"Bauer","year":"1982"},{"key":"10.1016\/0167-6423(86)90008-0_BIB13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(76)90011-4","article-title":"A partial evaluator, and its use as a programming tool","volume":"7","author":"Beckman","year":"1976","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0167-6423(86)90008-0_BIB14","article-title":"Zur formalen Entwicklung graphentheoretischer Algorithmen durch Transformation","author":"Berghammer","year":"1984","journal-title":"Institut f\u00fcr Informatik der TU M\u00fcnchen, Dissertation"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB15","first-page":"17","article-title":"Bottom-up computations of recursive programs","volume":"10","author":"Berry","year":"1976","journal-title":"R.A.I.R.O. Informat. Theorique"},{"issue":"4","key":"10.1016\/0167-6423(86)90008-0_BIB16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","article-title":"Tabulation techniques for recursive programs","volume":"12","author":"Bird","year":"1980","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-6423(86)90008-0_BIB17","article-title":"A case study in program development: sorting","author":"Broy","year":"1978","journal-title":"Institut f\u00fcr Informatik der TU M\u00fcnchen, TUM-INFO-7831"},{"key":"10.1016\/0167-6423(86)90008-0_BIB18","series-title":"Program Transformation and Programming Environments","first-page":"199","article-title":"Algebraic methods for program construction: the project CIP","volume":"8","author":"Broy","year":"1984"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/357103.357108","article-title":"Derivation of invariant assertions during program development by transformation","volume":"2","author":"Broy","year":"1980","journal-title":"ACM TOPLAS"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0167-6423(86)90004-3","article-title":"Algebraic implementations preserve program correctness","volume":"7","author":"Broy","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90008-0_BIB21","series-title":"Information Processing 80","first-page":"101","article-title":"Semantic relations in programming languages","author":"Broy","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB22","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TSE.1981.230815","article-title":"Program development as a formal activity","volume":"7","author":"Broy","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB23","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/357172.357175","article-title":"Combining algebraic and algorithmic reasoning: an approach to the Schorr-Waite algorithm","volume":"4","author":"Broy","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB24","series-title":"International Symposium on Programming","first-page":"59","article-title":"On relations between programs","volume":"83","author":"Broy","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB25","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","article-title":"Algorithm classification through synthesis","volume":"23","author":"Clark","year":"1980","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","article-title":"A synthesis of several sort programs","volume":"11","author":"Darlington","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(86)90008-0_BIB28","series-title":"Algorithmic Languages","first-page":"221","article-title":"The structural description of algorithm derivations","author":"Darlington","year":"1981"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TSE.1981.230816","article-title":"A transformational derivation of a parsing algorithm in a high-level language","volume":"7","author":"Deak","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(86)90008-0_BIB30","series-title":"Automata, Languages and Programming","first-page":"203","article-title":"One abstract accepting algorithm for all kinds of parsers","volume":"71","author":"Deussen","year":"1979"},{"key":"10.1016\/0167-6423(86)90008-0_BIB31","series-title":"Erzeugung, Akzeption und syntaktische Analyse formaler Sprachen","author":"Deussen","year":"1983"},{"key":"10.1016\/0167-6423(86)90008-0_BIB32","series-title":"Context pattern grammars: a unifying approach to generalized phrase structure grammars","author":"Dieterich","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB33","article-title":"Why naive program transformation systems are unlikely to work","author":"Dijkstra","year":"1976","journal-title":"Privately circulated manuscript EWD-636"},{"key":"10.1016\/0167-6423(86)90008-0_BIB34","series-title":"Program Construction","first-page":"54","article-title":"Program inversion","volume":"69","author":"Dijkstra","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB35","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90008-0_BIB36","series-title":"Proc. IFIP Working Conference on Formal Description of Programming Concepts","first-page":"391","article-title":"On the essence of compilation","author":"Ershov","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB37","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","article-title":"Mixed computation: potential applications and problems for study","volume":"18","author":"Ershov","year":"1982","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357153.357154","article-title":"A system for assisting program transformations","volume":"4","author":"Feather","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB39","article-title":"Automating the transformational development of software","author":"Fickas","year":"1982","journal-title":"Department of Computer Science, University of California at Irvine, Ph.D. thesis"},{"key":"10.1016\/0167-6423(86)90008-0_BIB40","series-title":"Semantik und Programmtransformation","author":"Gnatz","year":"1979"},{"key":"10.1016\/0167-6423(86)90008-0_BIB41","article-title":"Transformational implementation of control structure refinement","author":"Goldberg","year":"1983","journal-title":"Kestrel Institute, Technical Report"},{"key":"10.1016\/0167-6423(86)90008-0_BIB42","article-title":"Transformational derivation of dynamic programming algorithms","author":"Goldberg","year":"1984","journal-title":"Kestrel Institute, Report Kes.U.83.4"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB43","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/357103.357112","article-title":"An improved context-free recognizer","volume":"2","author":"Graham","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB44","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0004-3702(78)80016-2","article-title":"On program synthesis knowledge","volume":"10","author":"Green","year":"1978","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0167-6423(86)90008-0_BIB45","article-title":"Research on knowledge-based programming and algorithm design\u20141981","author":"Green","year":"1981","journal-title":"Kestrel Institute, Report Kes.U.81.2"},{"key":"10.1016\/0167-6423(86)90008-0_BIB46","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"37","article-title":"Automatic programming from data types decomposition","author":"Gresse","year":"1983"},{"key":"10.1016\/0167-6423(86)90008-0_BIB47","series-title":"Compiler Construction for Digital Computers","author":"Gries","year":"1971"},{"key":"10.1016\/0167-6423(86)90008-0_BIB48","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"1","article-title":"Automatic programming using abstract data types","author":"Guiho","year":"1983"},{"issue":"4","key":"10.1016\/0167-6423(86)90008-0_BIB49","first-page":"319","article-title":"Conception et certification de programmes a partir d'une d\u00e9composition par les donn\u00e9es","volume":"14","author":"Guiho","year":"1980","journal-title":"R.A.I.R.O Informat.\/Comput. Sci."},{"key":"10.1016\/0167-6423(86)90008-0_BIB50","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB51","series-title":"Construction, Amelioration et Verification des Programmes","first-page":"57","article-title":"On generating programs from types: an approach to automatic programming","author":"von Henke","year":"1975"},{"key":"10.1016\/0167-6423(86)90008-0_BIB52","article-title":"Derivation of logic programs","author":"Hogger","year":"1979","journal-title":"University of London, Ph.D. thesis"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB53","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/942578.807083","article-title":"Formal development of correct algorithms: an example based on Earley's recognizer","volume":"7","author":"Jones","year":"1972","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0167-6423(86)90008-0_BIB54","series-title":"Software Development: A Rigorous Approach","author":"Jones","year":"1980"},{"key":"10.1016\/0167-6423(86)90008-0_BIB55","article-title":"Power, efficiency, and correctness of transformation systems","author":"Kibler","year":"1978","journal-title":"Department of Computer Science, University of California at Irvine, Ph.D. Thesis"},{"key":"10.1016\/0167-6423(86)90008-0_BIB56","series-title":"Program Transformations","first-page":"232","article-title":"About a transformation system: a theoretical study","author":"Kott","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB57","article-title":"Unfold\/fold program transformations","author":"Kott","year":"1982","journal-title":"INRIA Centre de Rennes, Rapport de Recherche No. 155"},{"key":"10.1016\/0167-6423(86)90008-0_BIB58","first-page":"127","article-title":"An improved version of the Cocke-Younger-Kasami algorithm","volume":"3","author":"Manacher","year":"1978","journal-title":"Comput. J."},{"key":"10.1016\/0167-6423(86)90008-0_BIB59","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"issue":"4","key":"10.1016\/0167-6423(86)90008-0_BIB60","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TSE.1979.234198","article-title":"Synthesis: dreams \u21d2 programs","volume":"5","author":"Manna","year":"1979","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB61","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/357084.357090","article-title":"A deductive approach to program synthesis","volume":"2","author":"Manna","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB62","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6423(81)90004-6","article-title":"Deductive synthesis of the unification algorithm","volume":"1","author":"Manna","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90008-0_BIB63","series-title":"A Theory of Syntactic Recognition for Natural Languages","author":"Marcus","year":"1980"},{"key":"10.1016\/0167-6423(86)90008-0_BIB64","series-title":"Theoretische Grundlagen der Programmiersprachen","author":"Maurer","year":"1969"},{"key":"10.1016\/0167-6423(86)90008-0_BIB65","series-title":"Mathematics and Computer Science","article-title":"Algorithmics: Towards programming as a mathematical activity","volume":"I","author":"Meertens","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB66","series-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB67","article-title":"The role of high level specification in programming by transformations: specification and transformation by parts","author":"Merritt","year":"1982","journal-title":"Department of Computer Science, Courant Institute, New York University, Ph.D. thesis"},{"key":"10.1016\/0167-6423(86)90008-0_BIB68","first-page":"428","article-title":"The role of logic in knowledge representation and common sense","author":"Moore","year":"1982"},{"key":"10.1016\/0167-6423(86)90008-0_BIB69","series-title":"Mathematical Foundations of Computer Science 81","first-page":"103","article-title":"Parsing strategies: a concise survey","volume":"118","author":"Nijholt","year":"1981"},{"key":"10.1016\/0167-6423(86)90008-0_BIB70_1","series-title":"Courant Computer Science Report #15","article-title":"Expression continuity and formal differentiation of algorithms","author":"Paige","year":"1979"},{"key":"10.1016\/0167-6423(86)90008-0_BIB70_2","series-title":"Report LCSR-TR-9","article-title":"Laboratory for Computer Science Research","author":"Paige","year":"1981"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB71","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/357172.357177","article-title":"Finite differencing of computable expressions","volume":"4","author":"Paige","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB72","article-title":"Konstruktion effizienter Markov-Algorithmen durch Programm-Transformationen","author":"Partsch","year":"1979","journal-title":"Institut f\u00fcr Informatik der TU M\u00fcnchen, Dissertation"},{"key":"10.1016\/0167-6423(86)90008-0_BIB73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(83)90002-3","article-title":"An exercise in the transformational derivation of an efficient program by joint development of control and data structure","volume":"3","author":"Partsch","year":"1983","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90008-0_BIB74","series-title":"A transformational approach to parsing and recognition","author":"Partsch","year":"1983"},{"key":"10.1016\/0167-6423(86)90008-0_BIB75","series-title":"Programmiersprachen und Programmentwicklung","first-page":"41","article-title":"Transformational derivation of parsing algorithms executable on parallel architectures","volume":"77","author":"Partsch","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB76","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-6423(84)90010-8","article-title":"Structuring transformational developments: a case study based on Earley's recognizer","volume":"4","author":"Partsch","year":"1984","journal-title":"Sci. Comput. Programming"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB77","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/356914.356917","article-title":"Program transformation systems","volume":"15","author":"Partsch","year":"1983","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-6423(86)90008-0_BIB78","series-title":"Transformationelle Entwicklung von Algorithmen zur syntaktische Analyse, aufbauend auf einer einzigen abstrakten Spezifikation","author":"Paukner","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB79","series-title":"A simple calculus for program transformations (inclusive of induction)","author":"Pepper","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB80","series-title":"On the feedback between specification and implementation","author":"Pepper","year":"1980"},{"key":"10.1016\/0167-6423(86)90008-0_BIB81","series-title":"Algebraic types as a framework for program transformation","author":"Pepper","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB82","series-title":"Proc. Informatica 77","first-page":"1","article-title":"Transformations of programs and use of tupling strategy","author":"Pettorossi","year":"1977"},{"key":"10.1016\/0167-6423(86)90008-0_BIB83","series-title":"Proc. 1984 ACM Symposium on LISP and Functional Programming","first-page":"74","article-title":"A powerful strategy for deriving efficient programs by transformation","author":"Pettorossi","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB84","series-title":"Report CMU-CS-82-155","article-title":"Deriving efficient graph algorithms","author":"Reif","year":"1982"},{"key":"10.1016\/0167-6423(86)90008-0_BIB85","series-title":"Automata, Languages and Programming","first-page":"489","article-title":"On the complexity of general context-free language parsing and recognition","volume":"71","author":"Ruzzo","year":"1979"},{"key":"10.1016\/0167-6423(86)90008-0_BIB86","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0167-6423(86)90008-0_BIB87","article-title":"Expression procedures and program derivation","author":"Scherlis","year":"1980","journal-title":"Department of Computer Science, Stanford University, Report STAN-CS-80-818"},{"key":"10.1016\/0167-6423(86)90008-0_BIB88","series-title":"Proc. 8th ACM Symposium on Principles of Programming Languages","first-page":"41","article-title":"Program improvement by internal specialization","author":"Scherlis","year":"1981"},{"key":"10.1016\/0167-6423(86)90008-0_BIB89","series-title":"Report CMU-CS-83-142","article-title":"First steps towards inferential programming","author":"Scherlis","year":"1983"},{"issue":"3","key":"10.1016\/0167-6423(86)90008-0_BIB90","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6423(82)90017-X","article-title":"An exercise in program synthesis: algorithms for computing the transitive closure of a relation","volume":"1","author":"Schmitz","year":"1982","journal-title":"Sci. Comput. Programming"},{"issue":"2","key":"10.1016\/0167-6423(86)90008-0_BIB91","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/357133.357135","article-title":"An automatic technique for selection of data representations in SETL programs","volume":"3","author":"Schonberg","year":"1981","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB92","article-title":"Algorithm derivation by transformations","author":"Sharir","year":"1979","journal-title":"Department of Computer Science, Courant Institute, New York University, Technical Report No. 021"},{"key":"10.1016\/0167-6423(86)90008-0_BIB93","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0096-0551(81)90047-3","article-title":"Formal integration, A program transformation technique","volume":"6","author":"Sharir","year":"1981","journal-title":"Comput. Languages"},{"issue":"2","key":"10.1016\/0167-6423(86)90008-0_BIB94","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/357162.357166","article-title":"Some observations concerning formal differentiation of set theoretic expressions","volume":"4","author":"Sharir","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90008-0_BIB95","series-title":"Proc. 7th International Conference on Automated Deduction","first-page":"1","article-title":"Universal unification","volume":"170","author":"Siekmann","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB96","series-title":"3rd International Colloquium on Automata, Languages and Programming","first-page":"531","article-title":"Eliminating blind alleys from backtrack programs","author":"Sintzoff","year":"1976"},{"key":"10.1016\/0167-6423(86)90008-0_BIB97","series-title":"Constructing Quality Software","first-page":"471","article-title":"Inventing program construction","author":"Sintzoff","year":"1978"},{"key":"10.1016\/0167-6423(86)90008-0_BIB98","series-title":"International Symposium on Programming","first-page":"311","article-title":"Suggestions for comparing and specifying program design decisions","volume":"83","author":"Sintzoff","year":"1980"},{"key":"10.1016\/0167-6423(86)90008-0_BIB99","series-title":"Proc. 2nd International Logic Programming Conference","first-page":"139","article-title":"Bounded-horizon goal-oriented specialization of inference programs","author":"Sintzoff","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB100","series-title":"Program Transformation and Programming Environments","first-page":"169","article-title":"Understanding and expressing software construction","volume":"8","author":"Sintzoff","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB101","series-title":"Proc. Workshop \u201cCombining Specification Methods\u201d","article-title":"Exploratory proposals for a calculus of software development","author":"Sintzoff","year":"1984"},{"key":"10.1016\/0167-6423(86)90008-0_BIB102","series-title":"Technical Report NPS 52-82-011","article-title":"Top-down synthesis of simple divide and conquer algorithms","author":"Smith","year":"1982"},{"key":"10.1016\/0167-6423(86)90008-0_BIB103","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"32","article-title":"A problem reduction approach to program synthesis","author":"Smith","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(86)90008-0_BIB104","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0167-6423(85)90003-6","article-title":"The design of divide and conquer algorithms","volume":"5","author":"Smith","year":"1985","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90008-0_BIB105","series-title":"Program development using transformational expressions","author":"Steinbr\u00fcggen","year":"1982"},{"key":"10.1016\/0167-6423(86)90008-0_BIB106","series-title":"Proc. Annual Conference of the American Association for Artificial Intelligence","first-page":"46","article-title":"Some algorithm design methods","author":"Tappel","year":"1980"},{"key":"10.1016\/0167-6423(86)90008-0_BIB107","series-title":"Proc. ACM Conference on Functional Programming Languages and Computer Architecture","first-page":"83","article-title":"The semantic elegance of applicative languages","author":"Turner","year":"1981"},{"key":"10.1016\/0167-6423(86)90008-0_BIB108","series-title":"Proc. 3rd ACM Symposium on Principles of Programming Languages","first-page":"153","article-title":"Goal-directed program transformation","author":"Wegbreit","year":"1976"},{"issue":"11","key":"10.1016\/0167-6423(86)90008-0_BIB109","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1145\/182.358443","article-title":"Program developments: formal explanations of implementations","volume":"26","author":"Wile","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90008-0_BIB110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264293","article-title":"On hierarchies of abstract data types","volume":"20","author":"Wirsing","year":"1983","journal-title":"Acta Informat."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:55:49Z","timestamp":1584510949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":112,"alternative-id":["0167642386900080"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90008-0","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}