Search and imperative programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Search and imperative programming

Full text

Pdf (1.02 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 67 - 79

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Krzysztof R. Apt	CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Dept. of Mathematics Computer Science, Physics & Astronomy, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands
Andrea Schaerf	Dipartimento di Informatica e Sistemistica, Univrsità di Roma "La Sapienza", via Salaria 113, 00198 Roma, Italy

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 21, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263699.263709 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Krzysztof R. Apt, Arrays, bounded quantification and iteration in logic and constraint logic programming, Science of Computer Programming, v.26 n.1-3, p.133-148, May 1996 [doi>10.1016/0167-6423(95)00020-8]
	2	Jonas Barklund , Johan Bevemyr, Prolog with Arrays and Bounded Quantifications, Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning, p.28-39, July 13-20, 1993
	3	Bonsangue, M. M. & Kok, J. (1994), 'The weakest precondition calculus: recursion and duality', Formal Aspects of Computing 6(6A), 788-800.
	4	Bylander, T. (1991), Complexity results for planning, in 'Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91)', pp. 274-279.
	5	Coelho, H. & Cotta, J. C. (1988), Prolog by Example, Springer-Verlag, Berlin.
	6	Jacques Cohen, Non-Deterministic Algorithms, ACM Computing Surveys (CSUR), v.11 n.2, p.79-94, June 1979 [doi>10.1145/356770.356773]
	7	Alain Colmerauer, An introduction to Prolog III, Communications of the ACM, v.33 n.7, p.69-90, July 1990 [doi>10.1145/79204.79210]
	8	Eriksson, L.-H. & Rayner, M. (1984), Incorporating mutable arrays into logic programming, in S. A. Tarnlund, ed., 'Proc. Second Int'l Conf. on Logic Programming', Uppsala University, pp. 101-114.
	9	Fikes, R. E. & Nilsson, N. J. (1971), 'STRIPS: A new approach to the application of theorem proving to problem solving', Artificial Intelligence Journal 2, 189-208.
	10	Ralph E. Griswold , Madge T. Griswold, ICON Programmng Language, Prentice Hall Professional Technical Reference, 1983
	11	Hennessy, M. & Plotkin, G. (1979), Full abstraction for a simple programming language, in 'Proceedings of Mathematical Foundations of Computer Science', Lecture Notes in Computer Science 74, Springer- Verlag, New York, pp. 108-120.
	12	Klulniak, F. (1993), SPILL-2: the language, Technical report ZMI Reports No 93-03, Institute of Informatics, Warsaw University. A deliverable for year 1 of the BRA Esprit Project Compulog 2.
	13	McAloon, K. & Tretkoff, C. (1995), 2LP: Linear programming and logic programming, in P. V. Hentenryek & V. Saraswat, eds, 'Principles and Practice of Constraint Programming', MIT Press, pp. 101- 116.
	14	Puget, J.-F. (1994), A C++ implementation of CLP, in 'Proceedings of the Second Singapore International Conference on Intelligent Systems', Singapore.
	15	J. T. Schwartz , R. B. Dewar , E. Schonberg , E. Dubinsky, Programming with sets; an introduction to SETL, Springer-Verlag New York, Inc., New York, NY, 1986
	16	Yoav Shoham, Artificial intelligence techniques in Prolog, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1994
	17	Sterling, L. & Shapiro, E. (1986), The Art of Prolog, MIT Press.
	18	Andrei Voronkov, Logic Programming with Bounded Quantifiers, Proceedings of the First Russian Conference on Logic Programming, p.486-514, September 14-18, 1990
	19	Niklaus Wirth, Programming in MODULA-2 (3rd corrected ed.), Springer-Verlag New York, Inc., New York, NY, 1985
	20	Niklaus Wirth, Algorithms & data structures, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985

CITED BY 7

	Pascal Van Hentenryck , Laurent Perron , Jean-François Puget, Search and strategies in OPL, ACM Transactions on Computational Logic (TOCL), v.1 n.2, p.285-320, Oct. 2000
	Krzysztof R. Apt , Jacob Brunekreef , Vincent Partington , Andrea Schaerf, Alma-O: an imperative language that supports declarative programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.5, p.1014-1066, Sept. 1998
	Enrico Pontelli , Gopal Gupta, Backtracking in Independent And-Parallel Implementations of Logic Programming Languages, IEEE Transactions on Parallel and Distributed Systems, v.12 n.11, p.1169-1189, November 2001
	Samir Loudni , Patrice Boizumault , Philippe David, On-line resources allocation for ATM networks with rerouting, Computers and Operations Research, v.33 n.10, p.2891-2917, October 2006
	François Laburthe , Yves Caseau, SALSA: A Language for Search Algorithms, Constraints, v.7 n.3-4, p.255-288, July-October 2002
	Yves Caseau , François-Xavier Josset , François Laburthe, CLAIRE: combining sets, search and rules to better express algorithms, Theory and Practice of Logic Programming, v.2 n.6, p.769-805, November 2002
	Hélène Kirchner , Pierre-Etienne Moreau, Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories, Journal of Functional Programming, v.11 n.2, p.207-251, March 2001