Sciweavers

289 search results - page 34 / 58
» Program transformation by templates based on term rewriting
Sort
View
OOPSLA
2010
Springer
13 years 6 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 19 hour ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
CF
2007
ACM
14 years 13 days ago
Fast compiler optimisation evaluation using code-feature based performance prediction
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
Christophe Dubach, John Cavazos, Björn Franke...
OOPSLA
2010
Springer
13 years 6 months ago
Ficticious: MicroLanguages for interactive fiction
In this paper we provide an experience report where language oriented programming approaches are applied to complex game design. Ficticious is a G-expression based pidgin of sever...
James Dean Palmer
IFIP
2004
Springer
14 years 1 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack