Sciweavers

3056 search results - page 170 / 612
» Compiling Embedded Languages
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 2 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
14 years 5 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
AOSD
2007
ACM
15 years 2 months ago
A flexible architecture for pointcut-advice language implementations
Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environme...
Christoph Bockisch, Mira Mezini
OOPSLA
2010
Springer
14 years 8 months ago
MetaFJig: a meta-circular composition language for Java-like classes
We propose a Java-like language where class denitions are rst class values, hence new classes can be derived from existing, rather than by a xed mechanism like inheritance, by e...
Marco Servetto, Elena Zucca
145
Voted
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 8 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...