January 2013 - Haskell

Call for Papers (ICTAC 2013)
by Huibiao Zhu 16 Jan '13

16 Jan '13

*************************************************************** ICTAC 2013 10th International Colloquium on Theoretical Aspects of Computing *** Call For Papers *** September 4-6, 2013 Shanghai, China http://ictac2013.ecnu.edu.cn/ *************************************************************** ICTAC 2013 is the 10th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2013 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. THEMES AND TOPICS OF PAPERS ICTAC 2013 calls for regular research papers on theories of computation and programming, foundations of software engineering, and on formal techniques in software design and verification; short papers on recent work or proposals of challenges in new programming paradigms such as Cyber-Physical Systems, Cloud Computing and Social Networks; and papers about tools that support formal techniques for software modeling, system design and verification. The topical areas of the conference include, but not limited to Automata theory and formal languages; Principles and semantics of programming languages; Theories of concurrency, mobility and reconfiguration; Logics and their applications; Software architectures and their models, refinement and verification; Relationship between software requirements, models and code; Program static and dynamic analysis and verification; Software specification, refinement, verification and testing; Model checking and theorem proving; Models of object and component systems; Coordination and feature interaction; Integration of theories, formal methods and tools for engineering computing systems; Service-oriented architectures: models and development methods; Models of concurrency, security, and mobility; Theory of distributed, grid and cloud computing; Real-time, embedded, hybrid and cyber-physical systems; Type and category theory in computer science; Models for learning and education; Case studies, theories, tools and experiments of verified systems; Domain-specific modeling and technology: examples, frameworks and experience. Challenges and foundations in the environmental modeling and monitoring, healthcare, and disaster management. PUBLICATION AND SUBMISSION As for the past editions, it is the plan that the proceedings of ICTAC 2013 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2013 is under negotiation. Submissions to the colloquium 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 conference. Submissions can be Regular Papers, Short Papers or Tool Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 18 pages and Short Papers and tool papers should be between 5 and 10 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers must be submitted at http://www.easychair.org/conferences/?conf=ictac2013. Short papers and tool papers must contain clear reference to the background theories and techniques; and a tool paper must further provide a link to a webpage that contains a tutorial and demo of the tool. All queries should be sent to the e-mail address ictac2013(a)sei.ecnu.edu.cn. IMPORTANT DATES Paper submission deadline: 8 March 2013 Paper Accept/Reject Notification: 26 Apr 2013 Final paper submission: 17 May 2013 Conference dates: 4 --- 6 September 2013 ASSOCIATED EVENTS Festschrift Symposium in Honor of Prof. Jifeng He: 01-03 September 2013 Summer School on Software Engineering: 26-30 August 2013 INVITED SPEAKERS Luca Cardelli, Microsoft Research Cambridge, UK Jifeng He, East China Normal University, China Marta Kwiatkowska, University of Oxford, UK CONFERENCE CHAIRS Zhou Chaochen, Software Institute, Chinese Academy of Sciences, China Peter Haddawy, UNU-IIST, Macau SAR, China Bill Roscoe, University of Oxford, UK PROGRAMME CHAIRS Zhiming Liu, UNU-IIST, Macau SAR, China Jim Woodcock, University of York, UK Huibiao Zhu, East China Normal University, China PROGRAMME COMMITTEE Farhad Arbab (CWI and Leiden University, The Netherlands) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Zhenbang Chen (National University of Defense Technology, China) Van Hung Dang (University of Engineering and Technology, Vietnam) Thao Dang (VERIMAG, France) David Deharbe (Universidade Federal do Rio Grande do Norte, Brasil) Jinsong Dong (National University of Singapore, Singapore) Meenakshi Dsouza (IIIT, India) Zhenhua Duan (Xidian University, China) John Fitzgerald (Newcastle University, UK) Martin Fraenzle (Carl von Ossietzky University Oldenburg, Germany) Marcelo Frias (Instituto Tecnologico Buenos Aires, Argentina) Lindsay Groves (Victoria University of Wellington, New Zealand) Kim Guldstrand Larsen (Aalborg University, Denmark) Ian J. Hayes (University of Queensland, Australia) Zhenjiang Hu (NII, Japan) Lei Ju (Shandong University, China) Daniel Kroening (Oxford University, UK) Martin Leucker (University of Lübeck, Germany) Zhiming Liu (UNU-IIST, Macau SAR, China) Annabelle Mciver (Macquarie University, Australia) Dominique Mery (Université de Lorraine, France) Tobias Nipkow (Technische Universit?t München, Germany) Paritosh Pandya (TIFR, India) Jun Pang (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Abhik Roychoudhury (National University of Singapore, Singapore) Augusto Sampaio (Federal university of Pernambuco, Brasil) Ondrej Sery (University of Lugano, Switzerland) Natarajan Shankar (SRI, US) Marjan Sirjani (Reykjavik University, Iceland) Andrzej Tarlecki (Warsaw University, Poland) Mark Utting (The University of Waikato, New Zealand) Tarmo Uustalu (Tallinn University of Technology, Estonia) Farn Wang (National Taiwan University, Taiwan) Burkhart Wolff (University Paris-Sud, France) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Naijun Zhan (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Jianhua Zhao (Nanjing University, China) Huibiao Zhu (East China Normal University, China)

1 0

PhD studentships in Nottingham
by Graham Hutton 16 Jan '13

16 Jan '13

Dear all, The School of Computer Science in Nottingham is advertising a number of PhD studentships. Applicants in the area of the Functional Programming Lab (fp.cs.nott.ac.uk) would be very welcome. If you are interested in applying, please contact a potential academic supervisor in the FP lab prior to submitting your application. Note that I'm not available to supervise new students myself this coming academic year. Graham Hutton University of Nottingham +---------------------------------------------------------------+ Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK Applications are invited for a number of fully-funded PhD studentships in the School of Computer Science at the University of Nottingham, starting on 1st October 2013. The topics for the studentships are open, but will relate to the research interests of existing members of staff within the School. Applicants should have discussed their interest and obtained the support of a named potential supervisor before applying. The studentships are for three years and include a maintenance grant of 13,726 UK pounds per year and tuition fees for UK students. The positions are open to students of any nationality, but non-UK students will require additional funding to cover tuition fees, which is awarded by the University on a competitive basis. Applicants will normally require a first-class Undergraduate or Masters degree in Computer Science or a related discipline. Informal enquiries may be addressed to Christine Fletcher <Christine.Fletcher(a)nottingham.ac.uk>. To apply, please submit the following items by email to the above address: (1) a brief covering letter that describes your reasons for wishing to pursue a PhD, any ideas you have regarding possible areas or topics, and the name of a potential supervisor; (2) a copy of your CV, including your actual or expected degree class(es), and results of all University examinations; (3) an example of your technical writing, such as a project report or dissertation; (4) contact details for two academic referees. *Closing date for applications:* 8th February 2013 +---------------------------------------------------------------+ -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh 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

Introduction to Haskell Lectures
by Nick Shukla 11 Jan '13

11 Jan '13

Hi, The University of Virginia department of Computer Science was kind enough let me lecture an introductory course on Haskell, a functional programming language. I'll be posting all slides on the class website: http://shuklan.com/haskell Come join me in this 12 week course. We will start from basic lists and tuples, and venture far into monads and category theory. Regards, Nishant Shukla UVA CS/Math http://shuklan.com

3 2

Announce: KURE 2.6.14
by Neil Sculthorpe 11 Jan '13

11 Jan '13

KURE 2.6.14 is now available on Hackage. This new version is simpler to instantiate, and has better performance. What's New? ----------- The main change from version 2.4.x are (1) A simplified class interface that makes KURE easier to instantiate. The previous Node and Walker classes have been merged into a single Walker class, which only requires one class method, allR, compared to two before (numChildren and childL). (2) The Walker class no longer takes the monad as a class parameter, but instead provides methods that work for any monad. This enforces (some of) the intended semantics, and makes the methods more re-usable. (3) The type function "Generic" has been removed. This leads to simpler type signatures, and allows nodes to appear in multiple sum types without the need for newtype wrappers. The (minor) disadvantage is that type inference is weakened, and thus more type ascriptions are now required from the user. (4) The efficiency of the default definitions of the shallow traversals (anyR, oneR etc...) has been improved, making it less likely the user will need to overwrite them with custom definitions. (5) The library as a whole has been internally optimised through aggressive use of inlining, which has led to significant speed-ups. (6) Monad transformers for anyR- and oneR-like behaviour are now provided, making it much simpler to define congruence combinators with those behaviours. About KURE ---------- The Kansas University Rewrite Engine (KURE) is a DSL for strategic rewriting. KURE shares concepts with Stratego, but unlike Stratego, KURE is strongly typed. KURE is similar to StrategyLib, but has a lightweight generic traversal mechanism rather than using SYB. KURE is the engine inside HERMIT, our Equational Rewrite Framework. Homepage: http://www.ittc.ku.edu/csdl/fpg/Tools/KURE Examples -------- Some small examples of using KURE are provided in the source bundle. For a larger, non-trivial, example, see the description of its use in the HERMIT project: http://ittc.ku.edu/csdl/fpg/node/126 Acknowledgement --------------- This work was supported by funding from the NSF, for which we are grateful. Neil Sculthorpe

1 0

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

11 Jan '13

[apologies for any cross-posting] ........................................................................ 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

ARiSVe 2013 Call for Papers
by Jean-Christophe Filliatre 11 Jan '13

11 Jan '13

Call For Papers 1st International Workshop on Automated Reasoning in Software Verification http://arisve2013.lri.fr/ Monday, June 10, 2013 Lake Placid, NY, USA Affiliated with CADE-24 Aims and Scope The focus of the workshop is application of automated reasoning in the context of software verification, and, more generally, automation in software verification. Relevant topics include but are not limited to: * specifics of verification-related automated reasoning tasks; * efficient translation of high-level verification conditions to logical languages of automated reasoning tools; * handling of the prover's feedback: proofs, models, answer terms; * logical theories of interest for program verification, decision procedures, integration into existing ATP and SMT systems; * combination of automated and user-assisted verification; * tool presentations, tool comparisons, and benchmarks; * experience reports on verification of complex algorithms and real-life software with the use of automated reasoning tools. Paper Submission and Proceedings All submissions are reviewed by the programme committee. We expect that one author of every accepted paper will present their work at the workshop. Submissions are limited to 6-12 pages in the LaTeX EasyChair format easychair.cls (http://www.easychair.org/publications/easychair.zip) Technical details may be included in an appendix to be read at the reviewers' discretion. Tool presentation papers and experience reports are welcome. Papers should be submitted through EasyChair, at http://www.easychair.org/conferences/?conf=arisve2013 Submissions must be in PDF format. Electronic version of proceedings will be freely distributed from the workshop web site. Important Dates * Abstract submission deadline: March 8, 2013 * Submission deadline: March 15, 2013 * Notification: April 10, 2013 * Camera ready versions due: May 10, 2013 * Workshop: June 10, 2013 Invited Speaker K. Rustan M. Leino (Microsoft Research) Program Committee * June Andronick (NICTA) * Clark Barrett (New York University) * Ernie Cohen (Microsoft Corp.) * Loïc Correnson (CEA) * Gidon Ernst (Ausburg University) * Jean-Christophe Filliâtre (CNRS), co-chair * Alwyn Goodloe (NASA) * Matthias Horbach (Koblenz University) * Vladimir Klebanov (Karlsruhe Institute of Technology) * Konstantin Korovin (The University of Manchester) * Rosemary Monahan (National University of Ireland) * Andrei Paskevich (Université Paris-Sud), co-chair * Silvio Ranise (Fondazione Bruno Kessler)

1 0

SCP Special Issue on Invariant Generation - Final Call for Papers [1 month to go]
by Gudmund Grov 11 Jan '13

11 Jan '13

(Apologies if you receive multiple copies of this announcement) ------------------------------------------------------------ Science of Computer Programming Special Issue on Invariant Generation -- FINAL CALL FOR PAPERS [1 month to go] -- ------------------------------------------------------------ This special issue is devoted to the 4th international Workshop on Invariant Generation (WING 2012) http://cs.nyu.edu/acsys/wing2012/ which was held on June 30 2012 in Manchester as a satellite event of IJCAR 2012. The scope of the workshop is the automation of extracting and synthesising auxiliary properties of programs, in particular providing, debugging, and verifying auxiliary invariant annotations. This should be seen in a broad sense and relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive assertion generation * Inductive proofs for reasoning about loops * Applications to assertion generation using: - abstract interpretation, - static analysis, - model checking, - theorem proving, - theory formation, - algebraic techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Submission to this special issue is completely open. We expect original articles (typically not more than 30 pages) that present high-quality contributions and must not be simultaneously submitted for publication elsewhere. Submission of extended versions of previously published papers is possible as long as the extension is significant, i.e., the submission can be considered a new paper, the previous paper is referenced, and the new material is clearly marked. Submissions must comply with SCP's author guidelines http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authori… and be written in English. Submission is over the SCP website: http://ees.elsevier.com/scico/default.asp which you will have to register for if you do not have an account. When submitting your paper please choose the article type "Special issue: WING 2012". IMPORTANT DATES --------------- * Submission of papers: February 11, 2013. * Notification: April 26, 2013. GUEST EDITORS -------------- * Gudmund Grov (Heriot-Watt University, UK) * Thomas Wies (New York University, USA) CONTACT -------------- Please send any queries you may have to: wing2012(a)easychair.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278.

1 0

Haskell Weekly News: Issue 254
by Daniel Santa Cruz 10 Jan '13

10 Jan '13

Welcome to issue 254 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of December 02, 2012 to January 05, 2013. As some of you might have noticed, there has been an interruption in the scheduled transmission of the newsletter. I have, over the past few weeks, completed a move to NYC! It has been wonderful to meet many in the community at the Haskell NYC meetups. Here is to a great year for our cherised community. Let's get things started out the right way, with a litte "Lambda Style" :-) [1] http://goo.gl/nQYdp Quotes of the Week * GuySteele: Some people prefer not to commingle the functional, lambda-calculus part of a language with the parts that do side effects. It seems they believe in the separation of Church and state. * edwardk: type level ieee floats are a crime against nature. i had to implement them in c++ for template meta programming once. never ever again * acowley: (regarding Proxy) Haven't you ever wanted to put something in a box and never think about it? elliott: children * merijn: xenocons: I spend the entire week grading FP homework, I think it's impossible for you to surprise me :p merijn: That's confusing :< * andr00: Today's software engineering word is "farpotshket." This is a Yiddish word meaning, "broken, because someone tried to fix it." * dmwit: I know, I know. "0, 1, many". But then I also write most of my programs in a language whose type system has 4 levels. Four! Is that even a number?? * aristid: a dubious motivation IMHO edwardk: i've had worse =P * ziarkaen: I'm thinking I can kill two birds with one stone by learning Haskell while producing a website, but all the birds are still alive at the moment. * ion: monad.bind = function (func, args) { return func.apply(undefined, [value].concat(Array.prototype.slice.apply(args || []))); }; is idiomatic JavaScript? * beaky: if stacks are recursion, what are queues? Hafydd: Procrastination. * elliott: I think lens is the first library I've seen that promises letting you write abstract totally-inefficient-looking compositional code and getting reliably good compilation which has actually delivered on that promise. * elliott: I didn't say half the things I said. * shachaf: The two-letter and three-letter identifiers are for edwardk's libraries. The one-letter identifiers are for his actual code. elliott: edwardk has non-library code? * neutrino: in many ways, Haskell is like this primodial soup out of which other languages end up springing * mm_freak: bruce schneier is an endofunctor that turns all automorphisms into identities * roconnor: where are all the category theoriest? why don't they already have all the answers for us? edwardk: roconnor: this is the point in your career where you look around for the cavalry and realize that you're it ;) * cmccann: multi-letter type variables is an experimental new extension * elliott: I can't remember the last time I wrote any Haskell without an evil grin. * neutrino: when you're told you have to use javascript, the viable alternative always remains in seppuku. and it's much more honorable. * shachaf: chrisdone: Please make Author not mandatory. [on hpaste] donri: shachaf: just write "not shachaf" and no one will ever know it's you * tac: If you're not part of the solution, you're part of the precipitate * cmccann: some people blame themselves, some people blame the language, but the people who really know what they're doing blame shachaf. Top Reddit Stories * The end of an era, and the dawn of a new one Domain: haskell.org, Score: 148, Comments: 32 On Reddit: [2] http://goo.gl/fiyVt Original: [3] http://goo.gl/dlxsF * Simon Peyton-Jones invests in FP Complete Domain: fpcomplete.com, Score: 92, Comments: 15 On Reddit: [4] http://goo.gl/nPTk1 Original: [5] http://goo.gl/wzfpP * 24 Days of Hackage - Thank YOU! Domain: ocharles.org.uk, Score: 88, Comments: 12 On Reddit: [6] http://goo.gl/2yodj Original: [7] http://goo.gl/hSsH6 * Heist 0.10...now with a >3000x performance improvement Domain: snapframework.com, Score: 81, Comments: 38 On Reddit: [8] http://goo.gl/p7R7u Original: [9] http://goo.gl/znugn * 24 Days of Hackage: EKG Domain: ocharles.org.uk, Score: 68, Comments: 15 On Reddit: [10] http://goo.gl/ltPb1 Original: [11] http://goo.gl/UeYOA * pipes-3.0: Simpler, unified API Domain: haskellforall.com, Score: 64, Comments: 71 On Reddit: [12] http://goo.gl/ZSVtT Original: [13] http://goo.gl/6Yt01 * Hoodle : Pen note-taking program written in haskell Domain: youtube.com, Score: 64, Comments: 21 On Reddit: [14] http://goo.gl/aJ9G9 Original: [15] http://goo.gl/GsZ85 * 24 Days of Hackage: lens Domain: ocharles.org.uk, Score: 62, Comments: 46 On Reddit: [16] http://goo.gl/71HbV Original: [17] http://goo.gl/L78Hp * Cartesian Closed Comic #19: Facebook Domain: ro-che.info, Score: 61, Comments: 8 On Reddit: [18] http://goo.gl/LKqzz Original: [19] http://goo.gl/tSrjJ * Announcing: Snap Framework v0.10 Domain: snapframework.com, Score: 61, Comments: 11 On Reddit: [20] http://goo.gl/TibIw Original: [21] http://goo.gl/Nm98e * Surprises of the Haskell module system (part 1) Domain: ro-che.info, Score: 57, Comments: 11 On Reddit: [22] http://goo.gl/tOiiK Original: [23] http://goo.gl/vLEZP * 24 Days of Hackage: configurator Domain: ocharles.org.uk, Score: 53, Comments: 7 On Reddit: [24] http://goo.gl/jFKt2 Original: [25] http://goo.gl/nu2zj * Fay :: Haskell -> JavaScript Domain: fay-lang.org, Score: 52, Comments: 14 On Reddit: [26] http://goo.gl/wAH7C Original: [27] http://goo.gl/uitoD * Announcing: Clay, a CSS preprocessor as a Haskell EDSL. Domain: sebastiaanvisser.github.com, Score: 52, Comments: 53 On Reddit: [28] http://goo.gl/1ej1n Original: [29] http://goo.gl/bWfU2 * 24 Days of Hackage: base Domain: ocharles.org.uk, Score: 51, Comments: 10 On Reddit: [30] http://goo.gl/e5gLp Original: [31] http://goo.gl/7MY8o * Haskell for all: The Continuation Monad Domain: haskellforall.com, Score: 51, Comments: 42 On Reddit: [32] http://goo.gl/YKDOo Original: [33] http://goo.gl/zJ42x * ANNNOUNCE: lens 3.7 released Domain: haskell.org, Score: 50, Comments: 9 On Reddit: [34] http://goo.gl/FecK0 Original: [35] http://goo.gl/n4tR0 * 24 Days of Hackage: optparse-applicative Domain: ocharles.org.uk, Score: 50, Comments: 21 On Reddit: [36] http://goo.gl/JyFVh Original: [37] http://goo.gl/PP4CX * 24 Days of Hackage: snap Domain: ocharles.org.uk, Score: 50, Comments: 35 On Reddit: [38] http://goo.gl/9Wp3q Original: [39] http://goo.gl/WlHlU * What doesn't Haskell do well? Domain: self.haskell, Score: 47, Comments: 153 On Reddit: [40] http://goo.gl/VRJMn Original: [41] http://goo.gl/VRJMn * 24 Days of Hackage: criterion Domain: ocharles.org.uk, Score: 46, Comments: 10 On Reddit: [42] http://goo.gl/wYrdm Original: [43] http://goo.gl/rYT9C * Some specific thoughts on why using Haskell makes you a better programmer. Domain: dubhrosa.blogspot.co.uk, Score: 46, Comments: 30 On Reddit: [44] http://goo.gl/dN1Zd Original: [45] http://goo.gl/DDNuQ * Growing Haskell Platform Domain: mtnviewmark.wordpress.com, Score: 43, Comments: 16 On Reddit: [46] http://goo.gl/jNefn Original: [47] http://goo.gl/a5udB * 24 Days of Hackage: text Domain: ocharles.org.uk, Score: 43, Comments: 21 On Reddit: [48] http://goo.gl/3VmmH Original: [49] http://goo.gl/13MOc Top StackOverflow Questions * What's the absurd function in Data.Void useful for? votes: 34, answers: 5 Read on SO: [50] http://goo.gl/ny4gh * Benefit of avoiding multiple list traversals votes: 27, answers: 4 Read on SO: [51] http://goo.gl/Z6DNg * Images in Haddock documentation votes: 22, answers: 2 Read on SO: [52] http://goo.gl/7tFgE * Idiomatic option pricing and risk using Repa parallel arrays votes: 22, answers: 1 Read on SO: [53] http://goo.gl/Ih9cn * How much memory does a thunk use? votes: 21, answers: 2 Read on SO: [54] http://goo.gl/VkdIX * Can I constrain a type family? votes: 20, answers: 2 Read on SO: [55] http://goo.gl/0kBEU * How to write platform-independent code in Haskell (ghc) votes: 18, answers: 1 Read on SO: [56] http://goo.gl/13bEB * Play a wav file with Haskell votes: 17, answers: 3 Read on SO: [57] http://goo.gl/sKpgf * Why are difference lists more efficient than regular concatenation? votes: 16, answers: 2 Read on SO: [58] http://goo.gl/GCVpe * GUI tools that are actively developed and well documented for Haskell votes: 15, answers: 2 Read on SO: [59] http://goo.gl/M2L0l * What are the adjoint functor pairs corresponding to common monads in Haskell? votes: 15, answers: 2 Read on SO: [60] http://goo.gl/UnUik Until next time, +Daniel Santa Cruz https://plus.google.com/105107667630152149014/about References 1. http://www.youtube.com/watch?v=Ci48kqp11F8 2. http://www.haskell.org/pipermail/haskell-cafe/2012-December/105041.html 3. http://www.reddit.com/r/haskell/comments/14bvtz/the_end_of_an_era_and_the_d… 4. http://fpcomplete.com/why-im-investing-in-fp-complete/ 5. http://www.reddit.com/r/haskell/comments/15wc7s/simon_peytonjones_invests_i… 6. http://ocharles.org.uk/blog/posts/2012-12-24-24-days-of-hackage.html 7. http://www.reddit.com/r/haskell/comments/15e0nz/24_days_of_hackage_thank_yo… 8. http://snapframework.com/blog/2012/12/9/heist-0.10-released 9. http://www.reddit.com/r/haskell/comments/14kjct/heist_010now_with_a_3000x_p… 10. http://ocharles.org.uk/blog/posts/2012-12-11-24-day-of-hackage-ekg.html 11. http://www.reddit.com/r/haskell/comments/14ovdp/24_days_of_hackage_ekg/ 12. http://www.haskellforall.com/2012/12/pipes-30-simpler-unified-api.html 13. http://www.reddit.com/r/haskell/comments/14qe8b/pipes30_simpler_unified_api/ 14. http://www.youtube.com/watch?v=Z2wzpyxsVSU 15. http://www.reddit.com/r/haskell/comments/14seiv/hoodle_pen_notetaking_progr… 16. http://ocharles.org.uk/blog/posts/2012-12-09-24-days-of-hackage-lens.html 17. http://www.reddit.com/r/haskell/comments/14kbbi/24_days_of_hackage_lens/ 18. http://ro-che.info/ccc/19.html 19. http://www.reddit.com/r/haskell/comments/145cra/cartesian_closed_comic_19_f… 20. http://snapframework.com/blog/2012/12/10/snap-0.10-released 21. http://www.reddit.com/r/haskell/comments/14lrlr/announcing_snap_framework_v… 22. http://ro-che.info/articles/2012-12-25-haskell-module-system-p1.html 23. http://www.reddit.com/r/haskell/comments/15fnrx/surprises_of_the_haskell_mo… 24. http://ocharles.org.uk/blog/posts/2012-12-21-24-days-of-hackage-configurato… 25. http://www.reddit.com/r/haskell/comments/158svo/24_days_of_hackage_configur… 26. http://fay-lang.org/ 27. http://www.reddit.com/r/haskell/comments/14dxru/fay_haskell_javascript/ 28. http://sebastiaanvisser.github.com/clay/ 29. http://www.reddit.com/r/haskell/comments/15aoif/announcing_clay_a_css_prepr… 30. http://ocharles.org.uk/blog/posts/2012-12-23-24-days-of-hackage-base.html 31. http://www.reddit.com/r/haskell/comments/15c0jm/24_days_of_hackage_base/ 32. http://www.haskellforall.com/2012/12/the-continuation-monad.html 33. http://www.reddit.com/r/haskell/comments/15ogxe/haskell_for_all_the_continu… 34. http://www.haskell.org/pipermail/haskell/2012-December/023598.html 35. http://www.reddit.com/r/haskell/comments/14fw7l/annnounce_lens_37_released/ 36. http://ocharles.org.uk/blog/posts/2012-12-17-24-days-of-hackage-optparse-ap… 37. http://www.reddit.com/r/haskell/comments/150iem/24_days_of_hackage_optparse… 38. http://ocharles.org.uk/blog/posts/2012-12-19-24-days-of-hackage-snap.html 39. http://www.reddit.com/r/haskell/comments/154i72/24_days_of_hackage_snap/ 40. file://localhost/r/haskell/comments/14nj0r/what_doesnt_haskell_do_well/ 41. http://www.reddit.com/r/haskell/comments/14nj0r/what_doesnt_haskell_do_well/ 42. http://ocharles.org.uk/blog/posts/2012-12-18-24-days-of-hackage-criterion.h… 43. http://www.reddit.com/r/haskell/comments/152yv3/24_days_of_hackage_criterio… 44. http://dubhrosa.blogspot.co.uk/2012/12/lessons-learning-haskell.html 45. http://www.reddit.com/r/haskell/comments/15ch1k/some_specific_thoughts_on_w… 46. http://mtnviewmark.wordpress.com/2012/12/06/growing/ 47. http://www.reddit.com/r/haskell/comments/14fmw8/growing_haskell_platform/ 48. http://ocharles.org.uk/blog/posts/2012-12-12-24-days-of-hackage-text.html 49. http://www.reddit.com/r/haskell/comments/14quxz/24_days_of_hackage_text/ 50. http://stackoverflow.com/questions/14131856/whats-the-absurd-function-in-da… 51. http://stackoverflow.com/questions/13686926/benefit-of-avoiding-multiple-li… 52. http://stackoverflow.com/questions/14017112/images-in-haddock-documentation 53. http://stackoverflow.com/questions/14082158/idiomatic-option-pricing-and-ri… 54. http://stackoverflow.com/questions/13982863/how-much-memory-does-a-thunk-use 55. http://stackoverflow.com/questions/14133121/can-i-constrain-a-type-family 56. http://stackoverflow.com/questions/13799199/how-to-write-platform-independe… 57. http://stackoverflow.com/questions/14005592/play-a-wav-file-with-haskell 58. http://stackoverflow.com/questions/13879260/why-are-difference-lists-more-e… 59. http://stackoverflow.com/questions/13887213/gui-tools-that-are-actively-dev… 60. http://stackoverflow.com/questions/13937289/what-are-the-adjoint-functor-pa…

1 0

Haskell and Pandoc "Let's Code"-Style Video
by Chris Forno 09 Jan '13

09 Jan '13

I've just uploaded a video walking through some of the source code for Pandoc. I plan to create more videos like it (on Pandoc and other open source/free software projects), and I'd appreciate your feedback. https://www.youtube.com/watch? v=FEFETKhhq8w&feature=youtube_gdata_play er I think Haskell is particularly well-suited for this type of study: - The code tends to be concise, and parts can usually be analyzed in isolation thanks to explicit state. - Even after 10 years of exposure to Haskell I feel like I still have much to learn about idiomatic style from the writings of others. - I've run across the same misconceptions about Haskell in the professional world (and had some myself in the beginning), and would like more people to see what Haskell really is like outside of papers and blog posts. Please let me know if there are other projects you'd like to see me cover. Thanks.

5 4

Three University Lectureships in Software Engineering at Oxford
by Jeremy.Gibbons＠cs.ox.ac.uk 07 Jan '13

07 Jan '13

University of Oxford Department of Computer Science in association with Kellogg College, Oxford UNIVERSITY LECTURERS IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) - THREE POSTS The Department of Computer Science proposes to appoint three University Lecturers in Computer Science from 1st April 2013 and no later than 1st October 2013. The successful candidate will be offered a Non-Tutorial Fellowship at Kellogg College under arrangements described in Further Particulars. The salary will be on a scale currently up to £57,581 per annum. The teaching duties of the appointees will be performed for the Software Engineering Programme, which offers part-time MScs in Software Engineering and Software and Systems Security, taught via a series of intensive one-week modules. The research interests of candidates should be in any area of Software Engineering or Computer Science relevant to these programmes. Applicants should hold a relevant PhD and have experience in any area which broadens the activities of the Software Engineering Programme (http://www.softeng.ox.ac.uk/) Full details of the qualifications required and the duties of the post can be found in the Further Particulars (http://www.cs.ox.ac.uk/files/5213/SEP_UL_FPs.pdf) The closing date for applications is Friday 8th February 2013. Queries about the post should be addressed in the first instance to Elizabeth Walsh at elizabeth.walsh(a)cs.ox.ac.uk or telephone: +44 (0) 1865 283503. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The University is an Equal Opportunities Employer.

1 0