Reinstate GS1.m with \_ in comments.

Add a emacs mode line to indicate mathematica mode

Author: rocky

examples/symbolic_logic/gries_schneider/GS1.m

@@ -1,3 +1,4 @@
+(* -*- wolfram -*- *)
 (* ****************************************************************************
 
     by Brian Beckman. License the same as for Mathics3: GPL3.
@@ -32,8 +33,8 @@
 (* Section 1.2 Textual substitution, page 8
  _____        _             _   ___      _       _   _ _        _   _
 |_   _|____ _| |_ _  _ __ _| | / __|_  _| |__ __| |_(_) |_ _  _| |_(_)___ _ _
-  | |/ -_) \ /  _| || / _` | | |__ \ || | '_ (_-<  _| |  _| || |  _| / _ \ ' \
-  |_||___/_|_||__||_,_|__,_|_| |___/|_,_|_.__/__/|__|_||__||_,_||__|_|___/_||_|
+  | |/ -_) \ /  _| || / _` | | \__ \ || | '_ (_-<  _| |  _| || |  _| / _ \ ' \
+  |_|\___/_\_\\__|\_,_\__,_|_| |___/\_,_|_.__/__/\__|_|\__|\_,_|\__|_\___/_||_|
 
     Mathics gives us direct syntax for Gries & Schneider's (G&S)'s "textual
     substitution:"
@@ -245,13 +246,13 @@
 
 (* Inference Rule Substitution (1.1), page 10
  ___       __                           ___      _     _
-|_ _|_ _  / _|___ _ _ ___ _ _  __ ___  | _ |_  _| |___(_)
- | || ' ||  _/ -_) '_/ -_) ' |/ _/ -_) |   / || | / -_)_
-|___|_||_|_| |___|_| |___|_||_|__|___| |_|_||_,_|_|___(_)
+|_ _|_ _  / _|___ _ _ ___ _ _  __ ___  | _ \_  _| |___(_)
+ | || ' \|  _/ -_) '_/ -_) ' \/ _/ -_) |   / || | / -_)_
+|___|_||_|_| \___|_| \___|_||_\__\___| |_|_\\_,_|_\___(_)
  ___      _       _   _ _        _   _
 / __|_  _| |__ __| |_(_) |_ _  _| |_(_)___ _ _
-|__ | || | '_ (_-<  _| |  _| || |  _| / _ | ' |
-|___/|_,_|_.__/__/|__|_||__||_,_||__|_|___/_||_|
+\__ \ || | '_ (_-<  _| |  _| || |  _| / _ \ ' \
+|___/\_,_|_.__/__/\__|_|\__|\_,_|\__|_\___/_||_|
 
     The inference rule 'Substitution' takes in a top-line expression e, a list
     of variables v, and a corresponding list of replacement expressions f, and
@@ -335,12 +336,12 @@
 (* Section 1.3 Textual substitution and equality, page 11
  _____        _             _   ___      _       _   _ _        _   _
 |_   _|____ _| |_ _  _ __ _| | / __|_  _| |__ __| |_(_) |_ _  _| |_(_)___ _ _
-  | |/ -_) | /  _| || / _` | | |__ | || | '_ (_-<  _| |  _| || |  _| / _ | ' |
-  |_||___/_|_||__||_,_|__,_|_| |___/|_,_|_.__/__/|__|_||__||_,_||__|_|___/_||_|
+  | |/ -_) \ /  _| || / _` | | \__ \ || | '_ (_-<  _| |  _| || |  _| / _ \ ' \
+  |_|\___/_\_\\__|\_,_\__,_|_| |___/\_,_|_.__/__/\__|_|\__|\_,_|\__|_\___/_||_|
               _   ___                _ _ _
  __ _ _ _  __| | | __|__ _ _  _ __ _| (_) |_ _  _
-/ _` | ' |/ _` | | _|/ _` | || / _` | | |  _| || |
-|__,_|_||_|__,_| |___|__, ||_,_|__,_|_|_||__||_, |
+/ _` | ' \/ _` | | _|/ _` | || / _` | | |  _| || |
+\__,_|_||_\__,_| |___\__, |\_,_\__,_|_|_|\__|\_, |
                         |_|                  |__/
 
     Going forward, we want more inference and less evaluation. This is tricky in
@@ -1054,8 +1055,8 @@ over and over (google "don't repeat yourself"), introduce "Postfix notation
 (*  Here is a cheat sheet of all the rules we've defined so far.
   ___ _             _     ___ _            _                __
  / __| |_  ___ __ _| |_  / __| |_  ___ ___| |_   ___ ___   / _|__ _ _ _
-| (__| ' |/ -_) _` |  _| |__ | ' |/ -_) -_)  _| (_-</ _ | |  _/ _` | '_|
- |___|_||_|___|__,_||__| |___/_||_|___|___||__| /__/|___/ |_| |__,_|_|
+| (__| ' \/ -_) _` |  _| \__ \ ' \/ -_) -_)  _| (_-</ _ \ |  _/ _` | '_|
+ \___|_||_\___\__,_|\__| |___/_||_\___\___|\__| /__/\___/ |_| \__,_|_|
 
     (* 1.1 *) substitutionInferenceRule[e_, v_:List, f_:List] :=
         Module[{ rules = MapThread[ Rule, {v, f} ] }, e /. rules ]
@@ -1091,13 +1092,13 @@ over and over (google "don't repeat yourself"), introduce "Postfix notation
 
 (* Section 1.4 Leibniz's rule and function evaluation, page 13
  _        _ _         _    _      ___      _                    _
-| |   ___(_) |__ _ _ (_)__( )___ | _ |_  _| |___   __ _ _ _  __| |
-| |__/ -_) | '_ | ' || |_ //|_ / |   / || | / -_) / _` | ' |/ _` |
-|____|___|_|_.__/_||_|_/__| /__| |_|_||_,_|_|___| |__,_|_||_|__,_|
+| |   ___(_) |__ _ _ (_)__( )___ | _ \_  _| |___   __ _ _ _  __| |
+| |__/ -_) | '_ \ ' \| |_ //|_ / |   / || | / -_) / _` | ' \/ _` |
+|____\___|_|_.__/_||_|_/__| /__| |_|_\\_,_|_\___| \__,_|_||_\__,_|
  ___             _   _            ___          _           _   _
 | __|  _ _ _  __| |_(_)___ _ _   | __|_ ____ _| |_  _ __ _| |_(_)___ _ _
-| _| || | ' |/ _|  _| / _ | ' |  | _|| V / _` | | || / _` |  _| / _ | ' |
-|_| |_,_|_||_|__||__|_|___/_||_| |___||_/|__,_|_||_,_|__,_||__|_|___/_||_|
+| _| || | ' \/ _|  _| / _ \ ' \  | _|\ V / _` | | || / _` |  _| / _ \ ' \
+|_| \_,_|_||_\__|\__|_\___/_||_| |___|\_/\__,_|_|\_,_\__,_|\__|_\___/_||_|
 
     Start at the bottom of page 13. A lot of this we can do without prose, now,
     because we're getting accustomed to the style.
@@ -1524,9 +1525,9 @@ calculus is (from page 42)
 
 (* Section 1.6, The assignment statement, page 16
    _          _                         _
-  /_|   _____(_)__ _ _ _  _ __  ___ _ _| |_
- / _ | (_-<_-< / _` | ' || '  |/ -_) ' |  _|
-/_/ |_|/__/__/_|__, |_||_|_|_|_|___|_||_|__|
+  /_\   _____(_)__ _ _ _  _ __  ___ _ _| |_
+ / _ \ (_-<_-< / _` | ' \| '  \/ -_) ' \  _|
+/_/ \_\/__/__/_\__, |_||_|_|_|_\___|_||_\__|
                |___/
 
     Here we exhibit the first instance of a "type." It's just a head and some
@@ -1675,8 +1676,8 @@ enclosing our variables in curly braces (List brackets).
 (* Exercises for Chapter 1, pages 21-23
  ___                _               ___ _        _
 | __|_ _____ _ _ __(_)___ ___ ___  / __| |_     / |
-| _|| | / -_) '_/ _| (_-</ -_|_-< | (__| ' | _  | |
-|___/_|_|___|_| |__|_/__/|___/__/  |___|_||_(_) |_|
+| _|\ \ / -_) '_/ _| (_-</ -_|_-< | (__| ' \ _  | |
+|___/_\_\___|_| \__|_/__/\___/__/  \___|_||_(_) |_|
 
  *************************************************************************** *)