Dipartimento di Informatica e Scienze dell'Informazione

Eugenio Moggi Publications

2008

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

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

• From Partial Lambda-calculus to Monads, Plotkin's Symposium, slides of presentation [pdf]

• Program Generation and Components, Formal Methods for Components and Objects 2004, Revised Lectures, LNCS tutorial 3167 [pdf]

• 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 Multi-stage Language for Global Computing, Mathematical Structures In Computer Science, 14(3), 2004 [pdf]
• ML-like 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 [MS03-sub])
• A Monadic Multi-stage Metalanguage, FOSSACS 2003. LNCS 2620, [pdf]
• Closed Types for a Safe Imperative MetaML, Journal of Functional Programming, 13(3), 2003. [pdf]

2002

• Guardians for Ambient-Based Monitoring, FWAN WS 2002. ENTCS 66. [pdf]
• A fully-abstract model for the pi-calculus (extended version). Information And Computation, 179, 2002 [ps.gz] [pdf]

2001

• Higher-Order Types and Meta-Programming for Global Computing, TOSCA WS 2001. ENTCS 62. [ps.gz] [pdf]
• MetaKlaim: Meta-Programming for Global Computing (Position Paper), SAIG WS (PLI) 2001. LNCS 2196. [ps.gz] [pdf]
• Global Types and Network Services, ConCoord WS 2001. ENTCS 54. [ps.gz] [pdf]
• Monadic Encapsulation of Effects: A Revised Approach (extended version), Journal of Functional Programming, 11(6), 2001. [ps.gz] [pdf]

2000

• Monads and Effects, APPSEM'00 Summer School, LNCS 2395, 2002. [ps.gz] [pdf], Slides Part I pdf
• Multi-Stage Imperative Languages: A Conservative Extension Result. SAIG WS (PLI) 2000. [ps.gz] [pdf] (please refer to [CMS02])
• Arity Polymorphism and Dependent Types DTP 2000. [ps.gz] [pdf] (slides)
• Closed Types as a Simple Approach to Safe Imperative Multi-Stage Programming. ICALP 2000. [ps.gz] [pdf] (please refer to [CMS02])

1999

• Monadic Encapsulation of Effects: a Revised Approach. HOOTS 1999. Extended Version (DISI-TR-99-10) [ps.gz] [pdf] (please refer to [MS01])
• Monads, Shapely Functors and Traversals. CTCS 1999. ENTCS 29. [ps.gz] [pdf]
• Logical Modalities and Multi-Stage Programming. IMLA WS (FLoC) 1999. [ps.gz] [pdf]
• An idealized MetaML: simpler, and more expressive. ESOP 1999. (OGI TR 98-017). [ps.gz] [pdf]

1998

• A Categorical Analysis of Multi-Level Languages (OGI TR 98-018). [ps.gz] [pdf]
• A categorical semantics of MetaML (slides). APPSEM'98 September 1998. ps
• Functorial ML. Journal of Functional Programming, 8(6), 1998. extended version [ps.gz] [pdf]
• Functor categories and two-level languages. FOSSACS 1998. preliminary version dvi

1997

• A categorical account of two-level languages. MFPS 1997. preliminary version dvi
• Typed intermediate languages for shape-analysis. TLCA 1997. preliminary version [ps.gz] [pdf]
• Metalanguages and applications. In Semantics and Logics of Computation, A.M. Pitts, P. Dybjer (eds), Publications of the Newton Institute, CUP, 1997. notes [ps.gz] [pdf] and slides [ps.gz] [pdf]

• Domains and denotational semantics: History, accomplishments and open problems. Bulletin of EATCS June 1996. [ps.gz] [pdf]
• A fully-abstract model for the pi-calculus. LICS 1996. [ps.gz] [pdf]
• Functorial ML. PLILP 1996. extended version [ps.gz] [pdf] and slides [ps.gz] [pdf]

• The S-replete construction. CTCS 1995, 953 LNCS. [ps.gz] [pdf]
• A semantics for evaluation logic. Fundamenta Informaticae, 22(1/2), 1995. [ps.gz] [pdf]

• Representing program logics in evaluation logic. [ps.gz] [pdf]
• A general semantics for evaluation logic. LICS 1994. [ps.gz] [pdf]
• A note on SDT in filter spaces. [ps.gz] [pdf]
• A general semantics for evaluation logic. [ps.gz] [pdf]

• A syntactic approach to modularity in denotational semantics. CTCS 1993. [ps.gz] [pdf]

• A category-theoretic account of program modules. Mathematical Structures In Computer Science, 1, 1991. [ps.gz] [pdf]
• Notions of computation and monads. Information And Computation, 93(1), 1991. [ps.gz] [pdf]
• Kripke-style models for typed lambda calculus. (with J. Mitchell). Journal Of Pure And Applied Algebra, 51, 1991. [ps.gz] [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. [ps.gz] [pdf]

• A category-theoretic characterisation of functional completeness. Theoretical Computer Science, 70, 1990.
• Higher-order modules and the phase distinction. POPL 1990. [ps.gz] [pdf]

• A category-theoretic account of program modules. CTCS 1989, 530 LNCS. journal version [ps.gz] [pdf]
• Computational lambda-calculus and monads. LICS 1989. [ps.gz] [pdf]
• An abstract view of programming languages. Tech. Report ECS-LFCS-90-113, Edinburgh Univ., 1989. [ps.gz] [pdf]

• Partial morphisms in categories of effective objects. Information And Computation, 73(2/3), 1988. [ps.gz] [pdf]
• The Partial Lambda-Calculus. PhD thesis, University of Edinburgh, 1988. available as CST-53-88. [ps.gz] [pdf]
• Computational lambda-calculus and monads. Tech. Report ECS-LFCS-88-66, Edinburgh Univ., 1988. [ps.gz] [pdf]

• Empty types in polymorphic lambda calculus. POPL 1987.
• Kripke-style models for typed lambda calculus. LICS 1987. journal version [ps.gz] [pdf]

• Categories of partial morphisms and the partial lambda-calculus. CTCS 1986, 240 LNCS.
• The maximum consistent theory of the second order lambda-calculus. TYPES mailing list 1986. txt

• The hereditary partial functionals and recursion theory in higher types. Journal Of Symbolic Logic, 49(4), 1984.
• Godel-numberings, principal morphisms and combinatory algebras. MFCS 1984, 176 LNCS.
• Cartesian closed categories of enumerations for effective type-structures. Semantics Of Data Types 1984, 173 LNCS.