Abstract
An abstract machine is described for the CLP1992 programming language. It is intended as a first step toward enabling CLP(R) programs to be executed with efficiency approaching that of conventional languages. The core Constraint Logic Arithmetic Machine (CLAM) extends the Warren Abstract Machine (WAM) for compiling Prolog with facilities for handling real arithmetic constraints. The full CLAM includes facilities for taking advantage of information obtained from global program analysis. © 1992, ACM. All rights reserved.
Cite
CITATION STYLE
Jaffar, J., Michaylov, S., Stuckey, P. J., & Yap, R. H. C. (1992). An Abstract Machine for CLP(R). ACM SIGPLAN Notices, 27(7), 128–139. https://doi.org/10.1145/143103.143127
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
