summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
raw | gz |
help

author | haftmann |

Tue, 20 Sep 2005 08:20:22 +0200 | |

changeset 17495 | ddb14cbec6a2 |

parent 17494 | e70600834f44 |

child 17496 | 26535df536ae |

infix operator precedence

--- a/NEWS Tue Sep 20 00:16:29 2005 +0200 +++ b/NEWS Tue Sep 20 08:20:22 2005 +0200 @@ -710,6 +710,16 @@ x |> f f #> g (x, y) |-> f f #-> g +* Pure/library.ML: introduced/changed precedence of infix operators: + + infix 1 |> |-> ||> ||>> |>> |>>> #> #->; + infix 2 ?; + infix 3 o oo ooo oooo; + infix 4 ~~ upto downto; + +Maybe INCOMPATIBILITY when any of those is used in conjunction with other +infix operators. + * Pure/library.ML: natural list combinators fold, fold_rev, and fold_map support linear functional transformations and nesting. For example: @@ -736,17 +746,14 @@ * Pure/General: structure AList (cf. Pure/General/alist.ML) provides basic operations for association lists, following natural argument -order. The old functions may be expressed as follows: +order; ; moreover the explicit equality predicate passed here avoids +potentially expensive polymorphic runtime equality checks. +The old functions may be expressed as follows: assoc = uncurry (AList.lookup (op =)) assocs = these oo AList.lookup (op =) overwrite = uncurry (AList.update (op =)) o swap -* Pure/General: structure AList (cf. Pure/General/alist.ML) provides -basic operations for association lists, following natural argument -order; moreover the explicit equality predicate passed here avoids -potentially expensive polymorphic runtime equality checks. - * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) provides a reasonably efficient light-weight implementation of sets as lists.