1000 search results - page 180 / 200 » Nominal rewriting systems |
CADE
2004
Springer
14 years 2 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
FMCO
2004
Springer
14 years 2 months ago
2004
Springer
This paper considers an integration of asynchronous communication, virtual binding, and multiple inheritance. Object orientation is the leading paradigm for concurrent and distribu...
LPAR
2004
Springer
14 years 2 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
OOPSLA
2004
Springer
14 years 2 months ago
2004
Springer
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...
SCOPES
2004
Springer
14 years 2 months ago
2004
Springer
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...