Extracting programs from type class proofs

Sulzmann, Martin

doi:10.1145/1140335.1140348

Cited by 3 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our own work [26], we formalize recursive instances in the presence of a dictionary-passing translation scheme.…”

Section: Translating Type Classesmentioning

confidence: 99%

“…In [18], non-standard type class features such as type class abstraction [11] and recursive instances (a.k.a. recursive dictionaries, co-inductive type classes) [26] are employed to support modular, extensible generic functions.…”

mentioning

confidence: 99%

“…In Section 3, we investigate why changing class declarations breaks modularity by taking a closer look at the dictionary-passing translation scheme [5,26] underlying Haskell implementations. Haskell implementations support the modular extension of subclasses but not superclasses.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Modular generic programming with extensible superclasses

Sulzmann

Wang

2006

Proceedings of the 2006 ACM SIGPLAN Workshop on Generic Programming

Self Cite

View full text Add to dashboard Cite

Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type classes. To achieve modularity, the GM and SYB approach have been extended by using some experimental language extensions such as abstraction over type classes and recursive instances. Hence, the type class encodings behind the GM and SYB approach become less practical and harder to understand.We show that none of these type class features are necessary if we use the single feature of extensible superclasses, the complement of subclass extension. We formalize type classes with extensible superclasses as the combination of a previously introduced typepassing translation scheme and a general type class framework. Our results shed some new light on the use of type classes to support generic programming.

show abstract

“…In our own work [26], we formalize recursive instances in the presence of a dictionary-passing translation scheme.…”

Section: Translating Type Classesmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Modular generic programming with extensible superclasses

Sulzmann

Wang

2006

Proceedings of the 2006 ACM SIGPLAN Workshop on Generic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

A history of Haskell

Hudak

Hughes

Jones

et al. 2007

Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages

141

View full text Add to dashboard Cite

JavaGI

Wehr¹,

Thiemann

2011

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

The language JavaGI extends Java 1.5 conservatively by a generalized interface mechanism. The generalization subsumes retroactive and type-conditional interface implementations, binary methods, symmetric multiple dispatch, interfaces over families of types, and static interface methods. These features make certain coding patterns redundant, increase the expressiveness of the type system, and permit solutions to extension and integration problems with components in binary form, for which previously several unrelated extensions had been suggested. This article explains JavaGI and motivates its design. Moreover, it formalizes a core calculus for JavaGI and proves type soundness, decidability of typechecking, and determinacy of evaluation. The article also presents the implementation of a JavaGI compiler and an accompanying run-time system. The compiler, based on the Eclipse Compiler for Java, offers mostly modular static typechecking and fully modular code generation. It defers certain well-formedness checks until load time to increase flexibility and to enable full support for dynamic loading. Benchmarks show that the code generated by the compiler offers good performance. Several case studies demonstrate the practical utility of the language and its implementation.

show abstract

Extracting programs from type class proofs

Cited by 3 publications

References 33 publications

Modular generic programming with extensible superclasses

Modular generic programming with extensible superclasses

A history of Haskell

JavaGI

Contact Info

Product

Resources

About