Person: Marcelo P. Fiore

DBLP: Fiore:Marcelo_P=

Contributed to:

2014

2013

2013

2012

2010

2009

2008

2007

2007

2006

2005

2004

2002

2002

2001

1999

1999

1998

1997

1996

1996

1994

2016

Wrote 27 papers:

LICS-CSL-2014-FioreS #algebra

Substitution, jumps, and algebraic effects (MPF, SS), p. 10.

LICS-2013-FioreH #algebra #equation #logic #multi #polymorphism #semantics #syntax

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic (MPF, MH), pp. 520–529.

TLCA-2013-AhnSFP #system f

System F i (KYA, TS, MPF, AMP), pp. 15–30.

ICALP-v2-2012-Fiore #polynomial

Discrete Generalised Polynomial Functors — (MPF), pp. 214–226.

CSL-2010-FioreH #equation #higher-order #logic

Second-Order Equational Logic (MPF, CKH), pp. 320–335.

TLCA-2009-FioreH #deduction #equation #synthesis

Mathematical Synthesis of Equational Deduction Systems (MPF, CKH), pp. 1–2.

LICS-2008-Fiore #higher-order #syntax

Second-Order and Dependently-Sorted Abstract Syntax (MPF), pp. 57–68.

ICALP-2007-FioreH #equation

Equational Systems and Free Constructions (MPF, CKH), pp. 607–618.

TLCA-2007-Fiore #difference #linear #logic #modelling #multi

Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic (MPF), pp. 163–177.

LICS-2006-FioreS #calculus #congruence #process #semantics

A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.

FoSSaCS-2005-Fiore #combinator #modelling

Mathematical Models of Computational and Combinatorial Structures (MPF), pp. 25–46.

POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus

Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.

POPL-2004-Fiore #morphism #polynomial #recursion

Isomorphisms of generic recursive polynomial types (MPF), pp. 77–88.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

PPDP-2002-Fiore #analysis #evaluation #normalisation #semantics #λ-calculus

Semantic analysis of normalisation by evaluation for typed λ calculus (MPF), pp. 26–37.

LICS-2001-FioreT #semantics

Semantics of Name and Value Passing (MPF, DT), pp. 93–104.

LICS-1999-FioreCW #bisimulation

Weak Bisimulation and Open Maps (MPF, GLC, GW), pp. 67–76.

LICS-1999-FiorePT #syntax

Abstract Syntax and Variable Binding (MPF, GDP, DT), pp. 193–202.

TLCA-1999-FioreS #logic

λ Definability with Sums via Grothendieck Logical Relations (MPF, AKS), pp. 147–161.

LICS-1998-CattaniFW #concurrent #formal method #recursion

A Theory of Recursive Domains with Applications to Concurrency (GLC, MPF, GW), pp. 214–225.

LICS-1998-FioreH #axiom #game studies #process #recursion #representation

Recursive Types in Games: Axiomatics and Process Representation (MPF, KH), pp. 345–356.

LICS-1997-FiorePP #axiom #set

Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.

CSL-1996-FioreP #axiom #modelling

An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory (MPF, GDP), pp. 129–149.

LICS-1996-AbadiF #recursion

Syntactic Considerations on Recursive Types (MA, MPF), pp. 242–252.

LICS-1996-FioreMS #π-calculus

A Fully-Abstract Model for the π-Calculus (MPF, EM, DS), pp. 43–54.

LICS-1994-FioreP #axiom #formal method #modelling

An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC (MPF, GDP), pp. 92–102.

POPL-2016-CurienFM #calculus #formal method #modelling

A theory of effects and resources: adjunction models and polarised calculi (PLC, MPF, GMM), pp. 44–56.