乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:32:36Z","timestamp":1649028756719},"reference-count":24,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.126.6","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T15:12:01Z","timestamp":1377616321000},"page":"72-86","source":"Crossref","is-referenced-by-count":2,"title":["Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion"],"prefix":"10.4204","volume":"126","author":[{"given":"Stefan","family":"Milius","sequence":"first","affiliation":[{"name":"FAU Erlangen-N\u00fcrnberg"}]},{"given":"Tadeusz","family":"Litak","sequence":"additional","affiliation":[{"name":"FAU Erlangen-N\u00fcrnberg"}]}],"member":"2720","published-online":{"date-parts":[[2013,8,28]]},"reference":[{"key":"abp98","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0022-4049(98)00106-6","article-title":"Nuclear and Trace Ideals in Tensored -Categories","volume":"143","author":"Abramsky","year":"1999","journal-title":"J. Pure Appl. Algebra"},{"key":"aamv03","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","article-title":"Infinite Trees and Completely Iterative Theories: A Coalgebraic View","volume":"300","author":"Aczel","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"am06","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.ic.2005.11.005","article-title":"Terminal Coalgebras and Free Iterative Theories","volume":"204","author":"Ad\u00e1mek","year":"2006","journal-title":"Inform. and Comput."},{"key":"AppelMRV07:popl","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1190216.1190235","article-title":"A very modal model of a modern, major, general type system","volume-title":"POPL","author":"Appel","year":"2007"},{"key":"badouel89","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-50939-9_126","article-title":"Terms and infinite trees as monads over a signature","volume":"351","author":"Badouel","year":"1989","journal-title":"Lecture Notes Comput. Sci."},{"key":"BentonT09:tldi","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1481861.1481864","article-title":"Compiling functional types to relational specifications for low level imperative code","volume-title":"TLDI","author":"Benton","year":"2009"},{"key":"BirkedalM13:lics","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/LICS.2013.27","article-title":"Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes","volume-title":"Proceedings of LICS","author":"Birkedal","year":"2013"},{"key":"BirkedalMSS12:lmcs","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(4:1)2012","article-title":"First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees","volume":"8","author":"Birkedal","year":"2012","journal-title":"Logical Methods in Computer Science"},{"key":"be93","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: the equational logic of iterative processes","author":"Bloom","year":"1993"},{"issue":"2","key":"cp92","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(92)90018-B","article-title":"New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and FIX-Logic","volume":"98","author":"Crole","year":"1992","journal-title":"Inform. and Comput."},{"key":"DiGianantonioM04:fossacs","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-24727-2_11","article-title":"Unifying Recursive and Co-recursive Definitions in Sheaf Categories","volume-title":"Foundations of Software Science and Computation Structures","volume":"2987","author":"Di Gianantonio","year":"2004"},{"key":"elgot75","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-4613-8177-8_6","article-title":"Monadic Computation and Iterative Algebraic Theories","volume-title":"Logic Colloquium '73","volume":"80","author":"Elgot","year":"1975"},{"key":"ebt78","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-1-4613-8177-8_7","article-title":"On the algebraic structure of rooted trees","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"h99","series-title":"Distinguished Dissertation Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0865-8","volume-title":"Models of Sharing Graphs: A Categorical Semantics of let and letrec","author":"Hasegawa","year":"1999"},{"key":"h97","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","article-title":"Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi","volume-title":"Proc. 3rd International Conference on Typed Lambda Calculi and Applications","volume":"1210","author":"Hasegawa","year":"1997"},{"issue":"3","key":"jsv96","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","article-title":"Traced Monoidal Categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"KrishnaswamiB11:icfp","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2034773.2034782","article-title":"A semantic model for graphical user interfaces","volume-title":"ICFP","author":"Krishnaswami","year":"2011"},{"key":"KrishnaswamiB11:lics","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/LICS.2011.38","article-title":"Ultrametric Semantics of Reactive Programs","volume-title":"LICS","author":"Krishnaswami","year":"2011"},{"key":"m05","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","article-title":"Completely Iterative Algebras and Completely Iterative Monads","volume":"196","author":"Milius","year":"2005","journal-title":"Inform. and Comput."},{"key":"milner89","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"mulry94","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-58027-1_15","article-title":"Lifting Theorems for Kleisli Categories","volume-title":"Proc. Mathematical Foundations of Programming Semantics (MFPS'93)","volume":"802","author":"Mulry","year":"1994"},{"key":"Nakano00:lics","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/LICS.2000.855774","article-title":"A Modality for Recursion","volume-title":"LICS","author":"Nakano","year":"2000"},{"key":"Nakano01:tacs","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45500-0_8","article-title":"Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness","volume-title":"TACS","volume":"2215","author":"Nakano","year":"2001"},{"key":"sp00","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/LICS.2000.855753","article-title":"Complete axioms for categorical fixed-point operators","volume-title":"Proc. 15th Symposium on Logic in Computer Science (LICS'00)","author":"Simpson","year":"2000"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T04:57:20Z","timestamp":1563771440000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1309.0895v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,28]]},"references-count":24,"URL":"https:\/\/doi.org\/10.4204\/eptcs.126.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,28]]}}}