@@ -10,7 +10,6 @@ import Data.Array.NonEmpty (NonEmptyArray)
1010import Data.Array.NonEmpty as NEA
1111import Data.Array.NonEmpty as NonEmptyArray
1212import Data.Bifunctor (bimap)
13−import Data.Foldable (foldMap)
1413import Data.Maybe (Maybe(..), maybe)
1514import Data.Newtype (un)
1615import Data.String (Pattern(..), Replacement(..))
@@ -95,7 +94,7 @@ escapeIdentifiers lib = lib
9594 escapeExpr = case _ of
9695 Identifier i -> Identifier $ escapeIdent i
9796 List exprs -> List $ map escapeExpr exprs
98− Cond b o -> Cond (map (bimap escapeExpr escapeExpr) b) (map escapeExpr o)
97+ Cond b o -> Cond (map (bimap escapeExpr escapeExpr) b) (escapeExpr o)
9998 Let recursive bindings expr ->
10099 Let recursive (map (bimap escapeIdent escapeExpr) bindings) $ escapeExpr expr
101100 Lambda args expr -> Lambda (map escapeIdent args) $ escapeExpr expr
@@ -318,7 +317,7 @@ printLambda args expr =
318317 (D.words [ D.text $ scmPrefixed "lambda", printList $ D.words $ map D.text args ])
319318 $ printChezExpr expr
320319
321−printCond :: NonEmptyArray (Tuple ChezExpr ChezExpr) -> Maybe ChezExpr -> Doc Void
320+printCond :: NonEmptyArray (Tuple ChezExpr ChezExpr) -> ChezExpr -> Doc Void
322321printCond branches fallback = do
323322 let
324323 b' :: Array (Doc Void)
@@ -326,8 +325,7 @@ printCond branches fallback = do
326325 printBrackets $ D.words [ printChezExpr cond, printChezExpr expr ]
327326
328327 o' :: Doc Void
329− o' = fallback # foldMap \x ->
330− printBrackets $ D.words [ D.text $ scmPrefixed "else", printChezExpr x ]
328+ o' = printBrackets $ D.words [ D.text $ scmPrefixed "else", printChezExpr fallback ]
331329
332330 printNamedIndentedList (D.text $ scmPrefixed "cond")
333331 $ D.lines