Monads need not be endofunctors, Logical Methods in Computer Science, vol.11, issue.1, 2015. ,
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. ,
Code Biology: A New Science of Life, 2015. ,
The lambda calculus: its syntax and semantics, vol.103, 1984. ,
The monoidal structure of Turing machines, Math. Struct. Comput. Sci, vol.23, issue.2, pp.204-246, 2013. ,
Quantum complexity theory, Proceedings of the twenty-fifth annual ACM Symposium on Theory of computing, pp.11-20, 1993. ,
A machine-independent theory of the complexity of recursive functions, J. ACM, vol.14, issue.2, pp.322-336, 1967. ,
Coalgebraic logic and synthesis of Mealy machines, Proceedings of FOSSACS 2008, vol.4962, pp.231-245, 2008. ,
Models of Computation. Texts in Theoretical Computer Science, An EATCS Series, 2017. ,
An unsolvable problem of elementary number theory, The American Journal Of Mathematics, vol.58, pp.345-363, 1936. ,
Timed sets, functional complexity, and computability, Electr. Notes Theor. Comput. Sci, vol.286, pp.117-137, 2012. ,
Introduction to Turing categories, Ann. Pure Appl. Logic, vol.156, issue.2-3, pp.183-209, 2008. ,
, Recursiveness. ACM Monograph, 1970.
Synthesis of Mealy machines using derivatives, Electr. Notes Theor. Comput. Sci, vol.164, issue.1, pp.27-45, 2006. ,
Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus, Theoretical Computer Science, vol.41, pp.95-104, 1985. ,
Combinatorial realizability models of type theory, Ann. Pure Appl. Logic, vol.164, issue.10, pp.957-988, 2013. ,
, Algebraic Automata Theory. Cambridge Studies in Advanced Mathematics, 1982.
Comparing models of the intensional typed ?-calculus. Theoretical Computer Science, vol.166, pp.83-99, 1996. ,
The effective topos, Centenary Symposium, number 110 in Studies in Logic and the Foundations of Mathematics, pp.165-216, 1982. ,
, Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, 2016.
Computability and Complexity: From a Programming Perspective. Foundations of Computing, 1997. ,
On notation for ordinal numbers, Journal of Symbolic Logic, vol.3, issue.4, pp.150-155, 1938. ,
Bialgebras for structural operational semantics, Theor. Comput. Sci, vol.412, issue.38, pp.5043-5069, 2011. ,
Introduction to Higher Order Categorical Logic, Number 7 in Cambridge Studies in Advanced Mathematics, 1986. ,
Categories for the Working Mathematician, Number 5 in Graduate Texts in Mathematics, 1971. ,
Notions of computation and monads. Information and Computation, vol.93, pp.55-92, 1991. ,
Kleene's amazing second recursion theorem, Bulletin of Symbolic Logic, vol.16, issue.2, pp.189-239, 2010. ,
Theory of Self-Reproducing Automata, 1966. ,
Classical Recursion Theory : The Theory of Functions and Sets of Natural Numbers, volume 125 of Studies in logic and the foundations of mathematics, 1989. ,
Realizability: An Introduction to its Categorical Side, Studies in Logic and the Foundations of Mathematics, vol.152, 2008. ,
Dominical Categories: Recursion Theory without Elements, J. Symbolic Logic, vol.52, issue.3, pp.594-635, 1987. ,
Categorical logic of names and abstraction in action calculus, Math. Structures in Comp. Sci, vol.7, pp.619-637, 1997. ,
Quantum and classical structures in nondeterministic computation, Proceedings of Quantum Interaction, vol.5494, pp.143-158, 2009. ,
Gaming security by obscurity, Carrie Gates and Cormac Hearley, pp.125-140, 2011. ,
Geometry of abstraction in quantum computation, Proceedings of Symposia in Applied Mathematics, vol.71, pp.233-267, 2012. ,
Monoidal computer I: Basic computability by string diagrams. Information and Computation, vol.226, pp.94-116, 2013. ,
Chasing diagrams in cryptography, Categories and Types in Logic, Language and Physics, vol.8222, pp.353-367, 2014. ,
Monoidal computer II: Normal complexity by string diagrams, ASECOLab, 2014. ,
Smooth coalgebra: testing vector analysis, Math. Structures in Comp. Sci, vol.26, pp.1-41, 2016. ,
Testing semantics: Connecting processes and process logics, Proceedings of AMAST 2006, vol.4019, pp.308-322, 2006. ,
Basic Concepts of Computer Science (with Pictures), 2018. ,
Calculus in coinductive form, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp.408-417, 1998. ,
Theory of recursive functions and effective computability, 1987. ,
Universal coalgebra: a theory of systems, Theor. Comput. Sci, vol.249, issue.1, pp.3-80, 2000. ,
Towards a mathematical operational semantics, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS 1997), pp.280-291, 1997. ,
On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society. Second Series, vol.42, pp.230-265, 1936. ,
The chemical basis of morphogenesis, Philosophical Transactions of the Royal Society of London Series B, Biological sciences, vol.237, pp.37-72, 1952. ,
The Formal Semantics of Programming Languages: An Introduction. Foundations of computing. Zone Books, 1993. ,