867 search results - page 30 / 174 » On Two Forms of Structural Recursion |
WABI
2004
Springer
15 years 5 months ago
2004
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...
93
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
82
Voted
TLDI
2005
ACM
15 years 6 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
103
click to vote
PLDI
2005
ACM
15 years 6 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
200
click to vote
POPL
2006
ACM
16 years 24 days ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...