- Haskell - Haskell.org

Licensing problem, caused by static linking on windows
by Kevin Backhouse 05 Jul '04

05 Jul '04

For past year or so, a group of us at ARM having been developing some software in Haskell. We have recently discovered that there may be a licensing problem if we wish to release a Windows version of the software. No doubt others have encountered the same problem, so we would be very grateful for any advice on how to solve it. The problem is that on Windows, GHC statically links the program with the libgmp library, which has an LGPL license. The LGPL license says that we can distribute the executable under our own terms, provided that we do this: Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. Does anyone have any experience of doing this with GHC? Is it relatively straightforward? Or better still, has anyone figured out a way of avoiding the problem by dynamically linking with libgmp on Windows? Any help would be greatly appreciated! Kevin Kevin Backhouse ARM Limited, 110 Fulbourn Road, Cambridge, CB1 9NJ, UK. Tel: +44 1223 400601 This e-mail message is intended for the addressee(s) only and may contain information that is the property of, and/or subject to a confidentiality agreement between the intended recipient(s), their organisation and/or the ARM Group of Companies. If you are not an intended recipient of this e-mail message, you should not read, copy, forward or otherwise distribute or further disclose the information in it; misuse of the contents of this e-mail message may violate various laws in your state, country or jurisdiction. If you have received this e-mail message in error, please contact the originator of this e-mail message via e-mail and delete all copies of this message from your computer or network, thank you.

3 2

Re: [Haskell] Licensing problem, caused by static linking on windows
by MR K P SCHUPKE 03 Jul '04

03 Jul '04

Re LGPL... I beleive it is acceptable to supply source code on request, and you should make it clear in the distributed code that the source for gmp is available on request. Keean.

2 1

for large x, log (x::Integer) :: Double
by Hal Daume III 01 Jul '04

01 Jul '04

i'm looking for an accurate way to take the log of a very large integer, for example: let x :: Integer = 1301427272151881160612765560226881966218101403436917787184856303672382623256898455416763978959067300249652773943715743032733292602624834984761739233232794619193611954735720284761058146899246611113236700853600891798968920775344491685185906922596026543915321367577774522912315930144523472702386240645993859368230855941019371447058664115974032571881072431604651385520393674840678811793554266595013773947434115579588912967969680150473258236727830867832149867100437142705476716669039640252677955201589378051836112800268367331455296715904387732836350613539218249950829555418397197909288345303407194983545308212828662999623279222913080214196287140117582811769188486693208227570257136851945943408206281672555558289460256867016896063334140640075708083581866297494610834545554864846306383014549439540479675828018496049574066533167553894586573246931377586176000 this # is approximately 10^850. not surprisingly, if i do: log (fromIntegral x) :: Double i get "Infinity". i can think of several ways to try to combat this: (1) divide x by something large (10^850) and then take the log of the integer part (requires finding that x ~ 10^850 by some search method); (2) multiply x by something large (10^10) and then take the log of this *as an Integer* and then convert that to a double. has anyone encountered this problem before? surely there must be a "good way" to do this... - hal -- Hal Daume III | hdaume(a)isi.edu "Arrest this man, he talks in maths." | www.isi.edu/~hdaume

5 5

Re: [Haskell] for large x, log (x::Integer) :: Double
by MR K P SCHUPKE 30 Jun '04

30 Jun '04

I would think to take an accurate (depends how you define accurate) arbitrary precision floating point is needed... gmp 2 supports this, but does not have a log function. The power series is the way calculators do it... you could always write a small library of operations on pairs of Integers to do arbitrary precision floating point, then use the power series. Keean.

1 0

Call for Participation: CIA 2004 Cooperative Information Agents
by Matthias Klusch 30 Jun '04

30 Jun '04

[Apologies if you receive this message more than once due to cross-posting to relevant mailing lists] +++ First Call for Participation +++ Dear colleague(s), we would like to very cordially invite you to join us at the eighth international workshop on Cooperative Information Agents (CIA 2004) to be held in Erfurt, Germany, from September 27 - 29, 2004. For more information please visit http://www.dfki.de/~klusch/cia2004/ Matthias Klusch, Sascha Ossowski, Vipul Kashyap, Rainer Unland (CIA 2004 Co-Chairs) _______________________________________________________ CIA 2004 PRELIMINARY PROGRAM _______________________________________________________ Monday, September 27 ==================== 9:15 Welcome 9:30 - 10:30 INVITED TALK Agents and OWL-S. Terry Payne (UK) 10:45 - 13:30 Session 1: Information Agents and P2P Computing ----------------------------------------------- 10:45 - 11:15 Design and Implementation of Agent Community based Peer-to-Peer Information Retrieval Tsunenori Mine, Daisuke Matsuno, Akihiro Kogo, Makoto Amamiya (Japan) 11:15 - 11:45 Towards Monitoring of Group Interactions and Social Roles via Overhearing Silvia Rossi, Paolo Busetta (Italy) 11:45 - 12:00 Coffee Break 12:00 - 12:30 A Probabilistic Approach to Predict Peers' Performance in P2P Networks Zoran Despotovic, Karl Aberer (Switzerland) 12:30 - 13:00 Personalizing Information Retrieval with Multi-Agent Systems Fabrício Enembreck, Jean-Paul Barthès, Braulio Coelho Ávila (Brazil) 13:00 - 13:30 (Part of Session 6: Cooperation in Open Environments) Auction Equilibrium Strategies for Task Allocation in Uncertain Environments David Sarne, Meirav Hadad, Sarit Kraus (Israel) 13:30 - 14:30 Lunch Break 14:30 - 15:30 INVITED TALK Agent-Based Distributed Data Mining: Current Pleasures, and Future Directions. Hillol Kargupta (USA) 15:45 - 17:15 Session 2: Communication ------------------------ 15:45 - 16:15 On the Impact of Agent Communication Languages on the Implementation of Agent Systems Juan Manuel Serrano, Sascha Ossowski (Spain) 16:15 - 16:45 Reasoning about Communication:A Practical Approach based on Empirical Semantics Felix Fischer, Michael Rovatsos (Germany) 16:45 - 17:15 The Evolution of Probabilistic Reciprocity in a Multi-agent Environment with Neighborhoods Enda Ridge, Michael G. Madden, Gerard J. Lyons (Ireland) Tuesday, September 28 ===================== 9:00 - 10:00 NOD 2004 Keynote Talk (Jim Koplien) 10:00 - 10:15 Coffee Break 10:15 - 13:30 Session 3: Recommender Agents, and Systems ------------------------------------------ 10:15 - 10:45 Collaboration Analysis in Recommender Systems using Social Networks Jordi Palau, Miquel Montaner, Beatriz López, Josep Lluís De la Rosa (Spain) 10:45 - 11:15 Qualitative Analysis of User-based and Item-based Prediction Algorithms for Recommendation Agents Manos Papagelis, Dimitris Plexousakis (Greece) 11:15 - 11:45 CIA 2004 System Innovation Award Finalists (1) Running system demonstration; Q&A 11:45 - 12:00 Coffee Break 12:00 - 13:30 CIA 2004 System Innovation Award Finalists (2) Running system demonstrations; Q&A; 13:15 Public voting 13:30 - 14:30 Lunch Break 14:30 - 15:15 INVITED TALK Society-Centred Design for Socially Embedded Multi-Agent Systems. Toru Ishida (Japan) 15:15 - 15:30 Coffee Break 15:30 - 17:00 Session 4: Information Agents and Mobile Computing -------------------------------------------------- 15:30 - 16:00 Agents that Coordinate Devices, Services, and Humans in Ubiquitous Computing Akio Sashima, Noriaki Izumi, Koichi Kurumatani (Japan) 16:00 - 16:30 Multi-Agent Technology as an Enabler of Computer Supported Cooperative Work for the Mobile Workforce Habin Lee, Patrik Mihailescu, John Shepherdson (UK) 16:30 - 17:00 A-globe: Agent Platform with Inaccessibility and Mobility Support David Sislák, Milan Rollo, Michal Pìchouèek (Czech Republic) 17:00 - 17:15 Coffee Break 17:15 - 18:45 Session 5: Industrial Applications ---------------------------------- 17:15 - 17:45 Supply Chain Management using Cooperative Multi-Agent Mode Keonsoo Lee, Wonil Kim, Minkoo Kim (South Korea) 17:45 - 18:15 An agent simulation model for the Québec Forest Supply chain Thierry Moyaux, Brahim Chaib-draa, Sophie D'Amours (Canada) 18:15 - 18:45 Performance analysis of multiagent industrial system Tomasz Babczynski, Zofia Kruczkiewicz, Jan Magott (Poland) 19:30 - 20:30 NOD 2004 NetTogetherMeeting (Welcome Reception) Wednesday, September 29 ======================= 9:00 - 10:00 NOD 2004 Keynote Talk 10:00 - 10:15 Coffee Break 10:15 - 11:45 Session 6: Cooperation in Open Environments ------------------------------------------- 10:15 - 10:45 The RoleX Environment for Multi-Agent Cooperation Giacomo Cabri, Luca Ferrari, Letizia Leonardi (Italy) (re-scheduled for Monday, 13:00 - 13:30) Auction Equilibrium Strategies for Task Allocation in Uncertain Environments David Sarne, Meirav Hadad, Sarit Kraus (Israel) 10:45 - 11:15 Agent's Multiple Inquiries for Enhancing the Partnership Formation Process David Sarne, Sarit Kraus (Israel) 11:15 - 11:45 Special Report Rational Cooperative Agents in Open Environments Matthias Klusch (Germany) 11:45 - 12:00 Coffee Break 12:00 - 13:00 CIA 2004 Open Discussion ------------------------ 13:00 - 13:30 Closing of CIA 2004 ------------------- - CIA 2004 Best Paper Award Giving - CIA 2004 System Innovation Award Giving - CIA 2005 Announcement 13:30 - 14:30 Lunch Break 14:30 -15:15 NOD 2004 Invited Talk 15:15 - 15:30 Coffee Break 15:30 - 19:00 In-Depth CIA 2004 Tutorial -------------------------- Semantic Web Services and Agents Terry Payne (UK) In between: Coffee break 17:00 - 17:15 20:30 - 21:30 NOD 2004 NetObjectNight (Social Event) ================================================================== CIA 2004 is co-sponsored by tranSIT GmbH, Germany Whitestein Technologies, Switzerland Spanish Association for Artificial Intelligence (AEPIA), Spain URJC Decision Engineering Lab (DMR), Spain AgentLink III, EU FP6 Coordinating Action ================================================================== For more information about the workshop please contact Matthias Klusch klusch(a)dfki.de Phone: +49-681-302-5297 http://www.dfki.de/~klusch/

1 0

CfP: Two Workshops in Aarhus, October 2004 (CPN'04 and MOCA'04)
by MOCA'04 30 Jun '04

30 Jun '04

Dear Colleagues, Below please find information about two workshops in Aarhus, Denmark, Oktober 8-13 2004. Please notice that the deadline for submission of papers is August 1. CPN'04 Fifth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools October 8-11, 2004 MOCA'04 Third Workshop on Modelling of Objects, Components, and Agents October 11-13, 2004 The two workshop have a joint full-day tutorial: UML and Coloured Petri Nets Johan Lilius, Åbo Akademi University, Finland Jianli Xu, Nokia Research Center, Helsinki, Finland Didier Buchs and Levi Lúcio, University of Geneva, Switzerland Moverover, the CPN workshop has a full-day tutorial: Application of Coloured Petri Nets to Protocols Jonathan Billington, University of South Australia, Australia Lars M. Kristensen, University of Aarhus, Denmark For more information, please see: http://www.daimi.au.dk/CPnets/workshop04/ Kurt Jensen Daniel Moldt -- Daniel Moldt Universität Hamburg Fachbereich Informatik, TGI Vogt-Koelln-Str. 30 http://www.daimi.au.dk/CPnets/workshop04/ D-22527 Hamburg

1 0

Re: [Haskell] Help in understanding a type error involving forall and class constraints
by MR K P SCHUPKE 30 Jun '04

30 Jun '04

> Then we get the problem when we use difST in distString. I no such problem. The Glorious Glasgow Haskell Compilation System, version 6.3 ghc -H32m -Wall -O2 -fvia-C -optc-O2 -optc-march=pentium3 -optc-mfpmath=sse -fexcess-precision -fliberate-case-threshold100 -funbox-strict-fields -threaded -c Diff.hs -i../.. -syslib net +RTS -K100000000 Diff.hs: Warning: Module `Data.Array.MArray' is imported, but nothing from it is used (except perhaps instances visible in `Data.Array.MArray') Diff.hs:159:13: Warning: Defined but not used: br ...??... Of course the obvious way to have somewhere to put the class is to turn the let into a function: for example like: distString :: String -> String -> Int distString s0 s1 = f (runST (difST s0 s1)) f :: IArray a Int => a (Int,Int) Int -> Int f a = a!(1,1) ... or a non polymorphic version: f :: UArray (Int,Int) Int -> Int f a = a!(1,1) Keean.

1 0

ICTAC2004 Call for papers: Deadline is Approaching soon
by QIN Shengchao 30 Jun '04

30 Jun '04

[Appologies if you received multiple copies] CALL FOR CONTRIBUTION: ICTAC 2004 FIRST INTERNATIONAL COLLOQUIUM ON THEORETICAL ASPECTS OF COMPUTING Guiyang, China 20 - 24 September 2004 http://www.iist.unu.edu/ICTAC2004 --- It is planned to publish the accepted papers after the conference in revised full version in the Springer Lecture Notes in Computer Science series --- Your submission is an appreciated support to the UNU-IIST (http://www.iist.unu.edu) mission to help developing countries to advance their education and research in computer science --- The colloquium program will include very 6 good tutorials AIMS AND OBJECTIVES The International Institute for Software Technology of the United Nations University (UNU-IIST) decides to found an International Colloquium on Theoretical Aspects of Computing (ICTAC). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing. We believe that this will help the developing countries to strengthen their research, teaching and development in computer science and engineering, to improve the links between developing countries and developed countries, and to establish collaboration in research and education. The technical program lasts five days including two days for tutorials and three days for a workshop. We plan to organize such a colloquium every 18 months jointly with a UNU-IIST training school in a developing country, and each time there will be a theme and a focus. The school participants will also attend the technical program of the colloquium. A small registration fee will be charged to cover meals tutorial handouts and proceedings only. There will be also a limited amount of grant that participants, tutorial and workshop speakers from developing countries can apply. Application should be submitted together with their tutorial proposals or papers to the workshop. The first ICTAC will be jointly organized by the Guizhou Academy of Sciences and UNU-IIST during 20-24 September 2004. SCOPE AND TOPICS ICTAC 2004 calls for tutorials in the areas of theoretical aspects of computing including automata, languages, software engineering and formal methods and solicits research papers for the workshop related to, but not limited to, the following principal topics: * automata theory and formal languages * principle and semantics of programming languages * logics and their applications * software architectures and their description languages * formal techniques in MDA * software specification, refinement and verification * model checking and theorem proving *formal techniques in software testing * models of object and component system * coordination and feature interaction * integration of formal and engineering methods * service-oriented development * document-driven development * models of concurrency, security and mobility * theory of parallel, distributed and internet-based (Grid) computing *Boolean satisfiability (SAT) * real-time and embedded systems * type and category theory in computer science SUBMISSIONS OF TUTORIAL PROPOSALS Proposals should be approximately five pages and must include the following information: * contents including abstract and syllabus/contents * duration of the tutorial (2 hours - 6 hours) * intended audience including prerequisites * biography of presenter * any special requirements (e.g., software/hardware for tool demo, software/hardware requirements for participants) Please send proposals (in postscript or PDF format) via email directly to the Program Chair Zhiming Liu at lzm(a)iist.unu.edu. SUBMISSIONS TO THE WORKSHOP Submissions to the workshop must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the workshop. It is planned to publish the accepted papers after the conference in revised full version in the Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html) Papers should be written in English and not exceed 15 pages in LNCS format: see. http://www.springer.de/comp/lncs/authors.html for details. Further information and instructions about submissions can be found on the colloquium website http://www.iist.unu.edu/ICTAC2004. Authors are strongly encouraged to use this website to submit their papers in electronic form. IMPORTANT DATES Submission deadline of papers: 05 July 2004 Notification of acceptance: 09 August 2004 Final version due: 30 August 2004 Submission deadline of tutorial proposal 21 June 2004 Notification of acceptance 12 July 2004 Tutorials 20, 21 September 2004 Workshop 22 - 24 September 2004 INVITED SPEAKERS Jos Luiz Fiadeiro (University of Leicester, UK) Jifeng He (UNU-IIST, Macao) K. Rustan M. Leino (Microsoft Research, WA, USA) Huimin Lin (Institute of Software, CAS, Beijing, China) Program Committee Chairs Keijiro Araki (Kyushu University, Japan) Zhiming Liu (UNU/IIST, Macao SAR China) Publicity Chairs Bernhard Aichernig (UNU/IIST, Macao) Dan Li (Academy of Sciences, Guizhou, China) Finance Chair Danning Li (Academy of Sciences, Guizhou, China) Organization Chair Danning Li (Academy of Sciences, Guizhou, China) Advisory Committee Dines Bj?rner (Denmark), Manfred Broy (Germany), Jose Luiz Fiadeiro (University of Leicester, UK), Jifeng He (UNU-IIST), Mathai Joseph (India), Shaoying Liu (Japan), Zhiming Liu (UNU-IIST), Jim Woodcock (UK) Program Committee Luis S. Barbosa (University of Minho, Portugal) Gabriel Baum (National University of La Plata, Argentina) Hubert Baumeister (LMU, Munich, Germany) Jonathan Bowen (London South Bank University, UK) Cristian S. Calude (University of Auckland, New Zealand) Ana Cavalcanti (University of Kent, UK) Wei Ngan Chin (NUS, Singapore) Jim Davies (Oxford University, UK) Henning Dierks (University of Oldenburg, Germany) Jin Song Dong (NUS, Singapore) Wan Fokkink (CWI, the Netherlands) Michael R. Hansen (DTU, Lyngby, Denmark) James Harland (RMIT University, Melbourne, Australia) Jozef Hooman (Embedded Systems Institute, Eindhoven, the Netherlands) Guoxing Huang (ECNU, Shanghai, China) Purush Iyer (North Carolina State University, USA) Ryszard Janicki (McMaster University, Ontario, Canada,) Michael Johnson( Macquarie University, Sydney, Australia) Fabrice Kordon (University of Paris VI, France) Maciej Koutny (University of Newcastle upon Tyne, UK) Kung-Kiu Lau (Manchester University, UK) Antnia Lopes (University of Lisbon, Portugal) Jian Lu (Nanjing University, China) Andrea Maggiolo-Schettini (University of Pisa, Italy) Huaikou Miao (Shanghai University, China) Paniti Netinant (Bangkok University, Thailand) Paritosh Pandya (TIFR, Mumbai, India) Zongyan Qiu (Peking University, Beijing, China) Anders P. Ravn (Aalborg University, Denmark) Gianna Reggio (University of Genova, Italy) Riadh Robbana (LIP2/EPT, Tunisia) Augusto Sampaio (Federal Univ of Pernambuco, Recife, Brazil) Bernhard Schatz (TU Munchen, Germany) Irek Ulidowski (University of Leicester, UK) Miroslav Velev (Carnegie Mellon University, USA) Ji Wang (National Lab for Parallel and Distributed Processing, China) Wang Yi (Uppsala University, Swiden) Jian Zhang (Institute of Software, CAS, China) Mingyi Zhang (Academic of Sciences, Guizhou, China) Hongjun Zheng (Semantics Designs Inc, USA)

1 0

Re: [Haskell] Help in understanding a type error involving forall and class constraints
by MR K P SCHUPKE 29 Jun '04

29 Jun '04

Try this: distString :: String -> String -> Int distString s0 s1 = let a = runST (difST s0 s1) in a!(1,1) difST :: MArray (STUArray s) Int (ST s) => String -> String -> ST s (UArray (Int,Int) Int) difST s0 s1 = do b@(_,br) <- return $ (\x1 y1 -> ((0,0),(x1,y1))) (length s0) (length s1) d <- newArray b 0 :: ST s (STUArray s (Int,Int) Int) mdiff d s0 s1 -- readArray d br unsafeFreeze d Keean.

2 1

Re: [Haskell] Help in understanding a type error involving forall and class constraints
by MR K P SCHUPKE 29 Jun '04

29 Jun '04

Erm, something I remember about needing MArrays... Here's something which does the same thing (cooks and MArray then freezes it - also using STUArray... The neat thing is MArray is a class, so you can swap between STUArray and STArray implementations without changing code. This is the classic dynamic programming version of string difference: distString :: String -> String -> Int distString s0 s1 = runST (difST s0 s1) difST :: MArray (STUArray s) Int (ST s) => String -> String -> ST s Int difST s0 s1 = do b@(_,br) <- return $ (\x1 y1 -> ((0,0),(x1,y1))) (length s0) (length s1) d <- newArray b 0 :: ST s (STUArray s (Int,Int) Int) mdiff d s0 s1 readArray d br mMin :: Int -> Int -> Int -> Int mMin i j k = min (min i j) k costDelete :: Char -> Int costDelete _ = 1 costInsert :: Char -> Int costInsert _ = 1 costReplace :: Char -> Char -> Int costReplace _ _ = 1 mdiff :: MArray a Int m => a (Int,Int) Int -> String -> String -> m () mdiff (d :: a e i) s0 s1 = do writeArray d (0,0) 0 foreach 1 s0 $ \x a -> do dx <- readArray d (x-1,0) writeArray d (x,0) (dx+costDelete a) foreach 1 s1 $ \y b -> do dy <- readArray d (0,y-1) writeArray d (0,y) (dy+costInsert b) foreach 1 s0 $ \x a -> do foreach 1 s1 $ \y b -> do dx <- readArray d (x-1,y) dy <- readArray d (x,y-1) dxy <- readArray d (x-1,y-1) writeArray d (x,y) $ mMin (dx+costDelete a) (dy+costInsert b) (if a==b then dxy else dxy+costReplace a b) where foreach :: MArray a Int m => Int -> String -> (Int -> Char -> m ()) -> m () foreach _ [] _ = return () foreach i (c0:cs) f = do f i c0 foreach (i+1) cs f ------------------------------------ Keean.

2 1