- Haskell-Cafe - Haskell.org

RE: haddock depencies to std-modules
by Simon Marlow 29 Sep '03

29 Sep '03

> I use haddock to create documentation. Everything is fine > except of the > references to standard modules. If I am using standardtypes > like Int or > String haddock wants to create crossrefs to these modules and > fails because > of missing "sourcecode". > > Is there a simple way to fix this? I've heard of interface > files to create > right refs to existing docs, but that doesnt work. Whats the > right way? One way is to use the Haddock interface files that are distributed with GHC. I haven't put any effort into making the process easy yet - ideally Haddock should consult GHC's package database to find the interface files, but it doesn't currently do this. You'll find Haddock interface files in the same location as the documentation when you install GHC (eg. /usr/share/ghc-<version>/html/base/base.haddock on a Linux system). Cheers, Simon

1 0

haddock depencies to std-modules
by Patrick Scheibe 29 Sep '03

29 Sep '03

hello I use haddock to create documentation. Everything is fine except of the references to standard modules. If I am using standardtypes like Int or String haddock wants to create crossrefs to these modules and fails because of missing "sourcecode". Is there a simple way to fix this? I've heard of interface files to create right refs to existing docs, but that doesnt work. Whats the right way? Cheers Patrick

1 0

(Off-topic) Question about categories
by Peter J. Veger 27 Sep '03

27 Sep '03

> I'm not sure if anyone mentioned the examples of a poset and a monoid as categories. > There is no "internal" structure in these. In the former, the objects are the > elements and there is a morphism between a and b iff a <= b. A functor then becomes > an order preserving map. In the latter, there is one object and the morphisms are > the elements. The identity is the identity map and if x and y are two elements / > morphisms then composition is xy. A functor is then a homomorphism. > Dominic. It is probably better to use the example of a preordered set. A Preordered set is a set with a relation <=, that is reflexive (x<=x) and transtive (x<=y & y<=z --> x<=z) (but not necessarily antisymmetric, x<=y & y<=x --> x=y as for a poset). If, in a preordered set, a is the unique morphism: x -> y and b the unique morphism: y -> x, then (writing x for the identity morphism id(x)) a.b=y and b.a=x Categorically, x and y are isomorphic. Concluding that x=y is not in the categorical language. Of course, you should distinguish the category of preorders (posets, monoids) from preorder (poset, monoid) as a category. As for literature, you have the classic: Saunders Mac Lane: Categories for the Working mathematician but the working computer scientist may prefer: Andrea Asperti and Guiseppe Longo: Categories, Types, and Structures (MIT Press, 1991) Michael Barr and Charles Wells: Category Theory for Computing Science (3rd ed., Les Publication CRM, 1999) idem, Introduction to Category Theory (www.let.uu.nl/esslli/Courses/barr-wells.html) Peter J. Veger, Best, Netherlands

1 0

(Off-topic) Question about categories
by Dominic Steinitz 27 Sep '03

27 Sep '03

Graham, I'm not sure if anyone mentioned the examples of a poset and a monoid as categories. There is no "internal" structure in these. In the former, the objects are the elements and there is a morphism between a and b iff a <= b. A functor then becomes an order preserving map. In the latter, there is one object and the morphisms are the elements. The identity is the identity map and if x and y are two elements / morphisms then composition is xy. A functor is then a homomorphism. Dominic.

1 0

Haskell as specification language
by Luc Taesch 25 Sep '03

25 Sep '03

out of curiosity, is haskell already been used as a "specification" language ? i was thinking in a business term, rather than mathematical one. (i.e. one than " normal mortal can read, even with a bit of training ;-) I.e. one would specifiy a model, an application ( possibly run it on samples), and hand it over to developper, typically in other languages/environment... I am aware of the contracts paper of SPJ, for instance... others you may think of ? does a spec. always leads to a DSL , for instance ? I imagine a specification for an application resulting in a DSL for the "data model"/ " process model " part, (which is the generic/ reusabel part, IMH) plus something more specific to the effective application targeted... (I cannot resist explaining my long term view : if IT outsourcing really takes off one day, one key factor will be proper specification, which is in a dear state in the current practice nowadays "in the field") ref: http://search.ft.com/search/article.html?id=030923007625

1 0

RE: Modeling multiple inheritance
by Simon Peyton-Jones 25 Sep '03

25 Sep '03

When Mark Shields and I tackled this problem we came up with Object-Oriented Style Overloading for Haskell http://research.microsoft.com/~simonpj/Papers/oo-haskell/index.htm It describes an (unimplemented) extension to Haskell, rather than modelling it in Haskell itself, but you may find it interesting none the less. Simon | -----Original Message----- | From: haskell-cafe-bounces(a)haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of | Brandon Michael Moore | Sent: 24 September 2003 22:22 | To: haskell-cafe(a)haskell.org | Subject: Modeling multiple inheritance | | I'm trying to build a nicer interface over the one generated by | jvm-bridge. I'm using fancy type classes to remove the need to mangle | method names. I would like methods to be automatcially inherited, | following an inheritance hierarcy defined with another set of type | classes. | | My basic classes look like this | class HasFooMethod cls args result | cls args -> result where | foo :: cls -> args -> result | | If I have classes A and B with foo methods like | foo_JA_Jint :: ClassA -> Jint -> Bool | foo_JB_Jboolean :: ClassB -> Bool -> Jint | then I can make instances | instance HasFooMethod ClassA Jint Bool | instance HasFooMethod ClassB Bool Jint | | Now I can just use foo everywhere. I would like to avoid declaring an | instance for every class though. In java methods are inherited from a | superclass, and I would like to inherit methods automatically as well. In | the bindings jvm-bridge generates a method is invoked with a function | mangled after the highest ancestor that defined that particular | overloading, so the implementation of HasFooMethod at a particular | overloading is the same for any descendant. | | So I defined a class to model the inheritance relationships | | class SubType super sub | sub -> super where | upCast :: sub -> super | | Now I can define a default instance of HasFooMethod: | instance (HasFooMethod super args result, | SubClass super sub) => | HasFooMethod sub args result where | foo sub args = foo (upCast sub) args | | This will propagate foo methods down the inheritance hierarcy. If a new | class C is derived from A, I just need to say | | instance SubClass ClassA ClassC | | and ClassC gets a foo method. (In the actually code I piggy-back on a | transitive subclass relation jvm-bridge defines that already includes an | upcast method, so upCast has a default that should always be acceptable). | | The problem comes when interfaces are added to the mix. Interfaces are | treated just like classes by jvm-bridge, and even though no implementation | is inherited from instances in Java, the method accessors generated by | jvm-bridge should be inherited. | | One problem is that the subclass relationship needs the functional | dependency so that the default instance of HasFooMethod will respects the | functional dependencies of HasFooMethod, so I can't declare subclass | instances for multiple inheritance. On the other hand, if I don't use the | functional dependency on HasFooMethod I end up needing to annotate most of | the return values in a program. I run into similar problems trying to use | numeric literals as arguments, because they are also overloaded. | | Does anyone know of clever solutions that would model multiple inheritance | while preserving the functional dependencies (unsafe compiler flags are | fine too), or ways to reduce the pain of overloading resolution without | the functional dependency? | | One alternative is generating seperate HasFooMethod instances for every | class in the system. The problem is that this would require alterating the | bit of jvm-bridge that uses JNI to find information on classes, which | currently only reports newly defined methods. JNI is black magic to me. | | Thanks | Brandon | | _______________________________________________ | Haskell-Cafe mailing list | Haskell-Cafe(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

RE: Database interface - would like advice on oracle library bind ing
by Bayley, Alistair 25 Sep '03

25 Sep '03

> From: oleg(a)pobox.com [mailto:oleg@pobox.com] > > I'd like to remark first that many real databases let us avoid opening > many cursors at once. It seems to be more efficient to do as much as > possible within the engine ... I agree (and Tom Pledger makes the same comment). It's rare that I want to have more than one cursor open at once. When I've seen other developers do it, they're often doing something that would be better accomplished as a join. And that last time I remember doing it, it was a nested loops situation (which, on reflection, probably could have been done as a join... oh well). OTOH, I have seen interleaved fetches used to simulate a join where the specific DBMS product struggled to perform the join efficiently itself. In this case the developer is making up for a deficiency in the DBMS, and I don't want to exclude the option from the interface (if you agree with what you read on http://www.dbdebunk.com , then most DBMS products are deficient in a number of ways). > Still, opening several cursors may be unavoidable. The left fold > approach may still help -- we _can_ mechanically invert a left fold > combinator (to be precise, a half-baked version of it) into a lazy > list. Please see a separate message "how to invert the left fold" Found it. I'll have a look... > I believe the extract functions can be constructed automatically -- > similar to the way Quickcheck constructs test cases. I believe that > instead of I though this might be possible, but I had no idea how to do it. I'll have a look at the Quickcheck source to see how it's done, unless you can suggest a better example. > buffers. It's hard for me to write the corresponding code because I > don't have Oracle handy (besides, I like Informix better). Is it > possible to come up with a "stub" that uses flat files? We are only > interested in fetching rows. It doesn't matter if these rows come from > a file or from a database. That would make prototyping the interface > quite easier. I wasn't interested so much in prototyping the interface, as trying to write an implementation that supported the interface(s) discussed previously. I intended to provide the left-fold interface, and was wondering if that was all that was needed (for selects). Still, this would be a good exercise for me, at least so I can figure out how to generate extraction functions. > From: Tom Pledger [mailto:Tom.Pledger@peace.com] > Here's one approach: find the OCI equivalent of JDBC's > ResultSetMetaData, and use it to drive the allocation and freeing of > buffers. I've considered this, and I think it's the next route I'll take (the OCI supports it). At the least it'll give me the ability to perform arbitrary queries (at present I have to know the types of the result set columns and construct the extraction function manually). I've also considered stuffing more information into the Cursor type (which I've introduced), and using this in a modal fashion to decide what to do at each point. > Here's another: ... > Make getInt (and friends) behave differently depending on the mode > of the cursor they're passed: either allocate a buffer and return > _|_, decode and return the current column of the current row, or > free a buffer and return _|_. Not wanting to sound too dumb, but how do you return _|_ ? Thanks, Alistair. ***************************************************************** The information in this email and in any attachments is confidential and intended solely for the attention and use of the named addressee(s). This information may be subject to legal professional or other privilege or may otherwise be protected by work product immunity or other legal rules. It must not be disclosed to any person without our authority. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorised to and must not disclose, copy, distribute, or retain this message or any part of it. *****************************************************************

3 2

Database interface - would like advice on oracle library binding
by Bayley, Alistair 24 Sep '03

24 Sep '03

(2nd attempt; mailman thinks I'm not a list member, but it still keeps sending me mail.) Still making slow progress on an Oracle database binding... now I'm trying to fit the API I have into some sort of abstract interface (like the one(s) discussed previously: http://haskell.org/pipermail/haskell-cafe/2003-August/004957.html ). 1. Is the left-fold the best/only interface to expose? I think yes, but that doesn't allow fine-grained control over cursors i.e. being able to open many cursors at once and interleave fetches from them. Or does it? 2. I'm finding it hard to write a doQuery function that takes an extraction function that isn't a pig to write. Some advice would be useful here... (and a long-ish explanation follows): The Oracle Call Interface (OCI) requires that I allocate buffers for the result of a single row fetch, before the first row is fetched. So a query involves: - prepare statement etc - allocate buffers (one for each column - call OCI C function "DefineByPos") - fetch row - extract/marshal data from buffer into Haskell types (which are then processed by fold function) - fetch, marshal (repeat until no more rows) - free buffers i.e. the same buffers are re-used for each row. The problem for me is how to specify the left-fold function in terms of the low-level API. If I want to supply extraction functions (to extract Haskell values from result buffer), how do I manage the buffer allocation in the doQuery function? The buffer allocate/free code also needs to know the column positions and types, in the same manner as the extract functions. I want to be able to write code like this: results <- doQuery dbconn sqltext [] \row results -> do name <- stringv row 1 address <- stringv row 2 return (name,address):results .. where the stringv function extracts/marshals a Haskell String from the result buffer. The intermediate approach I currently have means I have to pass an IO action into the doQuery function that, when evaluated, allocates the buffer and returns two more actions: - an action that extracts the row as a tuple - another action that frees the buffer The doQuery function evaluates the initial action (to allocate the buffer), uses the extract action to build the result (at present a list), and when there are no more rows, uses the free action to free the buffer. This approach is quite awkward (especially w.r.t. writing extract functions), and it's hard for me to see how to build a better interface. Hard, because of the memory management requirements. -------------------- Here's a chunk of the code. A lot of it is OCI plumbing, but I hope you can see how awkward it is to create an extract function (see ex3 at the bottom). Given pointers to the buffer, extract a string of variable length (you have to terminate it yourself). > fetchStringVal :: OCIColInfo -> IO String > fetchStringVal (_, bufptr, nullindptr, retsizeptr) = do > retsize <- liftM cShort2Int (peek retsizeptr) > nullind <- liftM cShort2Int (peek nullindptr) -- unused > pokeByteOff (castPtr bufptr) retsize nullByte > val <- peekCString (castPtr bufptr) > return val Free a single column's buffer. > freeColBuffer :: OCIColInfo -> IO () > freeColBuffer (_, bufptr, nullindptr, retsizeptr) = do > free bufptr > free retsizeptr > free nullindptr Create a buffer for a string column, and return the extract and free IO actions. > getExtractFnString :: Int -> ErrorHandle -> StmtHandle -> IO (IO String, IO ()) > getExtractFnString posn err stmt = do > c <- defineCol err stmt posn 2000 oci_SQLT_CHR > return ((fetchStringVal c), (freeColBuffer c)) doQuery uses the extractFns action to create the result buffer, and the two actions (extract and free) which are passed to doQuery2. > doQuery2 :: ErrorHandle -> StmtHandle -> IO a -> IO () -> [a] -> IO [a] > doQuery2 err stmt extractData freeMem results = do > rc <- fetch err stmt > if rc == oci_NO_DATA > then do > freeMem > return results > else do > v <- extractData > doQuery2 err stmt extractData freeMem (v:results) > doQuery :: Session -> String -> (ErrorHandle -> StmtHandle -> IO (IO a, IO ())) -> IO [a] > doQuery (Sess env err con) qry extractFns = do > stmt <- getStmt env err > prepare err stmt qry > execute err con stmt > (extractData, freeMem) <- extractFns err stmt > doQuery2 err stmt extractData freeMem [] The interface provided by doQuery means I have to write extract functions like this. Here's one for a select that returns three String columns. It's quite awkward... > ex3 :: ErrorHandle -> StmtHandle -> IO (IO (String, String, String), IO ()) > ex3 err stmt = do > (fetchcol1, freecol1) <- getExtractFnString 1 err stmt > (fetchcol2, freecol2) <- getExtractFnString 2 err stmt > (fetchcol3, freecol3) <- getExtractFnString 3 err stmt > return > ( do { s1 <- fetchcol1; s2 <- fetchcol2; s3 <- fetchcol3; return (s1, s2, s3) } > , do { freecol1; freecol2; freecol3 } > ) ***************************************************************** The information in this email and in any attachments is confidential and intended solely for the attention and use of the named addressee(s). This information may be subject to legal professional or other privilege or may otherwise be protected by work product immunity or other legal rules. It must not be disclosed to any person without our authority. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorised to and must not disclose, copy, distribute, or retain this message or any part of it. *****************************************************************

3 2

Re: Generating "setMember" functions for record structures
by Peter Simons 23 Sep '03

23 Sep '03

Peter Gammie writes: > Haskell Report, Sec 3.15.3 Great, that's exactly what I need. Thanks a lot to all who replied! Peter

1 0

Generating "setMember" functions for record structures
by Peter Simons 23 Sep '03

23 Sep '03

Hi, in one of my programs, I have to modify individual fields of a pretty large record structure quite frequently. Assume the structure is: > data State = State { foo :: [Int] > , bar :: [String] > } Then I'd like to have functions setFoo and setBar, which copy a State but replace the field in question with a given value. This is implemented as: > setFoo :: State -> [Int] -> State > setFoo st x = State { foo = x > , bar = bar st > } > setBar :: State -> [String] -> State > setBar st x = State { foo = foo st > , bar = x > } Now, defining these helper functions for large records is not what I call an interesting job. Thus I wonder, is there any way to automate this task? I thought about using Template Haskell, but I haven't used it at all yet and am uncertain about how difficult accomplishing this would be. I also thought about using "Data.Generics", which I know better, but the generic approach feels like over-kill for this task. In order to use it, I'd have to re-design my data structure as well. So this isn't too attractive ... Any ideas? Comments? Source Code? :-) Peter

3 2