Eugenio Moggi

Math. Struct. Comput. Sci., 2023

Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad.

[BibT_eX]

[DOI]

Francesco Dagnino

Amin Farjudian

Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2020

Sound Over-Approximation of Probabilities.

[BibT_eX]

[DOI]

Johan Thunberg

Acta Cybern., 2020

2019

System Analysis and Robustness.

[BibT_eX]

[DOI]

Amin Farjudian

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018

Safe & robust reachability analysis of hybrid systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A Semantic Account of Rigorous Simulation.

[BibT_eX]

[DOI]

Proceedings of the Principles of Modeling, 2018

2015

Acumen: An Open-Source Testbed for Cyber-Physical Systems Research.

[BibT_eX]

[DOI]

Proceedings of the Internet of Things. IoT Infrastructures, 2015

2012

Foreword ICTCS 2010 special issue.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

2010

Monad transformers as monoid transformers.

[BibT_eX]

[DOI]

Mauro Jaskelioff

Theor. Comput. Sci., 2010

2009

Monad Transformers as Monoid Transformers.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2007

Structuring Operational Semantics: Simplification and Computation.

[BibT_eX]

[DOI]

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2005

Applied semantics: Selected topics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

MetaKlaim: a type safe multi-stage language for global computing.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2004

An abstract monadic semantics for value recursion.

[BibT_eX]

[DOI]

Amr Sabry

RAIRO Theor. Informatics Appl., 2004

A Fresh Calculus for Name Management.

[BibT_eX]

[DOI]

Davide Ancona

Proceedings of the Generative Programming and Component Engineering: Third International Conference, 2004

Program Generation and Components.

[BibT_eX]

[DOI]

Davide Ancona

Proceedings of the Formal Methods for Components and Objects, 2004

ML-Like Inference for Classifiers.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2004

2003

Closed types for a safe imperative MetaML.

[BibT_eX]

[DOI]

Tim Sheard

J. Funct. Program., 2003

Mixin Modules and Computational Effects.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

The Klaim Project: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Global Computing. Programming Environments, 2003

A Monadic Multi-stage Metalanguage.

[BibT_eX]

[DOI]

Sonia Fagorzi

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

A Fully Abstract Model for the [pi]-calculus.

[BibT_eX]

[DOI]

Marcelo P. Fiore

Davide Sangiorgi

Inf. Comput., 2002

Guardians for Ambient-based Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Wide Area Network Computing, 2002

2001

Special issue: Modalities in type theory.

[BibT_eX]

[DOI]

Matt Fairtlough

Michael Mendler

Math. Struct. Comput. Sci., 2001

Monadic encapsulation of effects: a revised approach (extended version).

[BibT_eX]

[DOI]

Amr Sabry

J. Funct. Program., 2001

Global Types and Network Services.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Concurrency and Coordination, 2001

Higher-Order Types and Meta-Programming for Global Computing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

MetaKlaim: Meta-programming for Global Computing.

[BibT_eX]

[DOI]

Proceedings of the Semantics, 2001

2000

Multi-Stage Imperative Languages: A Conservative Extension Result.

[BibT_eX]

[DOI]

Proceedings of the Semantics, 2000

Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Monads and Effects.

[BibT_eX]

[DOI]

Nick Benton

John Hughes

Proceedings of the Applied Semantics, International Summer School, 2000

1999

Monads, shapely functors, and traversals.

[BibT_eX]

[DOI]

Gianna Bellè

C. Barry Jay

Proceedings of the Conference on Category Theory and Computer Science, 1999

Monadic Encapsulation of Effects: a Revised Approach.

[BibT_eX]

[DOI]

Fabrizio Palumbo

Proceedings of the Third Workshop on Higher-Order Operational Techniques in Semantics, 1999

An Idealized MetaML: Simpler, and More Expressive.

[BibT_eX]

[DOI]

Zine-El-Abidine Benaissa

Tim Sheard

Proceedings of the Programming Languages and Systems, 1999

1998

Functorial ML.

[BibT_eX]

[DOI]

C. Barry Jay

Gianna Bellè

J. Funct. Program., 1998

Functor Categories and Two-Level Languages.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997

A categorical account of two-level languages.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Typed Intermediate Languages for Shape Analysis.

[BibT_eX]

[DOI]

Gianna Bellè

Proceedings of the Typed Lambda Calculi and Applications, 1997

1996

A Fully-Abstract Model for the pi-Calculus (Extended Abstract).

[BibT_eX]

[DOI]

Marcelo P. Fiore

Davide Sangiorgi

Proceedings of the Proceedings, 1996

1995

A Semantics for Evaluation Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

The S-Replete Constuction.

[BibT_eX]

[DOI]

J. M. E. Hyland

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994

A General Semantics for Evaluation Logic

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1991

Notions of Computation and Monads

[BibT_eX]

[DOI]

Inf. Comput., July, 1991

A Cateogry-Theoretic Account of Program Modules.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1991

Constructive Natural Deduction and its 'Omega-Set' Interpretation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1991

Kripke-Style Models for Typed lambda Calculus.

[BibT_eX]

[DOI]

John C. Mitchell

Ann. Pure Appl. Log., 1991

A Modular Approach to Denotational Semantics.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 1991

Relating Models of Impredicative Type Theories.

[BibT_eX]

[DOI]

Bart Jacobs

Thomas Streicher

Proceedings of the Category Theory and Computer Science, 1991

1990

A Category-Theoretic Characterization of Functional Completeness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Higher-Order Modules and the Phase Distinction.

[BibT_eX]

[DOI]

Robert Harper

John C. Mitchell

Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

1989

Computational Lambda-Calculus and Monads

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

A Category-theoretic Account of Program Modules.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 1989

1988

Te partial lamdba calculus

[BibT_eX]

[DOI]

PhD thesis, 1988

Partial Morphisms in Categories of Effective Objects

[BibT_eX]

[DOI]

Inf. Comput., 1988

1987

Empty Types in Polymorphic Lambda Calculus.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Programming, 1985

1984

The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types.

[BibT_eX]

[DOI]

J. Symb. Log., 1984

Cartesian Closed Categories of Enumerations for Effective Type Structures (Part I & II).

[BibT_eX]

[DOI]

Proceedings of the Semantics of Data Types, International Symposium, 1984

Gödel Numberings, Principal Morphisms, Combinatory Algebras: A Category-theoretic Characterization of Functional Completeness.

[BibT_eX]

[DOI]