{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:36:18Z","timestamp":1648611378223},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0304-3975(94)90205-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"137-164","source":"Crossref","is-referenced-by-count":0,"title":["Defining concurrent processes constructively"],"prefix":"10.1016","volume":"122","author":[{"given":"Yukihide","family":"Takayama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90205-4_BIB1","article-title":"Non-well-founded sets","volume":"Vol. 14","author":"Aczel","year":"1988"},{"key":"10.1016\/0304-3975(94)90205-4_BIB2","series-title":"Category Theory and Computer Science","article-title":"A final coalgebra theorem","volume":"Vol. 389","author":"Aczel","year":"1989"},{"key":"10.1016\/0304-3975(94)90205-4_BIB3","series-title":"Foundation of Constructive Mathematics","author":"Beeson","year":"1985"},{"key":"10.1016\/0304-3975(94)90205-4_BIB4","series-title":"Recursive Programming Techniques","author":"Burge","year":"1975"},{"key":"10.1016\/0304-3975(94)90205-4_BIB5","series-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/0304-3975(94)90205-4_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01887211","article-title":"A functional programming approach to the specification and verification of concurrent systems","volume":"1","author":"Dybjer","year":"1989","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/0304-3975(94)90205-4_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90205-4_BIB8","author":"Goto","year":"1985","journal-title":"Concurrency in proof normalization and logic programming"},{"key":"10.1016\/0304-3975(94)90205-4_BIB9","series-title":"Category Theory and Computer Science","article-title":"A typed lambda calculus with categorical type constructors","volume":"Vol. 283","author":"Hagino","year":"1987"},{"key":"10.1016\/0304-3975(94)90205-4_BIB10","series-title":"PX: A Computational Logic","author":"Hayashi","year":"1989"},{"key":"10.1016\/0304-3975(94)90205-4_BIB11","series-title":"Essays on Combinatory Logic, Lambda Calculus and Formalism","article-title":"The formulas-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/0304-3975(94)90205-4_BIB12","series-title":"Proc. IFIP Congress '74","article-title":"The semantics of a simple language for parallel programming","author":"Kahn","year":"1974"},{"key":"10.1016\/0304-3975(94)90205-4_BIB13","series-title":"Proc. Information Processing '77","article-title":"Coroutine and networks of parallel processes","author":"Kahn","year":"1977"},{"key":"10.1016\/0304-3975(94)90205-4_BIB14","author":"Kobayashi","year":"1991","journal-title":"Inductive\/coinductive definitions and their realizability interpretation"},{"key":"10.1016\/0304-3975(94)90205-4_BIB15","article-title":"Nonstrandard type theory","author":"Martin-L\u00f6f","year":"1988","journal-title":"Proc. Logic Colloquium"},{"key":"10.1016\/0304-3975(94)90205-4_BIB16","article-title":"Infinite objects in type theory","author":"Mendler","year":"1986","journal-title":"Proc. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)90205-4_BIB17","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(94)90205-4_BIB18","article-title":"Algorithm development in the calculus of constructions","author":"Mohring","year":"1986","journal-title":"Proc. IEEE on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)90205-4_BIB19","article-title":"Programming in Martin-L\u00f6f's Type Theory, An Introduction","volume":"Vol. 7","author":"Petersson","year":"1990"},{"key":"10.1016\/0304-3975(94)90205-4_BIB20","series-title":"Natural Deduction","author":"Prawitz","year":"1965"},{"key":"10.1016\/0304-3975(94)90205-4_BIB21","series-title":"4th Internat. Conf. on Logic Programming","article-title":"Quty: A concurrent language based on logic and function","author":"Sato","year":"1987"},{"key":"10.1016\/0304-3975(94)90205-4_BIB22","series-title":"Proc. Japanese\u2014Czechoslovak Seminar on Theoretical Foundations of Knowledge Information Processing","article-title":"Constructive programming in SST","author":"Sato","year":"1990"},{"key":"10.1016\/0304-3975(94)90205-4_BIB23","series-title":"Proc. European Symp. on Programming '88","article-title":"QPC: QJ-based proof compiler \u2014 simple examples and analysis","volume":"Vol. 300","author":"Takayama","year":"1988"},{"key":"10.1016\/0304-3975(94)90205-4_BIB24","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(06)80008-8","article-title":"QPC2: A constructive calculus with parameterized specifications","author":"Takayama","year":"1993","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"10.1016\/0304-3975(94)90205-4_BIB25","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(08)80139-3","article-title":"Extraction of redundancy-free programs from constructive natural deduction proofs","volume":"12","author":"Takayama","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)90205-4_BIB26","article-title":"Realizability interpretation of coinductive definitions and program synthesis with streams","volume":"Vol. 2","author":"Tatsuta","year":"1992"},{"key":"10.1016\/0304-3975(94)90205-4_BIB27","series-title":"Metamathematical Investigation of Intuitionistic Arithmetic and Analysis","volume":"Vol. 344","year":"1973"},{"key":"10.1016\/0304-3975(94)90205-4_BIB28","series-title":"Intuitionistic Mathematics","article-title":"Choice sequences","author":"Troelstra","year":"1977"},{"key":"10.1016\/0304-3975(94)90205-4_BIB29","article-title":"Constructivism in Mathematics, An Introduction","volume":"Vol 121","author":"Troelstra","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:31Z","timestamp":1555115131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0304397594902054"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90205-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}