{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:50Z","timestamp":1725664970334},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617358"},{"type":"electronic","value":"9783540706724"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61735-3_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:17:25Z","timestamp":1330276645000},"page":"150-164","source":"Crossref","is-referenced-by-count":3,"title":["A language for the logical specification of processes and relations"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Caires","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"J.-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297\u2013347, 1992.","journal-title":"J. of Logic and Computation"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9, 1991.","DOI":"10.1007\/BF03037173"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Lu\u00eds Caires. A language for the logical specification of processes and relations. In Draft. Available at http:\/\/www-ctp.di.fct.unl.pt\/~lcaires\/papers\/lc.dvi.gz, 1996.","DOI":"10.1007\/3-540-61735-3_10"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Iliano Cervesato, J. Hodas, and F. Pfenning. Efficient resource management for linear logic proof search. In R. Dyckhoff and Peter Schroeder-Heister, editors, Proc. Fifth Intl. Workshop on Extensions of Logic Programming, pages 67\u201381, 1996.","DOI":"10.1007\/3-540-60983-0_5"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Iliano Cervesato and Frank Pfenning. A linear logical framework. In Proc. Eleventh IEEE Symp. Logic in Computer Science, 1996.","DOI":"10.1109\/LICS.1996.561339"},{"key":"10_CR6","unstructured":"J. Harland and M. Winikoff. Implementation and development issues for the linear logic programming language Lygon. In Proc. of the Eighteenth Australian Computer Science Conference, 1995."},{"issue":"2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J. S. Hodas","year":"1994","unstructured":"J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. J. Information and Computation, 110(2):327\u2013365, 1994.","journal-title":"J. Information and Computation"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"J.Y. Girard, Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01211602","volume":"7","author":"N. Kobayashi","year":"1995","unstructured":"N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113\u2013149, 1995.","journal-title":"Formal Aspects of Computing"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"P. Lincoln and V. Saraswat. Higher-order, linear, concurrent constraint programming. Unpublished manuscript, 1993.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"10_CR11","unstructured":"D. Miller. A multiple-conclusion specification logic. Theoretical Computer Science, (To appear, draft of January 3, 1996. Available from ftp.cis.upenn.edu)."},{"issue":"4","key":"10_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497\u2013536, 1991.","journal-title":"J. Logic and Computation"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"D. Miller. The \u03c0-calculus as a theory in linear logic: preliminary results. In E. Lamma and P. Mello, editors, Proc. of the Workshop on Extensions of Logic Programming, pages 242\u2013264, 1992.","DOI":"10.1007\/3-540-56454-3_13"},{"key":"10_CR14","unstructured":"D. Miller. A survey of linear logic programming. Computational Logic, 2(2), 1995."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"D. Miller and G. Nadathur. Higher-order logic programming. In Proc. of the Third International Conference on Logic Programming, pages 448\u2013462, 1986.","DOI":"10.1007\/3-540-16492-8_94"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proof as a foundation for logic programming. Annals of Pure and Applied Logic, (51):125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"10_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"10_CR18","unstructured":"R. Milner. Functions as processes. J. Computer and System Sciences, 17(3), 1992."},{"issue":"2","key":"10_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"R. Milner. The polyadic \u03c0-calculus: A tutorial. Mathematical Structures in Computer Science, 2(2):119\u2013142, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"U. Montanari and Pistore. Concurrent semantics for the \u03c0-calculus. Electronic Notes on Theoretical Computer Science, 1, 1995.","DOI":"10.1016\/S1571-0661(04)00024-6"},{"key":"10_CR21","unstructured":"L. Monteiro. Distributed logic: a logical system for specifying concurrency. In TR CIUNL-5.81, Departamento de Inform\u00e1tica, Universidade Nova de Lisboa, 1891, 1986."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61735-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:05Z","timestamp":1619559365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61735-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617358","9783540706724"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61735-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}