From calimeri at mat.unical.it Mon Dec 1 23:39:36 2014 From: calimeri at mat.unical.it (Francesco Calimeri) Date: Tue, 2 Dec 2014 00:39:36 +0100 Subject: [Haskell] CfP LPNMR 2015 Announcement: selected papers to appear in AI Journal and TPLP Message-ID: [apologies for any cross-posting] Call for Papers --------------------------------------------------------------------------- 13th International Conference on Logic Programming and Non-monotonic Reasoning LPNMR 2015 http://lpnmr2015.mat.unical.it/ Lexington, KY, USA September 27-30, 2015 (Collocated with the 4th Conference on Algorithmic Decision Theory 2015) --------------------------------------------------------------------------- AIMS AND SCOPE LPNMR 2015 is the thirteenth in the series of international meetings on logic programming and non-monotonic reasoning. LPNMR is a forum for exchanging ideas on declarative logic programming, non-monotonic reasoning, and knowledge representation. The aim of the conference is to facilitate interactions between researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those working in knowledge representation and nonmonotonic reasoning. LPNMR strives to encompass theoretical and experimental studies that have led or will lead to the construction of systems for declarative programming and knowledge representation, as well as their use in practical applications. This edition of LPNMR will feature several workshops, a special session dedicated to the 6th ASP Systems Competition, and will be collocated with the 4th Algorithmic Decision Theory Conference, ADT 2015. Joint LPNMR-ADT Doctoral Consortium will be a part of the program. Authors are invited to submit papers presenting original and unpublished research on all aspects of non-monotonic approaches in logic programming and knowledge representation. We invite submissions of both long and short papers. TOPICS Conference topics include, but are not limited to: 1. Foundations of LPNMR Systems: * Semantics of new and existing languages; * Action languages, causality; * Relationships among formalisms; * Complexity and expressive power; * Inference algorithms and heuristics for LPNMR systems; * Extensions of traditional LPNMR languages such as new logical connectives or new inference capabilities; * Updates, revision, and other operations on LPNMR systems; * Uncertainty in LPNMR systems. 2. Implementation of LPNMR systems: * System descriptions, comparisons, evaluations; * Algorithms and novel techniques for efficient evaluation; * LPNMR benchmarks. 3. Applications of LPNMR: * Use of LPNMR in formalization of Commonsense Reasoning and other areas of KR; * LPNMR languages and algorithms in planning, diagnosis, argumentation, reasoning with preferences, decision making and policies; * Applications of LPNMR languages in data integration and exchange systems, software engineering and model checking; * Applications of LPNMR to linguistics, psychology, and other sciences * Integration of LPNMR systems with other computational paradigms; * Embedded LPNMR: Systems using LPNMR subsystems. SUBMISSION LPNMR 2015 welcomes submissions of long papers (13 pages) or short papers (6 pages) in the following categories: * Technical papers * System descriptions * Application descriptions The indicated number of pages includes title page, references and figures. All submissions will be peer-reviewed and accepted papers will appear in the conference proceedings published in the Springer-Verlag Lecture Notes in Artificial Intelligence (LNAI/LNCS) series. At least one author of each accepted paper is expected to register for the conference to present the work. Submissions must be formatted according to the Springer LNCS author instructions, http://www.springer.com/comp/lncs/Authors.html must be written in English, and present original research. Paper submission will be electronic through the LPNMR-15 Easychair site: https://www.easychair.org/conferences/?conf=lpnmr2015 Two best papers of general AI interest will be invited for rapid publication in the journal Artificial Intelligence - Journal - Elsevier. Two best papers with narrower logic programming focus will be invited for a rapid publication in the journal Theory and Practice of Logic Programming. MULTIPLE SUBMISSION POLICY LPNMR 2015 will not accept any paper which, at the time of submission, is under review or has already been published or accepted for publication in a journal or another conference. Authors are also required not to submit their papers elsewhere during LPNMR's review period. However, these restrictions do not apply to previous workshops with a limited audience and without archival proceedings. ASSOCIATED EVENTS WORKSHOPS - LPNMR 2015 will include specialized workshops to be held on September 27 prior to the main conference. Currently planned workshops include: - Grounding, Transforming, and Modularizing Theories with Variables Organizers: Marc Denecker, Tomi Janhunen - Action Languages, Process Modeling, and Policy Reasoning Organizer: Joohyung Lee - Natural Language Processing and Automated Reasoning Organizers: Marcello Balduccini, Ekaterina Ovchinnikova, Peter Schueller - Learning and Nonmonotonic Reasoning Organizers: Alessandra Russo and Alessandra Mileo ASP COMPETITION - A special session dedicated to a discussion of the 6th ASP System Competition, including the methodology of the competition, benchmarks used, lessons learned and, most importantly, the results and the announcement of the winners. ALGORITHMIC DECISION THEORY (ADT) 2015 (collocated - same time and place) Algorithmic Decision Theory is a vibrant and growing area of research concerned with algorithmic aspects of problems arising in social choice and economics that involve optimal ways to aggregate preferences. The area abounds in hard computational problems and may be an axciting area of applications for ASP. The two conferences will seek ways to identify and promote synergies between their respective areas of focus. JOINT LPNMR-ADT DOCTORAL CONSORTIUM: Details to be announced co-Chairs: - Esra Erdem (LPNMR), Sabanci University, Turkey - Nick Mattei (ADT), NICTA, Australia IMPORTANT DATES (TENTATIVE) * Paper registration: April 13, 2015 * Paper submission: April 20, 2015 * Notification: June 1, 2015 * Final versions due: June 15, 2015 VENUE Lexington is a medium size, pleasant and quiet university town. It is located in the heart of the so-called Bluegrass Region in Central Kentucky. The city is surrounded by beautiful horse farms on green pastures dotted with ponds and traditional architecture stables, and small race tracks, and bordered by white or black fences. The Horse Museum is as beautifully located as it is interesting. Overall, the city has a nice feel that mixes well old and new. The conference will be held in the Hilton Lexington Downtown hotel. GENERAL CHAIR Victor Marek, University of Kentucky, KY, USA PROGRAM CHAIRS Giovambattista Ianni, University of Calabria, Italy Mirek Truszczynski, University of Kentucky, KY, USA WORKSHOPS CHAIR Yuliya Lierler, University of Nebrska at Omaha, NE, USA PUBLICITY CHAIR Francesco Calimeri, University of Calabria, Italy PROGRAM COMMITTEE Agostino Dovier, Universit? di Udine, Italy Agust?n Valverde, Universidad de M?laga, Spain Alessandra Mileo, National University of Ireland, Galway, INSIGHT Centre for Data Analytics, Ireland Andrea Formisano, Dip. di Matematica e Informatica, Universit? di Perugia, Italy Axel Polleres, Vienna University of Economics and Business, Austria Bart Bogaerts, Department of Computer Science, KU Leuven, Belgium Chiaki Sakama, Wakayama University, Japan Chitta Baral, Arizona State University, USA Christoph Redl, Vienna University of Technology, Austria Daniela Inclezan, Miami University, USA David Pearce, Universidad Polit?cnica de Madrid, Spain Emilia Oikarinen, Aalto University, Finland Enrico Pontelli, New Mexico State University, USA Esra Erdem, Sabanci University, Istanbul, Turkey Eugenia Ternovska, Simon Fraser University, Canada Fangkai Yang, Schlumberger Ltd Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong Francesco Calimeri, Universit? della Calabria, Italy Gerhard Brewka, Leipzig University, Germany Giovanni Grasso, Oxford University, UK Hannes Strass, Leipzig University, Germany Hans Tompits, Vienna University of Technology, Austria James Delgrande, Simon Fraser University, Canada Jia-Huai You, University of Alberta, Canada Joohyung Lee, Arizona State University, USA Jose Julio Alferes, Universidade Nova de Lisboa, Portugal Kewen Wang, Griffith University, Australia Marc Denecker, K.U.Leuven, Belgium Marcello Balduccini, Drexel University, USA Marina De Vos, University of Bath, UK Martin Gebser, University of Potsdam, Germany Matthias Knorr, CENTRIA, Universidade Nova de Lisboa, Portugal Mauricio Osorio, Fundacion de la Universidad de las Americas, Puebla, Mexico Michael Fink, Vienna University of Technology, Austria Michael Gelfond, Texas Tech University, USA Orkunt Sabuncu, University of Potsdam, Germany Paul Fodor, Stony Brook University, USA Pedro Cabalar, University of Corunna, Spain Saadat Anwar, Arizona State University, USA Stefan Woltran, Vienna University of Technology Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione, e Matematica, Univ. di L'Aquila, Italy Terrance Swift, CENTRIA, Universidade Nova de Lisboa, Portugal Thomas Eiter, Vienna University of Technology, Austria Tomi Janhunen, Aalto University, Finland Torsten Schaub, University of Potsdam, Germany Tran Cao Son, New Mexico State University, USA Vladimir Lifschitz, University of Texas at Austin, USA Wolfgang Faber, University of Huddersfield, UK Yi Zhou, University of Western Sydney, Australia Yisong Wang, Guizhou University, China Yuliya Lierler, University of Nebraska at Omaha, USA CONTACT lpnmr2015 at mat.unical.it From keller at cse.unsw.edu.au Tue Dec 2 03:39:46 2014 From: keller at cse.unsw.edu.au (Gabriele Keller) Date: Tue, 2 Dec 2014 14:39:46 +1100 Subject: [Haskell] Submission deadline coming up 22/12/2014: JFP special issue on Parallel and Concurrent Programming Message-ID: If you are working on parallel or concurrent functional programming, please consider submitting an article about your work to the Special Issue of the Journal of Functional Programming on this topic. This is a reminder that the deadline is on the 22nd of December: http://journals.cambridge.org/action/displaySpecialPage?pageId=6120 Kind regards, Gabriele Keller From Graham.Hutton at nottingham.ac.uk Tue Dec 2 09:20:02 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 2 Dec 2014 09:20:02 +0000 Subject: [Haskell] 10 PhD studentships in Nottingham Message-ID: <8B7B0EAA-B0E0-4905-BF0E-76A59BE3D47E@exmail.nottingham.ac.uk> Dear all, The School of Computer Science in Nottingham is advertising 10 fully-funded PhD studentships. Applicants in the area of the Functional Programming lab (fp.cs.nott.ac.uk) are encouraged! If you are interested in applying, please contact a potential supervisor in the FP lab prior to submitting your application: Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Venanzio Capretta - type theory, mathematical logic, corecursive structures, proof assistants, dependently-typed programming. Graham Hutton - not taking on any new students this year. Henrik Nilsson - functional reactive programming, modelling and simulation, domain-specific languages, probabilistic languages. Best wishes, Graham +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK http://tinyurl.com/ten-phds Applications are invited for up to ten fully-funded PhD studentships in the School of Computer Science at the University of Nottingham, starting on 1st October 2015. The topics for the studentships are open, but should relate to the interests of one of the School?s research groups: Agents Lab; Automated Scheduling, Optimisation and Planning; Computer Vision Lab; Functional Programming Lab; Intelligent Modelling and Analysis; Mixed Reality Lab; Networked Systems. The studentships are for three years and include a stipend of ?13,863 per year and tuition fees, and are available to students of any nationality. Applicants are normally expected to have a first-class Masters or Bachelors degree in Computer Science or a related discipline, and must obtain the support of a potential supervisor in the School prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to . 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, your proposed research area and topic, 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: 14th January 2015 +-----------------------------------------------------------+ 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. From neil.ghani at strath.ac.uk Thu Dec 4 12:07:16 2014 From: neil.ghani at strath.ac.uk (Neil Ghani) Date: Thu, 4 Dec 2014 12:07:16 +0000 Subject: [Haskell] 2 PostDocs in HoTT Message-ID: <1E3B998E-5BD2-4D21-B902-D157D8756635@strath.ac.uk> =============================================== Homotopy Type Theory: Programming and Verification 2 PostDocs, each 4 Years Universities of Strathclyde and Nottingham Applications are invited for two postdocs and one PhD student to work on the recently funded EPSRC grant "Homotopy Type Theory: Programming and Verification" obtained by Professor Neil Ghani and Dr Conor McBride (University of Strathclyde), Dr Thorsten Altenkirch (University of Nottingham) and Dr Nicola Gambino (University of Leeds). One postdoc and will work on more theoretical aspects of the project in Nottingham, while the other postdoc will work on implementation issues in Strathclyde. Nevertheless, the reality is that we will be working as a team with frequent visits expected between ourselves and our collaborators. Homotopy Type Theory (HoTT) is a revolutionary new approach to type theory where types are interpreted as spaces, terms as points and equalities as paths. Decades of research in homotopy theory has uncovered the structure of such paths and HoTT uses this structure as the basis of a new theory of equality. Excitingly, within homotopy theory, one naturally studies higher homotopies of paths between paths and this gives the higher dimensional structure of equality we previously lacked. The objective of this grant is to translate the advances of HoTT into more concrete programming language and verification tools. For more details, please email Neil Ghani (ng at cis.strath.ac.uk) Conor McBride (conor.mcbride at strath.ac.uk) Thorsten Altenkirch (Thorsten.Altenkirch at nottingham.ac.uk) Nicola Gambino (n.gambino at leeds.ac.uk) From pangjun at gmail.com Thu Dec 4 14:45:07 2014 From: pangjun at gmail.com (Jun PANG) Date: Thu, 4 Dec 2014 15:45:07 +0100 Subject: [Haskell] TASE 2015 -- Preliminary Call for Papers Message-ID: TASE 2015 - Preliminary CALL FOR PAPERS ****************************************************************** The 9th International Symposium on Theoretical Aspects of Software Engineering (TASE 2015) 12-14 September 2015, Nanjing, China http://tase2015.nuaa.edu.cn For more information email: tase2015 at easychair.org ****************************************************************** -------- OVERVIEW -------- The 9th Theoretical Aspects of Software Engineering Conference (TASE 2015) will be held in Nanjing, China in September, 2015. Modern society is increasingly dependent on software systems that are becoming larger and more complex. This poses new challenges to the various aspects of software engineering, for instance, software dependability in trusted computing, interaction with physical components in cyber physical systems, distribution in cloud computing applications, etc. Hence, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2015 aims to provide a forum for people from academia and industry to communicate their latest results on theoretical advances in software engineering. TASE 2015 is the 9th in the TASE series. The past TASE symposiums were successfully held in Shanghai ('07), Nanjing ('08), Tianjin ('09), Taipei ('10), Xi'an ('11), Beijing ('12), Birmingham ('13), Changsha('14).The proceedings of the TASE 2015 symposium are planned to be published by the IEEE Computer Society Press. ------ TOPICS ------ The symposium is devoted to theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Specification and Verification * Program Analysis * Software Testing * Model-Driven Engineering * Software Architectures and Design * Aspect and Object Orientation * Embedded and Real-Time Systems * Software Processes and Workflows * Component-Based Software Engineering * Software Safety, Security and Reliability * Reverse Engineering and Software Maintenance * Service-Oriented and Cloud Computing * Semantic Web and Web Services * Type System and Theory * Program Logics and Calculus * Probability in Software Engineering ---------- SUBMISSION ---------- Submission should be done through the TASE 2015 submission page, handled by the EasyChair conference system: https://www.easychair.org/conferences/?conf=tase2015 As in previous years, the proceedings of the conference are planned to be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 8 pages in Two-Column IEEE format --------------- IMPORTANT DATES --------------- Abstract submission: 7 March 2015 (23h59 GMT) Paper submission: 14 March 2015 (23h59 GMT) Notification: 23 May 2015 Camera-ready: 13 June 2015 Conference: 12-14 September 2015 ------------- GENERAL CHAIR ------------- Jifeng He (East China Normal University, China) ----------------- PROGRAM CO-CHAIRS ----------------- Zhiqiu Huang (Nanjing University of Aeronautics and Astronautics, China) Jun Sun (Singapore University of Technology and Design) ----------------- STEERING COMMITTE ----------------- Keijiro Araki (Kyushu University, Japan) Shengchao Qin (Teesside University, UK) Jifeng He (East China Normal University, China) Huibiao Zhu (East China Normal University, China) Michael Hinchey (Lero, Ireland) ----------------- PROGRAM COMITTIEE ----------------- TBA ---------------- ORGANIZING CHAIR ---------------- Ou Wei (Nanjing University of Aeronautics and Astronautics, China) ---------------- PUBLICITY CHAIRS ---------------- Jun Hun (Nanjing University of Aeronautics and Astronautics, China) Jun Pang (University of Luxembourg) Yu Zhou (Nanjing University of Aeronautics and Astronautics, China) From atze at uu.nl Mon Dec 8 09:04:13 2014 From: atze at uu.nl (Atze Dijkstra) Date: Mon, 8 Dec 2014 10:04:13 +0100 Subject: [Haskell] ANNOUNCE: Applied Functional Programming (AFP) Summerschool 6-17 July 2015, Utrecht, Netherlands Message-ID: <34196EDA-74C3-4A2E-94E0-BE69028E43B1@uu.nl> =========== AFP Summerschool 2015 =========== Applied Functional Programming (AFP) Summerschool July 6-17, 2015 Utrecht University, Department of Information and Computing Sciences Utrecht, The Netherlands Summerschool & registration website: http://www.utrechtsummerschool.nl/courses/science/applied-functional-programming-in-haskell AFP website : http://www.cs.uu.nl/wiki/USCS contact : Uscs-afp at lists.science.uu.nl *** The 2015 edition of the Applied Functional Programming (AFP) Summerschool in Utrecht, Netherlands will be held from 6-17 July 2015. The summerschool teaches Haskell on both beginners and advanced levels via lectures and lab exercises. More info can be found via the references above, included here is a summary from the summerschool info: ``Typed functional programming in Haskell allows for the development of compact programs in minimal time and with maximal guarantees about robustness and correctness. The course introduces Haskell as well as its theoretical underpinnings such as typed lambda calculus, and Damas-Milner type inference. There is ample opportunity to put this all in practice during lab sessions. Typed functional programming languages allow for the development of robust, concise programs in a short amount of time. The key advantages are higher-order functions as an abstraction mechanism, and an advanced type system for safety and reusability. This course introduces Haskell, a state-of-the-art functional programming language, together with some of its theoretical background, such as typed lambda calculi, referential transparency, Damas-Milner type inference, type level programming, and functional design patterns. We will combine this with applications of functional programming, concentrating on topics such as language processing, building graphical user interfaces, networking, databases, and programming for the web. The goal of the course is not just to teach the programming language and underlying theory, but also to learn about the Haskell community and to get hands-on experience by doing lab exercises or a Haskell project of your own.'' *** This year is somewhat special in that the Tour de France starts in Utrecht the weekend before the start of the summerschool. It is an opportunity for enjoying the related festivities. It also implies that housing may be more difficult the weekend before the summerschool, something to keep in mind when you wait with registration until the latest. regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze . /--| \ Fax : +31-30-2513971 .... | Email: atze at uu.nl ............... / |___\ _______________________________________________ Haskell mailing list Haskell at haskell.org http://www.haskell.org/mailman/listinfo/haskell From dstcruz at gmail.com Thu Dec 11 04:50:02 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 10 Dec 2014 21:50:02 -0700 Subject: [Haskell] Haskell Weekly News: Issue 313 Message-ID: Welcome to issue 313 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from November 16 to December 6, 2014 Quotes of the Week * Dijkstra: How do we convince people that in programming simplicity and clarity (in short: what mathematicians call "elegance") are not a dispensable luxury, but a crucial matter that decides between success and failure? * Dijkstra: Simplicity is a great virtue but it requires hard work to achieve it and education to appreciate it. And to make matters worse: complexity sells better. * monochrom: those who have learned from history are bound to helplessly watch other people repeat it. Top Reddit Stories * 24 Days of GHC Extensions: Welcome! Domain: ocharles.org.uk, Score: 140, Comments: 24 Original: [1] http://goo.gl/HvjuvJ On Reddit: [2] http://goo.gl/4Skf5Z * How I Start: Haskell Domain: howistart.org, Score: 120, Comments: 11 Original: [3] http://goo.gl/T2OCwj On Reddit: [4] http://goo.gl/1bGl7I * Lucid: templating DSL for HTML Domain: chrisdone.com, Score: 105, Comments: 59 Original: [5] http://goo.gl/JJsJlT On Reddit: [6] http://goo.gl/jyvkHu * Erik Meijer planning to make Category theory for programmers MOOC Domain: imgur.com, Score: 105, Comments: 45 Original: [7] http://goo.gl/ZnCi6Z On Reddit: [8] http://goo.gl/8vOFP0 * An opportunity in Singapore Domain: self.haskell, Score: 98, Comments: 31 Original: [9] http://goo.gl/X0OBAE On Reddit: [10] http://goo.gl/X0OBAE * Dan Piponi working on an audio synthesis tool written in Haskell Domain: plus.google.com, Score: 90, Comments: 1 Original: [11] http://goo.gl/J83NRS On Reddit: [12] http://goo.gl/Cbhx8x * GHC and LLVM: The State of the Union Domain: smart-cactus.org, Score: 86, Comments: 13 Original: [13] http://goo.gl/CA7R4C On Reddit: [14] http://goo.gl/l3L8H7 * Learning Haskell as a Nonprogrammer Domain: superginbaby.wordpress.com, Score: 84, Comments: 77 Original: [15] http://goo.gl/9Q1ufS On Reddit: [16] http://goo.gl/Yqni7Y * Announcing Opaleye: SQL-generating embedded domain specific language for Postgres Domain: self.haskell, Score: 84, Comments: 85 Original: [17] http://goo.gl/HoMXjj On Reddit: [18] http://goo.gl/HoMXjj * Deploy any Haskell application. Instantly. Domain: halcyon.sh, Score: 79, Comments: 27 Original: [19] http://goo.gl/sxQWKk On Reddit: [20] http://goo.gl/5V2dMj * Haskell for all: How to build library-agnostic streaming sources Domain: haskellforall.com, Score: 75, Comments: 26 Original: [21] http://goo.gl/1QcyRf On Reddit: [22] http://goo.gl/eYwlBp * Image Processing with Comonads Domain: jaspervdj.be, Score: 74, Comments: 33 Original: [23] http://goo.gl/GZu2oc On Reddit: [24] http://goo.gl/Xsh0z9 * 24 Days of GHC Extensions: View Patterns Domain: ocharles.org.uk, Score: 69, Comments: 39 Original: [25] http://goo.gl/uN3PLf On Reddit: [26] http://goo.gl/2YZ1r0 * Well-Typed are hiring! Domain: well-typed.com, Score: 68, Comments: 36 Original: [27] http://goo.gl/DxYgrT On Reddit: [28] http://goo.gl/2imRKu * 24 Days of GHC Extensions: Pattern Synonyms Domain: ocharles.org.uk, Score: 65, Comments: 20 Original: [29] http://goo.gl/j75DP8 On Reddit: [30] http://goo.gl/VTvCof * How lazy evaluation works Domain: hackhands.com, Score: 63, Comments: 30 Original: [31] http://goo.gl/YPOFaM On Reddit: [32] http://goo.gl/w2uKGJ * Learn You an Agda Domain: williamdemeo.github.io, Score: 59, Comments: 61 Original: [33] http://goo.gl/hQ5DaT On Reddit: [34] http://goo.gl/2I00Zh * 24 Days of GHC Extensions: Record Wildcards Domain: ocharles.org.uk, Score: 59, Comments: 38 Original: [35] http://goo.gl/BnXqjA On Reddit: [36] http://goo.gl/yBzMoY * Functional Programming Patterns (BuildStuff '14) Domain: slideshare.net, Score: 55, Comments: 15 Original: [37] http://goo.gl/fzo56I On Reddit: [38] http://goo.gl/XCy482 * The GHCJS guys are working on TH cross compiling Domain: thread.gmane.org, Score: 54, Comments: 15 Original: [39] http://goo.gl/XyA4FS On Reddit: [40] http://goo.gl/eRULJH * Silk is looking for a Haskell engineer Domain: self.haskell, Score: 53, Comments: 21 Original: [41] http://goo.gl/eB10Wa On Reddit: [42] http://goo.gl/eB10Wa * Keera studios: Haskell games & adventure engine for Android, beta testers wanted! Domain: keera.co.uk, Score: 53, Comments: 8 Original: [43] http://goo.gl/rk7Wrx On Reddit: [44] http://goo.gl/ciCbYp * 24 Days of GHC Extensions: Bang Patterns Domain: ocharles.org.uk, Score: 51, Comments: 34 Original: [45] http://goo.gl/X4Huvh On Reddit: [46] http://goo.gl/eHmymQ * Let's Build a Browser Engine in Haskell: part 6 Domain: hrothen.github.io, Score: 49, Comments: 4 Original: [47] http://goo.gl/mDnmpX On Reddit: [48] http://goo.gl/96aLMl * A Docker build script for GHC 7.8.3 cross-compiler targeting Android Domain: github.com, Score: 49, Comments: 21 Original: [49] http://goo.gl/uCsMNK On Reddit: [50] http://goo.gl/KvY3JX * amazonka - Comprehensive Amazon Web Services SDK Domain: self.haskell, Score: 46, Comments: 17 Original: [51] http://goo.gl/Yi18LS On Reddit: [52] http://goo.gl/Yi18LS * 24 Days of GHC Extensions: Rebindable Syntax (guest post by Benjamin Kovach) Domain: ocharles.org.uk, Score: 46, Comments: 14 Original: [53] http://goo.gl/7e3J1I On Reddit: [54] http://goo.gl/jJJONL * Haskell Communities and Activities Report ? November 2014 Domain: haskell.org, Score: 45, Comments: 6 Original: [55] http://goo.gl/7dfgQk On Reddit: [56] http://goo.gl/fME8UF * A taste of State: parsers are easy Domain: nikita-volkov.github.io, Score: 44, Comments: 4 Original: [57] http://goo.gl/HF4R3O On Reddit: [58] http://goo.gl/d7bLLV * Hybrid server/client Haskell web apps / Michael Snoyman Domain: youtube.com, Score: 42, Comments: 31 Original: [59] http://goo.gl/IbxCkI On Reddit: [60] http://goo.gl/Yjx8wj * Nix: The Cabal Purgatory HOWTO Domain: cse.chalmers.se, Score: 41, Comments: 45 Original: [61] http://goo.gl/pxdnYA On Reddit: [62] http://goo.gl/2uE8ya * Ranjit Jhala talks about Liquid Haskell Domain: youtu.be, Score: 41, Comments: 14 Original: [63] http://goo.gl/EAubrl On Reddit: [64] http://goo.gl/f1D8iz * A quick and easy Emacs configuration for Haskell Domain: github.com, Score: 39, Comments: 16 Original: [65] http://goo.gl/8akoJo On Reddit: [66] http://goo.gl/Ma8iDO Top StackOverflow Questions * Turning A => M[B] into M[A => B] votes: 22, answers: 2 Read on SO: [67] http://goo.gl/P4AXC2 * When are type signatures necessary in Haskell? votes: 19, answers: 3 Read on SO: [68] http://goo.gl/9YcgHo * Boilerplate-free annotation of ASTs in Haskell? votes: 18, answers: 4 Read on SO: [69] http://goo.gl/dNv5kU * Can fusion see through newtype wrappers? votes: 17, answers: 1 Read on SO: [70] http://goo.gl/00ONhp * Haskell: Why use Proxy? votes: 17, answers: 2 Read on SO: [71] http://goo.gl/bWRvVN * Is Haskell's laziness an elegant alternative to Python's generators? votes: 16, answers: 3 Read on SO: [72] http://goo.gl/oblTSW * Type inference interferes with referential transparency votes: 16, answers: 7 Read on SO: [73] http://goo.gl/2nIW1x * What exactly is the kind ?*? in Haskell? votes: 15, answers: 2 Read on SO: [74] http://goo.gl/sOXwgi * What's the difference between partial evaluation and function inlining in a functional language? votes: 14, answers: 1 Read on SO: [75] http://goo.gl/AOZuCH Until next time, [76]+Daniel Santa Cruz References 1. https://ocharles.org.uk/blog/posts/2014-12-01-24-days-of-ghc-extensions.html 2. http://www.reddit.com/r/haskell/comments/2nyy5z/24_days_of_ghc_extensions_welcome/ 3. http://howistart.org/posts/haskell/1 4. http://www.reddit.com/r/haskell/comments/2mkbay/how_i_start_haskell/ 5. http://chrisdone.com/posts/lucid 6. http://www.reddit.com/r/haskell/comments/2my5bc/lucid_templating_dsl_for_html/ 7. http://imgur.com/OQbeouW 8. http://www.reddit.com/r/haskell/comments/2o5m95/erik_meijer_planning_to_make_category_theory_for/ 9. http://www.reddit.com/r/haskell/comments/2nkjdq/an_opportunity_in_singapore/ 10. http://www.reddit.com/r/haskell/comments/2nkjdq/an_opportunity_in_singapore/ 11. https://plus.google.com/107913314994758123748/posts/9EQP1xqsQZ6 12. http://www.reddit.com/r/haskell/comments/2nsdkq/dan_piponi_working_on_an_audio_synthesis_tool/ 13. http://smart-cactus.org/~ben/posts/2014-11-28-state-of-llvm-backend.html 14. http://www.reddit.com/r/haskell/comments/2nphz5/ghc_and_llvm_the_state_of_the_union/ 15. http://superginbaby.wordpress.com/2014/11/18/learning-haskell-as-a-nonprogrammer/ 16. http://www.reddit.com/r/haskell/comments/2mp3fb/learning_haskell_as_a_nonprogrammer/ 17. http://www.reddit.com/r/haskell/comments/2nxx7n/announcing_opaleye_sqlgenerating_embedded_domain/ 18. http://www.reddit.com/r/haskell/comments/2nxx7n/announcing_opaleye_sqlgenerating_embedded_domain/ 19. https://halcyon.sh/ 20. http://www.reddit.com/r/haskell/comments/2ogoot/deploy_any_haskell_application_instantly/ 21. http://www.haskellforall.com/2014/11/how-to-build-library-agnostic-streaming.html 22. http://www.reddit.com/r/haskell/comments/2n8xo4/haskell_for_all_how_to_build_libraryagnostic/ 23. http://jaspervdj.be/posts/2014-11-27-comonads-image-processing.html 24. http://www.reddit.com/r/haskell/comments/2nmf5l/image_processing_with_comonads/ 25. https://ocharles.org.uk/blog/posts/2014-12-02-view-patterns.html 26. http://www.reddit.com/r/haskell/comments/2o341e/24_days_of_ghc_extensions_view_patterns/ 27. http://www.well-typed.com/blog/101/ 28. http://www.reddit.com/r/haskell/comments/2nlbei/welltyped_are_hiring/ 29. https://ocharles.org.uk/blog/posts/2014-12-03-pattern-synonyms.html 30. http://www.reddit.com/r/haskell/comments/2o6bq5/24_days_of_ghc_extensions_pattern_synonyms/ 31. https://hackhands.com/lazy-evaluation-works-haskell/ 32. http://www.reddit.com/r/haskell/comments/2n0991/how_lazy_evaluation_works/ 33. http://williamdemeo.github.io/2014/02/27/learn-you-an-agda/ 34. http://www.reddit.com/r/haskell/comments/2o49aw/learn_you_an_agda/ 35. https://ocharles.org.uk/blog/posts/2014-12-04-record-wildcards.html 36. http://www.reddit.com/r/haskell/comments/2oaj7e/24_days_of_ghc_extensions_record_wildcards/ 37. http://www.slideshare.net/ScottWlaschin/fp-patterns-buildstufflt 38. http://www.reddit.com/r/haskell/comments/2ntyqz/functional_programming_patterns_buildstuff_14/ 39. http://thread.gmane.org/gmane.comp.lang.haskell.ghc.devel/7299 40. http://www.reddit.com/r/haskell/comments/2o9fez/the_ghcjs_guys_are_working_on_th_cross_compiling/ 41. http://www.reddit.com/r/haskell/comments/2mok2d/silk_is_looking_for_a_haskell_engineer/ 42. http://www.reddit.com/r/haskell/comments/2mok2d/silk_is_looking_for_a_haskell_engineer/ 43. http://keera.co.uk/blog/2014/11/24/haskell-android-games-adventure-engine-beta-testing/ 44. http://www.reddit.com/r/haskell/comments/2nesiz/keera_studios_haskell_games_adventure_engine_for/ 45. https://ocharles.org.uk/blog/posts/2014-12-05-bang-patterns.html 46. http://www.reddit.com/r/haskell/comments/2oe1kk/24_days_of_ghc_extensions_bang_patterns/ 47. http://hrothen.github.io/2014/11/19/lets-build-a-browser-engine-in-haskell-part-6/ 48. http://www.reddit.com/r/haskell/comments/2mthmd/lets_build_a_browser_engine_in_haskell_part_6/ 49. https://github.com/sseefried/docker-build-ghc-android 50. http://www.reddit.com/r/haskell/comments/2n5njy/a_docker_build_script_for_ghc_783_crosscompiler/ 51. http://www.reddit.com/r/haskell/comments/2n2sgc/amazonka_comprehensive_amazon_web_services_sdk/ 52. http://www.reddit.com/r/haskell/comments/2n2sgc/amazonka_comprehensive_amazon_web_services_sdk/ 53. https://ocharles.org.uk/blog/guest-posts/2014-12-06-rebindable-syntax.html 54. http://www.reddit.com/r/haskell/comments/2ohm6p/24_days_of_ghc_extensions_rebindable_syntax_guest/ 55. https://www.haskell.org/communities/11-2014/report.pdf 56. http://www.reddit.com/r/haskell/comments/2mirc9/haskell_communities_and_activities_report/ 57. http://nikita-volkov.github.io/a-taste-of-state-parsers-are-easy/ 58. http://www.reddit.com/r/haskell/comments/2mk0ww/a_taste_of_state_parsers_are_easy/ 59. https://www.youtube.com/watch?v=XfINRj5OzGw 60. http://www.reddit.com/r/haskell/comments/2mhzj3/hybrid_serverclient_haskell_web_apps_michael/ 61. http://www.cse.chalmers.se/~bernardy/nix.html 62. http://www.reddit.com/r/haskell/comments/2mv3vo/nix_the_cabal_purgatory_howto/ 63. http://youtu.be/vYh27zz9530 64. http://www.reddit.com/r/haskell/comments/2nc9w6/ranjit_jhala_talks_about_liquid_haskell/ 65. https://github.com/chrisdone/emacs-haskell-config 66. http://www.reddit.com/r/haskell/comments/2oib5x/a_quick_and_easy_emacs_configuration_for_haskell/ 67. http://stackoverflow.com/questions/27267848/turning-a-mb-into-ma-b 68. http://stackoverflow.com/questions/27067905/when-are-type-signatures-necessary-in-haskell 69. http://stackoverflow.com/questions/27157717/boilerplate-free-annotation-of-asts-in-haskell 70. http://stackoverflow.com/questions/27014235/can-fusion-see-through-newtype-wrappers 71. http://stackoverflow.com/questions/27044209/haskell-why-use-proxy 72. http://stackoverflow.com/questions/26952366/is-haskells-laziness-an-elegant-alternative-to-pythons-generators 73. http://stackoverflow.com/questions/27019906/type-inference-interferes-with-referential-transparency 74. http://stackoverflow.com/questions/27095011/what-exactly-is-the-kind-in-haskell 75. http://stackoverflow.com/questions/26996110/whats-the-difference-between-partial-evaluation-and-function-inlining-in-a-func 76. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From compscience.announcement at gmail.com Thu Dec 11 07:06:40 2014 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Thu, 11 Dec 2014 08:06:40 +0100 Subject: [Haskell] LCTES 2015: First CFP Message-ID: First Call for Papers ############################################################ LCTES 2015 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools and Theory for Embedded Systems ############################################################ LCTES provides a link between the programming languages and embedded systems engineering communities. Researchers and developers in these areas are addressing many similar problems, but with different backgrounds and approaches. LCTES is intended to expose researchers and developers from either area to relevant work and interesting problems in the other area and provide a forum where they can interact. ## Important Dates Submission deadline: Feb. 15 Notifications by: Apr. 1 Camera-ready deadline: Apr. 11 LCTES 2015 will be held on June 18 and 19 as part of the FCRC 2015 (Federated Computing Research Conference 2015) in Portland, Oregon, USA. This will be the sixteenth conference in the LCTES series. Embedded system design faces many challenges both with respect to functional requirements and nonfunctional requirements, many of which are conflicting. They are found in areas such as design and developer productivity, verification, validation, maintainability, and meeting performance goals and resource constraints. Novel design-time and run-time approaches are needed to meet the demand of emerging applications and to exploit new hardware paradigms, and in particular to scale up to multicores (including GPUs and FPGAs) and distributed systems built from multicores. LCTES 2015 solicits papers presenting original work on programming languages, compilers, tools, theory, and architectures that help in overcoming these challenges. Research papers on innovative techniques are welcome, as well as experience papers on insights obtained by experimenting with real-world systems and applications. Papers are solicited on, but not limited to, the following topics in embedded systems: - Programming language challenges, including: - Domain-specific languages - Features to exploit multicore, reconfigurable, and other emerging architectures - Features for distributed, adaptive, and real-time control embedded systems - Language capabilities for specification, composition, and construction of embedded systems - Language features and techniques to enhance reliability, verifiability, and security - Virtual machines, concurrency, inter-processor synchronization, and memory management - Compiler challenges, including: - Interaction between embedded architectures, operating systems, and compiler - Interpreters, binary translation, just-in-time compilation, and split compilation - Support for enhanced programmer productivity - Support for enhanced debugging, profiling, and exception/interrupt handling - Optimization for low power/energy, code and data size, and best-effort and real-time performance - Parameterized and structural compiler design space exploration and auto-tuning - Tools for analysis, specification, design, and implementation, including: - Hardware, system software, application software, and their interfaces - Distributed real-time control, media players, and reconfigurable architectures - System integration and testing - Performance estimation, monitoring, and tuning - Run-time system support for embedded systems - Design space exploration tools - Support for system security and system-level reliability - Approaches for cross-layer system optimization - Theory and foundations of embedded systems, including: - Predictability of resource behaviour: energy, space, time - Validation and verification, in particular of concurrent and distributed systems - Formal foundations of model-based design as basis for code generation, analysis, and verification - Mathematical foundations for embedded systems - Models of computations for embedded applications - Novel embedded architectures, including: - Design and implementation of novel architectures - Workload analysis and performance evaluation - Architecture support for new language features, virtualization, compiler techniques, debugging tools - Empirical studies and their reproduction, and confirmation ## Note to Authors A few of the best submissions to LCTES 2015 are planned to be invited for submission, with some revisions, to a special issue of the ACM Transactions on Embedded Computing Systems (TECS). The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. ## Organization General Chair Sam H. Noh, Hongik University, Republic of Korea Program Chairs Sebastian Fischmesiter, University of Waterloo, Canada Jason Xue, City University of Hong Kong, China LCTES Steering Committee Bruce Childers, University of Pittsburgh, USA Jan Vitek, Northeastern University, USA Bjorn De Sutter, University of Edinbugh, Great Britain Jaejin Lee, Seoul National University, Republic of Korea Heiko Falk, Ulm University, Germany Wang Yi, Uppsala University, Sweden Jingling Xue, University of New South Wales, Australia Youtao Zhang, University of Pittsbugh, USA Prasad Kulkarni, University of Kansas, USA Program Committee Luis Almeida, University of Porto, Portugal Ian Bate, University of York, Great Britain Philip Brisk, University of California, Los Angeles, USA Marco Caccamo, University of Illinois, Urbana-Champaign, USA Peter Desnoyers, Northeastern University, USA Petru Eles, Link?pings Universitet, Sweden Georgios Fainekos, Arizona State University, USA Guto Froehlich, Universidade Federal de Santa Catarina Forianopolis, Brazil Giovani Gracioli, Universidade Federal de Santa Catarina Joinville, Brazil Radu Grosu, Technical University Vienna, Austria Nan Guan, Northeastern University, China Apala Guha, IIT Dehli, India Gernot Heiser, University of New South Wales, Australia Michael Jantz, University of Tennessee, Knoxville, USA Zhiping Jia, ShangDong University, China Jinsoo Kim, Sungkyunkwan University, Republic of Korea Raimund Kirner, University of Hertfordshire, Great Britain Kai Lampka, Uppsala University, Sweden Terrence Mak, Chinese University of Hong Kong, China Rahul Mangharam, University of Pennsylvania, USA Florence Maraninchi, VERIMAG, France Sang Lyul MIN, Seoul National University, Republic of Korea Sayan Mitra, University of Illinois, Urbana-Champaign, USA Tulika Mitra, Singapore National University, Singapore Thomas Nolte, M?lardalen University, Sweden Lin Phan, University of Pennsylvania, USA Dumitru Potop-Butucaru, INRIA Rocquencourt, France Zili Shao, Hong Kong Polytechnic University, China Liang Shi, Chong Qing Uniersity, China Aviral Shrivastava, Arizona State University, USA Wilfried Steiner, TTTech, Austria Michael Swift, University of Wisconsin, Madison, USA Gera Weiss, Ben Gurion University, Israel Jingling Xue, University of New South Wales, Australia Chengmo Yang, University of Delaware, USA Wang Yi, Uppsala University, Sweden Yuan-Hao Zhang, Academia Sinica, Taiwan -------------- next part -------------- An HTML attachment was scrubbed... URL: From rjmh at chalmers.se Thu Dec 11 16:00:45 2014 From: rjmh at chalmers.se (John Hughes) Date: Thu, 11 Dec 2014 17:00:45 +0100 Subject: [Haskell] Lambda Days--Call for abstracts Message-ID: <6300E06D39CE450FB32195BA4C190703@JohnsTablet2014> Lambda Days is a 2-day developer conference to be held in Krakow next year, Feb 26-27, devoted to all things functional. Abstract submission is open until the 5th of January. http://www.lambdadays.org/ Last year?s program is available here: http://www.lambdadays.org/lambdadays2014/#schedule Looking forward to some exciting Haskell submissions! John Hughes -------------- next part -------------- An HTML attachment was scrubbed... URL: From jeremy.gibbons at cs.ox.ac.uk Tue Dec 16 11:10:28 2014 From: jeremy.gibbons at cs.ox.ac.uk (Jeremy Gibbons) Date: Tue, 16 Dec 2014 11:10:28 +0000 Subject: [Haskell] Nominations for John C Reynolds Distinguished Dissertation Award Message-ID: <6CEFB60F-576E-4A69-9BCD-A6F6728060DB@cs.ox.ac.uk> (On behalf of Sue Eisenbach, to whom queries should be addressed. Nomination deadline is 4th Jan. My apologies for the short notice. -jg) * Dear all, If you have a student who has completed an outstanding programming language PhD thesis in the academic year 2014, can I recommend that the student be proposed for consideration for SIGPLAN?s best PhD award, the John C Reynolds Doctoral Dissertation Award? http://www.sigplan.org/Awards/Dissertation/ As a chair of a hiring committee, I know that winning such prizes, and even being nominated for such prizes, makes the potential candidate stand out. Best wishes, Susan -- Professor Susan Eisenbach Head, Department of Computing Imperial College London Huxley Building South Kensington Campus London SW7 2AZ, U.K. Phone:+44-20 7594 8264 Fax: +44-20 7594 8282 Web: http://www.doc.ic.ac.uk/~susan Email: mailto:s.eisenbach at imperial.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: From tom.schrijvers at cs.kuleuven.be Wed Dec 17 17:52:00 2014 From: tom.schrijvers at cs.kuleuven.be (Tom Schrijvers) Date: Wed, 17 Dec 2014 18:52:00 +0100 Subject: [Haskell] Postdoctoral Position in Functional Programming Message-ID: I have a position available for a postdoctoral researcher to join my team at KU Leuven. The position involves working on domain-specific languages (DSLs) embedded in Haskell and building on our earlier work of Monadic Constraint Programming. There is plenty of room for personal input and international collaboration, as well as developing your own research ideas. The position is for 3 years. The salary is competitive and the starting date negotiable. To apply you must hold a recent PhD (or be about to graduate) related to functional programming. The application deadline is January 5, 2015. Send your application (cover letter, cv, 3 references) and any enquiries to tom.schrijvers at cs.kuleuven.be . -- prof. dr. ir. Tom Schrijvers Research Professor KU Leuven Department of Computer Science Celestijnenlaan 200A 3001 Leuven Belgium Phone: +32 16 327 830 http://people.cs.kuleuven.be/~tom.schrijvers/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From J.T.Jeuring at uu.nl Thu Dec 18 07:32:18 2014 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Thu, 18 Dec 2014 08:32:18 +0100 Subject: [Haskell] CFP: TFPIE 2015 Message-ID: Trends in Functional Programming in Education (TFPIE 2015) Call for papers https://wiki.science.ru.nl/tfpie/TFPIE2015 The 4th International Workshop on Trends in Functional Programming in Education, TFPIE 2015, will be held on June 2, 2015 in Sophia-Antipolis in France. It is co-located with the Symposium on Trends in Functional Programming (TFP 2015) which takes place from June 3 - 5. *** Goal *** The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2015 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Visitors to the TFPIE 2015 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), and Soesterberg, The Netherlands (2014). *** Program Committee *** Peter Achten, Radboud University Nijmegen, The Netherlands Edwin Brady, University of St Andrews, UK Johan Jeuring, Utrecht University and Open University, The Netherlands (Chair) Shriram Krishnamurthi, Brown University, US Rita Loogen, Philipps-Universit?t Marburg, Germany Marco Morazan, Seton Hall University, US Norman Ramsey, Tufts University, US *** Submission Guidelines *** TFPIE 2015 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - Tools supporting learning FP - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy *** Best Lectures *** In addition to papers, we request ?best lecture? presentations. What is your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. *** Submission *** Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2015 It is expected at at least one author for each submitted paper will attend the workshop. *** Important Dates *** April 7, 2015: Early Registration for TFP closes April 27, 2015: Submission deadline for draft TFPIE papers and abstracts May 3 2015: Notification of acceptance for presentation ?? (Probably May 22 2015): Registration for TFPIE closes - as does late registration for TFP June 2, 2015: Presentations in Sophia-Antipolis, France July 7, 2015: Full papers for EPTCS proceedings due. September 1, 2015: Notification of acceptance for proceedings September 22, 2015: Camera ready copy due for EPTCS Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn. From rasfar at gmail.com Fri Dec 19 13:07:33 2014 From: rasfar at gmail.com (Andrew Seniuk) Date: Fri, 19 Dec 2014 07:07:33 -0600 Subject: [Haskell] ANN: deepseq-bounded, seqaid, leaky Message-ID: This trio of related packages explores strictness control in a variety of ways. deepseq-bounded provides classes and generic functions to artificially force evaluation, to extents controlled by static or dynamic configuration. seqaid puts that into practise, providing a GHC plugin to auto-instrument your package with a strictness harness, which is dynamically optimisable during runtime. This is supported directly in the GHC compilation pipeline, without requiring (or performing!) any edits to your sources. leaky is a minimal, prototypic executable that leaks space under current state-of-the-art compilation (GHC 7.8.3 -O2, at the present time). deepseq-bounded hackage: https://hackage.haskell.org/package/deepseq-bounded homepage: http://www.fremissant.net/deepseq-bounded seqaid hackage: https://hackage.haskell.org/package/seqaid homepage: http://www.fremissant.net/seqaid leaky hackage: https://hackage.haskell.org/package/leaky homepage: http://www.fremissant.net/leaky Reddit discussion for the three together: http://www.reddit.com/r/haskell/comments/2ps8f5/ann_deepseqbounded_seqaid_leaky/ Easiest way to try them all, is to install seqaid and run the demo: cabal install seqaid seqaid demo This tests seqaid on a local copy of the leaky source package. It turned out to be routine to extend deepseq-bounded and seqaid to dynamically configurable parallelisation (paraid?). Many other wrappers could be explored, too! Maybe seqaid should be renamed to koolaid or something... It's a pretty complicated system, and just first release, so there's bound to be lots of problems. I've not set up a bug tracker, but will maintain a casual list of bugs and feature requests at http://www.fremissant.net/seqaid/trac and will set up a proper tracker if there's interest. Any isssues (or comments), I'm here, or on the reddit discussion (or email). Andrew Seniuk rasfar on #haskell -------------- next part -------------- An HTML attachment was scrubbed... URL: From rasfar at gmail.com Fri Dec 19 14:01:12 2014 From: rasfar at gmail.com (Andrew Seniuk) Date: Fri, 19 Dec 2014 08:01:12 -0600 Subject: [Haskell] ANN: deepseq-bounded, seqaid, leaky In-Reply-To: References: Message-ID: Sorry, that was my first Reddit post and I messed up. Please use this link http://www.reddit.com/r/haskell/comments/2pscxh/ann_deepseqbounded_seqaid_leaky/ -Andrew On Fri, Dec 19, 2014 at 7:07 AM, Andrew Seniuk wrote: > This trio of related packages explores strictness control in a variety of > ways. > > deepseq-bounded provides classes and generic functions to artificially > force evaluation, to extents controlled by static or dynamic configuration. > > seqaid puts that into practise, providing a GHC plugin to auto-instrument > your package with a strictness harness, which is dynamically optimisable > during runtime. This is supported directly in the GHC compilation > pipeline, without requiring (or performing!) any edits to your sources. > > leaky is a minimal, prototypic executable that leaks space under current > state-of-the-art compilation (GHC 7.8.3 -O2, at the present time). > > deepseq-bounded > hackage: https://hackage.haskell.org/package/deepseq-bounded > homepage: http://www.fremissant.net/deepseq-bounded > > seqaid > hackage: https://hackage.haskell.org/package/seqaid > homepage: http://www.fremissant.net/seqaid > > leaky > hackage: https://hackage.haskell.org/package/leaky > homepage: http://www.fremissant.net/leaky > > Reddit discussion for the three together: > > http://www.reddit.com/r/haskell/comments/2ps8f5/ann_deepseqbounded_seqaid_leaky/ > > Easiest way to try them all, is to install seqaid and run the demo: > > cabal install seqaid > seqaid demo > > This tests seqaid on a local copy of the leaky source package. > > It turned out to be routine to extend deepseq-bounded and seqaid to > dynamically configurable parallelisation (paraid?). Many other wrappers > could be explored, too! Maybe seqaid should be renamed to koolaid or > something... > > It's a pretty complicated system, and just first release, so there's bound > to be lots of problems. I've not set up a bug tracker, but will maintain a > casual list of bugs and feature requests at > > http://www.fremissant.net/seqaid/trac > > and will set up a proper tracker if there's interest. > > Any isssues (or comments), I'm here, or on the reddit discussion (or > email). > > Andrew Seniuk > rasfar on #haskell > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Fri Dec 19 16:49:17 2014 From: P.Achten at cs.ru.nl (Peter Achten) Date: Fri, 19 Dec 2014 17:49:17 +0100 Subject: [Haskell] [TFP 2015] 1st call for papers Message-ID: <5494570D.5080406@cs.ru.nl> ----------------------------- C A L L F O R P A P E R S ----------------------------- ======== TFP 2015 =========== 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers are expected to be published as a Springer Lecture Notes in Computer Science (LNCS) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/). == INVITED SPEAKERS == TFP is pleased to announce talks by the following two invited speakers: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. * Sam Aaron (?) == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2015 program chair, Manuel Serrano. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TFP is financially supported by ?????????????????? == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp2015 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: March 17, 2015 Notification: March 24, 2015 Registration: April 7, 2015 TFP Symposium: June 3-5, 2015 Student papers feedback: June 9, 2015 Submission for formal review: July 1, 2015 Notification of acceptance: September 8, 2015 Camera ready paper: October 8, 2015 == PROGRAM COMMITTEE == Janis Voigtl?nder University of Bonn, DE Scott Owens University of Kent, UK Neil Sculthorpe Swansea University, UK Colin Runciman University of York, UK Manuel Serrano Inria (PC chair), FR Rinus Plasmeijer University of Nijmegen, NL Tomas Petricek University of Cambridge, UK Marco T. Morazan Seton Hall University, USA Wolfgang De Meuter Vrije Universiteit Brussel, BE Michel Mauny Ensta ParisTech, FR Sam Lindley The University of Edinburgh, UK Daan Leijen Microsoft, USA Jurriaan Hage Utrecht University, NL Andy Gill University of Kansas, USA Thomas Gazagnaire University of Cambrige, UK Lars-Ake Fredlund Universidad Polit?cnica de Madrid, ES Jean-Christophe Filliatre Universit? Paris Sud Orsay, FR Marc Feeley Universit? de Montr?al, CA Olaf Chitil University of Kent, UK Edwin Brady University of St Andrews, UK From rasfar at gmail.com Sun Dec 21 22:20:30 2014 From: rasfar at gmail.com (Andrew Seniuk) Date: Sun, 21 Dec 2014 16:20:30 -0600 Subject: [Haskell] ANN: deepseq-bounded, seqaid, leaky In-Reply-To: References: Message-ID: Finally, in case the lack of constraints on dependencies put anyone off, please note that all deps in all three projects now have minimum and maximum bounds. Also, I should take this chance to note that there were no cache controls in the homepages linked above, so please force reloads in your browser to see latest versions. (The pages /now/ have caching prevention so this should not be necessary again.) And, it's nice to share your thoughts, don't you think? -Andrew On Fri, Dec 19, 2014 at 8:01 AM, Andrew Seniuk wrote: > Sorry, that was my first Reddit post and I messed up. > > Please use this link > http://www.reddit.com/r/haskell/comments/2pscxh/ann_deepseqbounded_seqaid_leaky/ > > -Andrew > > On Fri, Dec 19, 2014 at 7:07 AM, Andrew Seniuk wrote: > >> This trio of related packages explores strictness control in a variety of >> ways. >> >> deepseq-bounded provides classes and generic functions to artificially >> force evaluation, to extents controlled by static or dynamic configuration. >> >> seqaid puts that into practise, providing a GHC plugin to auto-instrument >> your package with a strictness harness, which is dynamically optimisable >> during runtime. This is supported directly in the GHC compilation >> pipeline, without requiring (or performing!) any edits to your sources. >> >> leaky is a minimal, prototypic executable that leaks space under current >> state-of-the-art compilation (GHC 7.8.3 -O2, at the present time). >> >> deepseq-bounded >> hackage: https://hackage.haskell.org/package/deepseq-bounded >> homepage: http://www.fremissant.net/deepseq-bounded >> >> seqaid >> hackage: https://hackage.haskell.org/package/seqaid >> homepage: http://www.fremissant.net/seqaid >> >> leaky >> hackage: https://hackage.haskell.org/package/leaky >> homepage: http://www.fremissant.net/leaky >> >> Reddit discussion for the three together: >> >> http://www.reddit.com/r/haskell/comments/2ps8f5/ann_deepseqbounded_seqaid_leaky/ >> >> Easiest way to try them all, is to install seqaid and run the demo: >> >> cabal install seqaid >> seqaid demo >> >> This tests seqaid on a local copy of the leaky source package. >> >> It turned out to be routine to extend deepseq-bounded and seqaid to >> dynamically configurable parallelisation (paraid?). Many other wrappers >> could be explored, too! Maybe seqaid should be renamed to koolaid or >> something... >> >> It's a pretty complicated system, and just first release, so there's >> bound to be lots of problems. I've not set up a bug tracker, but will >> maintain a casual list of bugs and feature requests at >> >> http://www.fremissant.net/seqaid/trac >> >> and will set up a proper tracker if there's interest. >> >> Any isssues (or comments), I'm here, or on the reddit discussion (or >> email). >> >> Andrew Seniuk >> rasfar on #haskell >> >> > -------------- next part -------------- An HTML attachment was scrubbed... URL: From M.F.Berger at sussex.ac.uk Mon Dec 22 10:55:22 2014 From: M.F.Berger at sussex.ac.uk (Martin Berger) Date: Mon, 22 Dec 2014 10:55:22 +0000 Subject: [Haskell] PhD studentship on dependent type theory for concurrent processes Message-ID: Applications are invited for a fully funded PhD studentship in the Department of Informatics at the University of Sussex, starting in October 2015. The topics for the studentship is: dependent types for concurrent processes. That involved combining two major research traditions in type theory: (1) dependent type-theories a la Martin-Loef and homotopy type theory, and (2) types for concurrent processes such as session types. For further details, see http://www.sussex.ac.uk/informatics/pgstudy/doctoral/projects or contact Martin Berger . The studentship is for three years and includes a stipend of ?13,863 per year and full tuition fees for Home/EU applicants. For overseas applicants, a contribution of up to ?12,000 towards overseas fees is paid, depending on qualifications. The studentship is available to students of any nationality. Applicants are normally expected to have a first-class Masters or Bachelors degree in Computer Science, Mathematics or a related discipline, and must obtain the support of the supervisor in the School prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to . For further details about the application process, please see http://www.sussex.ac.uk/informatics/pgstudy/doctoral/funding Closing date for applications is 23 February 2015. -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 931 bytes Desc: Message signed with OpenPGP using GPGMail URL: From moreno.falaschi at uniud.it Mon Dec 22 15:05:06 2014 From: moreno.falaschi at uniud.it (Moreno Falaschi) Date: Mon, 22 Dec 2014 15:05:06 +0000 Subject: [Haskell] Call for papers LOPSTR 2015 -- 25th International Symposium on Logic-Based Program Synthesis and Transformation -- Siena, Italy Message-ID: ============================================================ 25th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2015 Special Issue of Formal Aspects of Computing http://alpha.diism.unisi.it/lopstr15/ University of Siena, Siena, IT, July 13-15, 2015 (co-located with PPDP 2015) DEADLINES Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 25th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2015) will be held at the University of Siena, Siena, Italy; previous symposia were held in Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2015 will be co-located with PPDP 2015 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * synthesis * transformation * specialization * composition * optimization * inversion * specification * analysis and verification * testing and certification * program and model manipulation * transformational techniques in SE * applications and tools Survey papers that present some aspects of the above topics from a new perspective, and application papers that describe experience with industrial applications are also welcome. 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). Important Dates Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 Notification: May 25, 2015 Camera-ready (for electronic pre-proceedings): June 15, 2015 Symposium: July 13-15, 2015 Submission Guidelines Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Submissions cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via the Easychair submission website for LOPSTR 2015, which can be accessed through the website of LOPSTR 2015. Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series (to be confirmed). Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Special journal issue After the symposium, a selection of the best papers will be invited to a special issue of the 'Formal Aspects of Computing' journal. The submissions to the special issue must be substantial extensions of the proceedings versions and will undergo the usual journal reviewing process. Program Committee Slim Abdennadher, German University of Cairo, Egypt Maria Alpuente, Universitat Politecnica de Valencia, Spain Demis Ballis, University of Udine, Italy Olaf Chitil, University of Kent, UK Michael Codish, Ben-Gurion University, Israel Moreno Falaschi, University of Siena, Italy (Program Chair) Jerome Feret, INRIA and ENS, France Maurizio Gabbrielli, University of Bologna, Italy Jurgen Giesl, RWTH Aachen University, Germany Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain Arnaud Gotlieb, SIMULA Research Laboratory, Norway Gopal Gupta, University of Texas at Dallas, USA Manuel Hermenegildo, IMDEA, Spain Viktor Kuncak, EPFL Lausanne, Switzerland Luigi Liquori, INRIA Sophia-Antipolis Mediterranee, France Alexei Lisitsa, University of Liverpool, UK Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain Jorge Navas, NASA, USA Kazuhiro Ogata, JAIST, Japan Carlos Olarte, ECT, Univ. Federal do Rio Grande do Norte, Brasil Catuscia Palamidessi, INRIA and Ecole Polytechnique, France Maurizio Proietti, IASI-CNR, Italy Albert Rubio, Universitat Politecnica de Catalunya, Barcelona, Spain Wim Vanhoof, University of Namur, Belgium Program and Symposium Chair: Moreno Falaschi, Dept. of Information Engineering and Mathematics, Univ. of Siena, Italy (moreno.falaschi at unisi.it) Organizing Committee Monica Bianchini, DIISM, Univ. of Siena, Italy Sara Brunetti, DIISM, Univ. of Siena, Italy Andrea Machetti, DIISM, Univ. of Siena, Italy Simonetta Palmas, DIISM, Univ. of Siena, Italy Maurizio Proietti, IASI-CNR, Italy Simone Rinaldi, DIISM, Univ. of Siena, Italy Elisa Tiezzi, DIISM, Univ. of Siena, Italy Sara Ugolini, Dip. Informatica, Univ. of Pisa From mwanikibusiness at gmail.com Mon Dec 22 15:04:52 2014 From: mwanikibusiness at gmail.com (Njagi Mwaniki) Date: Mon, 22 Dec 2014 18:04:52 +0300 Subject: [Haskell] Google Summer of Code Message-ID: <54983314.5020501@gmail.com> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Which books or resources or libraries should one read to get ready for the Google summer of code? Also which projects would be easiest to work on for beginners? Anything that would make one ready for Google summer of code and complete their project with ease. I'm currently taking cs194 from upenn online http://www.seas.upenn.edu/~cis194/lectures.html -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQJ8BAEBCgBmBQJUmDMUXxSAAAAAAC4AKGlzc3Vlci1mcHJAbm90YXRpb25zLm9w ZW5wZ3AuZmlmdGhob3JzZW1hbi5uZXRGMjlGREM4Qjk5M0I2NEFEODkwMzFEQkRB MDNCNjA0MzJCQzVCQjdEAAoJEKA7YEMrxbt9E74P/ip0kSsrcOitj8J14LbO3dkk pTLyI2xkH8C9zH2xcPkft37fb1MTdr/ycyjGiksw2X6RgK9EshlSGtG1VdRod7ku ZxiMEja1HsemAPof1wGG7ONIXDtoqtmH+VTDmvt4StKsG84UkNT3BALys/VRd5iF kwOLzMZP2O0MZPUbCb8R13mxI1XdfJoaKC16N0+pKftv+t3/tsyxC0ADpSrM1NG7 mq6840OhCyhD/lGp2zVVVhdL/qVnnF5BV7BFuHvQSxEEiZdD9TDQDuMp/qIUA4Ml S58wJmxubi0me7TxLUmhSrwozFpGZk6tijYbJVuQ68VKwwOBbZzvDClEzUDMw3w5 9Ao9kBAL+GoGrNsfOgDbX3NC0yhLmHfC+gXiaOsaClmYOUsL//IZVL3Mu3yHDjZv Yed7h/GSTveaYcLliFHxxj9iLDWKFTeYZs5s2plGNvqWcXC0pch+K6+JrpQUKXPO nEAhdVppHF+e8Uepap6CnfLE16ZfFDbbevw5WMtw8al0nOufbC7l9FDvp91quJnH 2iSmb5AbZC5dlcFsfissUFT7HAksGVPdGAJIfKdZ8+5mGkqUcxCDRjF1Gqq98PMq lV97ZUBo6NcTdXsRX+Ee55J5bw2pnM72LTsxTOc/tvC9BOpmCzSwGpIQa+Nx83bU 2zvuYHf6mXePqvmeqE6Z =ewGo -----END PGP SIGNATURE----- From austin at well-typed.com Tue Dec 23 13:12:39 2014 From: austin at well-typed.com (Austin Seipp) Date: Tue, 23 Dec 2014 07:12:39 -0600 Subject: [Haskell] ANNOUNCE: GHC version 7.8.4 Message-ID: ============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.8.4 ============================================================== The GHC Team is pleased to announce a new patchlevel release of GHC, 7.8.4. This is an important bugfix release relative to 7.8.3 (with over 30 defects fixed), so we highly recommend upgrading from the previous 7.8 releases. The full release notes are here: https://downloads.haskell.org/~ghc/7.8.4/docs/html/users_guide/release-7-8-4.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: https://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://ghc.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://ghc.haskell.org/trac/ghc/wiki/Platforms http://ghc.haskell.org/trac/ghc/wiki/CodeOwners 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://ghc.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://ghc.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 Hashes & Signatures ~~~~~~~~~~~~~~~~~ On https://downloads.haskell.org/~ghc/7.8.4/ you will find a signed copy of the SHA256 hashes for the tarballs, using my GPG key (keyid 0x3B58D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/ From david.feuer at gmail.com Sun Dec 28 19:35:17 2014 From: david.feuer at gmail.com (David Feuer) Date: Sun, 28 Dec 2014 14:35:17 -0500 Subject: [Haskell] Haskell wiki slowness Message-ID: Does anyone know when the wiki will be back up to speed? Until then, could one of the infrastructure people please have status.haskell.org indicate a partial service disruption?