List of publications by
Eugenio Moggi
(most recent first) in pdf format:
2010
2008

Perche' Frances E.Allen ha vinto la Turing Award 2006? (in Italian)
LNCS Italia [pdf],
lucidi [pdf]
2007

Structuring Operational Semantics: Simplification and Computation,
Computation, Meaning and Logic  Articles dedicated to Gordon Plotkin,
ENTCS vol.172
[pdf]
2006
2005
2004

An Abstract Monadic Semantics for Value Recursion,
Theoretical Informatics and Applications, 38, 2004
[pdf]

A Fresh Calculus for Names Management,
GPCE 2004, LNCS
[pdf]

MetaKlaim: A Type Safe Multistage Language for Global Computing,
Mathematical Structures In Computer Science, 14(3), 2004
[pdf]

MLlike Inference for Classifiers,
ESOP 2004. LNCS
[extended version pdf]
2003

The Klaim Project: Theory and Practice,
Global Computing, Trento Feb 2003. LNCS 2874,
[pdf]

Mixin Modules and Computational Effects,
ICALP 2003.
[pdf]

An Abstract Monadic Semantics for Value Recursion,
FICS 2003.
[pdf]
(please refer to [MS03sub])

A Monadic Multistage Metalanguage,
FOSSACS 2003. LNCS 2620,
[pdf]

Closed Types for a Safe Imperative MetaML,
Journal of Functional Programming, 13(3), 2003.
[pdf]
2002

Guardians for AmbientBased Monitoring,
FWAN WS 2002. ENTCS 66.
[pdf]

A fullyabstract model for the picalculus (extended version).
Information And Computation, 179, 2002
[pdf]
2001

HigherOrder Types and MetaProgramming for Global Computing,
TOSCA WS 2001. ENTCS 62.
[pdf]

MetaKlaim: MetaProgramming for Global Computing (Position Paper),
SAIG WS (PLI) 2001. LNCS 2196.
[pdf]

Global Types and Network Services,
ConCoord WS 2001. ENTCS 54.
[pdf]

Monadic Encapsulation of Effects: A Revised Approach (extended version),
Journal of Functional Programming, 11(6), 2001.
[pdf]
2000

Monads and Effects,
APPSEM'00 Summer School,
LNCS 2395, 2002.
[pdf],
Slides Part I pdf

MultiStage Imperative Languages: A Conservative Extension Result.
SAIG WS (PLI) 2000.
[pdf]
(please refer to [CMS02])

Arity Polymorphism and Dependent Types
DTP 2000.
[pdf] (slides)

Closed Types as a Simple Approach to Safe Imperative MultiStage Programming.
ICALP 2000.
[pdf]
(please refer to [CMS02])
1999

Monadic Encapsulation of Effects: a Revised Approach.
HOOTS 1999.
Extended Version (DISITR9910)
[pdf]
(please refer to [MS01])

Monads, Shapely Functors and Traversals.
CTCS 1999. ENTCS 29.
[pdf]

Logical Modalities and MultiStage Programming.
IMLA WS (FLoC) 1999.
[pdf]

An idealized MetaML: simpler, and more expressive.
ESOP 1999.
[pdf]
1998

A Categorical Analysis of MultiLevel Languages
[pdf]

A categorical semantics of MetaML (slides).
APPSEM'98 September 1998.
ps

Functorial ML.
Journal of Functional Programming, 8(6), 1998.
extended version
[pdf]

Functor categories and twolevel languages.
FOSSACS 1998.
1997

A categorical account of twolevel languages.
MFPS 1997.

Typed intermediate languages for shapeanalysis.
TLCA 1997.
preliminary version
[pdf]

Metalanguages and applications.
In Semantics and Logics of Computation,
A.M. Pitts, P. Dybjer (eds),
Publications of the Newton Institute, CUP, 1997.
notes
[pdf]
and slides
[pdf]
1996

Domains and denotational semantics: History, accomplishments and open problems.
Bulletin of EATCS June 1996.
[pdf]

A fullyabstract model for the picalculus.
LICS 1996.
[pdf]

Functorial ML.
PLILP 1996.
extended version
[pdf]
and slides
[pdf]
1995

The Sreplete construction.
CTCS 1995, 953 LNCS.
[pdf]

A semantics for evaluation logic.
Fundamenta Informaticae, 22(1/2), 1995.
[pdf]
1994

Representing program logics in evaluation logic.
[pdf]

A general semantics for evaluation logic.
LICS 1994.
[pdf]

A note on SDT in filter spaces.
[pdf]

A general semantics for evaluation logic.
[pdf]
1993

A syntactic approach to modularity in denotational semantics.
CTCS 1993.
[pdf]
1991

A categorytheoretic account of program modules.
Mathematical Structures In Computer Science, 1, 1991.
[pdf]

Notions of computation and monads.
Information And Computation, 93(1), 1991.
[pdf]

Kripkestyle models for typed lambda calculus.
(with J. Mitchell).
Journal Of Pure And Applied Algebra, 51, 1991.
[pdf]

Constructive natural deduction and its modest interpretation.
Mathematical Structures In Computer Science, 1, 1991.

Relating models of impredicative type theories.
CTCS 1991, 389 LNCS.
[pdf]
1990

A categorytheoretic characterisation of functional completeness.
Theoretical Computer Science, 70, 1990.

Higherorder modules and the phase distinction.
POPL 1990.
[pdf]
1989

A categorytheoretic account of program modules.
CTCS 1989, 530 LNCS.
journal version
[pdf]

Computational lambdacalculus and monads.
LICS 1989.
[pdf]

An abstract view of programming languages.
Tech. Report ECSLFCS90113, Edinburgh Univ., 1989.
[pdf]
1988

Partial morphisms in categories of effective objects.
Information And Computation, 73(2/3), 1988.
[pdf]

The Partial LambdaCalculus.
PhD thesis, University of Edinburgh, 1988.
available as CST5388.
[pdf]

Computational lambdacalculus and monads.
Tech. Report ECSLFCS8866, Edinburgh Univ., 1988.
[pdf]
1987

Empty types in polymorphic lambda calculus.
POPL 1987.
[pdf]

Kripkestyle models for typed lambda calculus.
LICS 1987.
journal version
[pdf]
1986

Categories of partial morphisms and the partial lambdacalculus.
Cathegory Theory and Computer Programming 1986, 240 LNCS.

The maximum consistent theory of the second order lambdacalculus.
TYPES mailing list 1986. txt
1984

The hereditary partial functionals and recursion theory in higher types.
Journal Of Symbolic Logic, 49(4), 1984.
pdf

Godelnumberings, principal morphisms and combinatory algebras.
MFCS 1984, 176 LNCS.

Cartesian closed categories of enumerations for effective typestructures.
Semantics Of Data Types 1984, 173 LNCS.
pdf
Comments to:
Eugenio Moggi.