An efficient incremental algorithm for solving systems of linear Diophantine equations
Information and Computation
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
The rewriting logic semantics project
Theoretical Computer Science
Higher-Order and Symbolic Computation
Science of Computer Programming
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
An algebraic semantics for MOF
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
The third rewrite engines competition
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
An introduction to maude and some of its applications
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Order-sorted Equational Unification Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Embedding domain-specific modelling languages in Maude specifications
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This paper introduces novel features of Maude 2.4 including support for unification and narrowing. Unification is supported in Core Maude, the core rewriting engine of Maude, with commands and metalevel functions for order-sorted unification modulo some frequently occurring equational axioms. Narrowing is currently supported in its Full Maude extension. We also give a brief summary of the most important features of Maude 2.4 that were not part of Maude 2.0 and earlier releases. These features include communication with external objects, a new implementation of its module algebra, and new predefined libraries. We also review some new Maude applications.