Type specialisation for imperative languages

Dussart, Dirk; Hughes, John; Thiemann, Peter

doi:10.1145/258948.258968

Cited by 12 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Type specialization is an alternative approach to partial evaluation based on type inference, where a functional program can be specialized for the type of the data that it manipulates [14,19]. Similarly to JUST, singleton types are used to specialize for concrete values; both the implementation of functions, their types, and the datatypes that they manipulate are specialized.…”

Section: Related Workmentioning

confidence: 99%

A Unification of Inheritance and Automatic Program Specialization

Schultz

2004

Generative Programming and Component Engineering

View full text Add to dashboard Cite

Abstract. The object-oriented style of programming facilitates program adaptation and enhances program genericness, but at the expense of efficiency. Automatic program specialization can be used to generate specialized, efficient implementations for specific scenarios, but requires the program to be structured appropriately for specialization and is yet another new concept for the programmer to understand and apply. We have unified automatic program specialization and inheritance into a single concept, and implemented this approach in a modified version of Java named JUST. When programming in JUST, inheritance is used to control the automatic application of program specialization to class members during compilation to obtain an efficient implementation. This paper presents the language JUST, which integrates object-oriented concepts, block structure, and techniques from automatic program specialization to provide both a generative programming language where object-oriented designs can be efficiently implemented and a simple yet powerful automatic program specializer for an object-oriented language.

show abstract

Section: Related Workmentioning

confidence: 99%

A Unification of Inheritance and Automatic Program Specialization

Schultz

2004

Generative Programming and Component Engineering

View full text Add to dashboard Cite

show abstract

“…There is a huge body of work on offline partiiil evaluation of functional languages (see [15]). For offline specialization of functional language with imperative features, see [7,12,13,19,26].…”

Section: Further Readingmentioning

confidence: 99%

An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language

Hatcliff

1999

Partial Evaluation

View full text Add to dashboard Cite

Abstract. These notes present b£isic principles of partial evaluation using the simple imperative language FCL (a language of flowcharts introduced by Jones and Gomard). Topics include online psirtial evaluators, ofiiine partial evaJuators, and binding-time aneilysis. The goal of the lectures is to give a rigorous presentation of the semantics of partial evaluation systems, while also providing details of actual implementations. Each partial evaluation system is specified by an operationsd semantics, and each is implemented in Scheme and Java. Exercises include proving veirious properties about the systems using the operational semantics, and modifying and extending the implementations.

show abstract

“…Launchbury and Peyton Jones [24] define an effect delimiter for the state monad with a second order polymorphic type to encapsulate state-based computations. Similar operators have been used by Dussart et al [16] in order to get satisfactory results in a type specializer for the monadic metalanguage extended with mutable store (as in Sec.7).…”

Section: Related Workmentioning

confidence: 99%

A generic framework for specialization (abridged version)

Thiemann

1998

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We present a generic framework for specifying and implementing offline partial evaluators. The framework provides the infrastructure for specializing higher-order programs with computational effects specified through a monad. It performs sound specialization for MI monadic instances and is evaluation-order independent. It subsumes most previously published partial evaluators for higher-order functional programming languages in the sense that they axe instances of the generic framework with respect to a particular monad.

show abstract

Type specialisation for imperative languages

Cited by 12 publications

References 26 publications

A Unification of Inheritance and Automatic Program Specialization

A Unification of Inheritance and Automatic Program Specialization

An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language

A generic framework for specialization (abridged version)

Contact Info

Product

Resources

About