The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This paper clarifies the essence of the features of .FJ, by giving a formal translation from .FJ into a variant of Featherweight GJ with a little extension of F-bounded polymorphism. The extension, which allows self types to...

Systems supporting the manipulation of non-trivial program code are complex and are at best semi-automatic. However, formal methods, and in partieular theorem proving, are providing a growing foundation of techniques for automatie program development (synthesis, improvement, transformation and verification). In this paper we report on novel research concerning: (1) the exploitation of synthesis...

In Correspondence Theory (McCarthy & Prince 1995), elements of two strings (S , S ) belonging to designated representational levels such as (input, output) may become associated through an arbitrary correspondence relation, while constraints like MAX, DEP evaluate such string pairs relative to the set of elementwise correspondences they find. Using some elementary calculations, I show that the ...

Much of the work on validation and verification of knowledge based systems (KBSs) has been done in terms of implementation languages (mostly rule-based languages). Recent papers have argued that it is advantageous to do validation and verification in terms of a more abstract and formal specification of the system. However, constructing such formal specifications is a difficult task. This paper ...

As business collaboration involves multiple business processes from different participating organisations, it becomes a challenging issue to manage the complex correspondence between instances of these business processes. Yet very limited support has been provided by inter-organisational workflow research. In this paper, we develop a formal method to specify instance correspondence based on a n...

The paper deals with the problem of approximation functions several variables by branched continued fractions. We study correspondence between formal multiple power series and so-called "multidimensional $S$-fraction independent variables". As a result, necessary sufficient conditions for expansion into corresponding multidimensional have been established. Several numerical experiments show eff...

We prove that a random choice rule satisfies Luce's Choice Axiom if and only its support is correspondence the Weak of Revealed Preference, thus it consists alternatives are optimal according to some preference, then occurs tie-breaking mechanism among such Renyi's Conditioning Axiom. Our result shows is, in precise formal sense, probabilistic version It supports view his own axiom as “canon ra...

Let Mm be the formal scheme which represents the functor of deformations of a one-dimensional formal module over F̄p equipped with a level-m-structure. By work of Boyer (in mixed characterististic) and Harris and Taylor, the l-adic étale cohomology of the generic fibre Mm of Mm realizes simultaneously the local Langlands and Jacquet-Langlands correspondences. The proofs given so far use Drinfeld...

let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigate some properties of formal local cohomology modules with respect to a serre subcategory. we provide a common language to indicate some properties of formal local cohomology modules. let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigat...

According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of the abstract syntax of UML class and sequence diagrams based on the well-defined theory of typed attributed graph transformation with inheritance and application conditions. The generated langu...