Elena Zucca

According to our database1, Elena Zucca authored at least 91 papers between 1981 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Flexible recovery of uniqueness and immutability (Extended Version).
CoRR, 2018

Tracing sharing in an imperative pure calculus.
CoRR, 2018

A type and effect system for uniqueness and immutability.
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

Modeling Infinite Behaviour by Corules.
Proceedings of the 32nd European Conference on Object-Oriented Programming, 2018

2017
Reasoning on divergent computations with coaxioms.
PACMPL, 2017

Type safe incremental rebinding.
Mathematical Structures in Computer Science, 2017

A type and effect system for sharing.
Proceedings of the Symposium on Applied Computing, 2017

Generalizing Inference Systems by Coaxioms.
Proceedings of the Programming Languages and Systems, 2017

Tracing sharing in an imperative pure calculus: extended abstract.
Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs, 2017

2016
An Imperative Pure Calculus.
Electr. Notes Theor. Comput. Sci., 2016

Incremental Rebinding with Name Polymorphism.
Electr. Notes Theor. Comput. Sci., 2016

Extending Coinductive Logic Programming with Co-Facts.
Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types, 2016

Initialize-and-catch.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Runtime Checks as Nominal Types.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Types for Immutability and Aliasing Control.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Coupling catch clauses with local declarations.
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, 2016

Towards a model of corecursion with default.
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, 2016

2015
Constrained Polymorphic Types for a Calculus with Name Variables.
Proceedings of the 21st International Conference on Types for Proofs and Programs, 2015

Aliasing Control in an Imperative Pure Calculus.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
A meta-circular language for active libraries.
Sci. Comput. Program., 2014

2013
A meta-circular language for active libraries.
Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, 2013

Safe corecursion in coFJ.
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, 2013

2012
DeepFJig - Modular composition of nested classes.
Journal of Object Technology, 2012

Featherweight Jigsaw - Replacing inheritance by composition in Java-like languages.
Inf. Comput., 2012

Reconciling positional and nominal binding.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

Corecursive Featherweight Java.
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, 2012

2011
Extending the lambda-calculus with unbind and rebind.
RAIRO - Theor. Inf. and Applic., 2011

DeepFJig: modular composition of nested classes.
Proceedings of the 9th International Conference on Principles and Practice of Programming in Java, 2011

2011 international workshop on foundations of object-oriented languages (fool'11): splash/oopsla '11 workshop summary.
Proceedings of the Companion to the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2010
A Lightweight Approach to Customizable Composition Operators for Java-like Classes.
Electr. Notes Theor. Comput. Sci., 2010

Intersection types for unbind and rebind
Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

MetaFJig: a meta-circular composition language for Java-like classes.
Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

2009
Customizable composition operators for Java-like classes.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

The essence of static and dynamic bindings.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes.
Proceedings of the ECOOP 2009, 2009

2008
A Parametric Calculus for Mobile Open Code.
Electr. Notes Theor. Comput. Sci., 2008

Type Inference by Coinductive Logic Programming.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

2007
A provenly correct translation of Fickle into Java.
ACM Trans. Program. Lang. Syst., 2007

A calculus of open modules: call-by-need strategy and confluence.
Mathematical Structures in Computer Science, 2007

Just: Safe Unknown Types in Java-like Languages.
Journal of Object Technology, 2007

A Calculus of Components with Dynamic Type-Checking.
Electr. Notes Theor. Comput. Sci., 2007

A formal framework for compositional compilation.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Type inference for polymorphic methods in Java-like languages.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
A Calculus for Reconfiguration: (Extended abstract).
Electr. Notes Theor. Comput. Sci., 2006

A Framework for Type Safe Exchange of Mobile Code.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Introducing safe unknown types in Java-like languages.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Flexible Type-Safe Linking of Components for Java-Like Languages.
Proceedings of the Modular Programming Languages, 7th Joint Modular Languages Conference, 2006

Formal Techniques for Java-Like Programs.
Proceedings of the Object-Oriented Technology, ECOOP 2006 Workshop Reader, 2006

2005
A Calculus for Dynamic Reconfiguration with Low Priority Linking.
Electr. Notes Theor. Comput. Sci., 2005

Mixin Modules for Dynamic Rebinding.
Proceedings of the Trustworthy Global Computing, International Symposium, 2005

Polymorphic bytecode: compositional compilation for Java-like languages.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

2004
A Case-Study in Encoding Configuration Languages: Multiple Class Loaders.
Journal of Object Technology, 2004

Modeling multiple class loaders by a calculus for dynamic linking.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Principal typings for Java-like languages.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

A Calculus with Lazy Module Operators.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Jam - designing a Java extension with mixins.
ACM Trans. Program. Lang. Syst., 2003

A Calculus for Dynamic Linking.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

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

2002
A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics.
Mathematical Structures in Computer Science, 2002

A calculus of module systems.
J. Funct. Program., 2002

True separate compilation of Java classes.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

A Formal Framework for Java Separate Compilation.
Proceedings of the ECOOP 2002, 2002

2001
A type preserving translation of Fickle into Java.
Electr. Notes Theor. Comput. Sci., 2001

A Core Calculus for Java Exceptions.
Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 2001

An Effective Translation of Fickle into Java.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

True Modules for Java-like Languages.
Proceedings of the ECOOP 2001, 2001

2000
Jam - A Smooth Extension of Java with Mixins.
Proceedings of the ECOOP 2000, 2000

1999
From Static to Dynamic Abstract Data-Types: An Institution Transformation.
Theor. Comput. Sci., 1999

Stores as Homomorphisms and Their Transformations: A Uniform Approach to Structured Types in Imperative Languages.
Sci. Comput. Program., 1999

Deriving Proof Rules from Continuation Semantics.
Formal Asp. Comput., 1999

Extending Casl by Late Binding.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1999

A Primitive Calculus for Module Systems.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

A Formal Framework with Late Binding.
Proceedings of the Fundamental Approaches to Software Engineering, 1999

1998
A Theory of Mixin Modules: Basic and Derived Operators.
Mathematical Structures in Computer Science, 1998

1997
Implementation of derived programs (almost) for free.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

An algebra of mixin modules.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

Overriding Operators in a Mixin-Based Framework.
Proceedings of the Programming Languages: Implementations, 1997

1996
A Free Construction of Dynamic Terms.
J. Comput. Syst. Sci., 1996

An Algebraic Semantic Framework for Object Oriented Languages with Concurrency (Extended Abstract).
Formal Asp. Comput., 1996

From Static to Dynamic Abstract Data-Types.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

A Formal Framework for Modules with State.
Proceedings of the Algebraic Methodology and Software Technology, 1996

An Algebraic Approach to Mixins and Modularity.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1995
D-oids: A Model for Dynamic Data-Types.
Mathematical Structures in Computer Science, 1995

1994
Implementation of Data Structures in an Imperative Framework.
Proceedings of the Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30, 1994

1993
Stores as Homomorphisms and their Transformations.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A Semantic Model for Dynamic Systems.
Proceedings of the Modelling Database Dynamics, 1992

1989
An Algebraic Compositional Semantics of an Object Oriented Notation with Concurrency.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1987
An Integrated Algebraic Approach to the Specification of Data Types, Processes and Objects.
Proceedings of the Algebraic Methods: Theory, 1987

1984
Parametric Channels via Label Expressions in CCS.
Theor. Comput. Sci., 1984

1981
Semantics of CSP via Translation into CCS.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Semantics of Distributed Processes Derived by Translation.
Proceedings of the GI, 1981


  Loading...