. Archimede and . Metodo, Nel laboratorio di un genio, Bollati Boringhieri, 2013.

S. Abramsky, Domain theory in logical form*, Annals of Pure and Applied Logic, vol.51, issue.1-2, 1991.
DOI : 10.1016/0168-0072(91)90065-T

S. Abramsky and R. Jagadeesan, New Foundations for the Geometry of Interaction, Information and Computation, vol.111, issue.1, pp.53-119, 1994.
DOI : 10.1006/inco.1994.1041

S. Abramsky, Retracing some paths in process algebra, Proceedings of the Conference CONCUR'96, 1996.
DOI : 10.1007/3-540-61604-7_44

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

S. Abramsky and M. Lenisa, Linear realizability and full completeness for typed lambda-calculi, Annals of Pure and Applied Logic, vol.134, issue.2-3, 2005.
DOI : 10.1016/j.apal.2004.08.003

S. Abramsky, A structural approach to reversible computation, Theoretical Computer Science, vol.347, issue.3, 2005.
DOI : 10.1016/j.tcs.2005.07.002

P. Aczel, Non-Well-Founded Sets, CSLI LN, vol.14, 1988.

P. Aczel, Final universes of processes, MFPS LNCS, vol.802, 1993.
DOI : 10.1007/3-540-58027-1_1

Y. André, Qu'est-ce que coagir?: pour une philosophie de la coaction. Notes d'exposé au Colloque Objet, 2014.

J. W. Backus, The Syntax and Semantics of the Proposed International Algebraic Language of the Zurich ACM-GAMM Conference, Proc. Int. Conf. on Inf. Processing, UNESCO, pp.125-132, 1959.

J. Barwise and L. S. Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, CSLI LN, vol.60, 1996.

L. Carroll, What the Tortoise Said to Achilles, pp.278-280, 1895.

F. Cardone and R. Hindley, Lambda-Calculus and Combinators in the 20th Century. Logic from Russell to Church, pp.723-817, 2009.

J. Conway, Numbers and games, 2000.
DOI : 10.1090/psapm/043/1095538

H. L. Dreyfus and S. E. Dreyfus, Making a Mind vs Modeling a Brain, Artificial Intelligence Back at a Branchpoint, Daedalus Art. Int, vol.117, issue.1, 1990.

P. , D. Gianantonio, G. Franco, and F. Honsell, Game Semantics for Untyped ???- Calculus. TLCA '99, SLNCS, p.1581, 1999.

L. Egidi, F. Honsell, and S. Ronchi, Operational, denotational and logical descriptions: a case study, Fundam. Inform, vol.16, issue.1, pp.149-169, 1992.

J. L. Lions, Rapport de la Commission d'enqute Ariane 501 Echec, 1997.

F. B. Fitch, IV.???SELF-REFERENCE IN PHILOSOPHY, Mind, vol.LV, issue.219, 1946.
DOI : 10.1093/mind/LV.219.64
URL : https://hal.archives-ouvertes.fr/hal-01492770

M. Forti and F. Honsell, Set Theory with Free Construction Principles, Ann. Scuola Norm. Sup. Pisa, vol.10, pp.493-522, 1983.

T. B. Steel, Formal language description languages for computer programming, Proc. IFIP TC 2 Work. Conf. on Formal Language Description Languages, 1964.

F. Gadducci, Graph rewriting for the ??-calculus, Mathematical Structures in Computer Science, vol.17, issue.03, 2007.
DOI : 10.1017/S096012950700610X

F. Gadducci and U. Montanari, Comparing logics for rewriting: rewriting logic, action calculi and tile logic, Theoretical Computer Science, vol.285, issue.2, 2002.
DOI : 10.1016/S0304-3975(01)00362-0

J. Girard, Geometry of interaction I: interpretation of system F. Logic Colloquium, 1989.

J. Girard, The Blind Spot: lectures on logic. Eur, Math. Soc, 2011.
DOI : 10.4171/088
URL : https://hal.archives-ouvertes.fr/hal-01322183

R. Harper, F. Honsell, and G. Plotkin, A framework for defining logics, Journal of the ACM, vol.40, issue.1, pp.143-184, 1993.
DOI : 10.1145/138027.138060

F. Honsell and M. Lenisa, Conway games, algebraically and coalgebraically, Logical Methods in Computer Science, vol.7, issue.3, 2011.
DOI : 10.2168/LMCS-7(3:8)2011
URL : http://arxiv.org/abs/1107.1351

F. Honsell and G. D. Plotkin, On the completeness of order-theoretic models of the ??-calculus, Information and Computation, vol.207, issue.5, pp.583-594, 2009.
DOI : 10.1016/j.ic.2008.03.027

F. Honsell, L. Liquori, P. Maksimovi´cmaksimovi´c, and I. Scagnetto, LLFP: A Logical Framework for Modeling External Evidence using Monads, LMCS, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01146059

B. Jacobs and J. J. Rutten, An introduction to (co)algebra and (co)induction, Cambridge Tracts in TCS CUP, vol.52, 2011.
DOI : 10.1017/CBO9780511792588.003

M. Lenisa, Themes in Final Semantics. PhD Th, CS Pisa, p.6, 1998.

S. Kripke, Wittgenstein on Rules and Private Language, Blackwell, 1982.

P. Martin-löf, Intuitionistic type theory, 1984.

R. Milner, A Calculus of Communicating Systems, SLNCS, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, The use of machines to assit in rigorous proof, Phil.Trans.R.Soc.Lond, p.312, 1984.

R. Milner, Is Computing an Experimental Science?, Journal of Information Technology, vol.2, issue.2, 1986.
DOI : 10.1057/jit.1987.12

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, IC, vol.100, issue.1, 1992.

E. Moggi, Notions of computation and monads, Information and Computation, vol.93, issue.1, 1991.
DOI : 10.1016/0890-5401(91)90052-4

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, 1975.
DOI : 10.1016/0304-3975(75)90017-1

G. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, 1977.
DOI : 10.1016/0304-3975(77)90044-5

H. Poincaré, La Science et l'Hypothèse. Flammarion, 1902.

J. Rutten and D. Turi, On the foundations of final co-algebra semantics: non-wellfounded sets, partial orders, metric spaces, MSCS, vol.8, 1998.

J. Rutten, Universal co-algebra: a theory of systems, TCS, vol.249, issue.1, 2000.

W. Scherlis and D. Scott, Semantically based programming tools, SLNCS, vol.185, 1985.

D. Scott, Continuous lattices, Dalhousie Conference on Toposes, Algebraic Geometry and Logic, p.274, 1972.
DOI : 10.1007/BFb0073967

D. Scott, Relating Theories of the Lambda Calculus. To H. B. Curry Essays in Combinagtory Logic, Lambda Calculus and formalism, 1980.

D. Scott, Domains for denotational semantics, ICALP SLNCS, vol.140, 1982.
DOI : 10.1007/BFb0012801

A. Shopenhauer, The World as Will and Representation, 1844.

M. Smyth and G. Plotkin, The Category-Theoretic Solution of Recursive Domain Equations, SIAM J. Comput, vol.11, issue.4, 1982.

D. Turi and G. Plotkin, Towards a mathematical operational semantics, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997.
DOI : 10.1109/LICS.1997.614955