{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T22:26:18Z","timestamp":1672525578805},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T00:00:00Z","timestamp":1438041600000},"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":[[2017,6]]},"abstract":"<jats:p>We consider a notion of approximation for terms of de Groote\u2013Saurin \u039b\u03bc-calculus. Then, we introduce an intersection type assignment system for that calculus which is invariant under subject conversion. The type assignment system also induces a filter model, which is an extensional \u039b\u03bc-model in the sense of Nakazawa and Katsumata. We then establish the approximation theorem, stating that a type can be assigned to a term in the system if and only if it can be assigned to same of its approximations.<\/jats:p>","DOI":"10.1017\/s0960129515000286","type":"journal-article","created":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T05:15:21Z","timestamp":1438060521000},"page":"560-580","source":"Crossref","is-referenced-by-count":2,"title":["The approximation theorem for the \u039b\u03bc-calculus"],"prefix":"10.1017","volume":"27","author":[{"given":"UGO","family":"DE'LIGUORO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"S0960129515000286_ref9","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.97.3"},{"key":"S0960129515000286_ref11","unstructured":"Py W. (1998). Confluence en \u03bb\u03bc-calcul, Ph.D. thesis, Universite de Savoie."},{"key":"S0960129515000286_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061"},{"key":"S0960129515000286_ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003141"},{"key":"S0960129515000286_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_11"},{"key":"S0960129515000286_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90065-T"},{"key":"S0960129515000286_ref8","doi-asserted-by":"crossref","unstructured":"Herbelin H. and Ghilezan S. (2008). An approach to call-by-name delimited continuations. In: Proceedings of POPL'08 383\u2013394.","DOI":"10.1145\/1328438.1328484"},{"key":"S0960129515000286_ref7","doi-asserted-by":"crossref","unstructured":"de Groote P. (1994b). On the relation between the lambda-mu-calculus and the syntactic theory of sequential control. In: LPAR. Springer Lecture Notes in Computer Science 31\u201343.","DOI":"10.1007\/3-540-58216-9_27"},{"key":"S0960129515000286_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9_26"},{"key":"S0960129515000286_ref5","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/11.3.395"},{"key":"S0960129515000286_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21691-6_18"},{"key":"S0960129515000286_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_13"},{"key":"S0960129515000286_ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"S0960129515000286_ref13","unstructured":"Saurin A. (2008a). Une \u00e9tude logique du contr\u00f4le (appliqu\u00e9e \u00e0 la programmation fonctionnelle et logique). PhD thesis, \u00c9cole Polytechnique."},{"key":"S0960129515000286_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1805950.1805958"},{"key":"S0960129515000286_ref4","doi-asserted-by":"publisher","DOI":"10.2307\/2694930"},{"key":"S0960129515000286_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017475"},{"key":"S0960129515000286_ref21","doi-asserted-by":"crossref","unstructured":"van Bakel S. , Barbanera F. and de'Liguoro U. (2013) Characterisation of strongly normalising \u03bb\u03bc-terms. In: Post Proceedings of ITRS'12. Electronic Proceedings in Theoretical Computer Science. To appear.","DOI":"10.4204\/EPTCS.121.1"},{"key":"S0960129515000286_ref2","volume-title":"The Lambda Calculus \u2013 Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"S0960129515000286_ref12","unstructured":"Saurin A. (2005). Separation with streams in the \u03bb\u03bc-calculus. In: Proceedings of LICS'05 356\u2013365."},{"key":"S0960129515000286_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.027"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129515000286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T16:18:34Z","timestamp":1567009114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129515000286\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,28]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["S0960129515000286"],"URL":"https:\/\/doi.org\/10.1017\/s0960129515000286","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,28]]}}}