An object-oriented approach to datatype-generic programming

Moors, Adriaan; Piessens, Frank; Joosen, Wouter

doi:10.1145/1159861.1159875

Cited by 8 publications

(13 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We believe that Scala tends to be seen only as an object-oriented language that happens to have some functional features, and so potential users feel that they have to use it in an object-oriented way. (For example, Moors et al [2006] claimed to be 'staying as close to the original work as possible' in their translation, but as we show in Section 4 they still ended up less functional than they might have done.) Scala is also a functional programming language that happens to have object-oriented features.…”

Section: Introductionmentioning

confidence: 76%

“…Moors et al [2006] explain the necessity of this construction for guaranteeing type safety; it is not required at all in the FP encoding.…”

Section: Evaluation Of the Approachmentioning

confidence: 99%

“…Origami in Scala, after Moors et al [2006] of the case class In, rather than a global function. This works smoothly for operations consuming a single distinguished instance of the recursive datatype, such as cata.…”

Section: Evaluation Of the Approachmentioning

confidence: 99%

“…Moors et al [2006] address this second problem through an 'extensible encoding', expressed in terms of virtual classes -that is, nested classes in a superclass that are overridable in a subclass. Since Scala does not provide such a construct, this virtual class encoding has itself to be encoded in terms of type members of the enclosing class (which are overridable).…”

Section: Evaluation Of the Approachmentioning

confidence: 99%

“…Indeed, at the previous Workshop on Generic Programming, Moors et al [2006] presented a translation into Scala of a Haskell library of 'origami operators' [Gibbons, 2006]; we discuss this translation in depth in Section 4. And of course, it is not really surprising that Scala should turn out to subsume Haskell, since its principal designer is a well-known functional programmer.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Scala for generic programmers

Oliveira

Gibbons

2008

Proceedings of the ACM SIGPLAN Workshop on Generic Programming

View full text Add to dashboard Cite

Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as 'list of'. Most approaches to datatype-generic programming are developed in the lazy functional programming language Haskell. We argue that the functional object-oriented language Scala is in many ways a better setting. Not only does Scala provide equivalents of all the necessary functional programming features (such parametric polymorphism, higher-order functions, higher-kinded type operations, and type-and constructor-classes), but it also provides the most useful features of object-oriented languages (such as subtyping, overriding, traditional single inheritance, and multiple inheritance in the form of traits). We show how this combination of features benefits datatype-generic programming, using three different approaches as illustrations.

show abstract

Section: Introductionmentioning

confidence: 76%

“…Moors et al [2006] explain the necessity of this construction for guaranteeing type safety; it is not required at all in the FP encoding.…”

Section: Evaluation Of the Approachmentioning

confidence: 99%

Section: Evaluation Of the Approachmentioning

confidence: 99%

Section: Evaluation Of the Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Scala for generic programmers

Oliveira

Gibbons

2008

Proceedings of the ACM SIGPLAN Workshop on Generic Programming

View full text Add to dashboard Cite

show abstract

Polytypic Genetic Programming

Swan

Krawiec

Ghani

2017

Applications of Evolutionary Computation

View full text Add to dashboard Cite

Abstract. Program synthesis via heuristic search often requires a great deal of 'boilerplate' code to adapt program APIs to the search mechanism. In addition, the majority of existing approaches are not type-safe: i.e. they can fail at runtime because the search mechanisms lack the strict type information often available to the compiler. In this article, we describe Polytope, a Scala framework that uses polytypic programming, a relatively recent advance in program abstraction. Polytope requires a minimum of boilerplate code and supports a form of strongtyping in which type rules are automatically enforced by the compiler, even for search operations such as mutation which are applied at runtime. By operating directly on language-native expressions, it provides an embeddable optimization procedure for existing code. We give a tutorial example of the specific polytypic approach we adopt and compare both runtime efficiency and required lines of code against the well-known EpochX GP framework, showing comparable performance in the former and the complete elimination of boilerplate for the latter.

show abstract