128 search results - page 5 / 26 » Ensuring Termination by Typability |
LISP
2008
13 years 7 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
LOGCOM
2007
13 years 7 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
ICLP
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
The standardization of the IMS as a multi-access network implies that it can be accessed by different classes of terminals. Even at the heart of the same class of terminals (mobile...
PEPM
2004
ACM
14 years 24 days ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...