Mercurial Mercurial > hg > lexing / changeset
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | raw | gz | help
Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
updated
authorChristian Urban <christian dot urban at kcl dot ac dot uk>
Tue, 08 Mar 2016 07:14:52 +0000
changeset 129 21c980a85ee5
parent 128 f87e6e23bf17
child 130 44fec0bfffe5
updated
thys/Paper/Paper.thy file | annotate | diff | comparison | revisions
thys/paper.pdf file | annotate | diff | comparison | revisions 
--- a/thys/Paper/Paper.thy	Tue Mar 08 07:13:20 2016 +0000
+++ b/thys/Paper/Paper.thy	Tue Mar 08 07:14:52 2016 +0000
@@ -947,7 +947,7 @@
   their greedy matching algorithm always produces a maximal element
   according to this ordering (from all possible solutions). The only
   difference between their greedy ordering and the ``ordering'' by Sulzmann
-  and Lu is that GREEDY always prefers a $Left$-value over a $Right-value$.
+  and Lu is that GREEDY always prefers a $Left$-value over a $Right$-value.
   What is interesting for our purposes is that the properties reflexivity,
   totality and transitivity for this GREEDY ordering can be proved
   relatively easily by induction.
Binary file thys/paper.pdf has changed
lexing