142 search results - page 26 / 29 » Total Termination of Term Rewriting |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
PODS
2010
ACM
14 years 17 days ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
LDTA
2010
13 years 7 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
GLOBECOM
2008
IEEE
2008
IEEE
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
13 years 7 months ago
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...