{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T13:27:56Z","timestamp":1791293276425,"version":"4.1.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Starting from an exact correspondence between linear approximations and non-idempotent intersection types, we develop a general framework for building systems of intersection types characterizing normalization properties. We show how this construction, which uses in a fundamental way Melli\u00e8s and Zeilberger's ``type systems as functors'' viewpoint, allows us to recover equivalent versions of every well known intersection type system (including Coppo and Dezani's original system, as well as its non-idempotent variants independently introduced by Gardner and de Carvalho). We also show how new systems of intersection types may be built almost automatically in this way.<\/jats:p>","DOI":"10.1145\/3158094","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T14:21:49Z","timestamp":1514557309000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Polyadic approximations, fibrations and intersection types"],"prefix":"10.1145","volume":"2","author":[{"given":"Damiano","family":"Mazza","sequence":"first","affiliation":[{"name":"CNRS, France \/ University of Paris 13, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"Pellissier","sequence":"additional","affiliation":[{"name":"University of Paris 13, France \/ CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Vial","sequence":"additional","affiliation":[{"name":"University of Paris Diderot, France \/ CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proceedings of RTA. 6\u201321","author":"Accattoli Beniamino","year":"2012","unstructured":"Beniamino Accattoli . 2012 . An Abstract Factorization Theorem for Explicit Substitutions . In Proceedings of RTA. 6\u201321 . Beniamino Accattoli. 2012. An Abstract Factorization Theorem for Explicit Substitutions. In Proceedings of RTA. 6\u201321."},{"key":"e_1_2_2_2_1","volume-title":"The Lambda Calculus, Its Syntax and Semantics","author":"Barendregt Henk P.","unstructured":"Henk P. Barendregt . 1984. The Lambda Calculus, Its Syntax and Semantics . Elsevier . Henk P. Barendregt. 1984. The Lambda Calculus, Its Syntax and Semantics. Elsevier."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(4:3)2013"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_1"},{"key":"e_1_2_2_5_1","unstructured":"Flavien Breuvart and Ugo Dal Lago. 2016. ntersection Types and Probabilistic Lambda Calculi. In Presented at ITRS.  Flavien Breuvart and Ugo Dal Lago. 2016. ntersection Types and Probabilistic Lambda Calculi. In Presented at ITRS."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44602-7_26"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003833"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24725-8_21"},{"key":"e_1_2_2_9_1","first-page":"891","article-title":"Au sujet de l\u2019existence d\u2019adjoints \u00e0 droite aux foncteurs \u2018image reciproque\u2019 dans la cat\u00e9gorie des cat\u00e9gories","volume":"275","author":"Conduch\u00e9 Fran\u00e7ois","year":"1972","unstructured":"Fran\u00e7ois Conduch\u00e9 . 1972 . Au sujet de l\u2019existence d\u2019adjoints \u00e0 droite aux foncteurs \u2018image reciproque\u2019 dans la cat\u00e9gorie des cat\u00e9gories . C. R. Acad. Sci. Paris S\u00e9rie A , 275 (1972), 891 \u2013 894 . Fran\u00e7ois Conduch\u00e9. 1972. Au sujet de l\u2019existence d\u2019adjoints \u00e0 droite aux foncteurs \u2018image reciproque\u2019 dans la cat\u00e9gorie des cat\u00e9gories. C. R. Acad. Sci. Paris S\u00e9rie A, 275 (1972), 891\u2013894.","journal-title":"C. R. Acad. Sci. Paris S\u00e9rie A"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883253"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19810270205"},{"key":"e_1_2_2_13_1","volume-title":"Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251","author":"de Carvalho Daniel","year":"2009","unstructured":"Daniel de Carvalho . 2009. Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251 ( 2009 ). Daniel de Carvalho. 2009. Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251 (2009)."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.06.005"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.001"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782615"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57887-0_115"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of CSL. 260\u2013276","author":"Grellois Charles","year":"2015","unstructured":"Charles Grellois and Paul-Andr\u00e9 Melli\u00e8s . 2015 . Relational Semantics of Linear Logic and Higher-order Model Checking . In Proceedings of CSL. 260\u2013276 . Charles Grellois and Paul-Andr\u00e9 Melli\u00e8s. 2015. Relational Semantics of Linear Logic and Higher-order Model Checking. In Proceedings of CSL. 260\u2013276."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)80713-4"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(3:10)2013"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129515000377"},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of FSCD (to appear)","author":"Kesner Delia","year":"2017","unstructured":"Delia Kesner and Pierre Vial . 2017 . Types as Resources for Classical Natural Deduction . Proceedings of FSCD (to appear) (2017). Delia Kesner and Pierre Vial. 2017. Types as Resources for Classical Natural Deduction. Proceedings of FSCD (to appear) (2017)."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/10.3.411"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_2_2_26_1","unstructured":"Jean-Louis Krivine. 1993. Lambda Calculus Types and Models. Ellis Horwood.  Jean-Louis Krivine. 1993. Lambda Calculus Types and Models. Ellis Horwood."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00297-3"},{"key":"e_1_2_2_28_1","unstructured":"Olivier Laurent. 2004. On the denotational semantics of the untyped lambda-mu calculus. (2004). Unpublished note.  Olivier Laurent. 2004. On the denotational semantics of the untyped lambda-mu calculus. (2004). Unpublished note."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525896"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.57"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_21"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676970"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016871"},{"key":"e_1_2_2_34_1","first-page":"248","article-title":"Change of Base for Relational Variable Sets","volume":"12","author":"Niefield Susan","year":"2004","unstructured":"Susan Niefield . 2004 . Change of Base for Relational Variable Sets . Theory Appl. Categ. 12 , 7 (2004), 248 \u2013 261 . Susan Niefield. 2004. Change of Base for Relational Variable Sets. Theory Appl. Categ. 12, 7 (2004), 248\u2013261.","journal-title":"Theory Appl. Categ."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061"},{"key":"e_1_2_2_38_1","volume-title":"Proceedings of LICS. 65\u201371","author":"Seely R. A. G.","year":"1987","unstructured":"R. A. G. Seely . 1987 . Modelling Computations: A 2-Categorical Framework . In Proceedings of LICS. 65\u201371 . R. A. G. Seely. 1987. Modelling Computations: A 2-Categorical Framework. In Proceedings of LICS. 65\u201371."},{"key":"e_1_2_2_39_1","volume-title":"Term Rewriting Systems","unstructured":"Terese. 2003. Term Rewriting Systems . Cambridge Tracts in Theoretical Computer Science, Vol. 55 . Cambridge University Press . Terese. 2003. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, Vol. 55. Cambridge University Press."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00073-6"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005103"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158094","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3158094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:30Z","timestamp":1750212690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":38,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1145\/3158094"],"URL":"https:\/\/doi.org\/10.1145\/3158094","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]},"assertion":[{"value":"2017-12-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}