1,721,103 research outputs found
Stronger Typings for Separate Compilation of Java-like Languages (Extended Abstract)
No full textDavide Ancona and Giovanni Lagorio DISI - Universita di Genova Via Dodecaneso, 35, 16146 Genova (Italy) email: {davide,lagorio}@disi.unige.it Abstract. We define a formal system supporting separate compilation for a small but significant Java-like language
Object-Oriented Programming Languages and Systems (OOPS) - Special Track at the 21st ACM Symposium on Applied Computing (SAC 2006)
No full textThe basic aim of the OO track at the SAC 2004 is to promote and stimulate the research on the object-oriented programming and distributed-object paradigms. This track will foster the development of extensions and enhancements to the prevalent OO languages, like Java, C# and C++, the formulation of innovative OO-based middleware approaches, and the improvements to existing and well-established distributed-object based systems
OOPS Track at SAC 2004 Nicosia / Cyprus
No full textThe OOPS special track at the 2004 ACM Symposium on Applied Computing (SAC 2004) on Object-Oriented Programming Languages and Systems was the first edition of a hopefully long series promoting the development of extensions and enhancements to the prevalent object-oriented languages and standard systems.
A high number of high quality submissions was attracted, among which 10 were selected for publication in the proceedings, and present at SAC 2004. Then, the authors of 6 papers were invited to submit to this JOT special issue a full article containing an extended version of the conference version
OOPS Track at SAC 2006 / France
No full textSpecial Issue "OOPS Track at SAC 2006" , February 2007, Vol. 6, No. 2 "..continuing the tradition started with OOPS (Object-Oriented Programming Languages) at SAC (Symposium on Applied Computing) 2004, this special issue hosts extended versions of papers already published in the ACM proceedings of SAC 2006
co-LP: Back to the Roots
No full textRecently, several papers dealing with co-inductive logic programming h
ave been proposed, dealing with pure Prolog and constraint logic programming, with and without negation.
In this paper we revisit and use, as much as possible, some fundamental results developed in the Eighties to analyze the foundations, and to clarify the possibilities but also the intrinsic theoretical limits of this programming paradigm
A Big Step from Finite to Infinite Computations (SCICO Journal-first)
No full textThe known is finite, the unknown infinite - Thomas Henry Huxley
The behaviour of programs can be described by the final results of computations, and/or their interactions with the context, also seen as observations. For instance, a function call can terminate and return a value, as well as have output effects during its execution.
Here, we deal with semantic definitions covering both results and observations. Often, such definitions are provided for finite computations only. Notably, in big-step style, infinite computations are simply not modelled, hence diverging and stuck terms are not distinguished. This becomes even more unsatisfactory if we have observations, since a non-terminating program may have significant infinite behaviour.
Recently, examples of big-step semantics modeling divergence have been provided [Davide Ancona et al., 2017; Davide Ancona et al., 2018] by means of generalized inference systems [Davide Ancona et al., 2017; Francesco Dagnino, 2019], which allow corules to control coinduction. Indeed, modeling infinite behaviour by a purely coinductive interpretation of big-step rules would lead to spurious results [Xavier Leroy and Hervé Grall, 2009] and undetermined observation, whereas, by adding appropriate corules, we can correctly get divergence (∞) as the only result, and a uniquely determined observation. This approach has been adopted in [Davide Ancona et al., 2017; Davide Ancona et al., 2018] to design big-step definitions including infinite behaviour for lambda-calculus and a simple imperative Java-like language. However, in such works the designer of the semantics is in charge of finding the appropriate corules, and this is a non-trivial task.
In this paper, we show a general construction that extends a given big-step semantics, modeling finite computations, to include infinite behaviour as well, notably by generating appropriate corules. The construction consists of two steps:
1) Starting from a monoid O modeling finite observations (e.g., finite traces), we construct an ω-monoid ⟨O, O_∞⟩ also modeling infinite observations (e.g., infinite traces). The latter structure is a variation of the notion of ω-semigroup [Dominique Perrin and Jean-Eric Pin, 2004], including a mixed product composing a finite with a possibly infinite observation, and an infinite product mapping an infinite sequence of finite observations into a single one (possibly infinite).
2) Starting from an inference system defining a big-step judgment c⇒⟨r, o⟩, with c denoting a configuration, r ∈ R a result, and o ∈ O a finite observation, we construct an inference system with corules defining an extended big-step judgment c⇒c ⇒ ⟨r_∞, o_∞⟩ with r_∞ ∈ R_∞ = R+{∞}, and o_∞ ∈ O_∞ a "possibly infinite" observation. The construction generates additional rules for propagating divergence, and corules for introducing divergence in a controlled way.
The exact corules added in the construction depend on the type of observations that one starts with. To show the effectiveness of our approach, we provide several instances of the framework, with different kinds of (finite) observations.
Finally, we prove a correctness result for the construction. To this end, we assume the original big-step semantics to be equivalent to (finite sequences of steps in) a reference small-step semantics, and we show that, by applying the construction, we obtain an extended big-step semantics which is still equivalent to the small-step semantics, where we consider possibly infinite sequences of steps.} As hypotheses, rather than {just} equivalence in the finite case {(which would be not enough)}, we assume a set of equivalence conditions between individual big-step rules and the small-step relation. This proof of equivalence holds for deterministic semantics; issues arising in the non-deterministic case and a possible solution are sketched in the conclusion of the full paper
Object-Oriented Programming Languages and Systems (OOPS) - Special Track at the 19th ACM Symposium on Applied Computing (SAC 2004)
No full textThe basic aim of the OO track at the SAC 2004 is to promote and stimulate the research on the object-oriented programming and distributed-object paradigms. This track will foster the development of extensions and enhancements to the prevalent OO languages, like Java, C# and C++, the formulation of innovative OO-based middleware approaches, and the improvements to existing and well-established distributed-object based systems
- …
