Journal articles
Fiore, M. and Szamozvancev, D., 2022. Formal Metatheory of Second-Order Abstract Syntax PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, v. 6
Doi: http://doi.org/10.1145/3498715
Fiore, M., Gambino, N., Hyland, M. and Winskel, G., 2018. Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures Selecta Mathematica, New Series, v. 24
Doi: http://doi.org/10.1007/s00029-017-0361-3
Fiore, MP., Gambino, N., Hyland, M. and Winskel, G., 2008. The cartesian closed bicategory of generalised species of structures Journal of the London Mathematical Society, v. 77
Doi: http://doi.org/10.1112/jlms/jdm096
Fiore, M., Gambino, N., Hyland, M. and Winskel, G., 2008. The cartesian closed bicategory of generalised species of structures J LOND MATH SOC, v. 77
Doi: http://doi.org/10.1112/jlms/jdm096
Cattani, GL. and Fiore, MP., 2007. The Bicategory-Theoretic Solution of Recursive Domain Equations. Electron. Notes Theor. Comput. Sci., v. 172
Doi: 10.1016/j.entcs.2007.02.008
Fiore, MP. and Leinster, T., 2004. An objective representation of the Gaussian integers. J. Symb. Comput., v. 37
Doi: 10.1016/j.jsc.2003.10.002
Bunge, M. and Fiore, MP., 2000. Unique factorisation lifting functors and categories of linearly-controlled processes. Math. Struct. Comput. Sci., v. 10
Fiore, MP., 1997. An Enrichment Theorem for an Axiomatisation of Categories of Domains and Continuous Functions. Math. Struct. Comput. Sci., v. 7
Doi: 10.1017/S0960129597002429
Fiore, MP., 1996. A Coinduction Principle for Recursive Data Types Based on Bisimulation. Inf. Comput., v. 127
Doi: 10.1006/inco.1996.0058
Fiore, MP., 1995. Order-Enrichment for Categories of Partial Maps. Math. Struct. Comput. Sci., v. 5
Doi: 10.1017/S0960129500001225
Fiore, M. and Saville, P., Coherence for bicategorical cartesian closed structure Mathematical Structures in Computer Science,
Fiore, M., An Equational Metalogic for Monadic Equational Systems Theory and Applications of Categories,
Fiore, M., Semantic Analysis of Normalisation by Evaluation for Typed Lambda Calculus Mathematical Structures in Computer Science,
Doi: 10.1017/S0960129522000263
Fiore, MP., Pitts, AM. and Steenkamp, SC., Quotients, inductive types, and quotient inductive types Logical Methods in Computer Science,
Conference proceedings
Fiore, M. and Saville, P., 2020. Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Doi: http://doi.org/10.1145/3373718.3394769
Arkor, N. and Fiore, M., 2020. Algebraic models of simple type theories: A polynomial approach Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Doi: http://doi.org/10.1145/3373718.3394771
Curien, P-L., Fiore, M. and Munch-Maccagnoni, G., 2016. A theory of effects and resources: adjunction models and polarised calculi Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
Doi: 10.1145/2837614.2837652
Fiore, M. and Staton, S., 2014. Substitution, jumps, and algebraic effects Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic, CSL 2014 and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2014,
Doi: http://doi.org/10.1145/2603088.2603163
Ahn, KY., Sheard, T., Fiore, M. and Pitts, AM., 2013. System F<inf>i</inf>: A higher-order polymorphic λ-calculus with erasable term-indices Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7941 LNCS
Doi: 10.1007/978-3-642-38946-7_4
Fiore, MP., 2012. Discrete Generalised Polynomial Functors Lecture Notes in Computer Science, v. 7392
Fiore, MP., 2012. Discrete Generalised Polynomial Functors - (Extended Abstract). ICALP (2), v. 7392
Fiore, MP. and Hamana, M., 2011. A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach Proceeding WGP'11 Proceedings of the seventh ACM SIGPLAN workshop on Generic programming,
Doi: http://doi.org/10.1145/2036918.2036927
Fiore, MP. and Hur, C-K., 2009. Mathematical Synthesis of Equational Deduction Systems. TLCA, v. 5608
Fiore, MP., 2008. Second-order and dependently-sorted abstract syntax Twenty-Third Annual IEEE Symposium on Logic in Computer Science,
Doi: http://doi.org/10.1109/LICS.2008.38
Fiore, MP. and Hur, C-K., 2007. Equational Systems and Free Constructions (Extended Abstract). ICALP, v. 4596
Fiore, MP., 2007. Differential structure in models of multiplicative biadditive intuitionistic linear logic Typed Lambda Calculi and Applications, Proceedings, v. 4583
Fiore, M. and Staton, S., 2006. A congruence rule format for name-passing process calculi from mathematical structural operational semantics 21st Annual IEEE Symposium on Logic in Computer Science, Proceedings,
Fiore, MP., 2005. Mathematical Models of Computational and Combinatorial Structures. FoSSaCS, v. 3441
Fiore, MP., 2005. Mathematical models of computational and combinatorial structures - (Invited address) FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, v. 3441
Balat, V., Di Cosmo, R. and Fiore, M., 2004. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums ACM SIGPLAN NOTICES, v. 39
Fiore, M., 2004. Isomorphisms of generic recursive polynomial types ACM SIGPLAN NOTICES, v. 39
Fiore, MP., 2002. Semantic analysis of normalisation by evaluation for typed lambda calculus. PPDP,
Fiore, MP., 2000. Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems. IFIP TCS, v. 1872
Fiore, MP. and Simpson, AK., 1999. Lambda Definability with Sums via Grothendieck Logical Relations. TLCA, v. 1581
Cattani, GL., Fiore, M. and Winskel, G., 1998. A theory of recursive domains with applications to concurrency THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS,
Fiore, MP. and Plotkin, GD., 1996. An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. CSL, v. 1258
Fiore, MP., 1995. Lifting as a KZ-Doctrine. Category Theory and Computer Science, v. 953
Pitts, A., Fiore, M. and Steenkamp, S., Constructing Infinitary Quotient-Inductive Types Springer Lecture Notes in Computer Science,
Fiore, M. and Szamozvancev, D., Formal Metatheory of Second-Order Abstract Syntax
Ahn, KY., Sheard, T., Fiore, MP. and Pitts, AM., System Fi Lecture Notes in Computer Science, v. 7941
Fiore, M., Galal, Z. and Paquet, H., A combinatorial approach to higher-order structure for polynomial functors LIPIcs – Leibniz International Proceedings in Informatics, v. 228
Doi: 10.4230/LIPIcs.FSCD.2022.31
Fiore, M. and Choudhury, V., Free Commutative Monoids in Homotopy Type Theory Electronic Notes in Theoretical Informatics and Computer Science, v. Volume 1 - Proceedings of MFPS XXXVIII
Doi: http://doi.org/10.46298/entics.10492
Book chapters
Working papers
Fiore, M., 2015. An Axiomatics and a Combinatorial Model of Creation/Annihilation
Operators
Theses / dissertations
Datasets
Fiore, M., Pitts, A. and Steenkamp, S., Code supporting "Constructing Infinitary Quotient-Inductive Types"
Pitts, A., Steenkamp, S. and Fiore, M., Agda code supporting "Quotients, Inductive Types and Quotient Inductive Types"
Pitts, A., Fiore, M. and Steenkamp, SC., Agda code supporting "Quotients, Inductive Types and Quotient Inductive Types" (v2)
Internet publications
Fiore, M., Galal, Z. and Paquet, H., Stabilized profunctors and stable species of structures