N.C. Heintze, S. Michaylov, P.J. Stuckey and R.H.C. Yap, "On Meta-Programming in CLP(R)", Proceedings 1 st NACLP, MIT Press, October 1989, 52--68. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Conservative Approach to Meta-Programming in Constraint.. - Pierre Lim And (1993) (2 citations) (Correct)
....the symbols 1, 2 and should be treated simply as uninterpreted symbols, so that the equation 1 2 = X Y has the solution f X = 1, Y = 2 g. It is not equivalent to 3 = X Y which is unsatisfiable. The reconciliation of this overloading of functors is addressed by Heintze et al. [3] in which they give a theoretical framework for the problem and discuss a solution for the CLP(R) language. The problem with their method is that it is not conservative i.e. it does not preserve the current LP meta programming functionality, but rather it defines new functionality to replace that ....
....an implementation in the ECL i PS e1 system. Our presentation is organized in the following way. First, we define the class of structures we are dealing with, i.e. those containing uninterpreted functors. The extensions to unification required by CLP are then discussed. Next, the approach of [3] is briefly reviewed. We use their theoretical basis in further discussions of the meta programming problem and the solution. The CHIP approach is then discussed and be build on this approach to develop our solution. Our solution and its implementation in ECL i PS e is then given. In sections ....
[Article contains additional citation context not shown here]
Nevin Heintze, Spiro Michaylov, Peter Stuckey and Roland Yap, "On MetaProgramming in CLP(R)", Proceedings of the 1989 North American Conference on Logic Programming, Cleveland, Ohio, USA, October 16--20, 1989.
CLP(R) Programmer's Manual Version 1.1 - Nevin Heintze Joxan (1992) (2 citations) Self-citation (Heintze Michaylov Stuckey Yap) (Correct)
....over real arithmetic terms. A working knowledge of PROLOG programming is assumed in this document; the book by Sterling and Shapiro [13] can serve as a suitable introductory text. Further technical information on CLP(R) is available on language design and implementation [6, 7] meta programming [3] and delay mechanisms [8] Additionally, much has been written about applications in electrical engineering [2] differential equations [1] options trading [10] music theory [15] molecular biology [16] etc. This document is both an introductory tutorial and reference manual describing the ....
....answer constraints are eval(X) 2.5, eval(Y) 1.5 although the values CHAPTER 3. PROGRAMMING IN CLP(R) 16 of X and Y cannot be determined uniquely. For example, X might be 2.5, or 1 b 1.5, etc. It should be noted that the eval mechanism described here is an approximation to that proposed in [3]. 3.4.2 rule 2, retract 1 and assert 1 Next we consider how these basic facilities may be used for reasoning about programs (see also Section 4.5 which describes how to use the dynamic code facilities) The canonical application for such reasoning is the meta circular interpreter, discussed in ....
[Article contains additional citation context not shown here]
N.C. Heintze, S. Michaylov, P.J. Stuckey and R.H.C. Yap, "On Meta-Programming in CLP(R)", Proceedings 1 st NACLP, MIT Press, October 1989, 52--68.
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