{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T01:05:11Z","timestamp":1794531911218,"version":"4.9.1"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319472850","type":"print"},{"value":"9783319472867","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47286-7_1","type":"book-chapter","created":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T13:51:10Z","timestamp":1475675470000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Wherefore Art Thou $$\\ldots $$ Semantics of Computation?"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"key":"1_CR1","volume-title":"Selected Papers on Automath","author":"RP Nederpelt","year":"1984","unstructured":"Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C.: Selected Papers on Automath, vol. 133. Studies Logic, Elsevier, Amsterdam (1984)"},{"key":"1_CR2","unstructured":"Archimede: Metodo. Nel laboratorio di un genio. Bollati Boringhieri (2013)"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic 51(1), 1\u201377 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: New foundations for the geometry of interaction. Inf. Comput. 111(1), 53\u2013119 (1994)","journal-title":"Inf. Comput."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61604-7_44","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S Abramsky","year":"1996","unstructured":"Abramsky, S.: Retracing some paths in process algebra. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 1\u201317. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61604-7_44"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"1_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.apal.2004.08.003","volume":"134","author":"S Abramsky","year":"2005","unstructured":"Abramsky, S., Lenisa, M.: Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Logic 134(2\u20133), 122\u2013168 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.tcs.2005.07.002","volume":"347","author":"SP Abramsky","year":"2005","unstructured":"Abramsky, S.P.: A structural approach to reversible computation. Theor. Comput. Sci. 347(3), 441\u2013464 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI LN 14, Stanford (1988)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58027-1_1","volume-title":"Mathematical Foundations of Programming Semantics","author":"P Aczel","year":"1994","unstructured":"Aczel, P.: Final universes of processes. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 1\u201328. Springer, Heidelberg (1994). doi: 10.1007\/3-540-58027-1_1"},{"key":"1_CR11","unstructured":"Andr\u00e9, Y.: Qu\u2019est-ce que coagir?: pour une philosophie de la coaction. Notes d\u2019expos\u00e9 au Colloque Objet\/Relation, ENS, Paris (2014)"},{"key":"1_CR12","unstructured":"Backus, J.W.: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference. In: Proceedings of the International Conference on Information Processing UNESCO, pp. 125\u2013132. Typewritten preprint (1959)"},{"key":"1_CR13","unstructured":"Badiou, A.: L\u2019\u00eatre et l\u2019\u00e9v\u00e9nement (1988)"},{"key":"1_CR14","unstructured":"Barwise, J., Moss, L.S., Circles, V.: On the Mathematics of Non-Wellfounded Phenomena. CSLI LN 60, Stanford (1996)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1093\/mind\/IV.14.278","volume":"4","author":"L Carroll","year":"1895","unstructured":"Carroll, L.: What the Tortoise Said to Achilles. Mind 4, 278\u2013280 (1895)","journal-title":"Mind"},{"key":"1_CR16","first-page":"723","volume-title":"Handbook of the History of Logic","author":"Felice Cardone","year":"2009","unstructured":"Cardone, F., Hindley, R.: Lambda-calculus and combinators in the 20th century. In: Logic from Russell to Church, pp. 723\u2013817 (2009)"},{"key":"1_CR17","doi-asserted-by":"crossref","DOI":"10.1201\/9781439864159","volume-title":"On Numbers and Games","author":"J Conway","year":"2000","unstructured":"Conway, J.: On Numbers and Games. A. K. Peters, Natick (2000)"},{"key":"1_CR18","unstructured":"Huet, G., Coquand, T., Phlin-Mohring, C., Herbelin, H. et al.: The coq proof assistant. https:\/\/coq.inria.fr"},{"issue":"1","key":"1_CR19","first-page":"185","volume":"117","author":"HL Dreyfus","year":"1990","unstructured":"Dreyfus, H.L., Dreyfus, S.E.: Making a mind vs modeling a brain, artificial intelligence back at a branchpoint. Daedalus Art. Int. 117(1), 185\u2013197 (1990)","journal-title":"Daedalus Art. Int."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Di Gianantonio, P., Franco, G., Honsell, F.: Game semantics for Untyped $$\\lambda \\beta \\eta $$-Calculus. In: TLCA 1999, SLNCS 1581 (1999)","DOI":"10.1007\/3-540-48959-2_10"},{"issue":"1","key":"1_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L Egidi","year":"1992","unstructured":"Egidi, L., Honsell, F., Ronchi, S.: Operational, denotational and logical descriptions: a case study. Fundam. Inform. 16(1), 149\u2013169 (1992)","journal-title":"Fundam. Inform."},{"key":"1_CR22","unstructured":"Lions, J.L.: Rapport de la Commission d\u2019enqute Ariane 501 Echec du vol Ariane 501 (1997). http:\/\/www.capcomespace.net\/dossiers\/espace_europeen\/ariane\/ariane5\/AR501\/AR501_rapport_denquete.htm."},{"issue":"217","key":"1_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1093\/mind\/LV.219.64","volume":"55","author":"FB Fitch","year":"1946","unstructured":"Fitch, F.B.: Self-reference in philosophy. MInd 55(217), 64\u201373 (1946)","journal-title":"MInd"},{"issue":"3","key":"1_CR24","first-page":"493","volume":"10","author":"M Forti","year":"1983","unstructured":"Forti, M., Honsell, F.: Set theory with free construction principles. Ann. Scuola Norm. Sup. Pisa 10(3), 493\u2013522 (1983)","journal-title":"Ann. Scuola Norm. Sup. Pisa"},{"key":"1_CR25","unstructured":"Steel, T.B. (ed.): Formal language description languages for computer programming. In: Proceedings of IFIP TC 2 Working Conference on Formal Language Description Languages, Vienna, 15\u201318 September 1964, North Holland (1966)"},{"issue":"3","key":"1_CR26","first-page":"407","volume":"17","author":"F Gadducci","year":"2007","unstructured":"Gadducci, F.: Graph rewriting for the $$\\pi $$-calculus. MSCS 17(3), 407\u2013437 (2007)","journal-title":"MSCS"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(01)00362-0","volume":"285","author":"F Gadducci","year":"2002","unstructured":"Gadducci, F., Montanari, U.: Comparing logics for rewriting: rewriting logic, action calculi and tile logic. Theor. Comput. Sci. 285(2), 319\u2013358 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR28","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. Comp. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comp. Sci."},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Geometry of interaction I: interpretation of system F. In: Logic Colloquium 1988, North-Holland (1989)","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"1_CR30","first-page":"537 pages","volume":"2011","author":"J-Y Girard","year":"2011","unstructured":"Girard, J.-Y.: The Blind Spot: lectures on logic. Eur. Math. Soc. 2011, 537 pages (2011)","journal-title":"Eur. Math. Soc."},{"key":"1_CR31","volume-title":"Prison Notebooks","author":"A Gramsci","year":"1992","unstructured":"Gramsci, A.: Prison Notebooks. Columbia University Press, New York (1992)"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. J. ACM 40(1), 143\u2013184 (1993)","journal-title":"J. ACM"},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-7(3:8)2011","volume":"7","author":"F Honsell","year":"2011","unstructured":"Honsell, F., Lenisa, M.: Conway games, algebraically and coalgebraically. Logical Meth. Comput. Sci. 7(3), 1\u201330 (2011)","journal-title":"Logical Meth. Comput. Sci."},{"issue":"5","key":"1_CR34","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.ic.2008.03.027","volume":"207","author":"F Honsell","year":"2009","unstructured":"Honsell, F., Plotkin, G.D.: On the completeness of order-theoretic models of the lambda-calculus. Inf. Comput. 207(5), 583\u2013594 (2009)","journal-title":"Inf. Comput."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Honsell, F.: 25 years of formal proof cultures: some problems, some philosophy. In: Proceeding of LFMTP 2013 ACM SIGPLAN Workshop, Boston (2013)","DOI":"10.1145\/2503887.2503896"},{"key":"1_CR36","unstructured":"Honsell, F., Lenisa, M.: Theories of Automatic Combinators (draft)"},{"key":"1_CR37","unstructured":"Honsell, F., Liquori, L., Maksimovi\u0107, P., Scagnetto, I.: LLFP: A Logical Framework for Modeling External Evidence using Monads, LMCS (2014, to appear)"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Rutten, J.J.M.M.: An introduction to (co)-algebras and (co)-induction. Cambridge Tracts in TCS 52, CUP (2011)","DOI":"10.1017\/CBO9780511792588.003"},{"key":"1_CR39","unstructured":"Lenisa, M.: Themes in Final Semantics. Ph.D. Thesis CS Pisa, TD 6 (1998)"},{"key":"1_CR40","volume-title":"Wittgenstein on Rules and Private Language","author":"S Kripke","year":"1982","unstructured":"Kripke, S.: Wittgenstein on Rules and Private Language. Blackwell, Oxford (1982)"},{"key":"1_CR41","volume-title":"Intuitionistic Type Theory","author":"P Martin-L\u00f6f","year":"1984","unstructured":"Martin-L\u00f6f, P.: Intuitionistic Type Theory. Bibliopolis, Napoli (1984)"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Milner, R.: A calculus of communicating systems. In: SLNCS 92 (1980)","DOI":"10.1007\/3-540-10235-3"},{"issue":"1522","key":"1_CR43","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1098\/rsta.1984.0067","volume":"312","author":"R Milner","year":"1984","unstructured":"Milner, R.: The use of machines to assit in rigorous proof. Phil. Lond. A Trans. R. Soc. 312(1522), 411\u2013422 (1984)","journal-title":"Phil. Lond. A Trans. R. Soc."},{"key":"1_CR44","unstructured":"Milner, R.: Is Computing an Experimental Science? LFCS Inaugural Lecture (1986)"},{"issue":"1","key":"1_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. Comput. 100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"1_CR46","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comp. 93(1), 55\u201392 (1991)","journal-title":"Inf. Comp."},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"GD Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the $$\\lambda $$-calculus. TCS 1(2), 125\u2013159 (1975)","journal-title":"TCS"},{"issue":"3","key":"1_CR48","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G Plotkin","year":"1977","unstructured":"Plotkin, G.: LCF considered as a programming language. TCS 5(3), 223\u2013255 (1977)","journal-title":"TCS"},{"key":"1_CR49","unstructured":"Poincar\u00e9, H.: La Science et l\u2019Hypoth\u00e8se. Flammarion, Paris (1902)"},{"issue":"05","key":"1_CR50","first-page":"481","volume":"8","author":"J Rutten","year":"1998","unstructured":"Rutten, J., Turi, D.: On the foundations of final co-algebra semantics: non-well-founded sets, partial orders, metric spaces. MSCS 8(05), 481\u2013540 (1998)","journal-title":"MSCS"},{"issue":"1","key":"1_CR51","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal co-algebra: a theory of systems. TCS 249(1), 3\u201380 (2000)","journal-title":"TCS"},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"Scherlis, W., Scott, D.: Semantically based programming tools. In: SLNCS 185 (1985)","DOI":"10.1007\/3-540-15198-2_4"},{"key":"1_CR53","first-page":"97","volume-title":"Lecture Notes in Mathematics","author":"Dana Scott","year":"1972","unstructured":"Scott, D.: Continuous lattices. In: Lawvere, F.W. (ed.) Dalhousie Conference on Toposes, Algebraic Geometry and Logic, SLNM 274 (1972)"},{"key":"1_CR54","unstructured":"Scott, D.: Relating theories of the lambda calculus. lambda calculus and formalism. In: To H. B. Curry Essays in Combinagtory Logic. Academic Press, London (1980)"},{"key":"1_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages and Programming","author":"DS Scott","year":"1982","unstructured":"Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577\u2013610. Springer, Heidelberg (1982). doi: 10.1007\/BFb0012801"},{"key":"1_CR56","unstructured":"Shopenhauer, A.: The World as Will and Representation (1844)"},{"issue":"4","key":"1_CR57","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1257\/jel.41.4.1240","volume":"41","author":"A Sen","year":"2003","unstructured":"Sen, A.: Sraffa, wittgenstein, and gramsci. J. Econ. Lit. 41(4), 1240\u20131255 (2003)","journal-title":"J. Econ. Lit."},{"issue":"4","key":"1_CR58","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M Smyth","year":"1982","unstructured":"Smyth, M., Plotkin, G.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761\u2013783 (1982)","journal-title":"SIAM J. Comput."},{"key":"1_CR59","unstructured":"Turi, D., Plotkin, G.: Towards a Mathematical Operational Semantics. In: LICS 97. IEEE (1997)"}],"container-title":["IFIP Advances in Information and Communication Technology","History and Philosophy of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47286-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T16:10:48Z","timestamp":1657383048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47286-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319472850","9783319472867"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47286-7_1","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-47286-7","asserted-by":"object"}]},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"6 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HaPoC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the History and Philosophy of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hapoc2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}