Sciweavers

3713 search results - page 409 / 743
» Constructing a Calculus of Programs
Sort
View
HASKELL
2007
ACM
15 years 8 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland
148
Voted
PLDI
1995
ACM
15 years 8 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
156
Voted
AOSD
2008
ACM
15 years 6 months ago
Test-based pointcuts for robust and fine-grained join point specification
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...
Kouhei Sakurai, Hidehiko Masuhara
DOCENG
2008
ACM
15 years 6 months ago
A concise XML binding framework facilitates practical object-oriented document engineering
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
Andruid Kerne, Zachary O. Toups, Blake Dworaczyk, ...
GPCE
2008
Springer
15 years 5 months ago
Polymorphic embedding of dsls
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...
Christian Hofer, Klaus Ostermann, Tillmann Rendel,...