Type classes as objects and implicits

Oliveira, Bruno C. d. S.; Moors, Adriaan; Odersky, Martin

doi:10.1145/1869459.1869489

Cited by 73 publications

(37 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Implicits in Scala [16] provide similar capabilities to type classes via direct support for type-directed implicit parameter passing. Parameters can be marked implicit which then allows them to be omitted from function calls.…”

Section: Implicitsmentioning

confidence: 99%

See 1 more Smart Citation

Modular implicits

White¹,

Bour²,

Yallop³

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism inspired by Scala implicits and modular type classes. Modular implicits are based on type-directed implicit module parameters, and elaborate straightforwardly into OCaml's first-class functors. Basing the design on OCaml's modules leads to a system that naturally supports many features from other languages with systematic ad-hoc overloading, including inheritance, instance constraints, constructor classes and associated types.

show abstract

Section: Implicitsmentioning

confidence: 99%

“…Scala implicits [16] are a major inspiration for this work. They provide implicit parameters on functions, which are selected from the scope of the call site based on their type.…”

Section: Implicitsmentioning

confidence: 99%

Modular implicits

White¹,

Bour²,

Yallop³

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Scala's implicits [4] provide a convenient way of deriving runtime information from static types. When the last argument list of a method is marked as implicit, a call to this method need not specify its actual arguments.…”

Section: Putting Static Information To Workmentioning

confidence: 99%

“…Domain-specific type restrictions can be implemented using implicit resolution, which provides a limited form of logic programming at the type level [4]. Phantom types and other classic tricks are also commonly used.…”

Section: Introductionmentioning

confidence: 99%

Scala-virtualized

Moors

Rompf

Haller

et al. 2012

Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation

Self Cite

View full text Add to dashboard Cite

Scala-Virtualized extends the Scala language to better support hosting embedded DSLs. Embedding a DSL in Scala-Virtualized comes with all the benefits of a shallow embedding thanks to Scala's flexible syntax, without giving up analyzing and manipulating the domain program -typically exclusive to deep embeddings. Through lightweight modular staging, implemented in standard Scala, the benefits of a deep embedding are recovered with little overhead. Scala-Virtualized lifts more of the language's built-in constructs and static information to complete this support and make it more convenient. We illustrate how Scala-Virtualized makes Scala an even better host for embedded DSLs along three axes of customizing the language: syntax, run-time behavior and static semantics.

show abstract

“…These parameters need not be provided explicitly if an implementation of the type in question can be found in implicit scope. One use case for implicit parameters is the definition of type classes [18] similar to those found in Haskell . Type classes are a way to implement ad-hoc polymorphism (method overloading) in purely functional programming languages.…”

Section: Introductionmentioning

confidence: 99%

chemf: A purely functional chemistry toolkit

Höck

Riedl

2012

J Cheminform

View full text Add to dashboard Cite

BackgroundAlthough programming in a type-safe and referentially transparent style offers several advantages over working with mutable data structures and side effects, this style of programming has not seen much use in chemistry-related software. Since functional programming languages were designed with referential transparency in mind, these languages offer a lot of support when writing immutable data structures and side-effects free code. We therefore started implementing our own toolkit based on the above programming paradigms in a modern, versatile programming language.ResultsWe present our initial results with functional programming in chemistry by first describing an immutable data structure for molecular graphs together with a couple of simple algorithms to calculate basic molecular properties before writing a complete SMILES parser in accordance with the OpenSMILES specification. Along the way we show how to deal with input validation, error handling, bulk operations, and parallelization in a purely functional way. At the end we also analyze and improve our algorithms and data structures in terms of performance and compare it to existing toolkits both object-oriented and purely functional. All code was written in Scala, a modern multi-paradigm programming language with a strong support for functional programming and a highly sophisticated type system.ConclusionsWe have successfully made the first important steps towards a purely functional chemistry toolkit. The data structures and algorithms presented in this article perform well while at the same time they can be safely used in parallelized applications, such as computer aided drug design experiments, without further adjustments. This stands in contrast to existing object-oriented toolkits where thread safety of data structures and algorithms is a deliberate design decision that can be hard to implement. Finally, the level of type-safety achieved by Scala highly increased the reliability of our code as well as the productivity of the programmers involved in this project.

show abstract

Type classes as objects and implicits

Cited by 73 publications

References 44 publications

Modular implicits

Modular implicits

Scala-virtualized

chemf: A purely functional chemistry toolkit

Contact Info

Product

Resources

About