688 search results - page 23 / 138 » Types for trees |
100
Voted
HOA
1993
15 years 4 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
113
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
84
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
IPPS
1995
IEEE
15 years 4 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
103
Voted
CASCON
2004
15 years 2 months ago
2004
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...