B. Buchberger, C. Dupre, T. Jebelean, B. Konev, F. Kriftner, T. Kutsia, K. Nakagawa, F. Piroi, D. Vasaru, and W. Windsteiger. The Theorema System: Proving, Solving, and Computing for the Working Mathematician. Technical Report 00-38, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Higher-order Lazy Narrowing Calculus: a Solver for.. - Ida, Marin, Suzuki (2001) (Correct)
....the operating principle of HOLN, its main properties, i.e. soundness and completeness, and its further refinements. The solving capability of HOLN is illustrated with an example of program calculation. 1 Introduction Proving, solving and computing are the essence of mathematicians activities [2]. Correspondingly, modern programmers role can be thought of as automating proving, solving and computing by defining specifications called programs. Traditionally, computing is the main concern of many programmers, and relatively smaller emphasis has been placed on the other two aspects of our ....
B. Buchberger. Proving, Solving, Computing. A Language Environment Based on Mathematica. Technical Report 97-20, Research Institute for Symbolic Computation (RISC-Linz), Johannes Kepler University, Linz, June 1997.
CLP(Flex): Constraint Logic Programming Applied to XML.. - Coelho, Florido (2004) (Correct)
No context found.
B. Buchberger, C. Dupre, T. Jebelean, B. Konev, F. Kriftner, T. Kutsia, K. Nakagawa, F. Piroi, D. Vasaru, and W. Windsteiger. The Theorema System: Proving, Solving, and Computing for the Working Mathematician. Technical Report 00-38, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC