- Haskell - Haskell.org

RE: Licensing of Haskell code
by Graham Klyne 23 May '03

23 May '03

This sounds like a possible application for the description logic (DL) [1] based systems that are being built for the semantic web... E.g. use DL-type structures to describe different software licensing terms ... what is permitted, what conditions apply, etc. If the licences concerned fall within the expressive constraints of DLs, a DL subsumption calculation should be able to derive the appropriate description of terms of if one is required to conform to multiple such licences (and if the permitted uses in such a subsumption is the empty set, one may deduce the licences are incompatible.) ALl of which, I think, would be readily expressed in Haskell. Another related, but different, approach might be based on some work I did for content negotation in Internet protocols, some time ago [2]. This takes a different slice through the form of logical expressions used to describe some set of possibilities, and algorithms for combining those expressions. #g -- [1] http://citeseer.nj.nec.com/borgida95description.html This is one of very many possible citations... it happens to be one that I found useful as an introduction to description logic ideas. I've also found some of Deborah McGuinness' papers in this area to be helpful. [2] http://www.ietf.org/rfc/rfc2533.txt At 12:16 23/05/03 +0100, Simon Marlow wrote: >Ashley Yakely writes: > > OK, this may not be immediately practical, but... as > > contracts, would it > > be possible to express licenses in a Haskell-like language? > > Didn't Simon > > PJ do some kind of work on this? There seem to be interesting > > covariant/contravariant properties here, for instance, if I > > require you > > to allow A to anyone who does B, then that is satisfied if you allow > > more than A to anyone who does less than B. > >I think that's a great idea. I've often thought that there ought to be >a formal system for reasoning about source code licenses, at least so >there would be a way to unambiguously decide when one license is >"compatible" with another, and what precisely are the obligations on a >programmer when distributing a work consisting of code licensed in two >different ways. > >An DSL for licenses would be even better, since you'd presumably be able >to interrogate the system to determine the properties of license >combinations. > >Cheers, > Simon > >_______________________________________________ >Haskell mailing list >Haskell(a)haskell.org >http://www.haskell.org/mailman/listinfo/haskell ------------------- Graham Klyne <GK(a)NineByNine.org> PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E

1 0

Hugs: Instance storage space exhausted
by Elke Kasimir 20 May '03

20 May '03

Hi! Does anybody now how to deal with the hugs message Reading file "...XYZ.hs" - Instance storage space exhausted ? Any hint appreciated, Elke. -- Elke Kasimir EsPresto AG ----------------------------------------------------------------- - Software Development- Breite Str. 30-31 Tel/Fax: +49-30-90 226-750/-760 10178 Berlin/Germany

2 1

Summary of responses to
by Brian McBride 20 May '03

20 May '03

I'd like to thank those folks who responded to my request for an Isabelle like system in Haskell. Whilst no one was able to point me to exactly what I was looking for, I did get helpful pointers to: http://www.cs.kun.nl/~janz/yarrow/ http://www.cs.yale.edu/homes/cc392/report.html http://www.math.chalmers.se/~rjmh/QuickCheck/ Brian

1 0

Re: (no subject)
by l14881＠alunos.uevora.pt 20 May '03

20 May '03

> > `return` takes a single argument. You've given it 3 and 2 arguments in > your two uses. > > Dean > Thanks Dean it help me a lot. i'm not used to program in Haskell i usualy program in Java, C, Prolog and Delphi. I'm implementing a Prolog Interpreter in Haskell in a University Discipline. that's why i have this newby questions about Haskell. p.s.- sorry about my english i don't write in english for a while.

2 1

Combining IO and state monads
by Graham Klyne 19 May '03

19 May '03

I've written and tested a collection of Haskell functions, and now I want to put them together into a "proper" program. The pattern of evaluation that I envisage is a program which maintains a workspace, and performs a sequence of read and write operations that reference and update this workspace, eventually returning some value based on the final state of the workspace. The workspace would seem to be appropriately manipulated using a form of state monad. And the I/O operations would be performed through an IO monad. What I'm unsure about is the best way to combine these so that the real-world state (IO) and workspace state are updated (threaded?) in parallel. I think I can imagine a solution that defines a new monad consisting of an IO paired with a state monad, and then implementing the monadic operators and access functions to manage the combined I/O and state updates. I haven't thought through the details, but my intuition is that it might be a fair amount of additional code. I notice the XML toolbox implements a similar idea [1], though in that case the state is not a separate monad, just combined with IO in a new monad type. [1] http://www.fh-wedel.de/~si/HXmlToolbox/hdoc/MonadStateIO.html I imagine that this is a common requirement, for which there exists an appropriately packaged solution. Is there a standard solution I should look to for this kind of functionality? Or is there some completely different approach that I've overlooked? #g ------------------- Graham Klyne <GK(a)NineByNine.org> PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E

9 14

(no subject)
by l14881＠alunos.uevora.pt 19 May '03

19 May '03

data Wam = Wam { falha::String, h::Int, s::Int, p::Int, heap::Array Int Pares, registos::Array Int Pares, e::Int, b::Int, mode::Char, cp::Int, code::Array Int Int, trail::Array Int Int, tr::Int, hb::Int } deriving Show deref a c = let (tag,value) = ((heap c)!(a)) in if ((tag=="REF") && (value /= a)) then return deref value c else return a c I would like to do something like that but it gives me an error. error: ERROR "trab2.hs":373 - Type error in function binding *** Term : deref *** Type : Int -> Wam -> Int *** Does not match : Wam -> Int Can anyone help, please?? thanks

2 1

Diagrammatic representation of Haskell datatypes
by Bas van Dijk 19 May '03

19 May '03

Hi, I'm desining a visual programming language (just for fun...). The language is pretty much based on "Visual Haskell": http://ptolemy.eecs.berkeley.edu/~johnr/papers/visual.html But it uses another approach to model higher-order functions: http://citeseer.nj.nec.com/dami96higherorder.html The "functional side" of the language is pretty much finished so what's left is the "datatype side". With Object-Oriented languages such as C++ and Java you can use diagram languages such as UML to model the data. I was wondering if there exists diagrammatic languages for modelling Haskell datatypes? It would be great if someone can point me to some research papers. Thanks, Bas van Dijk.

4 5

Blowfish
by Dominic Steinitz 18 May '03

18 May '03

I have been unable to track down the email of the author (Doug Hoyte) of the blowfish code on http://sourceforge.net/forum/forum.php?forum_id=263682. I'd like to include it the Crypto library. I think I can under the terms of the licence (GNU GPL) provided I reproduce the copyright information. Does this sound ok? Or alternatively does someone have Doug's email address so I can check it's ok with him directly. Many thanks, Dominc.

3 2

A Haskell News Reposter
by Steffen Mazanek 17 May '03

17 May '03

Hello, after a reinstallation of our newsserver we had problems to import some vitally old articles due to its incompatibility. So I have written a little Haskell program which converts news articles into expect scripts, which repost them. This is really dirty. Is there a Haskell library which allows direct communication like telnet? It would be quite cool to have a library which provides e.g. a kind of monad for the conversation with such servers, which takes care for errors and the protocol, so that you can roughly write: do s<-connectNews server groups<-listOfGroups s haskell<-searchFor "haskell" groups articles<-listOfArticles haskell article<-searchFor "obfuscated" articles reply article (Art "Steffen.Mazanek(a)UniBw-Muenchen.de" (reSubj article) haskell "These programms are really cool") disconnect s Is there such a library? Can someone provide an example of its usage? Ciao, Steffen Mazanek -- Haskell: that's where I just curry until fail, unwords any error, drop all undefined, maybe break, otherwise in sequence span isControl and take max $, id: (d:[])

1 0

Re: Fixing a type variable inside a function
by oleg＠pobox.com 16 May '03

16 May '03

> foo :: MyTypeClass resultType => resultType > foo = fromString (toString (undefined :: resultType)) > but I can't seem to do this -- GHC's scoped type variables don't seem > to help either, or at least I couldn't get it working. In GHC, type variables in the signature bear no relationship to (local) type variables in the body of the function. Simon Peyton Jones and Mark Shields explain that decision in their paper: http://research.microsoft.com/~simonpj/papers/scoped-tyvars They argue that a type signature does not have to immediately precede the body of the function. A type signature may be far away. In that case, relying in the body of the function something that was bound far earlier in the code did not seem reasonable. Incidentally, Chameleon took an opposite decision. Thus, if you want to use resultType in the body of the function, you have to bind it somewhere in the body of the function: foo :: MyTypeClass resultType => resultType foo::rt = fromString (toString (undefined :: rt)) Omitting the type signature, as in foo = fromString $ toString undefined works too. This is almost the same example that has been explained in the thread "Solved: Typing problems with polymorphic recursion and typeclasses" on this thread two weeks ago.

1 0