Abstract
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an explicit object of interest. In recent works, abstract strategies have been defined in extension but also intensionally. In this paper we complete these views with a new declarative approach based on constraints, which are used to model the different parts of a strategy. This procedure allows us to express elaborate strategies in a declarative and reusable way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andreoli, J.-M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation 2(3), 297–347 (1992)
Baader, F., Nipkow, T.: Term Rewriting and all That. Cambridge University Press, Cambridge (1998)
Balland, E., Brauner, P., Kopetz, R., Moreau, P.-E., Reilles, A.: Tom: Piggybacking Rewriting on Java. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 36–47. Springer, Heidelberg (2007)
Borovanský, P., Kirchner, C., Kirchner, H., Ringeissen, C.: Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science 12(1), 69–98 (2001)
Bourdier, T., Cirstea, H., Dougherty, D.J., Hélène, K.: Extensional and Intensional Strategies. In: Proceedings of the 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Brasilia, June 28. Electronic Proceedings in Theoretical Computer Science (2010)
Coen, C.S., Tassi, E., Zacchiroli, S.: Tinycals: Step by Step Tacticals. Electronic Notes in Theoretical Computer Science 174(2), 125–142 (2007)
Delahaye, D.: A Tactic Language for the System Coq. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 85–95. Springer, Heidelberg (2000)
Dowek, G., Hardin, T., Kirchner, C.: Theorem Proving Modulo. Journal of Automated Reasoning 31(1), 33–72 (2003)
Jaffar, J., Lassez, J.-L.: Constraint Logic Programming. In: Proceedings of the 14th Annual ACM Symposium on Principles Of Programming Languages, Munich, Germany, pp. 111–119 (1987)
Jojgov, G.: Holes with Binding Power. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 162–181. Springer, Heidelberg (2003)
Jouannaud, J.-P., Kirchner, C., Kirchner, H.: Incremental Construction of Unification Algorithms in Equational Theories. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 361–373. Springer, Heidelberg (1983)
Kirchner, C., Kirchner, F., Kirchner, H.: Strategic Computations and Deductions. In: Benzmüller, C., Brown, C.E., Siekmann, J., Statman, R. (eds.) Reasoning in Simple Type Theory. Festschrift in Honour of Peter B. Andrews on His 70th Birthday. Studies in Logic and the Foundations of Mathematics, vol. 17, pp. 339–364. College Publications (2008)
Kirchner, C., Kirchner, H.: Rewriting, Solving, Proving. A preliminary version of a book (1999), http://www.loria.fr/ckirchne/=rsp/rsp.pdf
Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue d’Intelligence Artificielle 4(3), 9–52 (1990); Special issue on Automatic Deduction
Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-Pattern Matching. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 110–124. Springer, Heidelberg (2007)
Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-Pattern Matching Modulo. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 275–286. Springer, Heidelberg (2008)
Kirchner, F., Muñoz, C.: The Proof Monad. Submitted to the Journal of Logic and Algebraic Programming (2008)
Lévy, J.-J.: Réductions correctes et optimales dans le lambda-calcul. PhD thesis, Université de Paris VII (1978)
Liang, C., Miller, D.: A Unified Sequent Calculus for Focused Proofs. In: LICS: 24th Symp. on Logic in Computer Science, pp. 355–364 (2009)
Martí-Oliet, N., Meseguer, J., Verdejo, A.: Towards a Strategy Language for Maude. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27–April 4, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 417–441. Elsevier, Amsterdam (2005)
Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Terese. Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
Visser, E.: Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description of Stratego 0.5. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 357–361. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirchner, C., Kirchner, F., Kirchner, H. (2010). Constraint Based Strategies. In: Escobar, S. (eds) Functional and Constraint Logic Programming. WFLP 2009. Lecture Notes in Computer Science, vol 5979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11999-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-11999-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11998-9
Online ISBN: 978-3-642-11999-6
eBook Packages: Computer ScienceComputer Science (R0)