{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:52:11Z","timestamp":1770277931966,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319089171","type":"print"},{"value":"9783319089188","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_8","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T01:44:22Z","timestamp":1404265462000},"page":"108-123","source":"Crossref","is-referenced-by-count":13,"title":["A Model of Countable Nondeterminism in Guarded Type Theory"],"prefix":"10.1007","author":[{"given":"Ale\u0161","family":"Bizjak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marino","family":"Miculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S095679689700261X","volume":"7","author":"G. Agha","year":"1997","unstructured":"Agha, G., Mason, I.A., Smith, S.F., Talcott, C.L.: A foundation for actor computation. Journal of Functional Programming\u00a07(1), 1\u201372 (1997)","journal-title":"Journal of Functional Programming"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, A.: Step-indexed syntactic logical relations for recursive and quantified types. Tech. rep., Harvard University (2006), \n                  \n                    http:\/\/www.ccs.neu.edu\/home\/amal\/papers\/lr-recquant-techrpt.pdf","DOI":"10.1007\/11693024_6"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., Plotkin, G.D.: Countable nondeterminism and random assignment. Journal of the ACM\u00a033(4), 724\u2013767 (1986)","journal-title":"Journal of the ACM"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Birkedal, L., Bizjak, A., Schwinghammer, J.: Step-indexed relational reasoning for countable nondeterminism. Logical Methods in Computer Science\u00a09(4) (2013)","DOI":"10.2168\/LMCS-9(4:4)2013"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Birkedal, L., M\u00f8gelberg, R.E., Schwinghammer, J., St\u00f8vring, K.: First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Logical Methods in Computer Science\u00a08(4) (2012)","DOI":"10.2168\/LMCS-8(4:1)2012"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bizjak, A., Birkedal, L., Miculan, M.: A model of countable nondetermism in guarded type theory (2014), \n                  \n                    http:\/\/cs.au.dk\/~abizjak\/documents\/trs\/cntbl-gtt-tr.pdf","DOI":"10.1007\/978-3-319-08918-8_8"},{"issue":"2","key":"8_CR7","first-page":"126","volume":"2","author":"P. Di Gianantonio","year":"1995","unstructured":"Di Gianantonio, P., Honsell, F., Plotkin, G.D.: Uncountable limits and the lambda calculus. Nordic Journal of Computing\u00a02(2), 126\u2013145 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Dreyer, D., Ahmed, A., Birkedal, L.: Logical step-indexed logical relations. Logical Methods in Computer Science\u00a07(2) (2011)","DOI":"10.2168\/LMCS-7(2:16)2011"},{"key":"8_CR9","unstructured":"Lambek, J., Scott, P.: Introduction to Higher-Order Categorical Logic. Cambridge Studies in Advanced Mathematics. Cambridge University Press (1988)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Relational Reasoning about Functions and Nondeterminism. Ph.D. thesis, University of Aarhus (1998)","DOI":"10.7146\/brics.v4i24.18950"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-48340-3_18","volume-title":"Mathematical Foundations of Computer Science 1999","author":"S.B. Lassen","year":"1999","unstructured":"Lassen, S.B., Moran, A.: Unique fixed point induction for McCarthy\u2019s amb. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 198\u2013208. Springer, Heidelberg (1999)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Lassen, S.B., Pitcher, C.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electronic Notes in Theoretical Computer Science\u00a010 (1997)","DOI":"10.1016\/S1571-0661(05)80704-2"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Levy, P.B.: Infinitary Howe\u2019s method. In: Coalgebraic Methods in Computer Science, pp. 85\u2013104 (2006)","DOI":"10.1016\/j.entcs.2006.06.006"},{"key":"8_CR14","series-title":"Mathematical Sciences Research Institute Publications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0927-0","volume-title":"Sheaves in Geometry and Logic: A First Introduction to Topos Theory","author":"S. MacLane","year":"1992","unstructured":"MacLane, S., Moerdijk, I.: Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Mathematical Sciences Research Institute Publications. Springer, New York (1992)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I.A. Mason","year":"1991","unstructured":"Mason, I.A., Talcott, C.L.: Equivalence in functional languages with effects. Journal of Functional Programming\u00a01(3), 287\u2013327 (1991)","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF00357841","volume":"25","author":"G. Reyes","year":"1996","unstructured":"Reyes, G., Zolfaghari, H.: Bi-heyting algebras, toposes and modalities. Journal of Philosophical Logic\u00a025(1), 25\u201343 (1996)","journal-title":"Journal of Philosophical Logic"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0960129508006774","volume":"18","author":"D. Sabel","year":"2008","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. Mathematical Structures in Computer Science\u00a018(3), 501\u2013553 (2008)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:11:36Z","timestamp":1558923096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}