Latest Work

  • M.P.Fiore.  Polymorphic Algebraic Theories.  Invited talk at the GlynnFest Workshop.  Computer Laboratory, University of Cambridge (UK), June 2013.  [slides]

    •  
  • M.P.Fiore.  The Algebra of DAGs.  Invited talk at the Samson@60 Conf..  Department of Computer Science, University of Oxford (UK), May 2013.  [slides]  

    •  
  • M.P.Fiore and M.Hamana.  Multiversal polymorphic algebraic theories: Syntax, semantics, translations, and equational logic.  To appear in Logic in Computer Science Conf. (LICS'13).  IEEE, Computer Society Press, 2013.  [preprint]

    •  
  • K.Y.Ahn, T.Sheard, M.P.Fiore, and A.Pitts.  System Fi: A higher-order polymorphic lambda-calculus with erasable term-indices.  To appear in Proceedings of the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), Lecture Notes in Computer Science, 2013.  [preprint]   (The final publication will be available at link.sprinker.com.)

    •  
  • M.P.Fiore and M.Devesas Campos.  The Algebra of Directed Acyclic Graphs.  In Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, Volume 7860 of Lecture Notes in Computer Science, 2013.  [preprint]   [arxiv]   (The final publication will be available at link.sprinker.com.)

    •  
  • M.P.Fiore.  Analytic functors between presheaf categories over groupoids.  2013.  [preprint]   [arxiv]

    •  
  • M.P.Fiore.   Lie in Logic.  Invited talk at the Seminaire CHoCoLa, Lyon (France), 2012.  [abstract]

    •  
  • M.P.Fiore.   Discrete Generalised Polynomial Functors.  In 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science, Volume 7392, pages 214-226, 2012.  [preprint]   [slides]   (The original publication is available at www.springerlink.com.)

    •  
  • M.P.Fiore.   Mathematical Aspects of Data Structure.  Invited talk at the Department of Computer Science, Gunma University, Kiryu (Japan), 2012.  [slides]

    •  
  • M.P.Fiore.   Second-Order Algebra and Generalised Polynomial Functors.  Invited talk at Algebra and Computation, Logic and Interactions (LI2012), Luminy (France), 2012.  [slides]

    •  
  • M.P.Fiore.   Algebraic Foundations for Type Theories.  Talk given at the 18th Workshop Types for Proofs and Programs (Types 2011), Bergen (Norway), 2011.  [slides]

    •  
  • M.Hamana and M.P.Fiore.   A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach.  To appear in ACM SIGPLAN 7th Workshop on Generic Programming, 2011.  [preprint]

    •  
  • M.P.Fiore and C.-K.Hur.   On the mathematical synthesis of equational logics.  To appear in Logical Methods in Computer Science, Selected Papers of the Conference "Typed Lambda Calculi and Aplications 2009", 2011.  [preprint]   [arxiv]

    •  
  • M.P.Fiore.   On Higher-Order Algebra.  Invited talk at the Third Scottish Category Theory Seminar, Glasgow (Scotland), 2010.  [slides]

    •  
  • M.P.Fiore and O.Mahmoud.   Second-order algebraic theories.  In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), LNCS 6281, pp. 368-380, 2010.  [preprint]   (The original publication is available at www.springerlink.com.)

    •  
  • M.P.Fiore and C.-K.Hur.   Second-order equational logic.  In Proceedings of the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010), LNCS 6247, pp. 320-335, 2010.  [preprint]   (The original publication is available at www.springerlink.com.)

    •  
  • M.P.Fiore and S.Staton.   Positive structural operational semantics and monotone distributive laws..  In Short Contributions for the 10th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2010), CWI Technical report SEN-1004, pages 8--9, 2010.

    •  
  • M.P.Fiore and T.Leinster.   An abstract characterization of Thompson's group F.  Semigroup Forum, Volume 80, Number 2, 2010.  [DOI]

    •  
  • M.P.Fiore and C.-K.Hur.   Mathematical Synthesis of Equational Deduction Systems.  Invited address at the International Conference on Typed Lambda Calculi and Applications (TLCA 2009), Brasilia (Brazil), 2009.  [abstract]

    •  
  • M.P.Fiore and S.Staton.   A congruence rule format for name-passing process calculi.  Information and Computation, 207(2):209-236, 2009. 

    •  
  • M.P.Fiore and C.-K.Hur.   Term Equational Systems and Logics.  In Proceedings of the 24th Mathematical Foundations of Programming Semantics Conf. (MFPS XXIV), Electronic Notes in Theoretical Computer Science (ENTCS), Volume 218, pp. 171-192, 2008.  [preprint]

    •  
  • M.P.Fiore.   Second-order and dependently-sorted abstract syntax.  In Logic in Computer Science Conf. (LICS'08), pages 57-68.  IEEE, Computer Society Press, 2008.  [preprint] [slides]

    •  
  • M.P.Fiore and C.-K.Hur.   On the construction of free algebras for equational systems.  In special issue for the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Theoretical Computer Science, 410: 1704-1729, 2008.  [preprint]

    •  
  • M.P.Fiore, N.Gambino, M.Hyland, and G.Winskel.   The cartesian closed bicategory of generalised species of structures.  In J. London Math. Soc., 77:203-220, 2008.  [preprint]