| M. Leuschel. Homeomorphic embedding for online termination. Technical Report DSSE-TR-98-11, University of Southampton, Dept. of Electronics and Computer Science, 1998. |
....popular with online transformers. Existing transformers are only geared toward the direct transformation of programs. They often fail to perform well on an extra metasystem level, so that several refinements have been suggested, e.g. 29] For a discussion of the invariance problem see also [17]. Higher order terms provide a suitable data structure for representing programs in a higher order abstract syntax. Higher order logic programming utilizes higher order logic as the basis for computation, e.g. 20] The primary advantage of higher order abstract syntax is that it simplifies ....
M. Leuschel. Homeomorphic embedding for online termination. Technical Report DSSE-TR-98-11, University of Southampton, Dept. of Electronics and Computer Science, 1998.
....work, we propose to focus on the integration of recent developments in the study of termination analysis for logic programs into the semantic based approach proposed in this paper. In particular, new ideas on: inferring norms automatically [19] and on well quasi orders and homeomorphic embedding [30]. ....
M. Leuschel. Homeomorphic embedding for online termination. In Static Analysis, 5th International Symposium, SAS '98, 1998. to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC