Lightweight scalable components

Kamina, Tetsuo; Tamai, Terutaka

doi:10.1145/1289971.1289996

Cited by 9 publications

(6 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A good example is FGJ# [16], which supports a similar mechanism, namely type inference for this, although it is invented independently. We find that the type system has a flaw-it allows unsafe subclassing and instantiation of a generic class whose self type is a type variable-resulting in failure of type soundness.…”

Section: Integration With Other Typing Mechanismsmentioning

confidence: 97%

“…Our formalization requires self type variables to be explicitly specified as opposed to the example in Section 3. Formalizing an inference rule for i would be easy as done in Kamina and Tamai [16]. There are no other differences from the FGJ syntax except that typecasts are omitted for simplicity.…”

Section: Formalizationmentioning

confidence: 99%

“…We simplify the proof of subject reduction for FGJ self (in Appendix C) by referring to Kamina and Tamai [16], who have proposed a mechanism similar to our self type variables.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Essence of Lightweight Family Polymorphism.

Saito

Igarashi

2008

JOT

View full text Add to dashboard Cite

We have proposed lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes, and introduced its formal core calculus .FJ. In this paper, we give a formal translation, which changes only type declarations, from .FJ into FGJ self , an extension of Featherweight GJ with self type variables. They improve self typing and are required for the translation to preserve typing. Therefore we claim that self type variables represent the essential difference between .FJ and Featherweight GJ, namely, lightweight family polymorphism provides better self typing for mutually recursive classes than Java generics. To support this claim rigorously, we show that FGJ self enjoys type soundness and the formal translation preserves typing and reduction.

show abstract

Section: Integration With Other Typing Mechanismsmentioning

confidence: 97%

Section: Formalizationmentioning

confidence: 99%

See 1 more Smart Citation

The Essence of Lightweight Family Polymorphism.

Saito

Igarashi

2008

JOT

View full text Add to dashboard Cite

show abstract

“…In Scala, self types can be explicitly annotated [34] by using requires clause. Another solution, invented independently by Saito and Igarashi [35] and Kamina and Tamai [24], is to extend generics a little so that this can have abstract types in a special case in exchange for a small restriction on subclassing.…”

Section: Related Workmentioning

confidence: 99%

Self type constructors

Saito

Igarashi

2009

Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inheritance. MyType is useful to write extensible yet typesafe classes for objects with recursive interfaces, that is, ones with methods that take or return objects of the same type as the receiver.Although LOOJ has also generics, MyType has been introduced as a feature rather orthogonal to generics. As a result, LOOJ cannot express an interface that refers to the same generic class recursively but with different type arguments. This is a significant limitation because such an interface naturally arises in practice, for example, in a generic collection class with method map(), which converts a collection to the same kind of collection of a different element type. Altherr and Cremet and Moors, Piessens, and Odersky gave solutions to this problem but they used a highly sophisticated combination of advanced mechanisms such as abstract type members, higher-order type constructors, and F-bounded polymorphism.In this paper, we give another solution by introducing self type constructors, which integrate MyType and generics so that MyType can take type arguments in a generic class. Self type constructors are tailored to writing recursive interfaces more concicely than previous solutions. We demonstrate the expressive power of self type constructors by means of examples, formalize a core language with self type constructors, and prove its type safety.

show abstract

“…Thus, as a composition technique, superimposition should be applicable to a wide range of software artifacts. While there are various tools that support superimposition for code artifacts [4,8,9,20,28,31,32,34,37] and non-code artifacts [1,8,14,16,18,21], they appear all different, are dedicated to and embedded differently in their respective host languages, and their implementation and integration requires a major effort. A reason is that, usually, the developers of languages and tools did not address (or realize) the general nature of superimposition.…”

Section: Introductionmentioning

confidence: 99%

Language-Independent and Automated Software Composition: The FeatureHouse Experience

Apel

Kästner

Lengauer

2013

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has been (re)invented and implemented individually for various kinds of software artifacts. We unify languages and tools that rely on superimposition by using the language-independent model of feature structure trees (FSTs). On the basis of the FST model, we propose a general approach to the composition of software artifacts written in different languages, Furthermore, we offer a supporting framework and tool chain, called FEATUREHOUSE. We use attribute grammars to automate the integration of additional languages, in particular, we have integrated Java, C#, C, Haskell, JavaCC, and XML. Several case studies demonstrate the practicality and scalability of our approach and reveal insights into the properties a language must have in order to be ready for superimposition.

show abstract

Lightweight scalable components

Cited by 9 publications

References 37 publications

The Essence of Lightweight Family Polymorphism.

The Essence of Lightweight Family Polymorphism.

Self type constructors

Language-Independent and Automated Software Composition: The FeatureHouse Experience

Contact Info

Product

Resources

About