- Haskell - Haskell.org

Re: [Haskell] [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations
by Niklas Hambüchen 29 Mar '13

29 Mar '13

Hey Scott, I quickly tried your suggestion, plugging in foldr' from Data.Foldable and sprinkling a few seqs in some places, but it doesn't help the stack overflow. On Fri 29 Mar 2013 16:23:55 GMT, Scott Dillard wrote: > I do not know why it overflows. It's been a while, but isn't the > answer usually "too much laziness"? Maybe try changing the foldr in > fromList to foldr'? I would try it out quickly but do not have ghc > installed on any computers here. > > I am happy start a repo for this library, but there is not much > history to import so anyone else may do it. I'm not sure how hackage > upload permissions work... I guess I just change the maintainer field > in the .cabal file from myself to someone else...? Any volunteers? > > > > > On Thu, Mar 28, 2013 at 11:16 PM, Kazu Yamamoto <kazu(a)iij.ad.jp > <mailto:kazu@iij.ad.jp>> wrote: > > Hi Niklas, > > > * PSQueue throws a stack space overflow if you try to put in 100000 > > * Ints > > A slightly different implementation is used in GHC: > > > https://github.com/ghc/packages-base/blob/master/GHC/Event/PSQ.hs > > Could you test it? If this code also has the same problem, I need to > fix it. > > --Kazu > >

2 1

WRS 2013 - Call for Papers
by Jeroen Ketema 28 Mar '13

28 Mar '13

------------------------- WRS 2013: CALL FOR PAPERS ------------------------- 11th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2013) http://multicore.doc.ic.ac.uk/events/wrs2013/ 27 June 2013, Eindhoven, the Netherlands IMPORTANT DATES * Paper submission deadline: 24 April 2013 * Notification of acceptance: 22 May 2013 * Preliminary proceedings version due: 5 June 2013 * Workshop: 27 June 2013 * Paper submission for final proceedings: TBA * Notification of acceptance: TBA * Final version due: TBA AIMS AND SCOPE The WRS workshop promotes research and collaboration in the area of reduction strategies in rewriting and programming. It encourages the presentation of new directions, developments, and results as well as surveys and tutorials on existing knowledge in this area. Reduction strategies define which (sub)expression(s) should be selected for evaluation and which rule(s) should be applied. These choices affect fundamental properties of computations such as laziness, strictness, completeness, and efficiency, to name a few. For this reason programming languages such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit definition of the evaluation strategy, whereas languages such as Clean, Curry, and Haskell allow its modification. In addition to strategies in rewriting and programming, WRS also covers the use of strategies and tactics in other areas such as theorem and termination proving. Previous editions of the workshop were held in Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), Edinburgh (2010), Novi Sad (2011), and Manchester (2012); the 2010 and 2012 editions were joint with the STRATEGIES workshop. Further information can be found at the permanent site for WRS (http://users.dsic.upv.es/~wrs/) WRS 2013 will be co-located with RTA 2013 (24th International Conference on Rewriting Techniques and Applications), as a satellite event of RDP, the Federated Conference on Rewriting, Deduction, and Programming. WRS 2013 will be held on 27 June in Eindhoven, the Netherlands. PAPER SUBMISSION AND PUBLICATION The submission process is in two stages. * Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style through the EasyChair submission site: https://www.easychair.org/conferences/?conf=wrs2013 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. * After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in an electronic journal, such as Electronic Proceedings in Theoretical Computer Science. Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. INVITED SPEAKER * Eelco Visser, Delft Univerity of Technology, the Netherlands PROGRAM COMMITTEE * Sandra Alves, University of Porto * Isabelle Gnaedig, LORIA and INRIA Nancy * Bernhard Gramlich, Technische Universität Wien * Jürgen Giesl, RWTH Aachen * Jeroen Ketema, Imperial College Londen (co-chair) * Dorel Lucanu, "Alexandru Ioan Cuza" University * Hans Zantema, Eindhoven University of Technology (co-chair)

1 0

ICSM 2013 - CFP for Research Track
by Natalia Dragan 28 Mar '13

28 Mar '13

============================================================================ ICSM 2013 CFP - Research Track ============================================================================ 29th IEEE International Conference on Software Maintenance 22 - 28 September 2013 - Eindhoven, The Netherlands http://icsm2013.tue.nl/ Follow us on Twitter: @IEEEICSM ============================================================================ The deadline for the Research track is approaching! Please read below and refer to the web page for further information. ================================ IMPORTANT DATES ================================ Abstract submission: April 17, 2013 Full papers submission: April 24, 2013 Notification: June 14, 2013 Camera-ready: July 13, 2013 ================================ CHAIRS ================================ General Chair: Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Program Co-chairs: Tom Mens, University of Mons, Belgium and Yann-Gaël Guéhéneuc, École Polytechnique de Montréal, Canada ================================ TOPICS ================================ Topics of Interest include but not limited to: • Software repository analysis and mining • Run-time evolution, dynamic reconfiguration and self adaptation • Reverse engineering, re- engineering and migration • Software refactoring, restructuring and renovation • Software and system comprehension • Code cloning, code provenance, concept location and related research • Change and defect management • Evolution of non-code artefacts (e.g., requirements, design models, documentation, software architectures, business process models) • Maintenance-related testing (e.g., regression testing) • Maintenance and evolution processes • Software quality improvement • Software evolution for emerging paradigms • Human aspects of software evolution ================================ PAPER SUBMISSION ================================ Research papers must adhere to the IEEE CS Proceedings style guidelines and are limited to 10 pages. Further details are available at: http://icsm2013.tue.nl/CFP/index.html

1 0

2nd Call for Papers: ICFEM 2013 - 15th International Conference on Formal Engineering Methods
by Huibiao Zhu 25 Mar '13

25 Mar '13

ICFEM 2013 CALL FOR PAPERS AND WORKSHOPS 15th International Conference on Formal Engineering Methods (ICFEM 2013) Queenstown, New Zealand, 29 October - 1 November 2013 http://www.cs.auckland.ac.nz/icfem2013/ The 15th International Conference on Formal Engineering Methods (ICFEM 2013) will be held at the Crowne Plaza Hotel in Queenstown, New Zealand from 29 October to 1 November 2013. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2013 is organized and sponsored by The University of Auckland and will be held in the world renowned travel destination - Queenstown. Around 1.9 million visitors are drawn to Queenstown each year to enjoy their own unforgettable travel experience. We are looking forward to your submissions and participation. SCOPE AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered. + Abstraction and refinement + Formal specification and modeling + Program analysis + Software verification + Software model checking + Formal approaches to software testing + Formal methods for self-adaptive systems + Formal methods for object and component systems + Formal methods for concurrent and real-time systems + Formal methods for cloud computing and cyber-physical systems + Formal methods for software safety, security, reliability and dependability + Tool development, integration and experiments involving verified systems + Formal methods used in certifying products under international standards + Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference 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. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be made through the ICFEM 2013 submission page (https://www.easychair.org/conferences/?conf=icfem2013) handled by the EasyChair conference management system. WORKSHOP AND TUTORIAL The first day of the conference (29 October 2013) will be dedicated to workshops, tutorials and other satellite events. The organizing committee of ICFEM 2013 therefore cordially invites proposals for one-day workshops and one-day or half-day tutorials in any area related to formal methods or software engineering, but particularly in new or emerging fields of application of formal methods. Proposals for workshops/tutorial should contain: + a title and brief description of the topic and the history of the workshop/tutorial, if applicable; + the names and contact details of the potential organizers; + a brief justification of the topic and estimated size of audience; + a description of any special technical requirements. Proposals should be sent to ICFEM2013 Workshops Chairs, Yang Liu and Jun Sun, at <yangliu(a)ntu.edu.sg> no later than 18 April 2013. IMPORTANT DATES Abstract Submissions Due: 15 April 2013 Full Paper Submissions Due: 22 April 2013 Workshop/Tutorial Proposals: 18 April 2013 Acceptance Notification: 18 June 2013 Camera-ready Papers Due: 15 July 2013 ORGANIZING COMMITTEE General Co-Chairs Jin Song Dong, National University of Singapore, Singapore. Ian Hayes, The University of Queensland, Australia. Steve Reeves, The University of Waikato, New Zealand. Program Committee Co-Chairs Lindsay Groves, Victoria University of Wellington, New Zealand. Jing Sun, The University of Auckland, New Zealand. Workshop and Tutorial Co-Chairs Yang Liu, Nanyang Technological University, Singapore. Jun Sun, Singapore University of Technology and Design, Singapore. Local Organization Chair Gillian Dobbie, The University of Auckland, New Zealand. Publicity Co-Chairs Jonathan Bowen, London South Bank University & Chairman, Museophile Limited, United Kingdom. Huibiao Zhu, East China Normal University, China. PROGRAM COMMITTEE Bernhard K. Aichernig, Graz University of Technology, Austria. Yamine Ait Ameur, LISI/ENSMA, France. Keijiro Araki, Kyushu University, Japan. Farhad Arbab, CWI and Leiden University, The Netherlands. Richard Banach, University of Manchester, United Kingdom. Nikolaj Bjorner, Microsoft Research Redmond, USA. Jonathan Bowen, London South Bank University & Chairman, Museophile Limited, United Kingdom. Michael Butler, University of Southampton, United Kingdom. Andrew Butterfield, Trinity College Dublin, Ireland. Wei-Ngan Chin, National University of Singapore, Singapore. Jim Davies, University of Oxford, United Kingdom. Jin Song Dong, National University of Singapore, Singapore Zhenhua Duan, Xidian University, China. Colin Fidge, Queensland University of Technology, Australia. John Fitzgerald, Newcastle University, United Kingdom. Joaquim Gabarro, Universitat Politecnica de Catalunya, Spain. Stefania Gnesi, ISTI-CNR, Italy. Radu Grosu, State University of New York at Stony Brook, USA. Lindsay Groves, Victoria University of Wellington, New Zealand. Ian Hayes, University of Queensland, Australia. Mike Hinchey, Lero, Ireland. Peter Gorm Larsen, Engineering College of Aarhus, Denmark. Michael Leuschel, Heinrich-Heine Universitat Dusseldorf, Germany. Xuandong Li, Nanjing University, China. Yuan-Fang Li, Monash University, Australia. Shang-Wei Lin, National University of Singapore, Singapore. Shaoying Liu, Hosei University, Japan. Yang Liu, Nanyang Technological University, Singapore. Zhiming Liu, UNU/IIST, China. Tiziana Margaria, University of Potsdam, Germany. Hong Mei, Peking University, China. Huaikou Miao, Shanghai University, China. Peter Mueller, ETH Zurich, Switzerland. Shin Nakajima, National Institute of Informatics, Japan. Sebastian Nanz, ETH Zurich, Switzerland. Jose Nuno Oliveira, Universidade do Minho, Portugal. Jun Pang, University of Luxembourg, Luxembourg. Shengchao Qin, Teesside University, United Kingdom. Zongyan Qiu, Peking University, China. Steve Reeves, The University of Waikato, New Zealand. Alexander Romanovsky, Newcastle University, United Kingdom. Wuwei Shen, Western Michigan University, USA. Marjan Sirjani, Reykjavik University, Iceland. Graeme Smith, The University of Queensland, Australia. Jing Sun, The University of Auckland, New Zealand. Jun Sun, Singapore University of Technology and Design, Singapore. Kenji Taguchi, AIST, Japan. Tetsuo Tamai, Hosei University, Japan. Yih-Kuen Tsay, National Taiwan University, Taiwan. T.H. Tse, The University of Hong Kong, China. Viktor Vafeiadis, MPI-SWS, Germany. Farn Wang, National Taiwan University, Taiwan. Hai H. Wang, Aston University, United Kingdom. Jim Woodcock, University of York, United Kingdom. Wang Yi, Uppsala University, Sweden. Jian Zhang, Chinese Academy of Sciences, China. Hong Zhu, Oxford Brookes University, United Kingdom. Huibiao Zhu, East China Normal University, China.

1 0

Call for Papers: WFLP/WLP 2013
by mh＠informatik.uni-kiel.de 25 Mar '13

25 Mar '13

====================================================================== CALL FOR PAPERS WFLP 2013 22nd International Workshop on Functional and (Constraint) Logic Programming 27th Workshop on Logic Programming part of the Kiel Declarative Programming Days 2013 September 11-13, 2013, Kiel, Germany http://www-ps.informatik.uni-kiel.de/wflp2013/ ====================================================================== GENERAL WFLP 2013 is the combination of two workshops of a successful series of annual workshops on declarative programming. The international workshops on functional and logic programming aim at bringing together researchers interested in functional programming, logic programming, as well as their integration. The workshops on (constraint) logic programming serve as the scientific forum of the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence, and operations research. In this year both workshops will be jointly organized and co-located with the 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) under the umbrella of the Kiel Declarative Programming Days in order to promote 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 technical program of the workshop will include invited talks, presentations of refereed papers and demo presentations. ---------------------------------------------------------------------- TOPICS The topics of interest include (but are not limited to): * Functional programming * Logic programming * Constraint programming * Deductive databases, data mining * Extensions of declarative languages, objects * Multi-paradigm declarative programming * Foundations, semantics, nonmonotonic reasoning, dynamics * Parallelism, concurrency * Program analysis, abstract interpretation * Program transformation, partial evaluation, meta-programming * Specification, verification, declarative debugging * Knowledge representation, machine learning * Interaction of declarative programming with other formalisms (e.g., agents, XML, Java) * Implementation of declarative languages * Advanced programming environments and tools * Software technique for declarative programming * Applications The primary focus is on new and original research results but submissions describing innovative products, prototypes under development, application systems, or interesting experiments (e.g., benchmarks) are also encouraged. ---------------------------------------------------------------------- IMPORTANT DATES Submission of papers: June 16, 2013 Notification of acceptance: July 18, 2013 Camera-ready papers: August 18, 2013 Workshop: September 11-13, 2013 ---------------------------------------------------------------------- SUBMISSION GUIDELINES Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Papers can be submitted as technical papers or system descriptions. Technical papers should consist of up to 15 pages, system descriptions should be no longer than 6 pages. Formatting should follow the LNCS guidelines. The details about the procedure to submit papers electronically are described on the conference website. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. ---------------------------------------------------------------------- BEST NEWCOMER AWARD An award will be given to the best paper exclusively written by one or several young researchers who have not yet obtained their PhD degrees. Papers written in this category should be clearly marked as a "Student paper" in the submission. ---------------------------------------------------------------------- PROCEEDINGS All accepted papers will be published as a technical report. As for previous events, it is planned to publish selected papers as post-conference proceedings in the Springer LNCS series. Previous proceedings appeared as Springer LNCS volumes 6816 (WFLP 2011), 6559 (WFLP 2010), 5979 (WFLP 2009), 5437 (WLP 2007), and 3392 (WLP 2004). ---------------------------------------------------------------------- PROGRAM COMMITTEE Elvira Albert Universidad Complutense de Madrid, Spain Sergio Antoy Portland State University, USA Francois Bry University of Munich, Germany Juergen Dix University of Clausthal, Germany Rachid Echahed CNRS, University of Grenoble, France Moreno Falaschi Universita di Siena, Italy Sebastian Fischer Kiel, Germany Thom Fruehwirth University of Ulm, Germany Michael Hanus University of Kiel, Germany (Chair) Oleg Kiselyov Monterey (CA), USA Herbert Kuchen University of Muenster, Germany Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Torsten Schaub University of Potsdam, Germany Peter Schneider-Kamp University of Southern Denmark, Denmark Dietmar Seipel University of Wuerzburg, Germany Hans Tompits Vienna University of Technology, Austria German Vidal Universidad Politecnica de Valencia, Spain Janis Voigtlaender University of Bonn, Germany ---------------------------------------------------------------------- CONTACT Michael Hanus University of Kiel, Germany Email: mh(a)informatik.uni-kiel.de ----------------------------------------------------------------------

1 0

[ANN] hsndfile 0.7
by Stefan Kersten 25 Mar '13

25 Mar '13

I am happy to announce version 0.7 of hsndfile [1], a set of Haskell bindings to the venerable libsndfile library. This release is a bugfix and maintenance release, thanks to Roman Cheplyaka for his contributions! Changes since 0.6 [3]: * Read and write signed instead of unsigned integer samples and rename `sf_readf_wordXX` and `sf_writef_wordXX` to `sf_readf_intXX` and `sf_writef_intXX`, respectively * Add new supported header and sample formats Have fun, sk [1] http://hackage.haskell.org/package/hsndfile [2] http://www.mega-nerd.com/libsndfile/ [3] https://github.com/kaoskorobase/hsndfile/blob/master/ChangeLog.md

1 0

Oregon Programming Languages Summer School - call for participation
by Amal Ahmed 22 Mar '13

22 Mar '13

This year's Oregon PL Summer School will take place from July 22nd to August 3rd. The registration deadline is April 16th. Full information on registration and scholarships an be found here: http://www.cs.uoregon.edu/Activities/summerschool The school has a long and successful tradition (sponsored by the NSF, ACM SIGPLAN, and industry). It covers current research in the theory and practice of programming languages. Material is presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. Prerequisites are an elementary knowledge of logic and mathematics, as covered in undergraduate classes on discrete mathematics, and some knowledge of programming languages at the level of an undergraduate survey course. A new feature this year is a Coq boot camp session, to be held on July 21st -- one day before the summer school officially begins. The boot camp will provide a one-day, intensive, hands-on introduction to the practical mechanics of the Coq proof assistant. More information is available at the summer school website. This year's program is titled Types, Logic, and Verification. The speakers and topics include: Amal Ahmed -- Logical Relations Northeastern University Robert Harper -- Type Theory Foundations Carnegie Mellon University Dan Licata -- Dependently-Typed Programming in Agda Carnegie Mellon University and Institute for Advanced Study Greg Morrisett -- Coq as a Programming Language Harvard University Simon Peyton-Jones -- Adventures with Types in Haskell Microsoft Research Frank Pfenning -- Linear Logic and Session-based Concurrency Carnegie Mellon University Andrew Tolmach -- Software Foundations in Coq Portland State University Stephanie Weirich -- Designing Dependently-Typed Programming Languages University of Pennsylvania Steve Zdancewic -- Verifying LLVM Optimizations in Coq University of Pennsylvania We hope you can join us for this excellent program. Amal Ahmed Zena Ariola Bob Constable Frank Pfenning Benjamin Pierce OPLSS 2013 organizers

1 0

2nd CFP: SBLP 2013 (17th Brazilian Symposium on Programming Languages)
by Andre Rauber Du Bois 21 Mar '13

21 Mar '13

[Apologies if you receive multiple copies of this CFP] ======================================================= 2nd CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Brasília, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.cic.unb.br/sblp ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): April 19th Full paper submission: April 26th, 2013 Notification of acceptance: May 31st, 2013 Final papers due: June 28th, 2013 INVITED SPEAKERS * Tim Harris, Oracle Labs * More TBA INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Brasília, Brazil, on September 29th to October 4th, 2013. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013, http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer (pending approval). For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system at http://www.easychair.org/conferences/?conf=sblp2013. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonifácio, UnB Diego Aranha, UnB PROGRAMME CHAIRS André Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS André Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quintão Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho João F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel António Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu

1 0

Haskell Weekly News: Issue 263
by Daniel Santa Cruz 21 Mar '13

21 Mar '13

Welcome to issue 263 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 10 to 16, 2013. Quotes of the Week * shachaf: Did someone give edwardk a committee bit? Top Reddit Stories * Restored: the Haskell mailing list archives: 1990-2000. The lost books of Haskell Domain: code.haskell.org, Score: 71, Comments: 9 On Reddit: [1] http://goo.gl/wYs4E Original: [2] http://goo.gl/1Hw4G * Dependently Typed Functional Programming with Idris [video] Domain: vimeo.com, Score: 49, Comments: 20 On Reddit: [3] http://goo.gl/RDII5 Original: [4] http://goo.gl/AmmPJ * Snake game in Haskell Domain: self.haskell, Score: 48, Comments: 19 On Reddit: [5] http://goo.gl/HssiG Original: [6] http://goo.gl/HssiG * A simple graphical notation for lambda calculus Domain: binarylambda.blogspot.com, Score: 46, Comments: 35 On Reddit: [7] http://goo.gl/I3xqp Original: [8] http://goo.gl/sY6gl * Simon Peyton Jones on Adventures with types (Functional Programming eXchange 2013) Domain: skillsmatter.com, Score: 46, Comments: 27 On Reddit: [9] http://goo.gl/wUvon Original: [10] http://goo.gl/XCWsE * Guide to GHC Extensions (just some simple ones for now, will expand over time) - School of Haskell Domain: fpcomplete.com, Score: 42, Comments: 25 On Reddit: [11] http://goo.gl/XhFK5 Original: [12] http://goo.gl/Wa0K3 * layers-0.1: Modular type class machinery for monad transformer stacks. Domain: hackage.haskell.org, Score: 37, Comments: 30 On Reddit: [13] http://goo.gl/nkimL Original: [14] http://goo.gl/HFBxI * Type Families and Pokemon: School of Haskell Pick of the Week Domain: fpcomplete.com, Score: 35, Comments: 3 On Reddit: [15] http://goo.gl/mITH3 Original: [16] http://goo.gl/oymkn * Gale: an IDE for creating games in Haskell Domain: youtube.com, Score: 31, Comments: 4 On Reddit: [17] http://goo.gl/2k28x Original: [18] http://goo.gl/9SxFS * What is the best way to make a simple web service in Haskell? Domain: self.haskell, Score: 31, Comments: 34 On Reddit: [19] http://goo.gl/sVAe7 Original: [20] http://goo.gl/sVAe7 * Wadler's Blog: Informatics 1: Functional Programming Domain: wadler.blogspot.ro, Score: 25, Comments: 3 On Reddit: [21] http://goo.gl/70Ocg Original: [22] http://goo.gl/z4b38 * Constructions on Typeclasses, Part 1: F-Algebras Domain: lukepalmer.wordpress.com, Score: 24, Comments: 0 On Reddit: [23] http://goo.gl/qGsVj Original: [24] http://goo.gl/s947R * cabal-dev updated on hackage Domain: haskell.org, Score: 24, Comments: 37 On Reddit: [25] http://goo.gl/LUOQZ Original: [26] http://goo.gl/nMut4 * monoid-subclasses: ListLike-like, only built on sound theoretical foundations Domain: hackage.haskell.org, Score: 22, Comments: 24 On Reddit: [27] http://goo.gl/gA46h Original: [28] http://goo.gl/4QOKw * Introduction to Concurrent Haskell - Simon Marlow [FP Days Cambridge 2012] Domain: infoq.com, Score: 22, Comments: 1 On Reddit: [29] http://goo.gl/CS0xV Original: [30] http://goo.gl/TrVo9 Top StackOverflow Questions * Proposal for local data declarations / instances votes: 15, answers: 1 Read on SO: [31] http://goo.gl/VCd4K * What is the equivalent Haskell type for C99 bool when using FFI? votes: 14, answers: 2 Read on SO: [32] http://goo.gl/mm3hC * Disadvantages of using INLINABLE pragma votes: 13, answers: 1 Read on SO: [33] http://goo.gl/zxnBu * How to compare two lists in Haskell? votes: 11, answers: 4 Read on SO: [34] http://goo.gl/kTXqL * Haskell space usage compile time restrictions votes: 11, answers: 2 Read on SO: [35] http://goo.gl/vy7wO * haskell - Average floating point error using QuickCheck votes: 10, answers: 1 Read on SO: [36] http://goo.gl/MNsnL * Trying to understand function application operator in Haskell votes: 9, answers: 1 Read on SO: [37] http://goo.gl/ymFv4 * Haskell equivalent to Scala's groupBy votes: 9, answers: 4 Read on SO: [38] http://goo.gl/0uceW * (Num a) vs Integer type inference votes: 9, answers: 3 Read on SO: [39] http://goo.gl/N3CWn Until next time, +Daniel Santa Cruz References 1. http://code.haskell.org/~dons/haskell-1990-2000/ 2. http://www.reddit.com/r/haskell/comments/1aescj/restored_the_haskell_mailin… 3. http://vimeo.com/61576198 4. http://www.reddit.com/r/haskell/comments/1a7rbk/dependently_typed_functiona… 5. http://www.reddit.com/r/haskell/comments/1a12vg/snake_game_in_haskell/ 6. http://www.reddit.com/r/haskell/comments/1a12vg/snake_game_in_haskell/ 7. http://binarylambda.blogspot.com/2013/03/lambda-diagrams-lambda-diagrams-fe… 8. http://www.reddit.com/r/haskell/comments/1a47ox/a_simple_graphical_notation… 9. http://skillsmatter.com/podcast/java-jee/keynote-3842 10. http://www.reddit.com/r/haskell/comments/1aedqt/simon_peyton_jones_on_adven… 11. https://www.fpcomplete.com/user/PthariensFlame/guide-to-ghc-extensions ? 12. http://www.reddit.com/r/haskell/comments/1a3ye8/guide_to_ghc_extensions_jus… 13. http://hackage.haskell.org/package/layers 14. http://www.reddit.com/r/haskell/comments/1aazok/layers01_modular_type_class… 15. https://www.fpcomplete.com/user/nubis/type-families-and-pokemon 16. http://www.reddit.com/r/haskell/comments/1adukd/type_families_and_pokemon_s… 17. http://www.youtube.com/watch?v=dKBFJa9N3zY 18. http://www.reddit.com/r/haskell/comments/1a3k64/gale_an_ide_for_creating_ga… 19. http://www.reddit.com/r/haskell/comments/1acfbx/what_is_the_best_way_to_mak… 20. http://www.reddit.com/r/haskell/comments/1acfbx/what_is_the_best_way_to_mak… 21. http://wadler.blogspot.ro/2013/03/informatics-1-functional-programming.html 22. http://www.reddit.com/r/haskell/comments/1a5uio/wadlers_blog_informatics_1_… 23. http://lukepalmer.wordpress.com/2013/03/12/constructions-on-typeclasses-par… 24. http://www.reddit.com/r/haskell/comments/1a5dtt/constructions_on_typeclasse… 25. http://www.haskell.org/pipermail/haskell-cafe/2013-February/106719.html 26. http://www.reddit.com/r/haskell/comments/1a6t0j/cabaldev_updated_on_hackage/ 27. http://hackage.haskell.org/package/monoid-subclasses 28. http://www.reddit.com/r/haskell/comments/1a33sb/monoidsubclasses_listlikeli… 29. http://www.infoq.com/presentations/Concurrent-Haskell 30. http://www.reddit.com/r/haskell/comments/1a4pvi/introduction_to_concurrent_… 31. http://stackoverflow.com/questions/15320391/proposal-for-local-data-declara… 32. http://stackoverflow.com/questions/15368658/what-is-the-equivalent-haskell-… 33. http://stackoverflow.com/questions/15440804/disadvantages-of-using-inlinabl… 34. http://stackoverflow.com/questions/15319136/how-to-compare-two-lists-in-has… 35. http://stackoverflow.com/questions/15374829/haskell-space-usage-compile-tim… 36. http://stackoverflow.com/questions/15364518/haskell-average-floating-point-… 37. http://stackoverflow.com/questions/15362990/trying-to-understand-function-a… 38. http://stackoverflow.com/questions/15412027/haskell-equivalent-to-scalas-gr… 39. http://stackoverflow.com/questions/15448351/num-a-vs-integer-type-inference 40. https://plus.google.com/105107667630152149014/about

1 0

ANN: universe-0.0
by wagnerdm＠seas.upenn.edu 20 Mar '13

20 Mar '13

I've long heralded "data-default" as my favorite ten-line package... before it was released, I found my self writing those a few lines in each project to do just what's done there. Inspired by this, and the fact that there's a separate ten lines that I find myself writing in nearly every project, I'm pleased to announce the initial release of "universe". The package sports just two load-bearing lines: class Universe a where universe :: [a] class Universe a => Finite a where universeF :: [a] ...along with a dozen or so instances of each. The instance do nothing more than enumerating all the values of the given type. Hope you enjoy it, and let me know if you think there are some important missing instances! http://hackage.haskell.org/package/universe https://github.com/dmwit/universe ~d

1 1