Sciweavers

5904 search results - page 259 / 1181
» Requirements for a Composition Language
Sort
View
FOSSACS
2011
Springer
14 years 8 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
ICFP
2010
ACM
15 years 5 months ago
Experience report: growing programming languages for beginning students
A student learning how to program learns best when the programming language and programming environment cater to her specific needs. These needs are different from the requirement...
Marcus Crestani, Michael Sperber
ECOOP
2007
Springer
15 years 10 months ago
Towards correct evolution of components using VPA-based aspects
Abstract. Interaction protocols are a popular means to construct correct component-based systems. Aspects that modify such protocols are interesting in this context because they su...
Dong Ha Nguyen, Mario Südholt
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 4 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICFP
2001
ACM
16 years 4 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha