Design and Implementation of Symbolic Computation Systems
Current problems in computer algebra systems design.- The design of cayley - a language for modern algebra.- CoCoA: A user-friendly system for commutative algebra.- The design of SISYPHE : a system for doing symbolic and algebraic computations.- Scratchpad's view of algebra I: Basic commutative algebra.- Design issues for a computed-aided environment for constructive mathematics.- Efficient type inference and coercion in computer algebra.- Abstract specification of mathematical structures and methods.- Programming paradigms for symbolic computation systems analysis of an example.- The computation of Gröbner bases on a shared memory multiprocessor.- A theory for program and data type specification.- Context induction: A proof principle for behavioural abstractions.- Completion modulo associativity, commutativity and identity (AC1).- Polymorphic type checking with subtypes in Prolog.- On the power of subsumption and context checks.- Putting algebraic components together: A dependent type approach.- The use of proof plans in formal methods.- A prolog technology theorem prover: A new exposition and implementation in Prolog.- Parametric queries, linear constraints and variable elimination.- AC-unification race: The system solving approach and its implementation.- Heuristical criteria in refutational theorem proving.- Requirements for standards in knowledge base systems.- Reconciling symbolic and numeric computation in a practical setting.- The design and specification of the ASSPEGIQUE database.- A functional and logic language with polymorphic types.- Graphical object oriented executable specification for an automation oriented paradigm of software development.- Building graphic user interfaces for computer algebra systems.- A system independent graphing package formathematical functions.- A model of interaction for graphical systems.- Praxis: A rule-based expert system for MACSYMA.- Will DELiA grow into an expert system?.- The GANITH algebraic geometry toolkit.- Mas Modula-2 algebra system.- Prototypes for the automatic translation of computer algebra languages.- The implementation of A PC-based list processor for symbolic computation.- Implementation of the symbol analytic transformations language FLAC.- Design and development of ENprover, an automated theorem proving system based on EN-strategy.- Towards a logic language: An object-oriented implementation of the connection method.- Suggestions for a friendlier user interface.
| Erscheint lt. Verlag | 26.3.1990 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 286 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 546 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | automated reasoning • Automation • Automatisches Programmieren • Automatisches Schließen • Computeralgebra • Expert System • Formal Method • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Künstliche Intelligenz • Logic • object • programming • proving • Scratch • Softwareumgebungen • Symbolisches Rechnen • System |
| ISBN-13 | 9783540525318 / 9783540525318 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
