81 search results - page 14 / 17 » Extensible pattern matching via a lightweight language exten... |
144
click to vote
ESOP
2007
Springer
15 years 11 months ago
2007
Springer
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...
161
click to vote
ECOOP
2007
Springer
15 years 11 months ago
2007
Springer
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...
405
click to vote
ICA
2012
Springer
14 years 1 months ago
2012
Springer
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 ...
164
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
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...
178
click to vote
IANDC
2011
15 years 18 days ago
2011
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...