Marcelo P. Fiore

According to our database1, Marcelo P. Fiore authored at least 61 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A type theory for cartesian closed bicategories.
CoRR, 2019

A type theory for cartesian closed bicategories (Extended Abstract).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2017
List Objects with Algebraic Structure.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016
A theory of effects and resources: adjunction models and polarised calculi.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Classical Logic with Mendler Induction - A Dual Calculus and Its Strong Normalization.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2014
Analytic functors between presheaf categories over groupoids.
Theor. Comput. Sci., 2014

Functorial Semantics of Second-Order Algebraic Theories.
CoRR, 2014

Substitution, jumps, and algebraic effects.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Second-Order Algebraic Theories.
CoRR, 2013

System F i .
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

The Algebra of Directed Acyclic Graphs.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Discrete Generalised Polynomial Functors - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
On the mathematical synthesis of equational logics
Logical Methods in Computer Science, 2011

A foundation for GADTs and inductive families: dependent polynomial functor approach.
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming, 2011

2010
Second-Order Algebraic Theories - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Second-Order Equational Logic (Extended Abstract).
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
On the construction of free algebras for equational systems.
Theor. Comput. Sci., 2009

A congruence rule format for name-passing process calculi.
Inf. Comput., 2009

Mathematical Synthesis of Equational Deduction Systems.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2008
Term Equational Systems and Logics: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2008

Second-Order and Dependently-Sorted Abstract Syntax.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
Preface.
Electr. Notes Theor. Comput. Sci., 2007

The Bicategory-Theoretic Solution of Recursive Domain Equations.
Electr. Notes Theor. Comput. Sci., 2007

Preface.
Electr. Notes Theor. Comput. Sci., 2007

Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

Equational Systems and Free Constructions (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Comparing operational models of name-passing process calculi.
Inf. Comput., 2006

Remarks on isomorphisms in typed lambda calculi with empty and sum types.
Ann. Pure Appl. Logic, 2006

A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005
Mathematical Models of Computational and Combinatorial Structures.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
An objective representation of the Gaussian integers.
J. Symb. Comput., 2004

Comparing Operational Models of Name-Passing Process Calculi.
Electr. Notes Theor. Comput. Sci., 2004

Isomorphisms of generic recursive polynomial types.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

2002
A Fully Abstract Model for the [pi]-calculus.
Inf. Comput., 2002

Semantic analysis of normalisation by evaluation for typed lambda calculus.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Domains in H.
Theor. Comput. Sci., 2001

Semantics of Name and Value Passing.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Computing Symbolic Models for Verifying Cryptographic Protocols.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000
Unique factorisation lifting functors and categories of linearly-controlled processes.
Mathematical Structures in Computer Science, 2000

Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems.
Proceedings of the Theoretical Computer Science, 2000

1999
Fibred models of processes.
Electr. Notes Theor. Comput. Sci., 1999

Lambda Definability with Sums via Grothendieck Logical Relations.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

Abstract Syntax and Variable Binding.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Weak Bisimulation and Open Maps.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
Recursive Types in Games: Axiomatics and Process Representation.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

A Theory of Recursive Domains with Applications to Concurrency.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
An Enrichment Theorem for an Axiomatisation of Categories of Domains and Continuous Functions.
Mathematical Structures in Computer Science, 1997

The category of cpos from a synthetic viewpoint.
Electr. Notes Theor. Comput. Sci., 1997

Complete Cuboidal Sets in Axiomatic Domain Theory.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996
A Coinduction Principle for Recursive Data Types Based on Bisimulation.
Inf. Comput., 1996

A Fully-Abstract Model for the pi-Calculus (Extended Abstract).
Proceedings of the Proceedings, 1996

Syntactic Considerations on Recursive Types.
Proceedings of the Proceedings, 1996

An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
Order-Enrichment for Categories of Partial Maps.
Mathematical Structures in Computer Science, 1995

Lifting as a KZ-Doctrine.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
Axiomatic domain theory in categories of partial maps.
PhD thesis, 1994

An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
A Coinduction Principle for Recursive Data Types Based on Bisimulation
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993


  Loading...