From 051059e1512d3288c960d1c1e97d922f345206f7 Mon Sep 17 00:00:00 2001
From: Jan Van Bruggen <JanCVanB@pm.me>
Date: Wed, 7 Sep 2022 22:37:55 -0600
Subject: [PATCH] Replace tabs with spaces

See https://github.com/DavidAnson/markdownlint/blob/main/doc/Rules.md#md010
---
 .markdownlint-cli2.yaml                          |  1 -
 .../docs/ambient_lambda_set_specialization.md    | 16 ++++++++--------
 2 files changed, 8 insertions(+), 9 deletions(-)

diff --git a/.markdownlint-cli2.yaml b/.markdownlint-cli2.yaml
index c56c71be71..1fa9f2482b 100644
--- a/.markdownlint-cli2.yaml
+++ b/.markdownlint-cli2.yaml
@@ -5,7 +5,6 @@ config:
   line-length: false
   no-duplicate-heading: false
   no-emphasis-as-heading: false
-  no-hard-tabs: false
   no-inline-html: false
   no-multiple-blanks: false
   no-space-in-code: false
diff --git a/crates/compiler/solve/docs/ambient_lambda_set_specialization.md b/crates/compiler/solve/docs/ambient_lambda_set_specialization.md
index 9817a2ed17..9a6508259c 100644
--- a/crates/compiler/solve/docs/ambient_lambda_set_specialization.md
+++ b/crates/compiler/solve/docs/ambient_lambda_set_specialization.md
@@ -212,7 +212,7 @@ Okay, so first we’ll enumerate some terminology, and the exact algorithm. Then
     | Type_function region
 
     Type_function = \region ->
-    	let left_type, new_region = Type (region + 1)
+      let left_type, new_region = Type (region + 1)
       let right_type, new_region = Type (new_region)
       let func_type = left_type -[Lambda region]-> right_type
       (func_type, new_region)
@@ -313,9 +313,9 @@ has unification proceed as follows:
 => Fo -[[] + Fo:f:1]-> (b' -[[] + Fo:f:2]-> {})
    <specialization time>
       step 1:
-			  uls_Fo =  { [[] + Fo:f:1], [[] + Fo:f:2] }
+        uls_Fo =  { [[] + Fo:f:1], [[] + Fo:f:2] }
       step 2 (sort):
-			  uls_Fo' = { [[] + Fo:f:2], [[] + Fo:f:1] }
+        uls_Fo' = { [[] + Fo:f:2], [[] + Fo:f:1] }
       step 3:
         1. iteration: [[] + Fo:f:2]
              b'  -[[]]-> {}             (t_f1 after removing Fo:f:2)
@@ -342,7 +342,7 @@ has unification proceed as follows:
         uls_Go =  { [[] + Go:g:1] }
       step 2 (sort):
         uls_Go' = { [[] + Go:g:1] }
-			step 3:
+      step 3:
         1. iteration: [[] + Go:g:1]
              Go -[[]]-> {}     (t_f1 after removing Go:g:1)
            ~ Go -[[Go#g]]-> {}
@@ -398,7 +398,7 @@ Then, the call `h (@Go {})` has the trace
         uls_Go =  { [[] + Go:g:1] }
       step 2 (sort):
         uls_Go' = { [[] + Go:g:1] }
-			step 3:
+      step 3:
         1. iteration: [[] + Go:g:1]
              Go -[[]]-> {}     (t_f1 after removing Go:g:1)
            ~ Go -[[Go#g]]-> {}
@@ -497,8 +497,8 @@ Let’s get to it.
                   uls_Go = { [[] + Go:g:2] }
                 step 2:
                   uls_Go = { [[] + Go:g:2] } (sorted)
-					      step_3:
-					        1. iteration: [[] + Go:g:2]
+                step_3:
+                  1. iteration: [[] + Go:g:2]
                        {} -[[]]-> {} (t_f1 after removing Go:g:2)
                      ~ {} -[[lamG]]-> {}
                      = {} -[[lamG]]-> {}
@@ -675,7 +675,7 @@ Type = \region ->
 | Type_function region
 
 Type_function = \region ->
-	let left_type = Type (region * 2)
+  let left_type = Type (region * 2)
   let right_type = Type (region * 2 + 1)
   let func_type = left_type -[Lambda region]-> right_type
   func_type