{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:30Z","timestamp":1759637790573},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_14","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"151-165","source":"Crossref","is-referenced-by-count":5,"title":["A Lambda Calculus for G\u00f6del\u2013Dummett Logic Capturing Waitfreedom"],"prefix":"10.1007","author":[{"given":"Yoichi","family":"Hirai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational interpretations of linear logic. Theo. Comp. Sci.\u00a0111(1-2), 3\u201357 (1993)","journal-title":"Theo. Comp. Sci."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell.\u00a04, 225\u2013248 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics, pp. 1\u201332. Clarendon Press (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.: A natural deduction system for intuitionistic fuzzy logic. In: Lectures on Soft Computing (2001)","DOI":"10.1007\/978-3-7908-1818-5_1"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/982962.964007","volume":"39","author":"V. Balat","year":"2004","unstructured":"Balat, V., Di Cosmo, R., Fiore, M.: Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. SIGPLAN Not.\u00a039(1), 64\u201376 (2004)","journal-title":"SIGPLAN Not."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In: PODC 1988, pp. 263\u2013275. ACM (1988)","DOI":"10.1145\/62546.62590"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC 1993, pp. 41\u201351. ACM (1993)","DOI":"10.1145\/164051.164056"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: LICS 2008, pp. 229\u2013240. IEEE (2008)","DOI":"10.1109\/LICS.2008.39"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Dummett, M.: A propositional calculus with denumerable matrix. J. Symb. Logic\u00a024(2), 97\u2013106 (1959)","journal-title":"J. Symb. Logic"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-45206-5_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C.G. Ferm\u00fcller","year":"2003","unstructured":"Ferm\u00fcller, C.G.: Parallel Dialogue Games and Hypersequents for Intermediate Logics. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol.\u00a02796, pp. 48\u201364. Springer, Heidelberg (2003)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45699-6_6","volume-title":"Applied Semantics","author":"C. Fournet","year":"2002","unstructured":"Fournet, C., Gonthier, G.: The Join Calculus: A Language for Distributed Mobile Programming. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol.\u00a02395, pp. 268\u2013332. Springer, Heidelberg (2002)"},{"issue":"4","key":"14_CR12","first-page":"288","volume":"1","author":"G. Gentzen","year":"1964","unstructured":"Gentzen, G.: Investigations into logical deduction. American Philosophical Quarterly\u00a01(4), 288\u2013306 (1964)","journal-title":"American Philosophical Quarterly"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/inco.2002.3147","volume":"178","author":"P. Groote de","year":"2002","unstructured":"de Groote, P.: On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions. Information and Computation\u00a0178(2), 441\u2013464 (2002)","journal-title":"Information and Computation"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M.: Impossibility and universality results for wait-free synchronization. In: PODC 1988, pp. 276\u2013290. ACM (1988)","DOI":"10.1145\/62546.62593"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-17511-4_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Y. Hirai","year":"2010","unstructured":"Hirai, Y.: An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 272\u2013289. Springer, Heidelberg (2010)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"key":"14_CR17","unstructured":"Milner, R.: Communicating and mobile systems: the pi-calculus. Cambridge University Press (1999)"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"Moran, S.: Extended impossibility results for asynchronous complete networks. Information Processing Letters\u00a026(3), 145\u2013151 (1987)","journal-title":"Information Processing Letters"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. In: STOC 1993, pp. 101\u2013110. ACM (1993)","DOI":"10.1145\/167088.167122"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"S\u00f8rensen, M.H., Urzyczyn, P.: Lectures on the Curry\u2013Howard isomorphism. Elsevier (2007)","DOI":"10.1016\/S0049-237X(06)80005-4"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T17:44:48Z","timestamp":1713980688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}