233 search results - page 36 / 47 » Computational Lambda-Calculus and Monads |
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CONCUR
2004
Springer
14 years 26 days ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
GI
1997
Springer
13 years 11 months ago
1997
Springer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...