default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcelo P. Fiore
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Marcelo Fiore, Zeinab Galal, Hugo Paquet:
Stabilized profunctors and stable species of structures. Log. Methods Comput. Sci. 20(1) (2024)- 2023
- [c51]Marcelo Fiore, Zeinab Galal, Farzad Jafarrahmani:
Fixpoint constructions in focused orthogonality models of linear logic. MFPS 2023 - [i9]Marcelo Fiore, Zeinab Galal, Hugo Paquet:
Stabilized profunctors and stable species of structures. CoRR abs/2303.04795 (2023) - 2022
- [j18]Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp
:
Quotients, inductive types, and quotient inductive types. Log. Methods Comput. Sci. 18(2) (2022) - [j17]Marcelo Fiore:
Semantic analysis of normalisation by evaluation for typed lambda calculus. Math. Struct. Comput. Sci. 32(8): 1028-1065 (2022) - [j16]Marcelo Fiore, Dmitrij Szamozvancev:
Formal metatheory of second-order abstract syntax. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [c50]Marcelo Fiore, Zeinab Galal, Hugo Paquet:
A Combinatorial Approach to Higher-Order Structure for Polynomial Functors. FSCD 2022: 31:1-31:19 - [c49]Vikraman Choudhury, Marcelo Fiore:
Free Commutative Monoids in Homotopy Type Theory. MFPS 2022 - [i8]Marcelo Fiore, Dmitrij Szamozvancev:
Formal Metatheory of Second-Order Abstract Syntax. CoRR abs/2201.03504 (2022) - [i7]Marcelo Fiore:
Semantic Analysis of Normalisation by Evaluation for Typed Lambda Calculus. CoRR abs/2207.08777 (2022) - 2021
- [j15]Marcelo Fiore, Philip Saville:
Coherence for bicategorical cartesian closed structure. Math. Struct. Comput. Sci. 31(7): 822-849 (2021) - [i6]Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp:
Quotients, inductive types, and quotient inductive types. CoRR abs/2101.02994 (2021) - 2020
- [j14]Marco Devesas Campos, Marcelo Fiore:
Classical logic with Mendler induction. J. Log. Comput. 30(1): 77-106 (2020) - [c48]Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp:
Constructing Infinitary Quotient-Inductive Types. FoSSaCS 2020: 257-276 - [c47]Marcelo Fiore, Philip Saville:
Relative Full Completeness for Bicategorical Cartesian Closed Structure. FoSSaCS 2020: 277-298 - [c46]Nathanael Arkor, Marcelo Fiore:
Algebraic models of simple type theories: A polynomial approach. LICS 2020: 88-101 - [c45]Marcelo Fiore, Philip Saville:
Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure. LICS 2020: 425-439 - [i5]Nathanael Arkor, Marcelo Fiore:
Algebraic models of simple type theories: a polynomial approach. CoRR abs/2006.16949 (2020)
2010 – 2019
- 2019
- [c44]Marcelo Fiore, Philip Saville:
A type theory for cartesian closed bicategories (Extended Abstract). LICS 2019: 1-13 - [i4]Marcelo Fiore, Philip Saville:
A type theory for cartesian closed bicategories. CoRR abs/1904.06538 (2019) - [i3]Marcelo Fiore, Andrew M. Pitts, S. C. Steenkamp:
Constructing Infinitary Quotient-Inductive Types. CoRR abs/1911.06899 (2019) - 2017
- [c43]Marcelo Fiore, Philip Saville:
List Objects with Algebraic Structure. FSCD 2017: 16:1-16:18 - 2016
- [c42]Marco Devesas Campos, Marcelo P. Fiore:
Classical Logic with Mendler Induction - A Dual Calculus and Its Strong Normalization. LFCS 2016: 43-59 - [c41]Pierre-Louis Curien, Marcelo P. Fiore, Guillaume Munch-Maccagnoni:
A theory of effects and resources: adjunction models and polarised calculi. POPL 2016: 44-56 - 2014
- [j13]Marcelo P. Fiore:
Analytic functors between presheaf categories over groupoids. Theor. Comput. Sci. 546: 120-131 (2014) - [c40]Marcelo P. Fiore, Sam Staton:
Substitution, jumps, and algebraic effects. CSL-LICS 2014: 41:1-41:10 - [i2]Marcelo P. Fiore, Ola Mahmoud:
Functorial Semantics of Second-Order Algebraic Theories. CoRR abs/1401.4697 (2014) - 2013
- [c39]Marcelo P. Fiore, Marco Devesas Campos:
The Algebra of Directed Acyclic Graphs. Computation, Logic, Games, and Quantum Foundations 2013: 37-51 - [c38]Marcelo P. Fiore, Makoto Hamana:
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic. LICS 2013: 520-529 - [c37]Ki Yung Ahn, Tim Sheard, Marcelo P. Fiore, Andrew M. Pitts:
System F i . TLCA 2013: 15-30 - [i1]Marcelo P. Fiore, Ola Mahmoud:
Second-Order Algebraic Theories. CoRR abs/1308.5409 (2013) - 2012
- [c36]Marcelo P. Fiore:
Discrete Generalised Polynomial Functors - (Extended Abstract). ICALP (2) 2012: 214-226 - 2011
- [j12]Marcelo P. Fiore, Chung-Kil Hur:
On the mathematical synthesis of equational logics. Log. Methods Comput. Sci. 7(3) (2011) - [c35]Makoto Hamana, Marcelo P. Fiore:
A foundation for GADTs and inductive families: dependent polynomial functor approach. WGP@ICFP 2011: 59-70 - 2010
- [c34]Marcelo P. Fiore, Chung-Kil Hur:
Second-Order Equational Logic (Extended Abstract). CSL 2010: 320-335 - [c33]Marcelo P. Fiore, Ola Mahmoud:
Second-Order Algebraic Theories - (Extended Abstract). MFCS 2010: 368-380
2000 – 2009
- 2009
- [j11]Marcelo P. Fiore, Sam Staton:
A congruence rule format for name-passing process calculi. Inf. Comput. 207(2): 209-236 (2009) - [j10]Marcelo P. Fiore, Chung-Kil Hur:
On the construction of free algebras for equational systems. Theor. Comput. Sci. 410(18): 1704-1729 (2009) - [c32]Marcelo P. Fiore, Chung-Kil Hur:
Mathematical Synthesis of Equational Deduction Systems. TLCA 2009: 1-2 - 2008
- [c31]Marcelo P. Fiore:
Second-Order and Dependently-Sorted Abstract Syntax. LICS 2008: 57-68 - [c30]Marcelo P. Fiore, Chung-Kil Hur:
Term Equational Systems and Logics: (Extended Abstract). MFPS 2008: 171-192 - 2007
- [c29]Marcelo P. Fiore, Chung-Kil Hur:
Equational Systems and Free Constructions (Extended Abstract). ICALP 2007: 607-618 - [c28]Marcelo P. Fiore:
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic. TLCA 2007: 163-177 - [c27]Luca Cardelli, Marcelo P. Fiore, Glynn Winskel:
Preface. Computation, Meaning, and Logic 2007: 1-4 - [c26]Marcelo P. Fiore:
Preface. MFPS 2007: 1-2 - [c25]Gian Luca Cattani, Marcelo P. Fiore:
The Bicategory-Theoretic Solution of Recursive Domain Equations. Computation, Meaning, and Logic 2007: 203-222 - [e2]Luca Cardelli, Marcelo Fiore, Glynn Winskel:
Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin. Electronic Notes in Theoretical Computer Science 172, Elsevier 2007 [contents] - [e1]Marcelo Fiore:
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, MFPS 2007, New Orleans, LA, USA, April 11-14, 2007. Electronic Notes in Theoretical Computer Science 173, Elsevier 2007 [contents] - 2006
- [j9]Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat:
Remarks on isomorphisms in typed lambda calculi with empty and sum types. Ann. Pure Appl. Log. 141(1-2): 35-50 (2006) - [j8]Marcelo P. Fiore, Sam Staton:
Comparing operational models of name-passing process calculi. Inf. Comput. 204(4): 524-560 (2006) - [c24]Marcelo P. Fiore, Sam Staton:
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. LICS 2006: 49-58 - 2005
- [c23]Marcelo P. Fiore:
Mathematical Models of Computational and Combinatorial Structures. FoSSaCS 2005: 25-46 - 2004
- [j7]Marcelo P. Fiore, Tom Leinster:
An objective representation of the Gaussian integers. J. Symb. Comput. 37(6): 707-716 (2004) - [c22]Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore:
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. POPL 2004: 64-76 - [c21]Marcelo P. Fiore:
Isomorphisms of generic recursive polynomial types. POPL 2004: 77-88 - [c20]Marcelo P. Fiore, Sam Staton:
Comparing Operational Models of Name-Passing Process Calculi. CMCS 2004: 91-104 - 2002
- [j6]Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi:
A Fully Abstract Model for the [pi]-calculus. Inf. Comput. 179(1): 76-117 (2002) - [c19]Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat:
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types. LICS 2002: 147- - [c18]Marcelo P. Fiore:
Semantic analysis of normalisation by evaluation for typed lambda calculus. PPDP 2002: 26-37 - 2001
- [j5]Marcelo P. Fiore, Giuseppe Rosolini:
Domains in H. Theor. Comput. Sci. 264(2): 171-193 (2001) - [c17]Marcelo P. Fiore, Martín Abadi:
Computing Symbolic Models for Verifying Cryptographic Protocols. CSFW 2001: 160-173 - [c16]Marcelo P. Fiore, Daniele Turi:
Semantics of Name and Value Passing. LICS 2001: 93-104 - 2000
- [j4]Marta Bunge, Marcelo P. Fiore:
Unique factorisation lifting functors and categories of linearly-controlled processes. Math. Struct. Comput. Sci. 10(2): 137-163 (2000) - [c15]Marcelo P. Fiore:
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems. IFIP TCS 2000: 457-473
1990 – 1999
- 1999
- [c14]Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel:
Weak Bisimulation and Open Maps. LICS 1999: 67-76 - [c13]Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi:
Abstract Syntax and Variable Binding. LICS 1999: 193-202 - [c12]Marcelo P. Fiore, Alex K. Simpson:
Lambda Definability with Sums via Grothendieck Logical Relations. TLCA 1999: 147-161 - [c11]Marcelo P. Fiore:
Fibred models of processes. CTCS 1999: 78 - 1998
- [c10]Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel:
A Theory of Recursive Domains with Applications to Concurrency. LICS 1998: 214-225 - [c9]Marcelo P. Fiore, Kohei Honda:
Recursive Types in Games: Axiomatics and Process Representation. LICS 1998: 345-356 - 1997
- [j3]Marcelo P. Fiore:
An Enrichment Theorem for an Axiomatisation of Categories of Domains and Continuous Functions. Math. Struct. Comput. Sci. 7(5): 591-618 (1997) - [c8]Marcelo P. Fiore, Gordon D. Plotkin, A. John Power:
Complete Cuboidal Sets in Axiomatic Domain Theory. LICS 1997: 268-278 - [c7]Marcelo P. Fiore, Giuseppe Rosolini:
The category of cpos from a synthetic viewpoint. MFPS 1997: 133-150 - 1996
- [j2]Marcelo P. Fiore:
A Coinduction Principle for Recursive Data Types Based on Bisimulation. Inf. Comput. 127(2): 186-198 (1996) - [c6]Marcelo P. Fiore, Gordon D. Plotkin:
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. CSL 1996: 129-149 - [c5]Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi:
A Fully-Abstract Model for the pi-Calculus (Extended Abstract). LICS 1996: 43-54 - [c4]Martín Abadi, Marcelo P. Fiore:
Syntactic Considerations on Recursive Types. LICS 1996: 242-252 - 1995
- [j1]Marcelo P. Fiore:
Order-Enrichment for Categories of Partial Maps. Math. Struct. Comput. Sci. 5(4): 533-562 (1995) - [c3]Marcelo P. Fiore:
Lifting as a KZ-Doctrine. Category Theory and Computer Science 1995: 146-158 - 1994
- [b1]Marcelo P. Fiore:
Axiomatic domain theory in categories of partial maps. University of Edinburgh, UK, 1994 - [c2]Marcelo P. Fiore, Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC. LICS 1994: 92-102 - 1993
- [c1]Marcelo P. Fiore:
A Coinduction Principle for Recursive Data Types Based on Bisimulation. LICS 1993: 110-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-30 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
