| A Big Step from Finite to Infinite Computations | 0 | 0.34 | 2020 |
| A Big Step from Finite to Infinite Computations (SCICO Journal-first). | 0 | 0.34 | 2020 |
| An inductive abstract semantics for coFJ. | 0 | 0.34 | 2020 |
| Flexible coinductive logic programming | 0 | 0.34 | 2020 |
| Sound Regular Corecursion in coFJ | 0 | 0.34 | 2020 |
| A Syntactic Model of Mutation and Aliasing. | 0 | 0.34 | 2019 |
| Flexible recovery of uniqueness and immutability | 0 | 0.34 | 2019 |
| Tracing and Preventing Sharing and Mutation. | 0 | 0.34 | 2019 |
| Corecursive Featherweight Java Revisited. | 0 | 0.34 | 2019 |
| Flexible recovery of uniqueness and immutability (Extended Version). | 0 | 0.34 | 2018 |
| A type and effect system for uniqueness and immutability. | 1 | 0.35 | 2018 |
| Tracing sharing in an imperative pure calculus. | 0 | 0.34 | 2018 |
| Semantic subtyping for non-strict languages. | 1 | 0.35 | 2018 |
| Modeling Infinite Behaviour by Corules. | 1 | 0.35 | 2018 |
| Generalizing Inference Systems by Coaxioms. | 2 | 0.36 | 2017 |
| Tracing sharing in an imperative pure calculus: extended abstract | 2 | 0.37 | 2017 |
| Type safe incremental rebinding. | 0 | 0.34 | 2017 |
| Reasoning on divergent computations with coaxioms | 1 | 0.35 | 2017 |
| A type and effect system for sharing. | 3 | 0.39 | 2017 |
| Coupling catch clauses with local declarations. | 0 | 0.34 | 2016 |
| Runtime Checks as Nominal Types. | 0 | 0.34 | 2016 |
| Initialize-and-catch. | 0 | 0.34 | 2016 |
| Towards a model of corecursion with default. | 2 | 0.36 | 2016 |
| An Imperative Pure Calculus. | 4 | 0.43 | 2016 |
| Types for Immutability and Aliasing Control. | 0 | 0.34 | 2016 |
| Incremental Rebinding with Name Polymorphism. | 0 | 0.34 | 2016 |
| Aliasing Control In An Imperative Pure Calculus | 5 | 0.45 | 2015 |
| Constrained Polymorphic Types for a Calculus with Name Variables. | 0 | 0.34 | 2015 |
| Safe corecursion in coFJ | 3 | 0.39 | 2013 |
| Reconciling Positional And Nominal Binding | 3 | 0.47 | 2013 |
| A meta-circular language for active libraries. | 0 | 0.34 | 2013 |
| DeepFJig: modular composition of nested classes | 3 | 0.38 | 2012 |
| Featherweight Jigsaw - Replacing inheritance by composition in Java-like languages | 8 | 0.44 | 2012 |
| Corecursive Featherweight Java | 6 | 0.45 | 2012 |
| Extending the lambda-calculus with unbind and rebind. | 1 | 0.37 | 2011 |
| 2010 international workshop on foundations of object-oriented languages (FOOL'10): SPLASH/OOPSLA'10 workshop summary | 0 | 0.34 | 2011 |
| A Lightweight Approach to Customizable Composition Operators for Java-like Classes | 2 | 0.36 | 2010 |
| Formal Techniques for Distributed Systems, Joint 12th IFIP WG 6.1 International Conference, FMOODS 2010 and 30th IFIP WG 6.1 International Conference, FORTE 2010, Amsterdam, The Netherlands, June 7-9, 2010. Proceedings | 15 | 1.41 | 2010 |
| Intersection types for unbind and rebind | 3 | 0.48 | 2010 |
| Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes | 17 | 0.75 | 2009 |
| Customizable composition operators for Java-like classes. | 0 | 0.34 | 2009 |
| The essence of static and dynamic bindings. | 2 | 0.40 | 2009 |
| Type Inference by Coinductive Logic Programming | 8 | 0.56 | 2008 |
| A Parametric Calculus for Mobile Open Code | 7 | 0.61 | 2008 |
| A formal framework for compositional compilation | 0 | 0.34 | 2007 |
| A Calculus of Components with Dynamic Type-Checking | 4 | 0.40 | 2007 |
| Just: Safe Unknown Types In Java-Like Languages | 7 | 0.58 | 2007 |
| A calculus of open modules: call-by-need strategy and confluence | 2 | 0.38 | 2007 |
| Type inference for polymorphic methods in Java-like languages | 4 | 0.47 | 2007 |
| A framework for type safe exchange of mobile code | 3 | 0.43 | 2006 |
