simplify code

Author: capfredf

typed-racket-lib/typed-racket/rep/type-rep.rkt

@@ -160,14 +160,8 @@
 (define-match-expander F:*
   (lambda (stx)
     (syntax-case stx ()
-      [(_ n)
-       #'(? F? (app (lambda (t)
-                      (F-n t))
-                    n))]
-      [(_ n b)
-       #'(? F? (app (lambda (t)
-                      (list (F-n t) (F-bound t)))
-                    (list n b)))])))
+      [(_ n) #'(F: n _)]
+      [(_ n b) #'(F: n b)])))
 
 
 (define Name-table (make-free-id-table))

typed-racket-lib/typed-racket/types/subtype.rkt

@@ -806,16 +806,8 @@
    (match* (t2 bound)
      ;; tvars are equal if they are the same variable
      [((F: var2) _) (and (eq? var1 var2) A)]
-     [(_ (? Type?)) (subtype* A bound t2 obj)
-      #;
-      (eprintf "t2 is ~a bound is ~a ~n" t2 bound)
-      #;
-      (if bound
-          (let ([ret (subtype* A bound t2 obj)])
-            (eprintf "subtype ret is ~a ~n" ret)
-            ret)
-          (continue<: A t1 t2 obj))]
-     [(_ _ ) (continue<: A t1 t2 obj)])]
+     [(_ (? Type?)) (subtype* A bound t2 obj)]
+     [(_ _) (continue<: A t1 t2 obj)])]
   [(case: Fun (Fun: arrows1))
    (match* (t2 arrows1)
      ;; special case when t1 can be collapsed into simpler arrow