equal
deleted
inserted
replaced
230 \begin{warn} |
230 \begin{warn} |
231 If you have defined $f\,x\,y~\isasymequiv~t$ then you can only unfold |
231 If you have defined $f\,x\,y~\isasymequiv~t$ then you can only unfold |
232 occurrences of $f$ with at least two arguments. This may be helpful for unfolding |
232 occurrences of $f$ with at least two arguments. This may be helpful for unfolding |
233 $f$ selectively, but it may also get in the way. Defining |
233 $f$ selectively, but it may also get in the way. Defining |
234 $f$~\isasymequiv~\isasymlambda$x\,y.\;t$ allows to unfold all occurrences of $f$. |
234 $f$~\isasymequiv~\isasymlambda$x\,y.\;t$ allows to unfold all occurrences of $f$. |
235 \end{warn}% |
235 \end{warn} |
|
236 |
|
237 There is also the special method \isa{unfold}\index{*unfold (method)|bold} |
|
238 which merely unfolds |
|
239 one or several definitions, as in \isacommand{apply}\isa{(unfold xor_def)}. |
|
240 This is can be useful if \isa{simp} does too much.% |
236 \end{isamarkuptext}% |
241 \end{isamarkuptext}% |
237 \isamarkuptrue% |
242 \isamarkuptrue% |
238 % |
243 % |
239 \isamarkupsubsection{Simplifying {\tt\slshape let}-Expressions% |
244 \isamarkupsubsection{Simplifying {\tt\slshape let}-Expressions% |
240 } |
245 } |