Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Implementing a meta-logical scheme
| |
|
Constraint Logic Programming
Implementing a meta-logical scheme Pierre Lim1  and David Morley2
| (1) |
Department of Computer Science, Monash University, 3168 Clayton, Australia |
| (2) |
Australian Artificial Intelligence Institute, 1 Grattan Street, 3053 Carlton, Australia |
Abstract
When working with programming languages, it is often necessary to have meta-programs, such as compilers or interpreters, which can manipulate programs in those languages. The semantics of meta-programs for Constraint Logic Programming (CLP) languages have been problematic, but Lim and Stuckey have presented an approach which allows such meta-programs to be themselves treated as constraint logic programs; for each CLP language CLP( X), there is a meta-language, CLP(meta( X)).
This paper describes how to implement these CLP(meta(X)) languages by translation into PROLOG-like languages. To illustrate how such implementations work, a meta-interpreter is used as an example meta-program.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|