Article

Free access

An abstract machine for CLP(R)

Authors:

Joxan Jaffar,

Peter J. Stuckey,

Spiro Michaylov,

Roland H. C. YapAuthors Info & Claims

PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation

Pages 128 - 139

https://doi.org/10.1145/143095.143127

Published: 01 July 1992 Publication History

PDF eReader

Abstract

An abstract machine is described for the CLP(ℜ) programming language. It is intended as a first step toward enabling CLP(ℜ) 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.

References

[1]

S. K. Debray, "Static Inference of Modes and Data Dependencies in Logic Programs", A CM Transactions on Programming Languages and Systems 11 (3), 1989, pp 418-450.

Digital Library

Google Scholar

[2]

S.K. Debray and D.S. Warren, "Functional Computations in Logic Programs", A CM Transactions on Programming Languages and Systems 11 (3), 1989, pp 451-481.

Digital Library

Google Scholar

[3]

J. Jaffar and j-L. Lassez, "Constraint Logic Programming'', Proceedings 14th A CM Symposium on Principles of Programming Languages, January 1987, pp 111-119.

Digital Library

Google Scholar

[4]

D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin, and N. Adams, "ORBIT: an optimizing compiler for Scheme", $IGPLAN'86 Symposium on Compiler Construction, June 1986, pp 219- 233.

Digital Library

Google Scholar

[5]

J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap", "The CLP(R.) Language and System", A CM Transactions on Programming Languages and Systems, to appear, July 1992.

Digital Library

Google Scholar

[6]

J. Jaffar, S. Michaylov and R.H.C. Yap, "A Methodology for Managing Hard Constraints in CLP Systems", Proceedings A CM-$IGPLAN Conference on Programming Language Design and Implementation, June 1991, pp 306-316.

Digital Library

Google Scholar

[7]

N. Jorgensen, K. Marriott and S. Michaylov, "Some Global Compile-time Optimizations for CLP(T~)", Proceedings 1991 International Logic Programming Symposium", October 1991, pp 420-434.

Google Scholar

[8]

A. Taylor, "LIPS on a MIPS: Results from a Prolog Compiler for a RISC", Proceedings 7th International Conference on Logic Programming, June 1990, pp 174-185 {Also Ph.D. thesis, CS, Univ. of Sydney, 1991}.

Digital Library

Google Scholar

[9]

P. van Roy and A.M. Despain, "The Benefits of Global Datafiow Analysis for an Optimizing Prolog Compiler", Proceedings 1990 North American Conference on Logic Programming, October 1990, pp 501-515 {Also Ph.D. thesis by Van Roy, CS/EE, UC Berkeley, 1990}.

Digital Library

Google Scholar

[10]

D.H.D. Warren, "An Abstract PROLOG Instruction Set", Technical note 309, AI Center, SRI International, Menlo Park, October 1983.

Google Scholar

Cited By

View all

Kelly AMacdonald AMarriott KSøndergaard HStuckey PYap R(2005)An optimizing compiler for CLP(ℛ)Principles and Practice of Constraint Programming — CP '9510.1007/3-540-60299-2_14(222-239)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60299-2_14
JØrgensen N(2005)Chaotic fixpoint iteration guided by dynamic dependencyStatic Analysis10.1007/3-540-57264-3_27(27-44)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57264-3_27
Diehl SSestoft P(2000)Abstract machines for programming language implementationFuture Generation Computer Systems10.1016/S0167-739X(99)00088-616:7(739-751)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1016/S0167-739X%2899%2900088-6
Show More Cited By

Index Terms

An abstract machine for CLP(R)
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
        Data types and structures
      2. Language types
        Constraint and logic languages

Recommendations

The CLP( ℛ ) language and system

The CLP( ℛ ) programming language is defined, its underlying philosophy and programming methodology are discussed, important implementation issues are explored in detail, and finally, a prototype interpreter is described.

CLP( ℛ ) is designed to be an ...
An abstract machine for CLP(R)

An abstract machine is described for the CLP(ℜ) programming language. It is intended as a first step toward enabling CLP(ℜ) programs to be executed with efficiency approaching that of conventional languages. The core Constraint Logic Arithmetic Machine (...
Optimizing compilation of CLP( ℛ )

Constraint Logic Programming (CLP) languages extend logic programming by allowing the use of constraints from different domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive ...

Comments

Information & Contributors

Information

Published In

PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation

July 1992

352 pages

ISBN:0897914759

DOI:10.1145/143095

Chairman:
Stuart I. Feldman
Bell Communications Research, Morristown, NJ
,
Editor:
Richard L. Wexelblat

ACM SIGPLAN Notices Volume 27, Issue 7
July 1992
352 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/143103
Editor:
Richard Wexelblat
IDA/CDED, Alexandria, VA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI92

Sponsor:

SIGPLAN

PLDI92: SIGPLAN 92 Conference on Programming Language Design and Implmentation

June 15 - 19, 1992

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
456
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)18

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kelly AMacdonald AMarriott KSøndergaard HStuckey PYap R(2005)An optimizing compiler for CLP(ℛ)Principles and Practice of Constraint Programming — CP '9510.1007/3-540-60299-2_14(222-239)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60299-2_14
JØrgensen N(2005)Chaotic fixpoint iteration guided by dynamic dependencyStatic Analysis10.1007/3-540-57264-3_27(27-44)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57264-3_27
Diehl SSestoft P(2000)Abstract machines for programming language implementationFuture Generation Computer Systems10.1016/S0167-739X(99)00088-616:7(739-751)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1016/S0167-739X%2899%2900088-6
Diehl S(2000)A generative methodology for the design of abstract machinesScience of Computer Programming10.1016/S0167-6423(99)00047-738:1-3(125-142)Online publication date: 1-Aug-2000
https://dl.acm.org/doi/10.1016/S0167-6423%2899%2900047-7
Fordan AYap R(1999)Early Projection in CLP(R)Principles and Practice of Constraint Programming — CP9810.1007/3-540-49481-2_14(177-191)Online publication date: 11-Jun-1999
https://doi.org/10.1007/3-540-49481-2_14
Kelly AMarriott KMacDonald AStuckey PYap R(1998)Optimizing compilation of CLP( ℛ )ACM Transactions on Programming Languages and Systems10.1145/295656.29566120:6(1223-1250)Online publication date: 1-Nov-1998
https://dl.acm.org/doi/10.1145/295656.295661
Hentenryck PSaraswat V(1997)Constraint ProgrammingConstraints10.1023/A:10097408049512:1(7-33)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1023/A%3A1009740804951
Burg JLang SHughes C(1996)Intelligent backtracking in CLP(ℜ)Annals of Mathematics and Artificial Intelligence10.1007/BF0212796817:2(189-211)Online publication date: Sep-1996
https://doi.org/10.1007/BF02127968
Van Hentenryck PRamachandran V(1994)Backtracking without trailing in CLP (R)ACM SIGPLAN Notices10.1145/773473.17848829:6(349-360)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1145/773473.178488
Lopez GFreeman-Benson BBorning A(1994)Implementing constraint imperative programming languagesACM SIGPLAN Notices10.1145/191081.19111829:10(259-271)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/191081.191118
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

The CLP( ℛ ) language and system

An abstract machine for CLP(R)

Optimizing compilation of CLP( ℛ )