The following pages link to Elena Zucca (Q418192):
Displaying 49 items.
- Featherweight Jigsaw. Replacing inheritance by composition in Java-like languages (Q418193) (← links)
- Incremental rebinding with name polymorphism (Q737082) (← links)
- An imperative pure calculus (Q737089) (← links)
- Parametric channels via label expressions in CCS (Q795500) (← links)
- From static to dynamic abstract data-types: An institution transformation (Q1285655) (← links)
- Flexible recovery of uniqueness and immutability (Q1731519) (← links)
- Stores as homomorphisms and their transformations: A uniform approach to structured types in imperative languages (Q1806130) (← links)
- A free construction of dynamic terms (Q1915511) (← links)
- Deriving proof rules from continuation semantics (Q1974480) (← links)
- Enhancing expressivity of checked corecursive streams (Q2163153) (← links)
- An algebraic semantic framework for object oriented languages with concurrency. (Extended abstract) (Q2365396) (← links)
- (Q2722015) (← links)
- (Q2779264) (← links)
- A calculus for dynamic reconfiguration with low priority linking (Q2848693) (← links)
- A calculus for reconfiguration (extended abstract) (Q2851704) (← links)
- A parametric calculus for mobile open code (Q2864499) (← links)
- An algebraic approach to mixins and modularity (Q2956721) (← links)
- Type safe incremental rebinding (Q2971056) (← links)
- Generalizing Inference Systems by Coaxioms (Q2988632) (← links)
- Extending the lambda-calculus with unbind and rebind (Q3006163) (← links)
- (Q3046765) (← links)
- (Q3316569) (← links)
- Principal typings for Java-like languages (Q3452269) (← links)
- Aliasing Control in an Imperative Pure Calculus (Q3460909) (← links)
- A Framework for Type Safe Exchange of Mobile Code (Q3608465) (← links)
- Type Inference by Coinductive Logic Programming (Q3638242) (← links)
- (Q3969858) (← links)
- A theory of mixin modules: basic and derived operators (Q4236216) (← links)
- A calculus of module systems (Q4331135) (← links)
- (Q4375629) (← links)
- A theory of mixin modules: algebraic laws and reduction semantics (Q4405692) (← links)
- (Q4449178) (← links)
- (Q4580225) (← links)
- (Q4673423) (← links)
- D-oids: a model for dynamic data-types (Q4856662) (← links)
- (Q4964691) (← links)
- (Q4993855) (← links)
- Soundness Conditions for Big-Step Semantics (Q5041092) (← links)
- (Q5076059) (← links)
- (Q5091145) (← links)
- Flexible coinductive logic programming (Q5140017) (← links)
- Polymorphic bytecode (Q5276131) (← links)
- Trustworthy Global Computing (Q5394805) (← links)
- A calculus of open modules: call-by-need strategy and confluence (Q5756978) (← links)
- Theoretical Computer Science (Q5897367) (← links)
- Checked corecursive streams: expressivity and completeness (Q6049926) (← links)
- (Q6099600) (← links)
- A Java-like calculus with heterogeneous coeffects (Q6175517) (← links)
- Checking equivalence of corecursive streams: an inductive procedure (Q6589842) (← links)
