£9.38
Add to Cart
Maude Programming language- UNIX Linux- rewriting logic
Only 1 available
Details
Shipping: United Kingdom: £3.00 (more destinations)
Condition: Brand new
*The store has not been updated recently. You may want to contact the merchant to confirm the availability of the product.
cs2045 - The Maude Programming Language - Linux/UNIX and more or less MacOS-X and Windows
June, 2005 Edition Copyright Arnold Kochman. Other copyrights also apply, in particular the General Public License. Maude is a product of research at the SRI International Computer Science Laboratory and The Department of Computer Science, University of Illinois at Urbana-Champaign.
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications. Maude has been influenced in important ways by the OBJ3 language, which can be regarded as an equational logic sublanguage. Besides supporting equational specification and programming, Maude also supports rewriting logic computation. Equational reasoning is an important component in symbolic algebra, automated deduction, high-level programming languages, program verification, and artificial intelligence. Reasoning with equations involves deriving consequences of given equations and finding values for variables that satisfy a given equation. Rewriting is a very powerful method for dealing with equations. Directed equations, called rewrite rules, are used to replace equals by equals, but only in the indicated direction. The theory of rewriting centers around the concept of normal form, an expression that cannot be rewritten any further. Computation consists of rewriting to a normal form; when the normal form is unique, it is taken as the value of the initial expression. When rewriting equal terms always leads to the same normal form, the set of rules is said to be convergent and rewriting can be used to check for equality. Maude supports logical reflection in a systematic and efficient way.
This makes Maude remarkably extensible and powerful; it supports an extensible algebra of module composition operations, and allows many advanced metaprogramming and metalanguage applications. Maude can thus be used to create executable environments for different logics, theorem provers, languages, and computational models.
This CD contains the source for Maude and dependencies, as well as binary distributions for a number of UNIX/Linux family systems, and additional documentation. Maude can also be run on MacOS-X and on Windows, but users of these systems should expect to expend some extra effort to install. The software is distributed in the form of compressed archives, and the user must expand these archives and follow other instructions to achieve the installation. The products on this CD are believed to be useful, but naturally, I cannot assure that they are suitable for any particular purpose.Shipping is $3.00 Worldwide
June, 2005 Edition Copyright Arnold Kochman. Other copyrights also apply, in particular the General Public License. Maude is a product of research at the SRI International Computer Science Laboratory and The Department of Computer Science, University of Illinois at Urbana-Champaign.
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications. Maude has been influenced in important ways by the OBJ3 language, which can be regarded as an equational logic sublanguage. Besides supporting equational specification and programming, Maude also supports rewriting logic computation. Equational reasoning is an important component in symbolic algebra, automated deduction, high-level programming languages, program verification, and artificial intelligence. Reasoning with equations involves deriving consequences of given equations and finding values for variables that satisfy a given equation. Rewriting is a very powerful method for dealing with equations. Directed equations, called rewrite rules, are used to replace equals by equals, but only in the indicated direction. The theory of rewriting centers around the concept of normal form, an expression that cannot be rewritten any further. Computation consists of rewriting to a normal form; when the normal form is unique, it is taken as the value of the initial expression. When rewriting equal terms always leads to the same normal form, the set of rules is said to be convergent and rewriting can be used to check for equality. Maude supports logical reflection in a systematic and efficient way.
This makes Maude remarkably extensible and powerful; it supports an extensible algebra of module composition operations, and allows many advanced metaprogramming and metalanguage applications. Maude can thus be used to create executable environments for different logics, theorem provers, languages, and computational models.
This CD contains the source for Maude and dependencies, as well as binary distributions for a number of UNIX/Linux family systems, and additional documentation. Maude can also be run on MacOS-X and on Windows, but users of these systems should expect to expend some extra effort to install. The software is distributed in the form of compressed archives, and the user must expand these archives and follow other instructions to achieve the installation. The products on this CD are believed to be useful, but naturally, I cannot assure that they are suitable for any particular purpose.Shipping is $3.00 Worldwide
IL, Judea
