{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:06:55Z","timestamp":1743120415322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031177149"},{"type":"electronic","value":"9783031177156"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17715-6_6","type":"book-chapter","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T09:02:27Z","timestamp":1664701347000},"page":"60-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structural Rules and\u00a0Algebraic Properties of\u00a0Intersection Types"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2005.06.005","volume":"342","author":"S Alves","year":"2005","unstructured":"Alves, S., Florido, M.: Weak linearization of the lambda calculus. Theor. Comput. Sci. 342(1), 79\u2013103 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Alves, S., Florido, M.: Structural rules and algebraic properties of intersection types. arXiv (2022)","DOI":"10.1007\/978-3-031-17715-6_6"},{"key":"6_CR3","unstructured":"Anderson, A.R., Belnap, N.: Entailment: The Logic of Relevance and Necessity, vol. I. Princeton University Press (1975)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symb. Log. 48(4), 931\u2013940 (1983)","journal-title":"J. Symb. Log."},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139032636","volume-title":"Lambda Calculus with Types. Perspectives in Logic","author":"HP Barendregt","year":"2013","unstructured":"Barendregt, H.P., Dekkers, W., Statman, R.: Lambda Calculus with Types. Perspectives in Logic. Cambridge University Press, Cambridge (2013)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bono, V., Dezani-Ciancaglini, M.: A tale of intersection types. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2020, pp. 7\u201320. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3373718.3394733"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1093\/jigpal\/jzx018","volume":"25","author":"A Bucciarelli","year":"2017","unstructured":"Bucciarelli, A., Kesner, D., Ventura, D.: Non-idempotent intersection types for the lambda-calculus. Log. J. IGPL 25(4), 431\u2013464 (2017)","journal-title":"Log. J. IGPL"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Lorenzis, S.D., Piperno, A., Salvo, I.: Some computational properties of intersection types. In: 14th Annual IEEE Symposium on Logic in Computer Science, pp. 109\u2013118. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782598"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the $$\\lambda $$-calculus. Notre Dame J. Formal Log. 21(4), 685\u2013693 (1980)","journal-title":"Notre Dame J. Formal Log."},{"issue":"2\u20136","key":"6_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M Coppo","year":"1981","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional characters of solvable terms. Math. Log. Q. 27(2\u20136), 45\u201358 (1981)","journal-title":"Math. Log. Q."},{"issue":"11","key":"6_CR11","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1073\/pnas.20.11.584","volume":"20","author":"HB Curry","year":"1934","unstructured":"Curry, H.B.: Functionality in combinatory logic. Proc. Natl. Acad. Sci. 20(11), 584\u2013590 (1934)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"6_CR12","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic, vol. I. North-Holland (1958)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.entcs.2005.06.011","volume":"136","author":"D de Carvalho","year":"2005","unstructured":"de Carvalho, D.: Intersection types for light affine lambda calculus. Electron. Notes Theor. Comput. Sci. 136, 133\u2013152 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR14","unstructured":"de Carvalho, D.: Execution time of lambda-terms via denotational semantics and intersection types. CoRR, abs\/0905.4251 (2009)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Dunfield, J.: Elaborating intersection and union types. In: ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, Copenhagen, Denmark, 9\u201315 September 2012, pp. 17\u201328. ACM (2012)","DOI":"10.1145\/2398856.2364534"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-36576-1_16","volume-title":"Foundations of Software Science and Computation Structures","author":"J Dunfield","year":"2003","unstructured":"Dunfield, J., Pfenning, F.: Type assignment for intersections and unions in call-by-value languages. In: Gordon, A.D. (ed.) FoSSaCS 2003. LNCS, vol. 2620, pp. 250\u2013266. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36576-1_16"},{"issue":"2\u20133","key":"6_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2008.06.001","volume":"403","author":"T Ehrhard","year":"2008","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2\u20133), 347\u2013372 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"6_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1017\/S0956796803004970","volume":"14","author":"M Florido","year":"2004","unstructured":"Florido, M., Damas, L.: Linearization of the lambda-calculus and its relation with intersection type systems. J. Funct. Program. 14(5), 519\u2013546 (2004)","journal-title":"J. Funct. Program."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-57880-3_14","volume-title":"Programming Languages and Systems \u2014 ESOP \u201994","author":"P Fradet","year":"1994","unstructured":"Fradet, P.: Compilation of head and strong reduction. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol. 788, pp. 211\u2013224. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57880-3_14"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Frankle, J., Osera, P., Walker, D., Zdancewic, S.: Example-directed synthesis: a type-theoretic interpretation. In: Bod\u00edk, R., Majumdar, R. (eds.) Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016. ACM (2016)","DOI":"10.1145\/2837614.2837629"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Freeman, T.S., Pfenning, F.: Refinement types for ML. In: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, 26\u201328 June 1991, pp. 268\u2013277. ACM (1991)","DOI":"10.1145\/113446.113468"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-57887-0_115","volume-title":"Theoretical Aspects of Computer Software","author":"P Gardner","year":"1994","unstructured":"Gardner, P.: Discovering needed reductions using type theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 555\u2013574. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57887-0_115"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013101 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"JR Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/10.3.411","volume":"10","author":"AJ Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus and consequences. J. Log. Comput. 10(3), 411\u2013436 (2000)","journal-title":"J. Log. Comput."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65(3), 154\u2013170 (1958)","journal-title":"Am. Math. Mon."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Mazza, D.: An infinitary affine lambda-calculus isomorphic to the full lambda-calculus. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, 25\u201328 June 2012, pp. 471\u2013480. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.57"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Mazza, D., Pellissier, L., Vial, P.: Polyadic approximations, fibrations and intersection types. Proc. ACM Program. Lang. 2(POPL):6:1\u20136:28 (2018)","DOI":"10.1145\/3158094"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02930-1_21","volume-title":"Automata, Languages and Programming","author":"P-A Melli\u00e8s","year":"2009","unstructured":"Melli\u00e8s, P.-A., Tabareau, N., Tasson, C.: An explicit formula for the free exponential modality of linear logic. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 247\u2013260. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_21"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Neergaard, P.M., Mairson, H.G.: Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In: Okasaki, C., Fisher, K. (eds.) Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP 2004, Snow Bird, UT, USA, 19\u201321 September 2004, pp. 138\u2013149. ACM (2004)","DOI":"10.1145\/1016848.1016871"},{"issue":"3","key":"6_CR31","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S095679680100394X","volume":"11","author":"J Palsberg","year":"2001","unstructured":"Palsberg, J., Pavlopoulou, C.: From polyvariant flow information to intersection and union types. J. Funct. Program. 11(3), 263\u2013317 (2001)","journal-title":"J. Funct. Program."},{"key":"6_CR32","volume-title":"The Implementation of Functional Programming Languages","author":"SL Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice-Hall, Hoboken (1987)"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-48959-2_21","volume-title":"Typed Lambda Calculi and Applications","author":"J Polakow","year":"1999","unstructured":"Polakow, J., Pfenning, F.: Natural deduction for intuitionistic non-commutative linear logic. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 295\u2013309. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48959-2_21"},{"key":"6_CR34","doi-asserted-by":"publisher","DOI":"10.4324\/9780203252642","volume-title":"An Introduction to Substructural Logics","author":"G Restall","year":"2000","unstructured":"Restall, G.: An Introduction to Substructural Logics. Routledge, Milton Park (2000)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Design of the Programming Language Forsythe, pp. 173\u2013233. Birkh\u00e4user Boston, Boston (1997)","DOI":"10.1007\/978-1-4612-4118-8_9"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Urzyczyn, P.: The emptiness problem for intersection types. In: Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS 1994), Paris, France, 4\u20137 July 1994, pp. 300\u2013309. IEEE Computer Society (1994)","DOI":"10.1109\/LICS.1994.316059"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Walker, D.: Substructural type systems. In: Advanced Topics in Types and Programming Languages, pp. 3\u201343. The MIT Press (2004)","DOI":"10.7551\/mitpress\/1104.003.0003"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17715-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T02:59:15Z","timestamp":1728097155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17715-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031177149","9783031177156"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17715-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/viam.science.tsu.ge\/clas2022\/ictac\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}