7139 search results - page 1206 / 1428 » Language Engineering in Practice |
122
Voted
SAS
1999
Springer
15 years 9 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
134
click to vote
ISORC
1998
IEEE
15 years 9 months ago
1998
IEEE
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
141
click to vote
ESA
1998
Springer
15 years 9 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
163
click to vote
VLDB
1998
ACM
15 years 9 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
159
click to vote
TLCA
1993
Springer
15 years 9 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...