phino 0.0.147 → 0.0.148

raw patch · 7 files changed

+173/−62 lines, 7 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

Files

• README.md +31/−7
• phino.cabal +1/−1
• src/Deps.hs +30/−21
• src/Evaluate.hs +5/−5
• src/Morph.hs +66/−24
• test/CLISpec.hs +35/−3
• test/DepsSpec.hs +5/−1

@@ -589,9 +589,11 @@ </deferred> ``` -Every argument of the call is an `<attr>` of `<with>`, and an argument that-is not a bare symbol is spelled `?`. A copy with no object of the world has-neither `of` nor `<with>`, only `<e>`.+Every argument of the call is an `<attr>` of `<with>`. An argument that is a+bare symbol, or a carrier of one whose `φ` leads to it, such as+`Φ.number( φ ↦ 𝜎1:λ )` or `𝜎1:λ:φ`, is spelled as that symbol, and any other+argument is spelled `?`. A copy with no object of the world has neither `of`+nor `<with>`, only `<e>`.  Every term is 𝜑 on a single line, whatever `--output` and `--flat` say about the result of the run, so a program reading the protocol back never has to know@@ -1385,10 +1387,32 @@ carries is the formation the frame above entered, as that frame had it, so the two are paired by their terms and no reader has to rename symbols by eye or find the cut in the residue. Nothing runs under a cut, so no block opens under-the line. In the XML protocol it is a self-closing element,-`<looped by="morph" match="proven" at="Φ.a🌵7" term="…"/>`, with the-attributes a `<formation>` carries and the mode. Without the option the same-run nests one round inside another until `--max-steps` runs out.+the line. In the XML protocol it is+`<looped by="morph" match="proven" at="Φ.a🌵7"><e>…</e></looped>`, with the+site and the mode as attributes and the formation in `<e>`. Without the option+the same run nests one round inside another until `--max-steps` runs out.++A cut at the `φ` of a copy the walk of `--deep` has placed, such as+`Φ.a🌵4.φ`, answers that copy with a fresh symbol, the way a deferred copy is+answered. A fork above it then joins that symbol with its other branch,+instead of getting stuck on a copy nobody can read. The line names the+symbol, as in `looped(…) := 𝜎6  # 𝕄(Φ.a🌵4.φ), plausible`, and the markup+writes the object the copy was made of and its arguments the way it writes+them for a deferred copy, on one line, broken here for reading:++<!-- markdownlint-disable MD013 -->++```xml+<looped symbol="𝜎6" by="morph" match="plausible" at="Φ.a🌵4.φ" of="Φ.fact">+  <with><attr name="n">𝜎3</attr><attr name="acc">?</attr></with>+  <e>⟦ c ↦ 𝜎2:λ, left ↦ 00-:Δ, right ↦ Φ.fact( n ↦ 𝜎3:λ:φ, acc ↦ Φ.pair( head ↦ 𝜎1:λ:φ, tail ↦ 00-:Δ ) ), λ ⤍ L_if ⟧</e>+</looped>+```++<!-- markdownlint-enable MD013 -->++A cut anywhere else, or at the `φ` of a copy nested inside a term, answers+nothing and leaves the copy as it stood.  What a frame remembers is the branch from the run down to it, never everything the run has touched, so two siblings entering one formation enter it twice and

@@ -1,6 +1,6 @@ cabal-version: 3.0 name: phino-version: 0.0.147+version: 0.0.148 license: MIT synopsis: Command-Line Manipulator of 𝜑-Calculus Expressions description: Please see the README on GitHub at <https://github.com/objectionary/phino#readme>

@@ -8,10 +8,11 @@  import AST import Control.Monad (unless, when)+import Data.Bifunctor (bimap) import Data.IORef (IORef, readIORef, writeIORef) import Data.List (intercalate) import qualified Data.Map.Strict as Map-import Data.Maybe (fromMaybe)+import Data.Maybe (fromMaybe, listToMaybe) import qualified Data.Text as T import Files (overwrite) import GHC.Clock (getMonotonicTime)@@ -92,7 +93,7 @@   = EvRun Judgment T.Text   | EvFiring Int T.Text Judgment Expression   | EvFormation Int Expression Expression-  | EvLooped Int Judgment Acyclic Expression Expression+  | EvLooped Int Judgment Acyclic Expression Expression (Maybe (Int, Maybe Expression))   | EvStuck Int T.Text Judgment Expression   | EvStall Int T.Text   | EvStuckOn Int T.Text@@ -119,7 +120,7 @@     record :: Evaluation -> Evaluation     record (EvFiring depth key judgment site) = EvFiring depth key judgment (term site)     record (EvFormation depth self site) = EvFormation depth (term self) (term site)-    record (EvLooped depth judgment mode self site) = EvLooped depth judgment mode (term self) (term site)+    record (EvLooped depth judgment mode self site answered) = EvLooped depth judgment mode (term self) (term site) (fmap (bimap symbol (fmap term)) answered)     record (EvStuck depth key judgment self) = EvStuck depth key judgment (term self)     record (EvStarved depth limit judgment site) = EvStarved depth limit judgment (term site)     record (EvTimeout depth limit judgment site) = EvTimeout depth limit judgment (term site)@@ -203,10 +204,13 @@       form <- render self       locator <- render site       pure (protocol, Just (indented depth (printf "formation(%s)  # %s(%s)" form (letter Dataization) locator)))-    written (EvLooped depth judgment mode self site) protocol = do+    written (EvLooped depth judgment mode self site answered) protocol = do       form <- render self       locator <- render site-      pure (protocol, Just (indented depth (printf "looped(%s)  # %s(%s), %s" form (letter judgment) locator (certainty mode))))+      pure (protocol, Just (indented depth (printf "looped(%s)%s  # %s(%s), %s" form (maybe "" symbolized answered) (letter judgment) locator (certainty mode))))+      where+        symbolized :: (Int, Maybe Expression) -> String+        symbolized (symbol, _) = printf " := %s" (printFunction (FnSymbol symbol))     written (EvStuck depth key judgment self) protocol = do       form <- render self       pure (protocol, Just (indented depth (printf "unanswered(%s)  # %s(%s)" (T.unpack key) (letter judgment) form)))@@ -345,11 +349,15 @@       locator <- render site       let (kept, closers) = closed depth nesting._closing       pure (nesting{_closing = (depth, "formation") : kept}, closers ++ [indentedXml depth (printf "<formation at=\"%s\" term=\"%s\">" (escapeXML locator) (escapeXML form))])-    elements (EvLooped depth judgment mode self site) nesting = do+    elements (EvLooped depth judgment mode self site answered) nesting = do       form <- render self       locator <- render site+      (origin, given) <- maybe (pure ("", "")) called (answered >>= snd)       let (kept, closers) = closed depth nesting._closing-      pure (nesting{_closing = kept}, closers ++ [indentedXml depth (printf "<looped by=\"%s\" match=\"%s\" at=\"%s\" term=\"%s\"/>" (opened judgment) (certainty mode) (escapeXML locator) (escapeXML form))])+      pure (nesting{_closing = kept}, closers ++ [indentedXml depth (printf "<looped%s by=\"%s\" match=\"%s\" at=\"%s\"%s>%s<e>%s</e></looped>" (maybe "" symbolized answered) (opened judgment) (certainty mode) (escapeXML locator) origin given (escapeXMLText form))])+      where+        symbolized :: (Int, Maybe Expression) -> String+        symbolized (symbol, _) = printf " symbol=\"%s\"" (sigma symbol)     elements (EvStuck depth key judgment self) nesting = do       form <- render self       let (kept, closers) = closed depth nesting._closing@@ -431,20 +439,6 @@       (origin, given) <- maybe (pure ("", "")) called call       let (kept, closers) = closed depth nesting._closing       pure (nesting{_closing = kept}, closers ++ [indentedXml depth (printf "<deferred symbol=\"%s\" by=\"%s\" at=\"%s\"%s>%s<e>%s</e></deferred>" (sigma symbol) (opened judgment) (escapeXML locator) origin given (escapeXMLText form))])-      where-        called :: Expression -> IO (String, String)-        called term = do-          let (object, arguments) = invoked term-          path <- render object-          pure (printf " of=\"%s\"" (escapeXML path), printf "<with>%s</with>" (concat arguments))-        invoked :: Expression -> (Expression, [String])-        invoked (ExApplication term (ArTau attr value)) =-          let (object, arguments) = invoked term-           in (object, arguments ++ [printf "<attr name=\"%s\">%s</attr>" (escapeXML (printAttribute attr)) (escapeXMLText (valued value))])-        invoked term = (term, [])-        valued :: Expression -> String-        valued (ExFormation [BiLambda (FnSymbol idx)]) = sigma idx-        valued _ = "?"     elements (EvBuilt depth term) nesting = do       body <- render term       let (kept, closers) = closed depth nesting._closing@@ -460,6 +454,21 @@     labelled :: Nesting -> Int -> T.Text -> String     labelled nesting depth spelling =       printf "%s.%d" (T.unpack spelling) (fromMaybe 0 (Map.lookup (depth - 1) nesting._openedAt))+    called :: Expression -> IO (String, String)+    called term = do+      let (object, arguments) = invoked term+      path <- render object+      pure (printf " of=\"%s\"" (escapeXML path), printf "<with>%s</with>" (concat arguments))+    invoked :: Expression -> (Expression, [String])+    invoked (ExApplication term (ArTau attr value)) =+      let (object, arguments) = invoked term+       in (object, arguments ++ [printf "<attr name=\"%s\">%s</attr>" (escapeXML (printAttribute attr)) (escapeXMLText (valued value))])+    invoked term = (term, [])+    valued :: Expression -> String+    valued (ExFormation [BiLambda (FnSymbol idx)]) = sigma idx+    valued (ExFormation bds) = maybe "?" valued (listToMaybe [body | BiTau AtPhi body <- bds])+    valued (ExApplication _ (ArTau AtPhi body)) = valued body+    valued _ = "?"     sigma :: Int -> String     sigma = printFunction . FnSymbol     quoted :: T.Text -> String

@@ -9,7 +9,7 @@  import AST import Builder (buildExpressionThrows)-import Control.Exception (throwIO, try)+import Control.Exception (catch, throwIO, try) import Control.Monad (foldM, unless) import Data.List (partition) import Data.List.NonEmpty (NonEmpty (..))@@ -19,7 +19,7 @@ import Engine (Engine (..)) import Lambdas (Lambda (..), Meta (..), joined, matched, minted, symbolized) import Matcher (MetaValue (..), Subst, combine, substEmpty, substSingle, substSlot)-import Morph (Answer, Firing (..), Kept (..), ReduceContext (..), ReduceException (..), Steps (..), charged, counted, deeper, enter, isLambda, lambda, morphing, normalized, recalled, remember, remembered, retained, settled, starved, unparked)+import Morph (Answer, Firing (..), Kept (..), ReduceContext (..), ReduceException (..), Refused (..), Steps (..), admitted, charged, counted, deeper, isLambda, lambda, morphing, normalized, recalled, refused, remember, remembered, retained, settled, starved, unparked) import Printer (printFunction) import Rule (RuleContext (RuleContext), matchExpressionWithRule') import Text.Printf (printf)@@ -114,7 +114,7 @@       pure (snd answer, state)     told (Looped term) = do       caller._saveEval (EvFiring caller._nesting func caller._judgment caller._site)-      mapM_ (\mode -> caller._saveEval (EvLooped (caller._nesting + 1) caller._judgment mode term caller._site)) caller._acyclic+      mapM_ (\mode -> caller._saveEval (EvLooped (caller._nesting + 1) caller._judgment mode term caller._site Nothing)) caller._acyclic       throwIO (Looping term)     told (Stalled name _) = do       caller._saveEval (EvFiring caller._nesting func caller._judgment caller._site)@@ -255,10 +255,10 @@     evaluated ctx state' form (func, self)       | isNothing (matched ctx._symbolic func) = pure (Nothing, state')       | otherwise = do-          made <- try (enter form ctx >>= symbol func form self univ state')+          made <- try (admitted form ctx >>= either (\(mode, before) -> throwIO (Refused mode before state')) (symbol func form self univ state'))           case made of             Right (answer, answered) -> do-              (again, reached) <- fired dispatched answer univ answered ctx+              (again, reached) <- fired dispatched answer univ answered ctx `catch` refused ctx               pure (Just (fromMaybe answer again), reached)             Left failure -> parked state' failure     parked :: State -> ReduceException -> IO (Maybe Expression, State)

@@ -1,7 +1,6 @@ {-# LANGUAGE DeriveAnyClass #-} {-# LANGUAGE DerivingStrategies #-} {-# LANGUAGE DuplicateRecordFields #-}-{-# LANGUAGE LambdaCase #-} {-# LANGUAGE OverloadedRecordDot #-} {-# LANGUAGE OverloadedStrings #-} {-# LANGUAGE RecordWildCards #-}@@ -12,7 +11,7 @@ -- SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com -- SPDX-License-Identifier: MIT -module Morph (Answer, Deadline (..), Firing (..), Kept (..), ReduceContext (..), ReduceException (..), EvaluationFunc, FiringFunc, Memo (..), ReductionFunc, Morphed, Steps (..), Tally (..), boxed, charged, counted, deeper, emptyState, enter, entering, execBuildTerm, inferred, insideUniverse, isLambda, lambda, leadsTo, memoized, morph, morph', morphing, normalized, onward, parking, recalled, remember, remembered, retained, settled, starved, tallied, timed, universed, unparked) where+module Morph (Answer, Deadline (..), Firing (..), Kept (..), ReduceContext (..), ReduceException (..), EvaluationFunc, FiringFunc, Memo (..), ReductionFunc, Morphed, Refused (..), Steps (..), Tally (..), admitted, boxed, charged, counted, deeper, emptyState, enter, entering, execBuildTerm, inferred, insideUniverse, isLambda, lambda, leadsTo, memoized, morph, morph', morphing, normalized, onward, parking, recalled, refused, remember, remembered, retained, settled, starved, tallied, timed, universed, unparked) where  import AST import Builder (buildExpressionThrows, pathOf)@@ -153,6 +152,18 @@   show (Undataizable _ _) = "no dataization rule matched"   show (Unmorphable term) = printf "Morphing expects a normal form, but no morphing rule matches: %s" (printExpression term) +data Refused = Refused Acyclic Expression State+  deriving anyclass (Exception)++instance Show Refused where+  show (Refused _ before _) = show (Looping before)++data Severed = Severed Expression State+  deriving anyclass (Exception)++instance Show Severed where+  show (Severed answer _) = printf "The deep walk answered a copy it cut with %s" (printExpression answer)+ deeper :: ReduceContext -> IO ReduceContext deeper ctx@ReduceContext{_steps = Steps limit spent} = do   clocked ctx@@ -270,15 +281,20 @@ entering term ctx = maybe (pure ctx) (`enter` ctx) (entrance ctx._judgment term)  enter :: Expression -> ReduceContext -> IO ReduceContext-enter form ctx = maybe (pure ctx) remembered ctx._acyclic+enter form ctx = admitted form ctx >>= either refuse pure   where-    remembered :: Acyclic -> IO ReduceContext+    refuse :: (Acyclic, Expression) -> IO ReduceContext+    refuse (mode, before) = do+      looped ctx mode before Nothing+      throwIO (Looping form)++admitted :: Expression -> ReduceContext -> IO (Either (Acyclic, Expression) ReduceContext)+admitted form ctx = maybe (pure (Right ctx)) remembered ctx._acyclic+  where+    remembered :: Acyclic -> IO (Either (Acyclic, Expression) ReduceContext)     remembered mode =-      awaited (find (repeated mode form) (Map.findWithDefault [] (digest mode form) ctx._entered)) >>= \case-        Just before -> do-          ctx._saveEval (EvLooped ctx._nesting ctx._judgment mode before ctx._site)-          throwIO (Looping form)-        Nothing -> pure ctx{_entered = seenInsert (digest mode form) form ctx._entered}+      maybe (Right ctx{_entered = seenInsert (digest mode form) form ctx._entered}) (Left . (mode,))+        <$> awaited (find (repeated mode form) (Map.findWithDefault [] (digest mode form) ctx._entered))     awaited :: Maybe Expression -> IO (Maybe Expression)     awaited found = case ctx._deadline of       Nothing -> pure found@@ -292,6 +308,12 @@     repeated Proven form before = alike form before     repeated Plausible form before = within before form +refused :: ReduceContext -> Refused -> IO (Maybe Expression, State)+refused ctx (Refused mode before reached) = (Nothing, reached) <$ looped ctx mode before Nothing++looped :: ReduceContext -> Acyclic -> Expression -> Maybe (Int, Maybe Expression) -> IO ()+looped ctx mode before answer = ctx._saveEval (EvLooped ctx._nesting ctx._judgment mode before ctx._site answer)+ entrance :: Judgment -> Expression -> Maybe Expression entrance Dataization term@(ExFormation bds)   | boxed bds || isJust (lambda bds) = Just term@@ -404,15 +426,33 @@       case copy of         Just form -> deferred form state' here         Nothing -> do-          (walked, walkedState) <- walk standing frame term state' here-          placed <- ctx._engine._contextualize walked =<< context frame-          current <- readIORef world-          (answer, answered) <- ctx'._fire dispatched placed current walkedState ctx'{_universe = Just current}-          mapM_ (noted here._site frame walked) answer-          pure (fromMaybe walked answer, answered)+          outcome <- try (walk standing frame term state' here)+          case outcome of+            Left (Severed answer reached) -> pure (answer, reached)+            Right (walked, walkedState) -> do+              placed <- ctx._engine._contextualize walked =<< context frame+              current <- readIORef world+              (answer, answered) <- ctx'._fire dispatched placed current walkedState ctx'{_universe = Just current} `catch` cut standing frame ctx'+              mapM_ (noted here._site frame walked) answer+              pure (fromMaybe walked answer, answered)+    cut :: Maybe Expression -> Frame -> ReduceContext -> Refused -> IO (Maybe Expression, State)+    cut (Just _) (Frame _ store path (Just AtPhi)) caller refusal@(Refused mode before reached) = do+      form <- held path store+      if copied form+        then do+          looped caller mode before (Just (fresh, called form))+          throwIO (Severed (ExFormation [BiLambda (FnSymbol fresh)]) reached{_minted = fresh})+        else refused caller refusal+      where+        fresh :: Int+        fresh = reached._minted + 1+    cut _ _ caller refusal = refused caller refusal+    copied :: Expression -> Bool+    copied (ExFormation bds) = boxed bds && not (any abstract bds) && any code bds+    copied _ = False     deferrable :: Maybe Attribute -> IORef Expression -> Expression -> State -> ReduceContext -> IO (Maybe Expression)     deferrable dispatched world form@(ExFormation bds) state' caller-      | boxed bds && not (any abstract bds) && any code bds && maybe True (\attr -> not (any (named attr) bds)) dispatched = do+      | copied form && maybe True (\attr -> not (any (named attr) bds)) dispatched = do           current <- readIORef world           known <- mapM (resolved current form state' caller) bds           pure (if any bare known then Just (ExFormation known) else Nothing)@@ -518,15 +558,15 @@       where         floor' :: Int         floor' = state'._minted-        planned :: Maybe (Expression, [Attribute]) -> (Int, Binding) -> IO (IO ([Evaluation], Either SomeException (Int -> (Binding, Maybe State))))+        planned :: Maybe (Expression, [Attribute]) -> (Int, Binding) -> IO (IO ([Evaluation], Either SomeException (Int -> IO (Binding, Maybe State))))         planned alias (idx, BiTau attr body)           | attr /= AtRho = do               new <- if closed body then fresh alias attr caller else pure True               pure (if new then worker idx attr body else kept (BiTau attr body))         planned _ (_, bd) = pure (kept bd)-        kept :: Binding -> IO ([Evaluation], Either SomeException (Int -> (Binding, Maybe State)))-        kept bd = pure ([], Right (const (bd, Nothing)))-        worker :: Int -> Attribute -> Expression -> IO ([Evaluation], Either SomeException (Int -> (Binding, Maybe State)))+        kept :: Binding -> IO ([Evaluation], Either SomeException (Int -> IO (Binding, Maybe State)))+        kept bd = pure ([], Right (const (pure (bd, Nothing))))+        worker :: Int -> Attribute -> Expression -> IO ([Evaluation], Either SomeException (Int -> IO (Binding, Maybe State)))         worker idx attr body = do           buffer <- newIORef []           tau <- tausOf idx@@ -535,19 +575,21 @@           copy <- newIORef =<< readIORef world           (store, path) <- home standing copy form           let own = caller{_jobs = 1, _tally = tally, _memo = memo, _saveEval = modifyIORef' buffer . (:), _buildTerm = minting tau caller._buildTerm}-          outcome <- try (go (fmap (`ExDispatch` attr) standing) Nothing (Frame copy store path (Just attr)) body state' own)+          outcome <- try (try (go (fmap (`ExDispatch` attr) standing) Nothing (Frame copy store path (Just attr)) body state' own))           records <- reverse <$> readIORef buffer-          pure (records, fmap (\(term, walked) offset -> (BiTau attr (lifted floor' offset term), Just (moved offset walked))) outcome)+          pure (records, fmap (either severed (\(term, walked) offset -> pure (BiTau attr (lifted floor' offset term), Just (moved offset walked)))) outcome)+        severed :: Severed -> Int -> IO (Binding, Maybe State)+        severed (Severed answer reached) offset = throwIO (Severed (lifted floor' offset answer) (moved offset reached))         moved :: Int -> State -> State         moved offset walked =           walked             { _minted = walked._minted + offset             , _manufactured = fmap (\sym -> if sym > floor' then sym + offset else sym) walked._manufactured             }-        gathered :: ([Binding], Int, State) -> ([Evaluation], Either SomeException (Int -> (Binding, Maybe State))) -> IO ([Binding], Int, State)+        gathered :: ([Binding], Int, State) -> ([Evaluation], Either SomeException (Int -> IO (Binding, Maybe State))) -> IO ([Binding], Int, State)         gathered (done, offset, current) (records, outcome) = do           mapM_ (caller._saveEval . renumbered floor' offset) records-          (bd, walked) <- either throwIO (pure . ($ offset)) outcome+          (bd, walked) <- either throwIO ($ offset) outcome           pure (bd : done, maybe offset (\after -> after._minted - floor') walked, fromMaybe current walked)     spread standing frame term state' caller = parts standing frame term state' caller     minting :: IO T.Text -> BuildTermFunc -> BuildTermFunc

@@ -1259,7 +1259,7 @@                        , "    looped(⟦ x ↦ ⟦⟧, φ ↦ Φ.cyc( x ) ⟧)  # 𝔻(Φ.t), proven"                        ] -      it "writes the cut to the XML protocol as a self-closing element" $+      it "writes the cut to the XML protocol with the formation in an element of its own" $         withTempFile "protocolXXXXXX.xml" $ \(path, stream) -> do           hClose stream           withStdin circling $@@ -1271,7 +1271,7 @@             `shouldBe` [ "<?xml version=\"1.0\" encoding=\"UTF-8\"?>"                        , "<dataize at=\"Φ.t\">"                        , "  <formation at=\"Φ.t\" term=\"⟦ x ↦ ⟦⟧, φ ↦ Φ.cyc( x ) ⟧\">"-                       , "    <looped by=\"dataize\" match=\"proven\" at=\"Φ.t\" term=\"⟦ x ↦ ⟦⟧, φ ↦ Φ.cyc( x ) ⟧\"/>"+                       , "    <looped by=\"dataize\" match=\"proven\" at=\"Φ.t\"><e>⟦ x ↦ ⟦⟧, φ ↦ Φ.cyc( x ) ⟧</e></looped>"                        , "  </formation>"                        , "</dataize>"                        ]@@ -1600,6 +1600,15 @@           records <- readProtocol path           lines records `shouldContain` ["  deferred(𝜎2) := ⟦ x ↦ 𝜎1:λ, φ ↦ x.next ⟧  # 𝕄(Φ.y)"] +      it "writes the symbol a cut answers a copy with" $+        withTempFile "protocolXXXXXX.txt" $ \(path, stream) -> do+          hClose stream+          withLambdasOf (T.pack "- λ: L_loop\n  morph:\n    𝑛1: $.x\n  𝑛: 𝑛1\n") $ \loops ->+            withStdin "⟦ box(n) ↦ ⟦ φ ↦ Φ.loop( x ↦ Φ.box( n ↦ ξ.n ) ) ⟧, loop(x) ↦ L_loop:λ, y ↦ Φ.loop( x ↦ Φ.box( n ↦ ⟦ Δ ⤍ 01- ⟧ ) ) ⟧" $+              testCLISucceeded ["morph", "--symbolic=" ++ loops, "--deep", "--acyclic=proven", "--locator=Q.y", "--protocol=" ++ path, "--quiet", "--sweet", "--hide-rho"] []+          records <- readProtocol path+          lines records `shouldContain` ["    looped(⟦ x ↦ Φ.box( n ↦ 01-:Δ ), λ ⤍ L_loop ⟧) := 𝜎1  # 𝕄(Φ.a🌵0.φ), proven"]+       it "writes a told stall to the XML protocol" $         withTempFile "protocolXXXXXX.xml" $ \(path, stream) -> do           hClose stream@@ -1925,7 +1934,7 @@               withStdin "⟦ bytes(φ) ↦ ⟦⟧, dataized(target) ↦ L_dataized:λ, joined(items) ↦ ⟦ φ ↦ step( tup ↦ items, s ↦ sep ), sep ↦ Φ.dataized( target ↦ items ), step(ρ, tup, s) ↦ ⟦ φ ↦ tup.next ⟧ ⟧, y ↦ Φ.joined( items ↦ ⟦ λ ⤍ 𝜎1 ⟧ ).φ ⟧" $                 testCLISucceeded ["morph", "--deep", "--symbolic=" ++ dataized, "--locator=Q.y", "--protocol=" ++ path, "--quiet", "--sweet", "--hide-rho"] []             records <- readProtocol path-            lines records `shouldContain` ["  <deferred symbol=\"𝜎3\" by=\"morph\" at=\"Φ.y\" of=\"Φ.joined.step\"><with><attr name=\"tup\">𝜎1</attr><attr name=\"s\">?</attr></with><e>⟦ tup ↦ 𝜎1:λ, s ↦ 𝜎2:λ:φ, φ ↦ tup.next ⟧</e></deferred>"]+            lines records `shouldContain` ["  <deferred symbol=\"𝜎3\" by=\"morph\" at=\"Φ.y\" of=\"Φ.joined.step\"><with><attr name=\"tup\">𝜎1</attr><attr name=\"s\">𝜎2</attr></with><e>⟦ tup ↦ 𝜎1:λ, s ↦ 𝜎2:λ:φ, φ ↦ tup.next ⟧</e></deferred>"]          it "writes a question mark for an argument of a deferred copy that is no bare symbol" $           withTempFile "protocolXXXXXX.xml" $ \(path, stream) -> do@@ -1951,6 +1960,15 @@             records <- readProtocol path             lines records `shouldContain` ["  <deferred symbol=\"𝜎2\" by=\"morph\" at=\"Φ.y\"><e>⟦ x ↦ 𝜎1:λ, φ ↦ x.next ⟧</e></deferred>"] +        it "writes the copy a cut answers as a call of the object it was made of" $+          withTempFile "protocolXXXXXX.xml" $ \(path, stream) -> do+            hClose stream+            withLambdasOf (T.pack "- λ: L_loop\n  morph:\n    𝑛1: $.x\n  𝑛: 𝑛1\n") $ \loops ->+              withStdin "⟦ num(φ) ↦ ⟦⟧, box(n) ↦ ⟦ φ ↦ Φ.loop( x ↦ Φ.box( n ↦ ξ.n ) ) ⟧, loop(x) ↦ L_loop:λ, y ↦ Φ.loop( x ↦ Φ.box( n ↦ Φ.num( φ ↦ ⟦ λ ⤍ 𝜎1 ⟧ ) ) ) ⟧" $+                testCLISucceeded ["morph", "--symbolic=" ++ loops, "--deep", "--acyclic=plausible", "--locator=Q.y", "--protocol=" ++ path, "--quiet", "--sweet", "--hide-rho"] []+            records <- readProtocol path+            lines records `shouldContain` ["    <looped symbol=\"𝜎2\" by=\"morph\" match=\"plausible\" at=\"Φ.a🌵0.φ\" of=\"Φ.box\"><with><attr name=\"n\">𝜎1</attr></with><e>⟦ x ↦ Φ.box( n ↦ Φ.num( φ ↦ 𝜎1:λ ) ), λ ⤍ L_loop ⟧</e></looped>"]+         it "writes no 'minted' element for a firing minting nothing" $           withTempFile "protocolXXXXXX.xml" $ \(path, stream) -> do             hClose stream@@ -2704,6 +2722,20 @@             testCLISucceeded               ["morph", "--symbolic=" ++ endless, "--deep", "--acyclic=proven", "--max-steps=4000", "--flat", "--hide-rho"]               ["⟦ x ↦ ⟦ λ ⤍ L_loop ⟧.foo, y ↦ ⟦ z ↦ ⟦⟧ ⟧ ⟧"]++      it "answers a copy with a fresh symbol once it cuts the φ of the copy" $+        withLambdasOf (T.pack "- λ: L_loop\n  morph:\n    𝑛1: $.x\n  𝑛: 𝑛1\n") $ \loops ->+          withStdin "⟦ box(n) ↦ ⟦ φ ↦ Φ.loop( x ↦ Φ.box( n ↦ ξ.n ) ) ⟧, loop(x) ↦ L_loop:λ, y ↦ Φ.loop( x ↦ Φ.box( n ↦ ⟦ Δ ⤍ 01- ⟧ ) ) ⟧" $+            testCLISucceeded+              ["morph", "--symbolic=" ++ loops, "--deep", "--acyclic=proven", "--locator=Q.y", "--flat", "--hide-rho", "--sweet"]+              ["𝜎1:λ"]++      it "answers a cut copy with the symbol one walk gives it whatever --jobs says" $+        withLambdasOf (T.pack "- λ: L_loop\n  morph:\n    𝑛1: $.x\n  𝑛: 𝑛1\n- λ: L_mint\n  𝑛: ⟦ λ ⤍ 𝜎 ⟧\n") $ \loops ->+          withStdin "⟦ mint ↦ L_mint:λ, box(n) ↦ ⟦ k ↦ Φ.mint, φ ↦ Φ.loop( x ↦ Φ.box( n ↦ ξ.n ) ) ⟧, loop(x) ↦ L_loop:λ, y ↦ Φ.loop( x ↦ Φ.box( n ↦ ⟦ Δ ⤍ 01- ⟧ ) ) ⟧" $+            testCLISucceeded+              ["morph", "--symbolic=" ++ loops, "--deep", "--acyclic=proven", "--jobs=2", "--locator=Q.y", "--flat", "--hide-rho", "--sweet"]+              ["𝜎2:λ"]      describe "fails" $ do       it "with --output=xmir on a top formation of several bindings" $

@@ -11,7 +11,7 @@ import Data.IORef (modifyIORef', newIORef, readIORef) import Data.List (isInfixOf, isPrefixOf) import Data.Time.Clock.POSIX (getPOSIXTime)-import Deps (Evaluation (EvDeferred, EvFiring, EvFormation, EvJoined, EvMinted, EvRun, EvTerm), Judgment (Morphing), Nesting (..), Protocol (..), dontSaveEval, dontSaveStep, emptyNesting, emptyProgress, emptyProtocol, endEval, endEvalXml, perSecond, progressed, renumbered, saveStep)+import Deps (Acyclic (Proven), Evaluation (EvDeferred, EvFiring, EvFormation, EvJoined, EvLooped, EvMinted, EvRun, EvTerm), Judgment (Morphing), Nesting (..), Protocol (..), dontSaveEval, dontSaveStep, emptyNesting, emptyProgress, emptyProtocol, endEval, endEvalXml, perSecond, progressed, renumbered, saveStep) import Fixtures (readUtf8) import GHC.Clock (getMonotonicTime) import Logger (LogLevel (DEBUG, ERROR, INFO), setLogConfig)@@ -123,6 +123,10 @@     it "raises the symbols the call a deferred copy stands for carries above the floor" $       case renumbered 2 5 (EvDeferred 3 4 Morphing (ExFormation []) (Just (ExApplication (ExDispatch ExRoot (AtLabel "box")) (ArTau (AtLabel "x") (ExFormation [BiLambda (FnSymbol 7)])))) ExXi) of         EvDeferred _ _ _ _ call _ -> fmap symbols call `shouldBe` Just [12]+        _ -> expectationFailure "The record did not stay the record it was"+    it "raises the symbol a cut answers a copy with and the symbols of its call above the floor" $+      case renumbered 2 5 (EvLooped 3 Morphing Proven (ExFormation []) ExXi (Just (4, Just (ExApplication (ExDispatch ExRoot (AtLabel "box")) (ArTau (AtLabel "n") (ExFormation [BiLambda (FnSymbol 7)])))))) of+        EvLooped _ _ _ _ _ answer -> fmap (fmap (fmap symbols)) answer `shouldBe` Just (9, Just [12])         _ -> expectationFailure "The record did not stay the record it was"    describe "perSecond" $ do