The Maude Tutorial is available as a postscript file.

The following are the examples, in ascii format, in the tutorial.

• Core Maude examples:
• a-graph.maude                                     (A concrete graph, Section 6.2)
• a-transition-system.maude              (A concrete transition system, Section 8.2)
• assoc-idemp.maude                            (Idempotent semigroups, correct version, Section 5.7)
• basic-nat.maude                                   (Basic natural numbers, Section 2.4)
• blocks-world.maude                            (Blocks world with robot arm, Section 8.4)
• boolean.maude                                       (Boolean values, Section 2.3)
• int.maude                                                 (Integer numbers, Section 3.3)
• library-petri-net.maude                     (Petri net model of a library, wrong version, Section 8.3)
• library-petri-net2.maude                   (Petri net model of a library, correct version, Section 8.3)
• naive-assoc-idemp.maude               (Idempotent semigroups, wrong version, Section 5.7)
• nat-bin-tree.maude                            (Binary trees with natural numbers, Section 4.4)
• nat-div.maude                                        (Natural numbers division, Section 4.1)
• nat-list-assoc.maude                         (Lists of natural numbers with concatenation, Section 5.3)
• nat-list-assoc-id.maude                   (Lists of natural numbers with concatenation, Section 5.4)
• nat-list.maude                                       (Lists of natural numbers with cons, Section 4.3)
• nat-mset.maude                                   (Multisets of natural numbers, Section 5.5)
• nat-ops-1.maude                                (Operations on natural numbers with importation, Section 2.5)
• nat-ops.maude                                      (Operations on natural numbers with importation, Section 3.1)
• nat-ord-list.maude                              (Ordered lists of natural numbers, Section 6.3)
• nat-search-tree.maude                     (Binary search trees with natural numbers, Section 6.4)
• nat-set.maude                                       (Sets of natural numbers, Section 5.6)
• nat.maude                                               (Natural numbers, Section 4.2)
• nat3.maude                                             (Basic natural numbers modulo 3, Section 3.1)
• numbers.maude                                     (Example of numbers with overloaded addition, Section 5.2)
• path.maude                                             (Paths over a given graph, Section 6.2)
• prop-log.maude                                    (Propositional logic syntax, Section 8.5)
• sequent-rules-prop-log.maude      (Sequent rules for propositional logic, Section 8.5)
• strategy.maude                                      (Strategy examples, Section 11)
• xmatch-test.maude                              (Test of matching with extension, Section 5.8)
• ya-blocks-world.maude                    (Another blocks world, without robot arm, Section 11)
• Full Maude examples:
• 8-puzzle.fm                                            (8 puzzle, Section 9.3)
• a-graph.fm                                              (A concrete graph, Sections 6.2 and 7.6)
• account.fm                                               (Bank accounts, Section 9.2)
• another-nat-div.fm                              (Natural numbers division, Section 4.1)
• another-nat-search-tree.fm            (Binary search trees with pairs of natural numbers and ids, Section 7.4)
• another-nat-set.fm                              (Sets of natural numbers, Section 7.2)
• another-nat.fm                                       (Natural numbers, Section 4.2)
• basic-nat.fm                                           (Basic natural numbers, Section 2.4)
• bin-tree.fm                                              (Parameterized binary trees, Section 7.4)
• checking-account.fm                           (Checking accounts, Section 9.2)
• configuration.fm                                     (Configuration of objects and messages, Section 9.1)
• default.fm                                                 (Parameterized default module, Section 7.4)
• graph.fm                                                   (Graph theory for paths, Section 7.6)
• lambda-calculus.fm                             (Untyped lambda calculus, Section 8.6)
• list.fm                                                        (Parameterized lists, Section 7.3)
• nat-div.fm                                               (Natural numbers division, Section 4.1)
• nat-list.fm                                               (Lists of natural numbers, Section ?)
• nat-ord-list.fm                                      (Ordered lists of natural numbers, Section 7.3)
• nat-tree.fm                                             (General trees of natural numbers, Section 7.5)
• nat.fm                                                       (Natural numbers, Section 4.2)
• oo-blocks-world.fm                           (Object-oriented blocks world, Section 9.5)
• ord-list.fm                                              (Parameterized ordered lists, Section 7.3)
• pair.fm                                                      (Theory of pairs for search trees, Section 7.4)
• path.fm                                                     (Parameterized paths over a graph, Section 7.6)
• search-tree.fm                                      (Parameterized binary search trees, Section 7.4)
• set.fm                                                        (Parameterized sets, Section 7.2)
• spreadsheet-asynch.fm                      (Asynchronous spreadsheet, Section 9.4)
• spreadsheet.fm                                       (Synchronous spreadsheet, Section 9.4)
• stack1.fm                                                  (Stacks of elements, Section 9.6)
• stack2.fm                                                  (Stacks of objects, Section 9.6)
• test-sets.fm                                            (Test sets generator, Section 10.2)
• toset.fm                                                    (Theory of totally ordered sets, Section 7.1)
• tree.fm                                                      (General trees, Section 7.5)