Elena Zucca

Orcid: 0000-0002-6833-6470

Affiliations:
  • University of Genoa, Italy


According to our database1, Elena Zucca authored at least 113 papers between 1981 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Resource-Aware Soundness for Big-Step Semantics.
Proc. ACM Program. Lang., October, 2023

A Java-like calculus with heterogeneous coeffects.
Theor. Comput. Sci., September, 2023

Checked corecursive streams: Expressivity and completeness.
Theor. Comput. Sci., September, 2023

Multi-Graded Featherweight Java.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

2022
Coeffects for sharing and mutation.
Proc. ACM Program. Lang., 2022

Enhancing expressivity of checked corecursive streams (extended version).
CoRR, 2022

A Java-Like Calculus with User-Defined Coeffects.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Equality of Corecursive Streams Defined by Finitary Equational Systems.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Enhancing Expressivity of Checked Corecursive Streams.
Proceedings of the Functional and Logic Programming - 16th International Symposium, 2022

2021
Flexible Coinduction in Agda.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

Enhanced Regular Corecursion for Data Streams.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

λ-Based Object-Oriented Programming (Pearl).
Proceedings of the 35th European Conference on Object-Oriented Programming, 2021

2020
Flexible coinductive logic programming.
Theory Pract. Log. Program., 2020

A big step from finite to infinite computations.
Sci. Comput. Program., 2020

Soundness Conditions for Big-Step Semantics.
Proceedings of the Programming Languages and Systems, 2020

An inductive abstract semantics for coFJ.
Proceedings of the FTfJP 2020: Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs, 2020

A Big Step from Finite to Infinite Computations (SCICO Journal-first).
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

Sound Regular Corecursion in coFJ.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
Flexible recovery of uniqueness and immutability.
Theor. Comput. Sci., 2019

Tracing sharing in an imperative pure calculus.
Sci. Comput. Program., 2019

Tracing and Preventing Sharing and Mutation.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Corecursive Featherweight Java Revisited.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Is Solidity Solid Enough?
Proceedings of the Financial Cryptography and Data Security, 2019

2018
A Syntactic Model of Mutation and Aliasing.
Proceedings of the Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, 2018

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

Semantic Subtyping for Non-Strict Languages.
Proceedings of the 24th International Conference on Types for Proofs and Programs, 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.
Proc. ACM Program. Lang., 2017

Type safe incremental rebinding.
Math. Struct. Comput. Sci., 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
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
An Imperative Pure Calculus.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Incremental Rebinding with Name Polymorphism.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 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
Safe corecursion in coFJ.
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, 2013

2012
DeepFJig - Modular composition of nested classes.
J. Object Technol., 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. Informatics Appl., 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
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
A Lightweight Approach to Customizable Composition Operators for Java-like Classes.
Proceedings of the 6th International Workshop on Formal Aspects of Component Software, 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
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.
Math. Struct. Comput. Sci., 2007

Just: Safe Unknown Types in Java-like Languages.
J. Object Technol., 2007

A Parametric Calculus for Mobile Open Code.
Proceedings of the Third International Workshop on Developments in Computational Models, 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 of Components with Dynamic Type-Checking.
Proceedings of the Third International Workshop on Formal Aspects of Component Software, 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 Reconfiguration: (Extended abstract).
Proceedings of the First International Workshop on Developments in Computational Models, 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.
J. Object Technol., 2004

A Calculus for Dynamic Reconfiguration with Low Priority Linking.
Proceedings of the Second Workshop on Object Oriented Developments, 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.
Math. Struct. Comput. Sci., 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.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 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 Aspects 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.
Math. Struct. Comput. Sci., 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 Aspects 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.
Math. Struct. Comput. Sci., 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...