January 2013 - Haskell

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 15
by Doaitse Swierstra 02 May '13

02 May '13

Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous four occasions students were all very happy with the school and we plan to repeat this success this year. Among the intended audience are prospective master students who gained an interest in Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In previous years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/USCS/ -- on this page you can find the poster you can print and hang somewhere (why not your office door): Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra, Atze Dijkstra and Johan Jeuring

2 1

Silent error
by miphis＠meta.ua 16 Feb '13

16 Feb '13

The program looks like this: --*********************** factorial :: Int->Int factorial n = product [1..n] main = do print $ factorial 50 --*********************** And that yields "0" (no errors). Is it a bug or feature? :) ______________________________ Акция! Скидка до - 50% на колготы зимних коллекций в Линии магазинов EVA! http://go.meta.ua/eva_colgotes

4 3

Haskell Weekly News: Issue 256
by Daniel Santa Cruz 31 Jan '13

31 Jan '13

Welcome to issue 256 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the weeks of January 20 to 26, 2013. Quotes of the Week * elliott: cmccann: unfortunately it is too perfect an abstraction to be useful. * SamanthaD: shachaf: you're one of those dirty imperative communists who want the state to dictate everything! * monochrom: I refuse camel case and mark zuckerberg. same level. not negotiable. * mauke: a newtype is like an existing type but wearing glasses and a fake mustache and a sign saying "you've never seen me before" Top Reddit Stories * Taking magic out of GHC or: Tracing compilation by transformation (intro to Core transformations, inlining,.. Domain: ics.p.lodz.pl, Score: 59, Comments: 2 On Reddit: [1] http://goo.gl/lJmsb Original: [2] http://goo.gl/IbJ5O * Introduction to Haskell IO Domain: haskellforall.com, Score: 57, Comments: 26 On Reddit: [3] http://goo.gl/fPky4 Original: [4] http://goo.gl/Xymbr * The longest type signature I have ever seen (package Nussinov78) Domain: i.imgur.com, Score: 48, Comments: 26 On Reddit: [5] http://goo.gl/ePwNs Original: [6] http://goo.gl/B74yW * There is now a patch for the GHC runtime system which implements a scheduler which can handle threads with priorities. Domain: hackage.haskell.org, Score: 47, Comments: 12 On Reddit: [7] http://goo.gl/22XgH Original: [8] http://goo.gl/8iC8w * Success story: novice haskeller moves console cursor with “netwire” FRP library Domain: danbst.wordpress.com, Score: 43, Comments: 8 On Reddit: [9] http://goo.gl/dm8ga Original: [10] http://goo.gl/Ue7pK * Haskell as pseudo code Domain: arxiv.org, Score: 33, Comments: 2 On Reddit: [11] http://goo.gl/JL8Mf Original: [12] http://goo.gl/5D4zV * Generalizing do notation Domain: self.haskell, Score: 28, Comments: 19 On Reddit: [13] http://goo.gl/teYAD Original: [14] http://goo.gl/teYAD * Tutorial: Up-front Unit Testing in Haskell Domain: github.com, Score: 26, Comments: 21 On Reddit: [15] http://goo.gl/kjzYJ Original: [16] http://goo.gl/oB2jg * The Design of a Practical Proof Checker for a Lazy Functional Language [PDF] Domain: people.cs.missouri.edu, Score: 26, Comments: On Reddit: [17] http://goo.gl/sj5Aj Original: [18] http://goo.gl/eEUOj * Introduction to Haskell, Lecture 2 is Live Domain: shuklan.com, Score: 24, Comments: 4 On Reddit: [19] http://goo.gl/1nUVv Original: [20] http://goo.gl/rCbfx * Hugs in your browser Domain: tryhaskell.org, Score: 24, Comments: 21 On Reddit: [21] http://goo.gl/zNtex Original: [22] http://goo.gl/wMPPW * Free functors - the reason Free and operational are not equivalent Domain: self.haskell, Score: 24, Comments: 12 On Reddit: [23] http://goo.gl/E7qe7 Original: [24] http://goo.gl/E7qe7 * Scribbling, smudging and smearing with Haskell Domain: self.haskell, Score: 22, Comments: 108 On Reddit: [25] http://goo.gl/KBw0V Original: [26] http://goo.gl/KBw0V * Touch and Keyboard API (announcing Elm 0.7.1) Domain: elm-lang.org, Score: 20, Comments: 3 On Reddit: [27] http://goo.gl/OhFaH Original: [28] http://goo.gl/rV9bU * (re)implementing the generalised Functor strength function using lenses. Domain: statusfailed.com, Score: 20, Comments: 3 On Reddit: [29] http://goo.gl/gEYHr Original: [30] http://goo.gl/TDX2A Top StackOverflow Questions * Can using UndecidableInstances pragma locally have global consequences on compilation termination? votes: 20, answers: 1 Read on SO: [31] http://goo.gl/PcQF1 * Why doesn't GHC Haskell support overloaded record parameter names? votes: 14, answers: 1 Read on SO: [32] http://goo.gl/BJ71T * How much does it cost for Haskell FFI to go into C and back? votes: 14, answers: 2 Read on SO: [33] http://goo.gl/kUCKn * Compile unsafe Haskell votes: 13, answers: 1 Read on SO: [34] http://goo.gl/nGaCX * Why GADT/existential data constructors cannot be used in lazy patterns? votes: 12, answers: 2 Read on SO: [35] http://goo.gl/zhpCh * Correct design for Haskell exception handling votes: 11, answers: 2 Read on SO: [36] http://goo.gl/zeWoH * How to use phase control of inlining in haskell? votes: 10, answers: 0 Read on SO: [37] http://goo.gl/dyuGI * Looking for resources that help testing a Haskell implementation for standard conformance votes: 9, answers: 1 Read on SO: [38] http://goo.gl/DL7vY * Generate a C struct based on a complex Haskell type votes: 8, answers: 1 Read on SO: [39] http://goo.gl/7E8OT * How to structure a Haskell project? votes: 7, answers: 1 Read on SO: [40] http://goo.gl/J4GuA * Difference between two functions creating a singleton list votes: 7, answers: 3 Read on SO: [41] http://goo.gl/ZXzw0 Until next time, Daniel Santa Cruz References 1. http://ics.p.lodz.pl/~stolarek/blog/2013/01/taking-magic-out-of-ghc-or-trac… 2. http://www.reddit.com/r/haskell/comments/17bu54/taking_magic_out_of_ghc_or_… 3. http://www.haskellforall.com/2013/01/introduction-to-haskell-io.html 4. http://www.reddit.com/r/haskell/comments/17712e/introduction_to_haskell_io/ 5. http://i.imgur.com/Zv9JH9A.png 6. http://www.reddit.com/r/haskell/comments/178jwh/the_longest_type_signature_… 7. http://hackage.haskell.org/trac/ghc/ticket/7606 8. http://www.reddit.com/r/haskell/comments/1725g0/there_is_now_a_patch_for_th… 9. http://danbst.wordpress.com/2013/01/23/novice-netwire-user/ 10. http://www.reddit.com/r/haskell/comments/173cxi/success_story_novice_haskel… 11. http://arxiv.org/abs/1301.5076 12. http://www.reddit.com/r/haskell/comments/176xk0/haskell_as_pseudo_code/ 13. http://www.reddit.com/r/haskell/comments/16zrsp/generalizing_do_notation/ 14. http://www.reddit.com/r/haskell/comments/16zrsp/generalizing_do_notation/ 15. https://github.com/kazu-yamamoto/unit-test-example/blob/master/markdown/en/… 16. http://www.reddit.com/r/haskell/comments/1750i9/tutorial_upfront_unit_testi… 17. http://people.cs.missouri.edu/~harrisonwl/papers/tfp2012.pdf 18. http://www.reddit.com/r/haskell/comments/179367/the_design_of_a_practical_p… 19. http://shuklan.com/haskell 20. http://www.reddit.com/r/haskell/comments/172h5q/introduction_to_haskell_lec… 21. http://tryhaskell.org/hugs/ 22. http://www.reddit.com/r/haskell/comments/177a56/hugs_in_your_browser/ 23. http://www.reddit.com/r/haskell/comments/17a33g/free_functors_the_reason_fr… 24. http://www.reddit.com/r/haskell/comments/17a33g/free_functors_the_reason_fr… 25. http://www.reddit.com/r/haskell/comments/175mxw/scribbling_smudging_and_sme… 26. http://www.reddit.com/r/haskell/comments/175mxw/scribbling_smudging_and_sme… 27. http://elm-lang.org/blog/announce/version-0.7.1.elm 28. http://www.reddit.com/r/haskell/comments/179nwl/touch_and_keyboard_api_anno… 29. http://statusfailed.com/blog/2013/01/26/haskells-strength-generalising-with… 30. http://www.reddit.com/r/haskell/comments/17b5ak/reimplementing_the_generali… 31. http://stackoverflow.com/questions/14476230/can-using-undecidableinstances-… 32. http://stackoverflow.com/questions/14422169/why-doesnt-ghc-haskell-support-… 33. http://stackoverflow.com/questions/14519905/how-much-does-it-cost-for-haske… 34. http://stackoverflow.com/questions/14429966/compile-unsafe-haskell 35. http://stackoverflow.com/questions/14538255/why-gadt-existential-data-const… 36. http://stackoverflow.com/questions/14538294/correct-design-for-haskell-exce… 37. http://stackoverflow.com/questions/14446368/how-to-use-phase-control-of-inl… 38. http://stackoverflow.com/questions/14484569/looking-for-resources-that-help… 39. http://stackoverflow.com/questions/14500582/generate-a-c-struct-based-on-a-… 40. http://stackoverflow.com/questions/14421178/how-to-structure-a-haskell-proj… 41. http://stackoverflow.com/questions/14530555/difference-between-two-function… 42. https://plus.google.com/105107667630152149014/about

1 0

*** FORTHCOMING DEADLINE*** [CfP] 4th *OPEN* Answer Set Programming Competition 2013 - CALL FOR PARTICIPANTS
by Francesco Calimeri 30 Jan '13

30 Jan '13

[apologies for any cross-posting] ************************* *** IMMINENT DEADLINE *** ************************* ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Participant Systems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ aspcomp2013(a)kr.tuwien.ac.at ........................................................................ The 4th Open Answer Set Programming (ASP) Competition is now in the Call for Participant Systems stage. +--------------------------------------------------------------------+ | The event is open to ASP systems and *any other* system based on a | | declarative specification paradigm. | +--------------------------------------------------------------------+ == Call for Participant Systems == Participants of the Answer Set Programming Competition will compete on a selected collection of benchmark problems, taken from a variety of benchmark problem domains as well as real world applications. These include, but are not limited to: * Classic and applicative graph problems * Scheduling, Timetabling, and other resource allocation problems * Sequential and Temporal Planning * Combinatorial Optimization Problems * Deductive database tasks on large data-sets * Puzzles and Combinatorics * Ontology reasoning * Automated Theorem Proving and Model Checking * Reasoning tasks over large propositional instances * Constraint Programming problems * Other AI problems The competition consists of two independent main tracks: * the Model & Solve Track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. Participants submit a solver based on an arbitrary input format and declarative specifications of the Competition's benchmark domains; * the System Track compares dedicated answer set solvers on ASP benchmarks. Participants compete with a solver for a standard ASP language. We encourage to submit parallel and portfolio systems exploiting multiple cores or multiple algorithms for solving the given instances. === About the Answer Set Programming Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. The ASP Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The 4th ASP Competition will be run in the first half of 2013 jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria). The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * February 2nd, 2013: Participant registration deadline * March 1st, 2013: Participant system submission deadline * March 2nd, 2013: System freeze, the competition runs * September 15-19, 2013: Announcement of results and award presentation at LPNMR 2013 in Corunna, Spain For further information and submission instructions please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013(a)kr.tuwien.ac.at

1 0

CFP: EOOLT 2013: Extended Submission Deadline!
by Henrik Nilsson 30 Jan '13

30 Jan '13

Dear Haskellers, The included call for papers to the 5th international workshop on Equation-based Object-Oriented Languages and Tools (EOOLT) 2013 may be of interest to those interested in declarative domain-specific languages in the context of Haskell. Note that the deadlines have been extended: * Abstracts: 8 February * Full papers: 18 February Apologies for multiple copies! All the best, /Henrik -- Henrik Nilsson School of Computer Science The University of Nottingham nhn(a)cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

ANNOUNCE: GHC version 7.6.2
by Ian Lynagh 29 Jan '13

29 Jan '13

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.6.2 ============================================================= The GHC Team is pleased to announce a new patchlevel release of GHC, 7.6.2. This release fixes a number of bugs relative to 7.6.1, so we recommend upgrading. Full release notes are here: http://www.haskell.org/ghc/docs/7.6.2/html/users_guide/release-7-6-2.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

1 0

Request for review of a GADT tutorial draft
by Anton Dergunov 28 Jan '13

28 Jan '13

Dear Haskell community, I have recently written an introductory-level tutorial article about GADTs in GHC (inspired by LASER 2012 summer school and to be submitted to their proceedings). I have already send this draft to the "Haskell Cafe" mailing list, but I was also advised to use these mailing lists, so I would like to ask for your feedback: http://anton-dergunov.ru/publications/gadts_draft_v4.pdf Any opinion about this article and any suggestions are very welcome! -- Best Regards, Anton Dergunov

1 0

Six PhD Studentships at St Andrews (tight deadline)
by Kevin Hammond 27 Jan '13

27 Jan '13

We have six funded PhD Studentships available. If you know any good applicants with an interest in functional programming, parallelism or related areas, I'd be pleased to hear from them. The deadline is tight (4th February), but the main thing is to get an application in. http://blogs.cs.st-andrews.ac.uk/csblog/2012/12/20/600th-anniversary-phd-sc… Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk) The University of St Andrews is a charity registered in Scotland : No SC013532

1 0