Abstract
The underlying ideas, design principles and capabilities of a system called Disc Atinf (Defining and Implementing Strategies and Calculi), allowing to implement a large class of computational systems (proof procedures, constraints solving algorithms...) are presented. Systems are described by sets of rules along with a strategy to guide the application of these rules. This formalism has been chosen because it fits well to the standard mathematical practice.
Disc Atinf is user-oriented and very flexible. It allows to specify the source objects and the transformation process in a very easy way. Moreover it is very general.
We describe the main features of Disc Atinf and gives examples of applications — showing evidence of the usefulness of our system. Finally, we briefly compare our system with similar ones.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. D. BRUIJN. Essays on Combinatory Logic, Lambda Calculus and Formalism, chapter A Survey of the project AUTOMATH. Academic Press, 1980.
R. CAFERRA and M. HERMENT. GLEFATINF: A graphic framework for combining provers and editing proofs. In Design and Implementation of Symbolic Computation Systems, pages 229–240. Springer-Verlag, 1993.
R. CAFERRA and M. HERMENT. A generic graphic framework for combining inference tools and editing proofs and formulae. Journal of Symbolic Computation, 19(2):217–243, 1995.
R. CAFERRA and N. ZABEL. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13:613–641, 1992.
H. COMON. Unification et Disunification. Théorie et Applications. PhD thesis, INPG, Grenoble, 1988.
H. COMON and P. LESCANNE. Equational problems and disunification. Journal of Symbolic Computation, 7:371–475, 1989.
T. COQUAND, C. PAULIN-MOHRING, G. DOWEK, and G. HUET. The calculus of constructions. documentation and user's guide 110. INRIA-ENS, Rocquencourt, 1989., 1989.
M. HABERSTRAU. ECOLOG: An Environment for COnstraints LOGics. In E. Domenjoud and C. Kirchner, editors, CCL'92, Le Val d'Ajol, 1992.
J. JOUANNAUD and C. KIRCHNER. Solving equations in abstracts algebra: a rule based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Essays in Honor of Alan Robinson, pages 91–99. The MIT-Press, 1991.
C. KIRCHNER, H. KIRCHNER, and M. VITTEK. Designing constraint logic programming using computational systems. In F. Orejas, editor, 2nd CCL Workshop, September 1993.
F. PFENNING. Logical frameworks, chapter Logic programming in the LF logical framework. Cambridge University Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourely, C., Peltier, N. (1996). DiscAtinf: A general framework for implementing calculi and strategies. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-61697-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61697-9
Online ISBN: 978-3-540-70635-9
eBook Packages: Springer Book Archive