- Haskell - Haskell.org

ANNOUNCE: feldspar-language
by Emil Axelsson 04 Nov '09

04 Nov '09

I'm happy to announce the first release of Feldspar, which is an embedded domain-specific language with associated code generator mainly targeting DSP algorithms. The language is developed in cooperation by Ericsson, Chalmers University and Eötvös Loránd University. Feldspar stands for *F*unctional *E*mbedded *L*anguage for *DSP* and *PAR*allelism. The language front-end is available on Hackage: http://hackage.haskell.org/package/feldspar-language The back-end C code generator will be uploaded and announced shortly. For more information, see: http://feldspar.sourceforge.net/ / Emil

1 0

about verification of haskell program
by Liu Jian 03 Nov '09

03 Nov '09

Dear all, Is there any work about "model checking haskell program"? In my opinion, think the haskell as a specification language, then we can check it or transform it to other specification language (such as, promela), so can be analyzed. cheers, Liu Jian ---- email to: gjk.liu(a)gmail.com

1 0

ANNOUNCE: control-monad-exception 0.5 with monadic call traces
by Jose Iborra 02 Nov '09

02 Nov '09

Folks, I'm happy to announce a new release of control-monad-exception with monadic call traces, available in Hackage. Grab it now while it is still online! Monadic stack traces are described in detail in a blog post [1]. In short, what this means for your code is the ability to generate errors like this: 500 Internal Server Error The CGI server failed with the following error: DeleteException (BmPK 2009-10-26 19:39:51.031297 UTC "Testing RPO") in deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (186, 44) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (186, 25) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (184, 17) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (180, 90) deleteTests, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (108, 3) deleteTests, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (106, 20) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (52, 33) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (52, 30) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (50, 9) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (46, 11) Currently a preprocessor is used to insert the source location information in the right places. The preprocessor is invoked by including the following pragma at the top of your Haskell source files: {-# OPTIONS_GHC -F -pgmF MonadLoc #-} In addition, you need to be in a monad which implements the Monadloc interface, currently the EMT monad from control-monad-exception being the only one, although it is trivial to enhance any error monad to implement this interface. In addition, support for monadic stack traces could be built into GHC and: 1. No preprocessor would be needed. 2. Eventually the IO monad could be enhanced to provide stack traces like this. Enjoy your monadic call traces ! Pepe Iborra [1] - http://pepeiborra.posterous.com/monadic-stack-traces-that-make-a-lot-of-sen…

1 0

two PhD positions in static analysis, Technical University Munich, Germany
by Axel Simon 02 Nov '09

02 Nov '09

Dear all, The chair II for computer science at the Technical University Munich is offering two PhD positions in the area of program analysis. The first position ("low-level analysis") is centered around defining an implementing an analysis of x86 assembler code and, in particular, of concurrency constructs. The second position ("high-level analysis") is geared towards the analysis of data structures (aka shape analysis) using numeric invariants. The intention is to extend an existing analyzer that performs a forward-reachability analysis with the aim to prove the absence of memory management errors and other defects in legacy C software. This analyzer is written in Haskell. first position: low-level analysis ---------------------------------- Most program analysis tools operate on the source code, usually C, since information on variable types, data structures and basic blocks is not available in the executable. One problem with this approach is the definition of the exact semantics of C source code as many constructs commonly found in hand-written programs are ``implementation-dependent'' or even ``undefined'' according to the C standard. These uncertainties are exacerbated when analyzing programs that make use of concurrency constructs. The goal is therefore to directly analyze the resulting x86 machine code and to reconstruct the control flow graph and data structures on-the-fly. The analysis of concurrent programs moreover requires that (abstract) states are propagated between different threads. The challenge here lies in storing a minimum number of abstract states (to reduce the memory requirements) and to get away with a minimum amount of propagation between threads. ------------------------------------- second position: high-level analysis ----------------------------------- One recurring challenge in analysing programs is the precise summarization of data structures. This so-called shape analysis commonly uses logic formulae (e.g. separation logic) to describe a data structure contained in a memory region. In this approach, a predicate must be present that describes the invariant (e.g. "list(p)" might mean that p points to a memory region containing a singly-linked list). If no predicate is available that matches the data structure that is being built by a program, the logic formula must be discarded in order to ensure termination, thereby discarding both, the shape of a memory region and the information on how it is connected to other memory regions. The goal of this position is to find novel abstractions that infer the shape of a memory region and its connection to other memory regions separately. The connection to other memory regions are then annotated with numeric variables that denote how many memory regions are reachable via the connection. The values of these variables is then tracked separately, allowing a more graceful loss of precision. am only the numeric information needs to be relaxed since number of different shapes is fixed by the structure of the program. ------------------------------------- Both positions are fully funded for 4 years and do not come with any teaching duties. The PhD students may start as soon as January 1, 2010. The salary is TVL E13 (about 2900 EUR/1650 EUR per month). The positions are part of the Emmy Noether Programme "Verifying Legacy C Programs using Numeric Domains" which is headed by Axel Simon. This project, in turn, is located within the chair of Helmut Seidl. The PhD students will be supervised by Axel Simon. What you should provide: - Master (or equivalent) degree in Computer Science or Maths - good programming skills - an interest in compiler construction, program optimization and the like - not afraid of discrete maths, lattices etc. - good writing skills in English and Haskell - an electronic application including detailed CV by December 1 (later applications may not be considered) Contact: Please send applications and any enquiries to: Axel.Simon(a)ens.fr

1 0

Haskell Weekly News: Issue 137 - October 31, 2009
by jfredett＠gmail.com 31 Oct '09

31 Oct '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091031 Issue 137 - October 31, 2009 --------------------------------------------------------------------------- Welcome to issue 137 of HWN, a newsletter covering developments in the [1]Haskell community. This week brings a new release of xmonad, some cool bindings to allow interaction with GNOME, KDE, and XFCE desktops and a new version of haskell-mode for the lesser of two editors... Some progress has also been made on the new HWN software, though this was mitigated by the fact that I started playing with the Isabelle theorem prover (after reading about Haskabelle) and so now I find myself convinced I should formally prove all of my software, and also that I'm pretty much incapable of getting things done when cool tools present themselves. In fact, I don't think I'll even be able to finish this [2]editori* [3]Exception: The Haskell Weekly News! Announcements xmonad 0.9 is now available! Don Stewart [4]announced a new version of everyone's favorite Tiling Window Manager, xmonad! The changes and improvments are too numerous to mention, see the post for details! WFLP2010 2nd CFP: LNCS + invited speaker + abstract due Nov 9. Pablo Nogueira [5]announced a second call for papers for the Workshop on Functional and Constraint Logic Programming. dbus-core 0.5 and dbus-client 0.1. John Millikin [6]announced pure-Haskell client libraries for using the D-Bus protocol. D-Bus is heavily used for inter-application IPC on Free and open-source desktop platforms, such as Linux, OpenSolaris, and FreeBSD. These libraries allow applications written in Haskell to inter-operate with other components of recent GNOME, KDE, and XFCE desktops. Singapore Functional Programmer Group First Meetup. Kenny Lu [7]announced (with apologies for the late notice) an informal meeting for the Functional Programmer Group in Singapore on 2 Nov 2009. The theme for the first meeting will be 'meet and greet'. GeBoP 1.7. Henk-Jan van Tuyl [8]updated and cabalized GeBoP (the General Boardgames Player) and uploaded it to hackage. GPS package on Hackage. Thomas DuBuisson [9]announced that he fixed up the GPS package to add correct distance calculation and a separate module for exporting KML. GPipe-TextureLoad 1.0.0 and GPipe 1.0.3. Tobias Bexelius [10]announced a new version of GPipe as well as a utility package for loading textures. HoleyMonoid-0.1. Martijn van Steenbergen [11]announced announce the first release of HoleyMonoid, a datatype that helps you build monoids with holes in them. The holes are filled in later using normal function application. GlomeVec, IcoGrid. Jim Snow [12]announced a couple of packages, GlomeVec is a vector library used in Jim's ray-tracer, and IcoGrid is a library for dealing with grids of hexagons and pentagons wrapped on a sphere. attempt-0.0.0. Michael Snoyman [13]announced a new package for exceptions haskell-mode 2.5. Svein Ove Aas [14]announced a new version of haskell-mode for that other 'editor'... Discussion Applicative but not Monad. Yusaku Hashimoto [15]asked about an example of a datatype that was an instance of Applicative, but not an instance of Monad. AND/OR Perceptron. Hector Guilarte [16]asked about how to understand a particular portion of JP Moresmau's [17]Perceptron in Haskell What is the current state of affairs with supercompilation? Eugene Kirpichov [18]asked about supercompilation in Haskell. Blog noise [19]Haskell news from the [20]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Magnus Therning: [21]Playing with sockets in Haskell. * Holumbus: [22]Switched to Git. * Manuel M T Chakravarty: [23]Finally found the ghci bug on Snow Leopard. * Galois, Inc: [24]Tech Talk: Testing First-Order-Logic Axioms in AutoCert. * Brent Yorgey: [25]Collecting Attributes. * Darcs: [26]darcs weekly news #44. * FP Lunch: [27]Parser Combinators are as expressive as possible. * David Amos: [28]Simple groups, the atoms of symmetry. * Xmonad: [29]xmonad 0.9 available now!. * Michael Snoyman: [30]Introduction to attempt error reporting library. * FP-Syd: [31]Sydney FP Group: FP-Syd #20.. Quotes of the Week * hexpuem: [on learning haskell] the best way is to shove a SD card up your nose with learn yourself a haskell good on it * copumpkin: copumpkin: 'YOU ARE SUCH A PULLBACK' copumpkin: 'YOU KNOW WHAT? I FUNCTORED YOUR MOTHER LAST NIGHT' * saml and mauke: saml: 'How can I convert python file to haskell?' mauke: 'By piping it through a programmer' * monochrom: premature generality is the root of OOP * EvilTerran: {-# LANGUAGE FlexibleMorals #-} -- needed for unsafeLaunchMissiles * Warrigal: Hey, the module loaded. I didn't expect that. * lilac: class Monad m where return and Kleisli compose must form a monoid About the Haskell Weekly News New editions are posted to [32]the Haskell mailing list as well as to [33]the Haskell Sequence and [34]Planet Haskell. [35]RSS is also available, and headlines appear on [36]haskell.org. To help create new editions of this newsletter, please see the information on [37]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [38]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://uncyclopedia.wikia.com/wiki/Haskell 3. http://www.reddit.com/r/haskell/comments/9yt9m/haskell_is_an_obscure_and_mo… 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65286 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17596 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65436 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65406 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65384 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65326 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65320 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65311 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65294 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65281 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65268 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65418 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65393 17. http://jpmoresmau.blogspot.com/2007/05/perceptron-in-haskell.html 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65227 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://therning.org/magnus/archives/778 22. http://holumbus.fh-wedel.de/blog/?p=25 23. http://justtesting.org/post/227629236 24. http://www.galois.com/blog/2009/10/28/ahn-autocert/ 25. http://byorgey.wordpress.com/2009/10/28/collecting-attributes/ 26. http://blog.darcs.net/2009/10/darcs-weekly-news-44.html 27. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=271 28. http://haskellformaths.blogspot.com/2009/10/simple-groups-atoms-of-symmetry… 29. http://xmonad.wordpress.com/2009/10/26/xmonad-0-9-available-now/ 30. http://blog.snoyman.com/2009/10/25/introduction-to-attempt-error-reporting-… 31. http://www.mega-nerd.com/erikd/Blog/FP-Syd/fp-syd-20.html 32. http://www.haskell.org/mailman/listinfo/haskell 33. http://sequence.complete.org/ 34. http://planet.haskell.org/ 35. http://sequence.complete.org/node/feed 36. http://haskell.org/ 37. http://haskell.org/haskellwiki/HWN 38. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

ANNOUNCE: dbus-core 0.5 and dbus-client 0.1
by John Millikin 30 Oct '09

30 Oct '09

These are pure-Haskell client libraries for using the D-Bus protocol. D-Bus is heavily used for inter-application IPC on Free and open-source desktop platforms, such as Linux, OpenSolaris, and FreeBSD. These libraries allow applications written in Haskell to inter-operate with other components of recent GNOME, KDE, and XFCE desktops. This is the first "real" release of these libraries; dbus-core has been published on Hackage for some time, but mostly just to make sure I got the Cabal bits right. I feel they are now stable / featureful enough for public use. Both are available on Hackage: http://hackage.haskell.org/package/dbus-core http://hackage.haskell.org/package/dbus-client --------- "dbus-core" is an implementation of the D-Bus protocol, specifically the parts relevant to clients. Eventually, it will probably grow some functions useful for implementing a message bus as well. It includes type mapping / conversion, an implementation of the wire format (marshaling / unmarshaling), data types for the currently defined message types (METHOD_CALL, METHOD_RETURN, ERROR, and SIGNAL) and a basic parser / generator for introspection documents. It is roughly equivalent in purpose to libdbus. By itself, a protocol implementation is somewhat cumbersome to use, so "dbus-client" is a high-level wrapper. It provides some abstractions like remote object proxies, exported object trees, synchronous method calls, signal reception, and name reservation. Messages are received and processed in separate IO threads, allowing asynchronous method call and signal handling. The purpose between splitting the library into two packages is stability; "dbus-core", ideally, will change only rarely -- performance improvements, new message / data types, etc. It provides a base level of functionality which more specialised libraries may use. "dbus-client" is an example of what such a library could look like, though for now it's not very Haskell-y (IO everywhere, exceptions, explicit locking). By separating the protocol from the client libs, alternative client libs can safely depend on the protocol implementation. --------- To see a sample of the library working, there's a clone of the "dbus-monitor" utility in <dbus-core/Examples>. Documentation is currently a bit lacking, so for now, the best documentation is the PDF of the source code itself, and the (rather barren) Haddock output: https://dl.getdropbox.com/u/1947532/dbus-core_0.5.pdf https://dl.getdropbox.com/u/1947532/dbus-core_0.5/index.html https://dl.getdropbox.com/u/1947532/dbus-client_0.1.pdf https://dl.getdropbox.com/u/1947532/dbus-client_0.1/index.html Once more people have used it without any major API issues, I'll write up a manual and populate the Haddock entries. Please respond with any feedback, difficulties, or suggestions. I'm particularly interested in ways to improve the public API, since I would rather make any breaking changes *before* anything big depends on these libraries.

1 0

ANNOUNCE: GeBoP 1.7
by Henk-Jan van Tuyl 29 Oct '09

29 Oct '09

L.S., I have updated and cabalized Daan Löffler's GeBoP and uploaded it to Hackage. GeBoP, the General Boardgames Player, offers a set of board games: Ataxx, Bamp, Halma, Hez, Kram, Nim, Reversi, TicTacToe, and Zenix. The application also features a brain viewer which enables you to explore the computer's internal game tree. The homepage is: http://www.haskell.org/haskellwiki/GeBoP Regards, Henk-Jan van Tuyl -- http://functor.bamikanarie.com http://Van.Tuyl.eu/ --

1 0

ANNOUNCE: regular-0.2 and regular-extras-0.1
by José Pedro Magalhães 28 Oct '09

28 Oct '09

Hello all, I'm pleased to announce a new version of the regular library which provides generic programming with fixed points for regular datatypes. Many generic programs require information about the recursive positions of a datatype. Examples include the generic fold, generic rewriting, and the Zipper data structure. This approach provides a fixed point view on data which allows these definitions for regular datatypes. It can be seen as a simplification of the Multirec library, which provides similar functionality but for families of (possibly mutually recursive) datatypes. This library is the underlying generic representation mechanism in the paper: Thomas van Noort, Alexey Rodriguez, Stefan Holdermans, Johan Jeuring, Bastiaan Heeren. A Lightweight Approach to Datatype-Generic Rewriting. In Ralf Hinze and Don Syme, editors, Proceedings of the ACM SIGPLAN Workshop on Generic Programming, WGP 2008, Victoria, BC, Canada, September 20, 2008, pages 13–24. ACM Press, 2008. http://people.cs.uu.nl/stefan/pubs/noort08lightweight.html More information is available on the webpage: http://www.cs.uu.nl/wiki/GenericProgramming/Regular Additionally, we have also released a regular-extras package which provides more generic functions operating on the fixed point view provided by regular. Currently the functions provided are: * QuickCheck's arbitrary, with an option to provide size, and frequencies for each constructor; * QuickCheck's coarbitrary; * Data.Binary get and put. Features -------- * A simple library with a fixed point view * Includes detailed examples, such as the generic fold * Forms the basis for a generic rewriting library: http://hackage.haskell.org/package/rewriting * In its current form, this library does not support nested datatypes. Support to access parameters of a datatype is limited. Requirements ------------ * GHC 6.10.1 or later * Cabal 1.2.1 or later Download -------- With cabal-install: cabal install regular cabal install regular-extras Get the packages: http://hackage.haskell.org/package/regular http://hackage.haskell.org/package/regular-extras Get the source: svn checkout https://subversion.cs.uu.nl/repos/project.dgp-haskell.libraries/regular/ svn checkout https://subversion.cs.uu.nl/repos/project.dgp-haskell.libraries/regular-ext… Bugs & Support -------------- Report issues, request features, or just discuss the library with the authors, maintainers, and other interested persons at: http://www.haskell.org/mailman/listinfo/generics Pedro

1 0

ANN: WFLP2010 2nd CFP: LNCS + invited speaker + abstract due Nov 9
by Pablo Nogueira 27 Oct '09

27 Oct '09

******************************************************************** Second Call For Papers 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Abstract Submission: November 9, 2009 Full Paper Submission: November 15, 2009 Acceptance Notification: December 15, 2009 Preliminary Proceedings: January 5, 2010 Workshop: January 17, 2010 SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. The previous WFLP editions are: WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). LOCATION WFLP 2010 will be held on January 17, 2010 in Madrid, Spain, colocated with the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010). WFLP 2010 solicits papers in all areas of functional and (constraint) logic programming, including but not limited to: * Foundations: formal semantics, logic variables, binding and abstract syntax, rewriting and narrowing, unification, constraint solving, dynamics, type theory, meta-theory, effects, etc. * Language Design: security, services, modules, type systems, multi-paradigm languages, concurrency and distribution, objects, libraries, generic programming, interoperability, etc. * Implementation: abstract machines, parallelism, compile-time and run-time optimizations, foreign-language interfaces, memory management, multi-threading, exploiting parallel hardware, etc. * Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, program calculation, program proof, meta-programming, generative programming, etc. * Software Development: algorithms, data structures, design patterns, components and composition, specification, proof assistants, verification and validation, model checking, debugging, testing, profiling, tracing, etc. * Paradigm Integration: integration of declarative programming with other paradigms or features such as imperative, object-oriented, aspect-oriented, concurrent, real-time programming, event-driven architectures, etc. * Applications: education, industry, commercial uses, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, XML processing, artificial intelligence, knowledge representation and machine learning, deductive databases, advanced programming environments and tools, etc. SUBMISSIONS and PROCEEDINGS Authors are invited to submit papers presenting original unpublished work. Papers must be at most 15 pages long. Exceptionally, authors may surpass the page limit by providing well-marked appendices intended as reviewing aids. Appendices will not appear in the final publication. Submission categories include regular research papers, system descriptions, and short papers describing on-going work (at most 8 pages). Submissions must be formatted in Lecture Notes in Computer Science (LNCS) style. This requirement needs not apply to appendices. Papers should be submitted in pdf format electronically via the web-based submission site http://www.easychair.org/conferences/?conf=wflp2010 Preliminary proceedings will be available at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. Contributions accepted for the post-workshop proceedings will be published in Springer's Lecture Notes in Computer Science series. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada)

1 0

RE: ANN: GPipe-TextureLoad 1.0.0 and GPipe 1.0.3
by Tobias Bexelius 27 Oct '09

27 Oct '09

I accidently missed a spot in the latest GPipe bugfix, this is fixed in version 1.0.4 that I've just uploaded. Sorry for that. /Tobias Bexelius From: tobias_bexelius(a)hotmail.com To: haskell-cafe(a)haskell.org; haskell(a)haskell.org; hopengl(a)haskell.org Subject: ANN: GPipe-TextureLoad 1.0.0 and GPipe 1.0.3 Date: Mon, 26 Oct 2009 22:37:01 +0100 I've uploaded a new version of GPipe as well as a utility package for loading textures. GPipe 1.0.3: * Fixes a major bug in the shader generation GPipe-TextureLoad 1.0.0: * Helps loading GPipe textures from file. It is based on the stb-image package, and supports subsets of the JPG, PNG, TGA, BMP and PSD formats. kolla in resten av Windows LiveT. Inte bara e-post - Windows LiveT är mycket mer än din inkorg. Mer än bara meddelanden _________________________________________________________________ Hitta kärleken nu i vår! http://dejting.se.msn.com/channel/index.aspx?trackingid=1002952

1 0