On 1/5/2011 12:39 PM, George Oates wrote: > > > Do people know if BibTex can manage annotations too?
BibTeX has an "annote" field for annotations. >> 2)Generation of sub-lists based on some criteria. > > Why a sub-list? Can you give some real-world examples? Just curious why you > wouldn't simply create a second list, and perhaps link them together in the > description... My thought is that a sub-list would be a second list derived from the first by means of some predicate; for example, starting with list A, make a list B containing every book of list A that was published by Dover. >> 4) Merging lists. > > Can you describe some actual examples here? To be clear, by merge I mean starting with List A and List B, create a new list C containing the books of both Lists A and B. The sources of the original two (or more) lists could come from your lists or other users lists. Maybe you want to take two lists from two other users that separately maintain lists on some subject matter. The merge of the two lists would be a new list under your control. More general would be to define a small language that included such things as: 1) Logical AND, OR and NOT 2) A function INCLUSION defined by INCLUSION(B,L)= TRUE if book B is on list L; and FALSE otherwise. 3) equality (=) 4) relations such as <, <=, etc. 5) property functions such as COPYRIGHT(B) that returns the copyright of B; or LOC(B) that returns the LOC call number. 6) some regular expression stuff like the wild card *, etc Then predicates (functions that return TRUE or FALSE) could be constructed to generate a new list, such as P(B)=(INCLUSION(B,X) OR INCLUSION(B,Y)) AND (COPYRIGHT(B) <= 1922) to generate a list of public domain books from lists X and Y. or P(B)=(LOC(B)=BQ*) AND INCLUSION(B,X) to generate a list of all books on Buddhism (as classified by LOC) from list X. This is just a rough idea that would need to be thought out. But with a small language a user could process lists however they could imagine. I realize that some of this functionality exists for searching. _______________________________________________ Ol-discuss mailing list [email protected] http://mail.archive.org/cgi-bin/mailman/listinfo/ol-discuss To unsubscribe from this mailing list, send email to [email protected]
