Sciweavers

5090 search results - page 533 / 1018
» Constructing Strategies for Programming
Sort
View
ESOP
2012
Springer
14 years 2 months ago
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho,...
ICFP
2012
ACM
13 years 9 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
PLDI
2006
ACM
16 years 27 days ago
Optimizing data permutations for SIMD devices
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...
Gang Ren, Peng Wu, David A. Padua
WLP
1997
Springer
15 years 11 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
ASPLOS
2011
ACM
14 years 10 months ago
Mnemosyne: lightweight persistent memory
New storage-class memory (SCM) technologies, such as phasechange memory, STT-RAM, and memristors, promise user-level access to non-volatile storage through regular memory instruct...
Haris Volos, Andres Jaan Tack, Michael M. Swift