2009 |
42 | EE | Marcelo P. Fiore,
Sam Staton:
A congruence rule format for name-passing process calculi.
Inf. Comput. 207(2): 209-236 (2009) |
41 | EE | Marcelo P. Fiore,
Chung-Kil Hur:
On the construction of free algebras for equational systems.
Theor. Comput. Sci. 410(18): 1704-1729 (2009) |
2008 |
40 | EE | Marcelo P. Fiore:
Second-Order and Dependently-Sorted Abstract Syntax.
LICS 2008: 57-68 |
39 | EE | Marcelo P. Fiore,
Chung-Kil Hur:
Term Equational Systems and Logics: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 218: 171-192 (2008) |
2007 |
38 | EE | Marcelo P. Fiore,
Chung-Kil Hur:
Equational Systems and Free Constructions (Extended Abstract).
ICALP 2007: 607-618 |
37 | EE | Marcelo P. Fiore:
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.
TLCA 2007: 163-177 |
36 | EE | Luca Cardelli,
Marcelo P. Fiore,
Glynn Winskel:
Preface.
Electr. Notes Theor. Comput. Sci. 172: 1-4 (2007) |
35 | EE | Gian Luca Cattani,
Marcelo P. Fiore:
The Bicategory-Theoretic Solution of Recursive Domain Equations.
Electr. Notes Theor. Comput. Sci. 172: 203-222 (2007) |
34 | EE | Marcelo P. Fiore:
Preface.
Electr. Notes Theor. Comput. Sci. 173: 1-2 (2007) |
2006 |
33 | EE | Marcelo P. Fiore,
Sam Staton:
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics.
LICS 2006: 49-58 |
32 | EE | Marcelo P. Fiore,
Roberto Di Cosmo,
Vincent Balat:
Remarks on isomorphisms in typed lambda calculi with empty and sum types.
Ann. Pure Appl. Logic 141(1-2): 35-50 (2006) |
31 | EE | Marcelo P. Fiore,
Sam Staton:
Comparing operational models of name-passing process calculi.
Inf. Comput. 204(4): 524-560 (2006) |
2005 |
30 | EE | Marcelo P. Fiore:
Mathematical Models of Computational and Combinatorial Structures.
FoSSaCS 2005: 25-46 |
2004 |
29 | EE | 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 |
28 | EE | Marcelo P. Fiore:
Isomorphisms of generic recursive polynomial types.
POPL 2004: 77-88 |
27 | EE | Marcelo P. Fiore,
Sam Staton:
Comparing Operational Models of Name-Passing Process Calculi.
Electr. Notes Theor. Comput. Sci. 106: 91-104 (2004) |
26 | EE | Marcelo P. Fiore,
Tom Leinster:
An objective representation of the Gaussian integers.
J. Symb. Comput. 37(6): 707-716 (2004) |
2002 |
25 | EE | Marcelo P. Fiore,
Roberto Di Cosmo,
Vincent Balat:
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types.
LICS 2002: 147- |
24 | EE | Marcelo P. Fiore:
Semantic analysis of normalisation by evaluation for typed lambda calculus.
PPDP 2002: 26-37 |
23 | EE | Marcelo P. Fiore,
Eugenio Moggi,
Davide Sangiorgi:
A Fully Abstract Model for the [pi]-calculus.
Inf. Comput. 179(1): 76-117 (2002) |
2001 |
22 | EE | Marcelo P. Fiore,
Martín Abadi:
Computing Symbolic Models for Verifying Cryptographic Protocols.
CSFW 2001: 160-173 |
21 | | Marcelo P. Fiore,
Daniele Turi:
Semantics of Name and Value Passing.
LICS 2001: 93-104 |
20 | EE | Marcelo P. Fiore,
Giuseppe Rosolini:
Domains in H.
Theor. Comput. Sci. 264(2): 171-193 (2001) |
2000 |
19 | EE | Marcelo P. Fiore:
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems.
IFIP TCS 2000: 457-473 |
18 | | Marta Bunge,
Marcelo P. Fiore:
Unique factorisation lifting functors and categories of linearly-controlled processes.
Mathematical Structures in Computer Science 10(2): 137-163 (2000) |
1999 |
17 | EE | Marcelo P. Fiore,
Gordon D. Plotkin,
Daniele Turi:
Abstract Syntax and Variable Binding.
LICS 1999: 193-202 |
16 | EE | Marcelo P. Fiore,
Gian Luca Cattani,
Glynn Winskel:
Weak Bisimulation and Open Maps.
LICS 1999: 67-76 |
15 | EE | Marcelo P. Fiore,
Alex K. Simpson:
Lambda Definability with Sums via Grothendieck Logical Relations.
TLCA 1999: 147-161 |
14 | EE | Marcelo P. Fiore:
Fibred models of processes.
Electr. Notes Theor. Comput. Sci. 29: (1999) |
1998 |
13 | | Gian Luca Cattani,
Marcelo P. Fiore,
Glynn Winskel:
A Theory of Recursive Domains with Applications to Concurrency.
LICS 1998: 214-225 |
12 | | Marcelo P. Fiore,
Kohei Honda:
Recursive Types in Games: Axiomatics and Process Representation.
LICS 1998: 345-356 |
1997 |
11 | EE | Marcelo P. Fiore,
Gordon D. Plotkin,
A. John Power:
Complete Cuboidal Sets in Axiomatic Domain Theory.
LICS 1997: 268-279 |
10 | EE | Marcelo P. Fiore,
Giuseppe Rosolini:
The category of cpos from a synthetic viewpoint.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
9 | | Marcelo P. Fiore:
An Enrichment Theorem for an Axiomatisation of Categories of Domains and Continuous Functions.
Mathematical Structures in Computer Science 7(5): 591-618 (1997) |
1996 |
8 | | Marcelo P. Fiore,
Gordon D. Plotkin:
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory.
CSL 1996: 129-149 |
7 | | Martín Abadi,
Marcelo P. Fiore:
Syntactic Considerations on Recursive Types.
LICS 1996: 242-252 |
6 | | Marcelo P. Fiore,
Eugenio Moggi,
Davide Sangiorgi:
A Fully-Abstract Model for the pi-Calculus (Extended Abstract).
LICS 1996: 43-54 |
5 | | Marcelo P. Fiore:
A Coinduction Principle for Recursive Data Types Based on Bisimulation.
Inf. Comput. 127(2): 186-198 (1996) |
1995 |
4 | | Marcelo P. Fiore:
Lifting as a KZ-Doctrine.
Category Theory and Computer Science 1995: 146-158 |
3 | | Marcelo P. Fiore:
Order-Enrichment for Categories of Partial Maps.
Mathematical Structures in Computer Science 5(4): 533-562 (1995) |
1994 |
2 | | Marcelo P. Fiore,
Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC
LICS 1994: 92-102 |
1993 |
1 | | Marcelo P. Fiore:
A Coinduction Principle for Recursive Data Types Based on Bisimulation
LICS 1993: 110-119 |