{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:37Z","timestamp":1725663457669},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164425"},{"type":"electronic","value":"9783540397823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16442-1_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:41:09Z","timestamp":1330195269000},"page":"339-350","source":"Crossref","is-referenced-by-count":20,"title":["Experiences with the RAP system \u2014 a specification interpreter combining term rewriting and resolution"],"prefix":"10.1007","author":[{"given":"Alfons","family":"Geser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinrich","family":"Hussman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"26_CR1","volume-title":"The handbook of artificial intelligence, Vol. I","author":"A. Barr","year":"1981","unstructured":"A. Barr, E. A. Feigenbaum, The handbook of artificial intelligence, Vol. I. Heuris Tech Press, Stanford 1981"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"M. Bidoit, C. Choppy, ASSPEGIQUE: An integrated environment for algebraic specifications, Proc. TAPSOFT 85, LNCS 186, pp.246\u2013260","DOI":"10.1007\/3-540-15199-0_16"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"L. Bouge, N. Choquet, L. Fribourg, M. C. Gaudel, Application of PROLOG to test sets generation from algebraic specifications. Proc. TAPSOFT 85 Conf., LNCS 186, pp.262\u2013275","DOI":"10.1007\/3-540-15199-0_17"},{"key":"26_CR4","unstructured":"M. Broy, C. Pair, M. Wirsing, A systematic study of models of abstract data types. Report 81-R-04Z, Universit\u00e9 de Nancy, Nancy 1981. To appear also in TCS."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"R. Budde,K. Kuhlenkamp, L. Mathiassen, H. Z\u00fcllinghoven (Eds.): Approaches to prototyping. Berlin\/Heidelberg\/New York\/Tokyo 1984.","DOI":"10.1007\/978-3-642-69796-8"},{"key":"26_CR6","volume-title":"The Munich project CIP, Vol. II, Part I: Formal specification. Report TUM-I8509","author":"A. Horsch","year":"1985","unstructured":"A. Horsch, B. M\u00f6ller, H. Partsch, O. Paukner, P. Pepper, The Munich project CIP, Vol. II, Part I: Formal specification. Report TUM-I8509 Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen 1985"},{"key":"26_CR7","volume-title":"ERIL \u2014 Equational reasoning: an interactive laboratory","author":"A. J. J. J. Dick","year":"1985","unstructured":"A. J. J. Dick, ERIL \u2014 Equational reasoning: an interactive laboratory. Internal report Rutherford Appleton Laboratory, Chilton, Didcot 1985"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"L. Fribourg, Oriented equational clauses as a programming language. Report 84002 Laboratoires de Marcoussis, Marcoussis 1984. Short version in: Proc. 11th ICALP Conf., LNCS 172, pp. 162\u2013173","DOI":"10.1007\/3-540-13345-3_15"},{"key":"26_CR9","unstructured":"L. Fribourg, Handling function definitions through innermost superposition and rewriting. Report 84-69 LITP, Universit\u00e9 Paris 7, 1984. Short version in: Proc. 1st RTA Conf., to appear in LNCS"},{"key":"26_CR10","unstructured":"A. Geser, An algebraic specification of the INTEL 8085 microprocessor: A case study. Report Universit\u00e4t Passau, to appear."},{"key":"26_CR11","volume-title":"Rapid prototyping for algebraic specifications \u2014 examples for the use of the RAP system, Report MIP-8517","author":"A. Geser","year":"1985","unstructured":"A. Geser, H. Hussmann, Rapid prototyping for algebraic specifications \u2014 examples for the use of the RAP system, Report MIP-8517 Universit\u00e4t Passau, Passau 1985."},{"key":"26_CR12","unstructured":"J. A. Goguen, J. Meseguer, Equality, types, modules and generics for logic programming. Report CSLI-84-5 Leland Stanford Junior University, Stanford 1985"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"G. Huet, D. C. Oppen, Equations and rewrite rules \u2014 a survey. In: R. V. Book (ed.), Formal language theory \u2014 perspectives and open problems. Academic Press","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"J. M. Hullot, Canonical forms and unification. Proc. 5th CADE Conf., LNCS 87, pp. 318\u2013334 1980","DOI":"10.21236\/ADA087640"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"H. Hussmann, Unification in conditional-equational theories, Report MIP-8502 Universit\u00e4t Passau, Passau 1985. Short version also in: Proc. EUROCAL 85, to appear in LNCS.","DOI":"10.1007\/3-540-15984-3_328"},{"key":"26_CR16","unstructured":"H. Hussmann, Rapid prototyping for algebraic specifications \u2014 RAP system user's manual. Report MIP-8504 Universit\u00e4t Passau, Passau 1985"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"S. Kaplan, Fair conditional term rewriting systems: unification, termination and confluence. Report 194 LRI Universit\u00e9 de Paris-Sud, Orsay 1984","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"P. Lescanne, Computer experiments with the REVE term rewriting system generator, Proc. 10th ACM Conf. on Principles of Programming Languages, Austin, Texas 1983","DOI":"10.1145\/567067.567078"},{"key":"26_CR19","unstructured":"J. L. Remy, H. Zhang, REVEUR4: A system for validating conditional algebraic specifications of abstract data types. In: T. O'Shea (ed.), Proc. ECAI 84: Advances in artificial intelligence, pp. 563\u2013572, North-Holland 1984"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"P. Rety, C. Kirchner, H. Kirchner, P. Lescanne, NARROWER: a new algorithm for unification and its application to logic programming. In: Proc. RTA 85 Conf., to appear in LNCS.","DOI":"10.1007\/3-540-15976-2_7"},{"key":"26_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264293","volume":"20","author":"M. Wirsing","year":"1983","unstructured":"M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20(1983), 1\u201333.","journal-title":"Acta Informatica"},{"key":"26_CR22","unstructured":"L. Wos, R. Overbeek, E. Lusk, J. Boyle: Automated Reasoning, introduction and applications, Prentice Hall Inc., 1984"}],"container-title":["Lecture Notes in Computer Science","ESOP 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16442-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:06Z","timestamp":1605643806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}