T. Altenkirch, J. Chapman, and T. Uustalu, Monads need not be endofunctors, Logical Methods in Computer Science, vol.11, issue.1, 2015.

A. Asperti, The intensional content of Rice's Theorem, Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '08, pp.113-119, 2008.

M. Barbieri, Code Biology: A New Science of Life, 2015.

H. P. Barendregt, The lambda calculus: its syntax and semantics, vol.103, 1984.

M. Bartha, The monoidal structure of Turing machines, Math. Struct. Comput. Sci, vol.23, issue.2, pp.204-246, 2013.

E. Bernstein and U. Vazirani, Quantum complexity theory, Proceedings of the twenty-fifth annual ACM Symposium on Theory of computing, pp.11-20, 1993.

M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM, vol.14, issue.2, pp.322-336, 1967.

M. M. Bonsangue, J. J. Rutten, and A. Silva, Coalgebraic logic and synthesis of Mealy machines, Proceedings of FOSSACS 2008, vol.4962, pp.231-245, 2008.

R. Bruni and U. Montanari, Models of Computation. Texts in Theoretical Computer Science, An EATCS Series, 2017.

A. Church, An unsolvable problem of elementary number theory, The American Journal Of Mathematics, vol.58, pp.345-363, 1936.

J. , R. B. Cockett, J. Díaz-bo¨?lsbo¨?ls, J. Gallagher, and P. Hrubes, Timed sets, functional complexity, and computability, Electr. Notes Theor. Comput. Sci, vol.286, pp.117-137, 2012.

J. , R. B. Cockett, and P. J. Hofstra, Introduction to Turing categories, Ann. Pure Appl. Logic, vol.156, issue.2-3, pp.183-209, 2008.

S. Eilenberg and C. C. Elgot, Recursiveness. ACM Monograph, 1970.

D. Helle-hvid-hansen, J. J. Costa, and . Rutten, Synthesis of Mealy machines using derivatives, Electr. Notes Theor. Comput. Sci, vol.164, issue.1, pp.27-45, 2006.

S. Hayashi, Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus, Theoretical Computer Science, vol.41, pp.95-104, 1985.

J. W. Pieter, M. A. Hofstra, and . Warren, Combinatorial realizability models of type theory, Ann. Pure Appl. Logic, vol.164, issue.10, pp.957-988, 2013.

W. M. Holcombe, Algebraic Automata Theory. Cambridge Studies in Advanced Mathematics, 1982.

R. Hoofman, Comparing models of the intensional typed ?-calculus. Theoretical Computer Science, vol.166, pp.83-99, 1996.

M. Hyland, The effective topos, Centenary Symposium, number 110 in Studies in Logic and the Foundations of Mathematics, pp.165-216, 1982.

B. Jacobs, Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, 2016.

N. D. Jones, Computability and Complexity: From a Programming Perspective. Foundations of Computing, 1997.

C. Stephen and . Kleene, On notation for ordinal numbers, Journal of Symbolic Logic, vol.3, issue.4, pp.150-155, 1938.

B. Klin, Bialgebras for structural operational semantics, Theor. Comput. Sci, vol.412, issue.38, pp.5043-5069, 2011.

J. Lambek and P. Scott, Introduction to Higher Order Categorical Logic, Number 7 in Cambridge Studies in Advanced Mathematics, 1986.

S. Lane, Categories for the Working Mathematician, Number 5 in Graduate Texts in Mathematics, 1971.

E. Moggi, Notions of computation and monads. Information and Computation, vol.93, pp.55-92, 1991.

N. Yiannis and . Moschovakis, Kleene's amazing second recursion theorem, Bulletin of Symbolic Logic, vol.16, issue.2, pp.189-239, 2010.

A. W. John-von-neumann and . Burks, Theory of Self-Reproducing Automata, 1966.

P. Odifreddi, Classical Recursion Theory : The Theory of Functions and Sets of Natural Numbers, volume 125 of Studies in logic and the foundations of mathematics, 1989.

. Jaap-van-oosten, Realizability: An Introduction to its Categorical Side, Studies in Logic and the Foundations of Mathematics, vol.152, 2008.

A. D. Robert, A. Paola, and . Heller, Dominical Categories: Recursion Theory without Elements, J. Symbolic Logic, vol.52, issue.3, pp.594-635, 1987.

D. Pavlovic, Categorical logic of names and abstraction in action calculus, Math. Structures in Comp. Sci, vol.7, pp.619-637, 1997.

D. Pavlovic, Quantum and classical structures in nondeterministic computation, Proceedings of Quantum Interaction, vol.5494, pp.143-158, 2009.

D. Pavlovic, Gaming security by obscurity, Carrie Gates and Cormac Hearley, pp.125-140, 2011.

D. Pavlovic, Geometry of abstraction in quantum computation, Proceedings of Symposia in Applied Mathematics, vol.71, pp.233-267, 2012.

D. Pavlovic, Monoidal computer I: Basic computability by string diagrams. Information and Computation, vol.226, pp.94-116, 2013.

D. Pavlovic, Chasing diagrams in cryptography, Categories and Types in Logic, Language and Physics, vol.8222, pp.353-367, 2014.

D. Pavlovic, Monoidal computer II: Normal complexity by string diagrams, ASECOLab, 2014.

D. Pavlovic and B. Fauser, Smooth coalgebra: testing vector analysis, Math. Structures in Comp. Sci, vol.26, pp.1-41, 2016.

D. Pavlovic, M. Mislove, and J. Worrell, Testing semantics: Connecting processes and process logics, Proceedings of AMAST 2006, vol.4019, pp.308-322, 2006.

D. Pavlovic and M. Yahia, Basic Concepts of Computer Science (with Pictures), 2018.

D. Pavlovi´cpavlovi´c and M. Escardó, Calculus in coinductive form, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp.408-417, 1998.

. Hartley-rogers, Theory of recursive functions and effective computability, 1987.

J. M. Jan and . Rutten, Universal coalgebra: a theory of systems, Theor. Comput. Sci, vol.249, issue.1, pp.3-80, 2000.

D. Turi and G. D. Plotkin, Towards a mathematical operational semantics, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS 1997), pp.280-291, 1997.

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society. Second Series, vol.42, pp.230-265, 1936.

A. M. Turing, The chemical basis of morphogenesis, Philosophical Transactions of the Royal Society of London Series B, Biological sciences, vol.237, pp.37-72, 1952.

G. Winskel, The Formal Semantics of Programming Languages: An Introduction. Foundations of computing. Zone Books, 1993.