Guarded expressions in practice

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Guarded expressions in practice

Full text

Pdf (1.04 MB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1997 international symposium on Symbolic and algebraic computation table of contents

Kihei, Maui, Hawaii, United States

Pages: 376 - 383

Year of Publication: 1997

ISBN:0-89791-875-4

Authors

Andreas Dolzmann	Fakultät für Mathematik und Informatik, University of Passau, Germany
Thomas Sturm	Fakultät für Mathematik und Informatik, University of Passau, Germany

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 12, Citation Count: 3

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/258726.258851 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	Russell J. Bradford, Algebraic Simplification of Multiple-Valued Functions, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.13-21, April 13-15, 1992
	2	P. A. Broadbery , T. Gómez-Díaz , S. M. Watt, On the implementation of dynamic evaluation, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.77-84, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220356]
	3	George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
	4	Robert M. Corless , David J. Jeffrey, Well … it isn't quite that simple, ACM SIGSAM Bulletin, v.26 n.3, p.2-6, Aug. 1992 [doi>10.1145/141897.141901]
	5	DAVENPORT, J. H., AND FAURE, C. The "unknown" in computer algebra. Programmirovanie 1, 1 (1994).
	6	Andreas Dolzmann , Thomas Sturm, Simplification of quantifier-free formulae over ordered fields, Journal of Symbolic Computation, v.24 n.2, p.209-231, August 1997 [doi>10.1006/jsco.1997.0123]
	7	DOLZMANN, A., AND STURM, T. Redlog--computer algebra meets computer logic. Technical Report MIP- 9603, FMI, Universit~it Passau, D-94030 Passau, Germany, Feb. 1996.
	8	DOLZMANN, A., AND STURM, T. Redlog user manual. Technical Report MIP-9616, FMI, Universitiit Passau, D-94030 Passau, Germany, Oct. 1996. Edition 1.0 for Version 1.0.
	9	D. Duval , L. González-Vega, Dynamic evaluation and real closure, Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments, p.551-560, January 1996, Lille, France
	10	DUVAL, D., AND REYNAUD, J.-C. Sketches and computation I: Basic definitions and static evaluation. Mathematical Structures in Computer Science 4, 2 (1994), 185-238.
	11	DUVAL, D., AND REYNAUD, J.-C. Sketches and computation II: Dynamic evaluation and applications. Mathematical Structures in Computer Science 4, 2 (1994), 239-271.
	12	G6MEZ-DIAZ, T. Examples of using dynamic constructible closure. In Proceedings of the IMACS Symposium on Symbolic Computation (1993).
	13	HEArtN, A. C., AND FITCr~, J. P. Reduce User's Manual for Version 3.6. RAND, Santa Monica, CA 90407- 2138, July 1995. RAND Publication CP78.
	14	HONG, H., COLLINS, G. E., JOHNSON, j. R., AND EN- CARNACION, M. J. QEPCAD interactive version 12. Kindly communicated to us by Hoon Hong, Sept. 1993.
	15	Loos, R., ANt) WEISPFENblING, V. Applying linear quantifier elimination. The Computer Journal 36, 5 (1993), 450-462. Special issue on computational quantifier elimination.
	16	MELENK, H. Reduce symbolic mode primer. In RE- DUCE 3.6 User's Guide for UNIX. Konrad-Zuse-Zentrum fiir Informationstechnik, Berlin, 1995.
	17	TARSUS, A. A decision method for elementary algebra and geometry. Tech. rep., University of California, 1948. Second edn., rev. 1951.
	18	Volker Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, v.5 n.1-2, p.3-27, February/April 1988 [doi>10.1016/S0747-7171(88)80003-8]
	19	Volker Weispfenning, Comprehensive Gro¨bner bases, Journal of Symbolic Computation, v.14 n.1, p.1-29, July 1992 [doi>10.1016/0747-7171(92)90023-W]
	20	Volker Weispfenning, Quantifier elimination for real algebra—the cubic case, Proceedings of the international symposium on Symbolic and algebraic computation, p.258-263, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190425]
	21	WEISPFENNING, V. Quantifier elimination for real algebra ..... the quadratic case and beyond. Applicable Algebra in Engineering Communication and Computing 8, 2 (Feb. 1997), 85-101.

CITED BY 3

	Andreas Dolzmann , Thomas Sturm, P-adic constraint solving, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.151-158, July 28-31, 1999, Vancouver, British Columbia, Canada
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Andreas Dolzmann , Thomas Sturm , Volker Weispfenning, A New Approach for Automatic Theorem Proving in Real Geometry, Journal of Automated Reasoning, v.21 n.3, p.357-380, December 1998