Sciweavers

57 search results - page 9 / 12
» Lazy XSL transformations
Sort
View
SEFM
2006
IEEE
15 years 3 months ago
A PVS Based Framework for Validating Compiler Optimizations
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
ACMMSP
2006
ACM
250views Hardware» more  ACMMSP 2006»
15 years 3 months ago
What do high-level memory models mean for transactions?
Many people have proposed adding transactions, or atomic blocks, to type-safe high-level programming languages. However, researchers have not considered the semantics of transacti...
Dan Grossman, Jeremy Manson, William Pugh
JOT
2008
100views more  JOT 2008»
14 years 9 months ago
Panda: a Pattern-based Programming System for Automatic Code Generation
This article provides an overview of a pattern-based programming system, named Panda, for automatic generation of high-level programming language code. Many code generation system...
Daniele Mazzeranghi
APLAS
2009
ACM
15 years 4 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier
94
Voted
PLILP
1992
Springer
15 years 1 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl