AbstractWe present an imperative calculus for a class-based language. By introducing classes as the basic object-oriented construct in a λ-calculus with records and references, we obtain a system with an intuitive operational semantics. Objects are instantiated from classes and represented by records. The type system for objects uses only functional, record, and reference types, and there is a clean separation between subtyping and inheritance. We demonstrate that the calculus is sound and sufficiently expressive to model advanced language features such as inheritance with method redefinition, multi-level encapsulation, and modular object construction
AbstractA problem that often has to be solved by compilers for functional languages targeting the Ja...
This paper addresses the area of video annotation, indexing and retrieval, and shows how a set of to...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
AbstractWe introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative...
AbstractAcceptable logic programs have been studied extensively in the context of proving terminatio...
AbstractComponent-oriented software development is becoming more and more important for the producti...
AbstractThe object-oriented concurrent paradigm demands for a new object model and for reconsidering...
AbstractIn the paper, we propose an automated, SVG-based visualization framework for modeling langua...
Street-level bureaucratic theory is now at a fairly mature stage. The focus on street-level bureaucr...
According to the new Italian Digital Administration Code all administrative organizations must impr...
AbstractWe use ω–finite automata as a device for compressing bi-level images. One of the advantages ...
This document corresponds to the presentations of the course "New Tools for the Digital Libraries " ...
AbstractWe propose an abstract interpretation-based analysis for automatically proving non-trivial p...
In this paper we propose an approach to robot learning by imitation that uses the multimodal inputs ...
AbstractOn the basis of an operational bisimulation account of Böhm tree equivalence, a novel operat...
AbstractA problem that often has to be solved by compilers for functional languages targeting the Ja...
This paper addresses the area of video annotation, indexing and retrieval, and shows how a set of to...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
AbstractWe introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative...
AbstractAcceptable logic programs have been studied extensively in the context of proving terminatio...
AbstractComponent-oriented software development is becoming more and more important for the producti...
AbstractThe object-oriented concurrent paradigm demands for a new object model and for reconsidering...
AbstractIn the paper, we propose an automated, SVG-based visualization framework for modeling langua...
Street-level bureaucratic theory is now at a fairly mature stage. The focus on street-level bureaucr...
According to the new Italian Digital Administration Code all administrative organizations must impr...
AbstractWe use ω–finite automata as a device for compressing bi-level images. One of the advantages ...
This document corresponds to the presentations of the course "New Tools for the Digital Libraries " ...
AbstractWe propose an abstract interpretation-based analysis for automatically proving non-trivial p...
In this paper we propose an approach to robot learning by imitation that uses the multimodal inputs ...
AbstractOn the basis of an operational bisimulation account of Böhm tree equivalence, a novel operat...
AbstractA problem that often has to be solved by compilers for functional languages targeting the Ja...
This paper addresses the area of video annotation, indexing and retrieval, and shows how a set of to...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...