52 search results - page 9 / 11 » Programmed Graph Rewriting with DEVS |
PPDP
1999
Springer
13 years 11 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
POPL
2000
ACM
13 years 12 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
CADE
2003
Springer
14 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
PASTE
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents Lancet, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the linktime rewri...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...