Sciweavers

81 search results - page 14 / 17
» Extensible pattern matching via a lightweight language exten...
Sort
View
ESOP
2007
Springer
14 years 1 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
ECOOP
2007
Springer
14 years 1 months ago
A Staged Static Program Analysis to Improve the Performance of Runtime Monitoring
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Our work is based on tracematches, an extension to...
Eric Bodden, Laurie J. Hendren, Ondrej Lhotá...
ICA
2012
Springer
12 years 3 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
SAC
2006
ACM
13 years 7 months ago
Transformation of yEPC business process models to YAWL
Model transformations are frequently applied in business process modeling to bridge between languages on a different abstraction and formality. In this paper, we define a transfor...
Jan Mendling, Michael Moser, Gustaf Neumann
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher