{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:52Z","timestamp":1725663652280},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512844"},{"type":"electronic","value":"9783540461838"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3540512845_56","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:50:59Z","timestamp":1330203059000},"page":"458-476","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partheo: A parallel inference machine ESPRIT 415 subproject F"],"prefix":"10.1007","author":[{"given":"W.","family":"Ertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Kurfe\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Letz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X.","family":"Pandolfi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Schumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"28_CR1","unstructured":"Ada Reference manual for the ADA programming language. United States Department of Defense, 1980."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Backus, J. W. Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs. Comm. ACM 21(8), 1978.","DOI":"10.1145\/359576.359579"},{"key":"28_CR3","unstructured":"Bayerl, S., Ertel, W., Kurfess, F., Letz, R., & Schumann, J. Layout and Design of Full First Order Logic Parallel Inference Machine. Deliverable D14, ESPRIT 415 F, 1988."},{"key":"28_CR4","unstructured":"Belmesk, Z. M\u00e9thodologie de sp\u00e9cification et de programmation des protocoles de communication avec le langage FP2. Cas \u00e9tudi\u00e9: le niveau liaison du protocole X25. Research Report LIFIA 86 \u2014 IMAG 748. Univ. Grenoble, October 1988."},{"key":"28_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"Bibel, W.Automated Theorem Proving (2nd. ed.). Vieweg, Braunschweig, 1987.","edition":"2nd. ed."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/182.183","volume":"26","author":"W. Bibel","year":"1983","unstructured":"Bibel, W. Matings in Matrices. Comm. of the ACM, 26, 844\u2013852, 1983.","journal-title":"Comm. of the ACM"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Bibel, W., Kurfess, F., Aspetsberger, K., Hintenaus, P. & J. Schumann. Parallel Inference Machines. in [Treleaven & Vanneschi 1987], 185\u2013226, 1987.","DOI":"10.1007\/3-540-18203-9_5"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Devienne, Ph. & Lebegue, P. Weighted graphs: a tool for logic programming. In Proc. CAAP 86, Nice, Lecture Notes in Computer Science 214, Springer-Verlag, March 1986.","DOI":"10.1007\/BFb0022662"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Ehrich, H.D. On the theory of specification, implementation and parametrization of abstract data types. Journal of the ACM 29(1), 1982.","DOI":"10.1145\/322290.322303"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Kreowski, H.J., Thatcher, J., Wagner, E. & Wright, J. Parameter passing in algebraic specification languages. Theoretical Computer Science 28, 1984.","DOI":"10.1016\/0304-3975(83)90065-8"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Guttag, J.V. & Horning, J.J. The algebraic specification of abstract data types. Acta Informatica 10, 1978.","DOI":"10.1007\/BF00260922"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Guttag, Horowitz & Musser Abstract data types and software validation. Comm. ACM 21(12), 1978.","DOI":"10.1145\/359657.359666"},{"key":"28_CR13","unstructured":"Hufflen, J.M. Une implementation de LPG en Lisp: \u201cGrand-Guignol\u201d. Research Report LIFIA 60 \u2014 IMAG 654, Univ. Grenoble, March 1987."},{"key":"28_CR14","unstructured":"Ib\u00e1\u00f1ez, M.B. Parallel inferencing in first order logic based on the connection method. In Proc. AIMSA 88 Conf., Varna, September 1988."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Jorrand, Ph. Term rewriting as a basis for the design of a functional and parallel programming language. A case study: the language FP2. In ACAI 85, Lecture Notes in Computer Science 232, Springer-Verlag, 1986.","DOI":"10.1007\/BFb0022684"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Jorrand, Ph. Design and implementation of a parallel inference machine for first order logic: an overview. In Proc. PARLE 87, Vol I: Parallel Architectures, Eindhoven, Lecture Notes in Computer Science 258, Springer-Verlag, June 1987.","DOI":"10.1007\/3-540-17943-7_143"},{"key":"28_CR17","unstructured":"Jorrand, Ph. & Schnoebelen, Ph. LIFIA\/IMAG, Grenoble. 1989."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Keller, R.M. Formal verification of parallel programs. Comm. ACM 19(7), 1976.","DOI":"10.1145\/360248.360251"},{"key":"28_CR19","unstructured":"Kowalski, R. Logic programming. Information Processing '83, 133\u2013145, 1983."},{"key":"28_CR20","volume-title":"Logic and Reasoning with Neural Models","author":"F. Kurfess","year":"1988","unstructured":"Kurfess, F. Logic and Reasoning with Neural Models. Institut f\u00fcr Informatik, Technische Universit\u00e4t, M\u00fcnchen, 1988."},{"key":"28_CR21","volume-title":"SETHEO: A SEquential THEOrem-prover for first order logic","author":"R. Letz","year":"1988","unstructured":"Letz, R., Schumann, J., and S. Bayerl. SETHEO: A SEquential THEOrem-prover for first order logic. Institut f\u00fcr Informatik, Techn. Universit\u00e4t M\u00fcnchen, M\u00fcnchen, 1988."},{"key":"28_CR22","first-page":"396","volume":"224","author":"G. Levi","year":"1986","unstructured":"Levi, G. Logic Programming: The Foundations, the Approach, and the Role of Concurrency. In De Bakker, J.W., De Roever, W.P., and Rozenberg, G. (eds.): Current Trends in Concurrency, LNCS 224, 396\u2013441, Springer, 1986.","journal-title":"LNCS"},{"key":"28_CR23","unstructured":"Marty, J.C. EDIT-FP2 User's Guide. Document Deliverable D9 (Part IIa) of Subproject F of ESPRIT Project 415, LIFIA, Univ. Grenoble, April 1987."},{"key":"28_CR24","unstructured":"Marty, J.C. EDIT-FP2 System Programmer's Guide. Document Deliverable D8 (Part II) of Subproject F of ESPRIT Project 415, LIFIA, Univ. Grenoble, April 1987."},{"key":"28_CR25","unstructured":"Marty, J.C., Rog\u00e9, S., Schnoebelen, Ph. Structure of the FP2 environment including the extensions. Document Deliverable D8 (Part I) of Subproject F of ESPRIT Project 415, LIFIA, Univ. Grenoble, April 1987."},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Milner, R. A Calculus of Communicating Processes. Lecture Notes in Computer Science 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"28_CR27","unstructured":"Pandolfi, X. A distributed implementation of the FP2 communication mechanism. Manuscript LIFIA\/IMAG, 1989."},{"key":"28_CR28","unstructured":"Pereira, J.M. Processus communicants; un langage formel et ses mod\u00e8les. Probl\u00e8mes d'analyse. Th\u00e8se de 3eme cycle, Univ. Grenoble, 1984."},{"key":"28_CR29","unstructured":"Rog\u00e9, S. Comparaison des comportements des processus communicants. Application au langage FP2. Th\u00e8se de Doctorat, I.N.P. Grenoble, November 1986."},{"key":"28_CR30","unstructured":"Rog\u00e9, S. A parallel FP2 interpreter. ESPRIT Conference 1988."},{"key":"28_CR31","unstructured":"Schaefer, P. & Schnoebelen, Ph. Specification of a pipelined event driven simulator. Research Report LIFIA 65 \u2014 IMAG 682, Univ. Grenoble, 1986."},{"key":"28_CR32","unstructured":"Schnoebelen, Ph. The semantics of concurrency in FP2. Research Report LIFIA 30 \u2014 IMAG 558, Univ. Grenoble, October 1985."},{"key":"28_CR33","unstructured":"Schnoebelen, Ph.\u03bcFP2: A prototype interpreter for FP2. Research Report LIFIA 41 \u2014 IMAG 573, Univ. Grenoble, January 1986."},{"key":"28_CR34","unstructured":"Schnoebelen, Ph. About the implementation of FP2. Research Report LIFIA 42 \u2014 IMAG 574, Univ. Grenoble, January 1986."},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"Schnoebelen, Ph. Rewriting techniques for the temporal analysis of communicating processes. Research Report IMAG 672, Univ. Grenoble, July 1987.","DOI":"10.1007\/3-540-17945-3_23"},{"key":"28_CR36","doi-asserted-by":"crossref","unstructured":"Schnoebelen, Ph. Refined compilation of pattern-matching for functional languages. Research Report LIFIA 71 \u2014 IMAG 715, Univ. Grenoble, April 1988. To appear in Science of Computer Programming.","DOI":"10.1007\/3-540-50667-5_75"},{"key":"28_CR37","unstructured":"Schumann, J., Ertel, W., & C. Suttner. Learning Heuristics for a Theorem Prover using Back Propagation. submitted to \u00d6GAI-89."},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Sifakis, J. A unified approach for studying the properties of transitions systems. Theoretical Computer Science 18, 1982.","DOI":"10.1016\/0304-3975(82)90067-6"},{"key":"28_CR39","volume-title":"COMMON LISP","author":"G.L. Steele Jr.","year":"1984","unstructured":"Steele, G.L., Jr. COMMON LISP. Digital Press, Burlington, Mass. 1984."},{"key":"28_CR40","volume-title":"Generierung nat\u00fcrlichsprachlicher S\u00e4tze in unifikationsbasierten Grammatiken \u2014 Ein Konnektionistischer Ansatz","author":"A. Stolcke","year":"1988","unstructured":"A. Stolcke. Generierung nat\u00fcrlichsprachlicher S\u00e4tze in unifikationsbasierten Grammatiken \u2014 Ein Konnektionistischer Ansatz. Diplomarbeit, Institut f\u00fcr Informatik, Techn. Universit\u00e4t M\u00fcnchen, M\u00fcnchen, 1988."},{"key":"28_CR41","unstructured":"Syre, J.C. A Review of Computer Architectures for Functional and Logic Programming Systems. Tech. Report CA-09, ECRC, M\u00fcnchen, 1985."},{"key":"28_CR42","doi-asserted-by":"crossref","unstructured":"Treleaven, P.C. & M. Vanneschi (eds.). Future Parallel Computers. LNCS 272, Springer, Berlin, 1987.","DOI":"10.1007\/3-540-18203-9"},{"key":"28_CR43","volume-title":"An Abstract Prolog Instruction Set","author":"D.H.D. Warren","year":"1983","unstructured":"WARREN, D.H.D. An Abstract Prolog Instruction Set. SRI International, Artificial Intelligence Center, Menlo Park, California, October 1983."}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540512845_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:50:34Z","timestamp":1640919034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540512845_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512844","9783540461838"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3540512845_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"26 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}