1320 search results - page 235 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
BPM
2008
Springer
13 years 9 months ago
2008
Springer
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
GG
2010
Springer
13 years 5 months ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
FPL
2008
Springer
13 years 9 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...