{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:00:05Z","timestamp":1649008805971},"reference-count":11,"publisher":"Cambridge University Press (CUP)","issue":"10","license":[{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2019,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we present an operational semantics for the \u2018call-by-name\u2019 probabilistic <jats:italic>\u03bb<\/jats:italic>-calculus, whose main feature is to use only deterministic relations and to have no constraint on the reduction strategy. The calculus enjoys similar properties to the usual <jats:italic>\u03bb<\/jats:italic>-calculus. In particular we prove it to be confluent, and we prove a standardisation theorem.<\/jats:p>","DOI":"10.1017\/s0960129519000045","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T06:24:32Z","timestamp":1559802272000},"page":"1479-1512","source":"Crossref","is-referenced-by-count":1,"title":["A deterministic rewrite system for the probabilistic \u03bb-calculus"],"prefix":"10.1017","volume":"29","author":[{"given":"Thomas","family":"Leventis","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,6,6]]},"reference":[{"key":"S0960129519000045_ref5","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1145"},{"key":"S0960129519000045_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129509990089"},{"key":"S0960129519000045_ref1","unstructured":"Alberti, M. (2014). On operational properties of quantitative extensions of \u03bb-calculus. Phd thesis, Aix Marseille Universit\u00e9, Universit\u00e0 di Bologna, https:\/\/hal.inria.fr\/tel-01096067."},{"key":"S0960129519000045_ref8","unstructured":"Leventis, T. (2016). Probabilistic Lambda-theories. Theses, Aix-Marseille Universit\u00e8, https:\/\/tel.archives-ouvertes.fr\/tel-01427279."},{"key":"S0960129519000045_ref2","first-page":"XIV","volume-title":"The Lambda Calculus, Its Syntax and Semantics.","volume":"103","author":"Barendregt","year":"1981"},{"key":"S0960129519000045_ref6","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2781"},{"key":"S0960129519000045_ref4","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2012012"},{"key":"S0960129519000045_ref10","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1057"},{"key":"S0960129519000045_ref7","first-page":"87","volume-title":"Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science","author":"Ehrhard","year":"2011"},{"key":"S0960129519000045_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02413910"},{"key":"S0960129519000045_ref3","volume-title":"Term Rewriting Systems","author":"Bezem","year":"2003"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129519000045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T05:23:08Z","timestamp":1574918588000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129519000045\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,6]]},"references-count":11,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["S0960129519000045"],"URL":"https:\/\/doi.org\/10.1017\/s0960129519000045","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,6]]}}}