Eugenio Moggi

Orcid: 0000-0001-8018-6543

Affiliations:
  • University of Genoa, Italy


According to our database1, Eugenio Moggi authored at least 59 papers between 1984 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Robustness, Scott continuity, and computability.
Math. Struct. Comput. Sci., 2023

Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2020
Sound Over-Approximation of Probabilities.
Acta Cybern., 2020

2019
System Analysis and Robustness.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
Safe & robust reachability analysis of hybrid systems.
Theor. Comput. Sci., 2018

A Semantic Account of Rigorous Simulation.
Proceedings of the Principles of Modeling, 2018

2015

2012
Foreword ICTCS 2010 special issue.
RAIRO Theor. Informatics Appl., 2012

2010
Monad transformers as monoid transformers.
Theor. Comput. Sci., 2010

2009
Monad Transformers as Monoid Transformers.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2007
Structuring Operational Semantics: Simplification and Computation.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2005
Applied semantics: Selected topics.
Theor. Comput. Sci., 2005

2004
MetaKlaim: a type safe multi-stage language for global computing.
Math. Struct. Comput. Sci., 2004

An abstract monadic semantics for value recursion.
RAIRO Theor. Informatics Appl., 2004

A Fresh Calculus for Name Management.
Proceedings of the Generative Programming and Component Engineering: Third International Conference, 2004

Program Generation and Components.
Proceedings of the Formal Methods for Components and Objects, 2004

ML-Like Inference for Classifiers.
Proceedings of the Programming Languages and Systems, 2004

2003
Closed types for a safe imperative MetaML.
J. Funct. Program., 2003

Mixin Modules and Computational Effects.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

The Klaim Project: Theory and Practice.
Proceedings of the Global Computing. Programming Environments, 2003

A Monadic Multi-stage Metalanguage.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

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

Guardians for Ambient-based Monitoring.
Proceedings of the Foundations of Wide Area Network Computing, 2002

2001
Special issue: Modalities in type theory.
Math. Struct. Comput. Sci., 2001

Monadic encapsulation of effects: a revised approach (extended version).
J. Funct. Program., 2001

Global Types and Network Services.
Proceedings of the International Workshop on Concurrency and Coordination, 2001

Higher-Order Types and Meta-Programming for Global Computing.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

MetaKlaim: Meta-programming for Global Computing.
Proceedings of the Semantics, 2001

2000
Multi-Stage Imperative Languages: A Conservative Extension Result.
Proceedings of the Semantics, 2000

Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Monads and Effects.
Proceedings of the Applied Semantics, International Summer School, 2000

1999
Monads, shapely functors, and traversals.
Proceedings of the Conference on Category Theory and Computer Science, 1999

Monadic Encapsulation of Effects: a Revised Approach.
Proceedings of the Third Workshop on Higher-Order Operational Techniques in Semantics, 1999

An Idealized MetaML: Simpler, and More Expressive.
Proceedings of the Programming Languages and Systems, 1999

1998
Functorial ML.
J. Funct. Program., 1998

Functor Categories and Two-Level Languages.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
A categorical account of two-level languages.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Typed Intermediate Languages for Shape Analysis.
Proceedings of the Typed Lambda Calculi and Applications, 1997

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

1995
A Semantics for Evaluation Logic.
Fundam. Informaticae, 1995

The S-Replete Constuction.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
A General Semantics for Evaluation Logic
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1991
Notions of Computation and Monads
Inf. Comput., July, 1991

A Cateogry-Theoretic Account of Program Modules.
Math. Struct. Comput. Sci., 1991

Constructive Natural Deduction and its 'Omega-Set' Interpretation.
Math. Struct. Comput. Sci., 1991

Kripke-Style Models for Typed lambda Calculus.
Ann. Pure Appl. Log., 1991

A Modular Approach to Denotational Semantics.
Proceedings of the Category Theory and Computer Science, 1991

Relating Models of Impredicative Type Theories.
Proceedings of the Category Theory and Computer Science, 1991

1990
A Category-Theoretic Characterization of Functional Completeness.
Theor. Comput. Sci., 1990

Higher-Order Modules and the Phase Distinction.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

1989
Computational Lambda-Calculus and Monads
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

A Category-theoretic Account of Program Modules.
Proceedings of the Category Theory and Computer Science, 1989

1988
Te partial lamdba calculus
PhD thesis, 1988

Partial Morphisms in Categories of Effective Objects
Inf. Comput., 1988

1987
Empty Types in Polymorphic Lambda Calculus.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1985
Categories of Partial Morphisms and the lambda<sup>p</sup> - Calculus.
Proceedings of the Category Theory and Computer Programming, 1985

1984
The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types.
J. Symb. Log., 1984

Cartesian Closed Categories of Enumerations for Effective Type Structures (Part I & II).
Proceedings of the Semantics of Data Types, International Symposium, 1984

Gödel Numberings, Principal Morphisms, Combinatory Algebras: A Category-theoretic Characterization of Functional Completeness.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984


  Loading...