Abstract
Contexts are sets of formulas used to manage the assumptions that arise in the course of a mathematical deduction or calculation. This paper describes some techniques for symbolic computation that are dependent on using contexts, and are implemented in IMPS, an Interactive Mathematical Proof System.
Supported by the MITRE-Sponsored Research program.
Preview
Unable to display preview. Download preview PDF.
References
R. S. Boyer and J. Strother Moore. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. Technical Report ICSCA-CMP-44, Institute for Computing Science, University of Texas at Austin, January 1985.
D. Craigen, S. Kromodimoeljo, I. Meisels, B. Pase, and M. Saaltink. Eves system description. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 771–775. Springer-Verlag, 1992.
W. M. Farmer. A simple type theory with partial functions and subtypes. Annals of Pure and Applied Logic. Forthcoming.
W. M. Farmer. A partial functions version of Church's simple theory of types. Journal of Symbolic Logic, 55:1269–91, 1990.
W. M. Farmer, J. D. Guttman, and F. J. Thayer. IMPS: an Interactive Mathematical Proof System. Journal of Automated Reasoning. Forthcoming.
W. M. Farmer, J. D. Guttman, and F. J. Thayer. IMPS: System description. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 701–705. Springer-Verlag, 1992.
W. M. Farmer, J. D. Guttman, and F. J. Thayer. Little theories. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 567–581. Springer-Verlag, 1992.
J. D. Guttman. A proposed interface logic for verification environments. Technical Report M91-19, The MITRE Corporation, 1991.
M. Kohlhase. Unification in order-sorted type theory. In A. Voronkov, editor, Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Computer Science, pages 421–432. Springer-Verlag, July 1992.
L. G. Monk. Inference rules using local contexts. Journal of Automated Reasoning, 4:445–462, 1988.
S. Owre, J. M. Rushby, and N. Shankar. pvs: A prototype verification system. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 748–752. Springer-Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farmer, W.M., Guttman, J.D., Thayer, F.J. (1993). Reasoning with contexts. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013179
Download citation
DOI: https://doi.org/10.1007/BFb0013179
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57235-0
Online ISBN: 978-3-540-47985-7
eBook Packages: Springer Book Archive