Algebra

  • M.P.Fiore.   Algebraic Foundations for Type TheoriesTalk given at the 18th Workshop Types for Proofs and Programs (Types 2011), Bergen (Norway), 2011.  [slides]
     
  • M.P.Fiore and C.-K.Hur.   On the mathematical synthesis of equational logicsTo 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 AlgebraInvited talk at the Third Scottish Category Theory Seminar, Glasgow (Scotland), 2010.  [slides]

  •  
  • M.P.Fiore and O.Mahmoud.   Second-order algebraic theoriesIn 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 logicIn 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 T.Leinster.   An abstract characterization of Thompson's group FSemigroup Forum, Volume 80, Number 2, 2010.  [DOI]

  •  
  • M.P.Fiore.  Algebraic Meta-Theories and Synthesis of Equational LogicsResearch Programme, 2009. 

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

  •  
  • M.P.Fiore and C.-K.Hur.   Term Equational Systems and LogicsIn 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 and C.-K.Hur.   On the construction of free algebras for equational systemsIn 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 and C.-K.Hur.   Equational systems and free constructionsIn International Colloquium on Automata, Language and Programming (ICALP 2007), LNCS 4596, pp. 607-619, 2007.  [preprint]

  •  
  • M.P.Fiore, R.Di Cosmo and V. Balat. Remarks on isomorphisms in typed lambda calculi with empty and sum typesAnnals of Pure and Applied Logic, Vol. 141, Issues 1-2, pp. 35-50, 2006.  [preprint]  (Extended preliminary version in 17th Logic in Computer Science Conf. (LICS'02), pages 147-156.  IEEE, Computer Society Press, 2002.  [preprint])

  •  
  • M.P.Fiore and T.Leinster.   Isomorphisms on generic mutually recursive polynomial typesInvited talk for the Second International Workshop on Isomorphisms of Types, Toulouse (France), 2005.  [2up slides]

  •  
  • M.P.Fiore and T.Leinster.   A simple description of Thompson's group FPreprint, 2005.  [arXiv]

  •  
  • M.P.Fiore and T.Leinster.   Objects of categories as complex numbersAdvances in Mathematics, 190(2): 264-277, 2005.  [arXiv]

  •  
  • M.P.Fiore.  Isomorphisms of generic recursive polynomial types.   In 31st Symposium on Principles of Programming Languages (POPL 2004), pages 77-88.  ACM Press, 2004.  [ps file ]

  •  
  • M.P.Fiore and T.Leinster.   An objective representation of the Gaussian integersJournal of Symbolic Computation 37(6): 707-716, 2004.  [arXiv]