From 70c0f448f72b23f00b6b126caec2ca7fae195902 Mon Sep 17 00:00:00 2001
From: Pierre Courtieu <courtieu@lri.fr>
Date: Sat, 4 Jun 2011 18:12:40 +0000
Subject: Updated the old code for indentation, in case Stefan cannot finish
 the new one for the release. Added also support for an experimental syntax
 modification: { .. } is a new syntax for Beginsubproof. ... EndSubproof.
 There a also few minor behavior changes. The code has changed a lot though.

---
 coq/ex/indent.v | 163 ++++++++++++++++++++++++++++++++++++++++++++++++++------
 1 file changed, 146 insertions(+), 17 deletions(-)

(limited to 'coq/ex')

diff --git a/coq/ex/indent.v b/coq/ex/indent.v
index b06ae922..ce8e1edb 100644
--- a/coq/ex/indent.v
+++ b/coq/ex/indent.v
@@ -9,22 +9,151 @@ Function div2 (n : nat) {struct n}: nat :=
   end.
 
 
-Module toto.
-  Lemma l1: forall n:nat, n = n. 
-    toto.
-  Qed.
-  Lemma l2: forall n:nat, n = n. 
-  toto. Qed.
-  Lemma l3: forall n:nat, n <= n. intro. Qed.
-  Lemma l4: forall n:nat, n <= n. Proof. intro. Qed.
-  Lemma l5 : forall n:nat, n <= n.
-  Proof. intro.
-  Qed.
-  Lemma l6: forall n:nat, n = n. 
-    toto.
-    Lemma l7: forall n:nat, n = n. 
-      toto.
+Module M1.
+  Module M2.
+    Lemma l1: forall n:nat, n = n. 
+      auto.
     Qed.
-  Qed.
-End toto.
+    Lemma l2: forall n:nat, n = n. 
+      auto. Qed.
+    Lemma l3: forall n:nat, n <= n. auto. Qed.
+    (*   Lemma l4: forall n:nat, n <= n. Proof. intro. Qed. *)
+    Lemma l5 : forall n:nat, n <= n.
+    Proof. auto.
+    Qed.
+    Lemma l6: forall n:nat, n = n. 
+      intros.
+      Lemma l7: forall n:nat, n = n. 
+        destruct n.
+        BeginSubproof.
+          auto.
+        EndSubproof.
+        BeginSubproof.
+          destruct n.
+          BeginSubproof.
+            auto.
+          EndSubproof.
+          auto.
+        EndSubproof.        
+      Qed.
+      BeginSubproof.
+        destruct n.
+        BeginSubproof.
+          auto. EndSubproof.
+        BeginSubproof. auto.
+        EndSubproof.
+      EndSubproof.
+    Qed.
+  End M2.
+End M1.
+
+
+Module M1'.
+  Module M2'.
+    Lemma l6: forall n:nat, n = n. 
+      intros.
+      Lemma l7: forall n:nat, n = n. 
+        destruct n.
+        {
+          auto.
+        }
+        { 
+          destruct n.
+          {
+            idtac;[
+              auto
+            ].
+          }
+          auto.
+        }        
+      Qed.
+      {destruct n.
+        {
+          auto. }
+        {auto.}
+      }
+    Qed.
+  End M2'.
+End M1'.
+
+Record rec:Set := { 
+  fld1:nat;
+  fld2:nat;
+  fld3:bool
+}.
+
+Class cla {X:Set}:Set := { 
+  cfld1:nat;
+  cld2:nat;
+  cld3:bool
+}.
+
+
+
+
+Lemma l :
+  forall r:rec,
+    exists r':rec,
+      r'.(fld1) = r.(fld2) /\ r'.(fld2) = r.(fld1).
+Proof.
+  intros r.  
+  {exists 
+    {|
+      fld1:=r.(fld2);
+      fld2:=r.(fld1);
+      fld3:=false
+    |}.
+    split.
+    {auto. }
+    {auto. }
+  }
+Qed.
+
+
+Lemma l2 :
+  forall r:rec,
+    exists r':rec,
+      r'.(fld1) = r.(fld2) /\ r'.(fld2) = r.(fld1).
+Proof.
+  intros r.  
+  {
+    idtac;
+      exists 
+        {|
+          fld1:=r.(fld2);
+          fld2:=r.(fld1);
+          fld3:=false
+        |}.
+    (* ltac *)
+    match goal with
+      | _:rec |- ?a /\ ?b => split
+      | _ => fail    
+    end.
+    {auto. }
+    {auto. }
+  }
+Qed.
+
+Require Import Morphisms.
+Generalizable All Variables.
+Open Local Scope signature_scope.
+Require Import RelationClasses.
+
+Module foo.
+Instance: (@RewriteRelation nat) impl.
+(* No goal created *)
+Definition XX := 0.
+
+
+Instance StrictOrder_Asymmetric `(StrictOrder A R) : Asymmetric R.
+(* One goal created. Then the user MUST put "Proof." to help indentation *)
+Proof.
+firstorder.
+Qed.
 
+  Program Fixpoint f (x:nat) {struct n} : nat :=
+            match x with
+               | 0 => 0
+               | S y => S (f y)
+            end.
+End Foo.
-- 
cgit v1.2.3