1998 symposium on partial evaluation

Danvy, Olivier; Glück, Robert; Thiemann, Peter

doi:10.1145/292469.293684

Cited by 3 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Derivation of product lines is often associated with partial evaluation [19,8,13]. There have been approaches to enable partial evaluation based on execution traces instead of fixed input values [15,28,10], nevertheless they were never implemented for realistic languages.…”

Section: Related Workmentioning

confidence: 99%

Modeling software product lines using color-blind transition systems

Larsen

Nyman

Wąsowski

2007

Int J Softw Tools Technol Transf

View full text Add to dashboard Cite

Families of embedded discrete finite state programs are modeled using input-enabled alternating transition systems. One model describes all functionality, while each variant is defined by an environment, describing its possible uses. The environments show both the inputs that a system can receive and indicate which of the system's responses are relevant for the environment. The latter trait, called color-blindness, creates new possibilities for system transformations in the specialization process. We demonstrate the use of the framework by applying it to two classes of realistic design languages. An example of a product line of alarm clocks is used throughout the article.

show abstract

Section: Related Workmentioning

confidence: 99%

Modeling software product lines using color-blind transition systems

Larsen

Nyman

Wąsowski

2007

Int J Softw Tools Technol Transf

View full text Add to dashboard Cite

show abstract

The Correctness of Type Specialisation

Hughes

2000

Programming Languages and Systems

View full text Add to dashboard Cite

Type specialisation, like partial evaluation, is an approach to specialising programs. But type specialisation works in a very different way, using a form of type inference. Previous articles have described the method and demonstrated its power as a program transformation, but its correctness has not previously been addressed. Indeed, it is not even clear what correctness should mean: type specialisation transforms programs to others with different types, so clearly cannot preserve semantics in the usual sense. In this paper we explain why finding a correctness proof was difficult, we motivate a correctness condition, and we prove that type specialisation satisfies it. Perhaps unsurprisingly, type-theoretic methods turned out to crack the nut.

show abstract

A Type Specialisation Tutorial

Hughes

1999

Partial Evaluation

View full text Add to dashboard Cite

1998 symposium on partial evaluation

Cited by 3 publications

References 22 publications

Modeling software product lines using color-blind transition systems

Modeling software product lines using color-blind transition systems

The Correctness of Type Specialisation

A Type Specialisation Tutorial

Contact Info

Product

Resources

About