From gvidal at dsic.upv.es Sun Jun 1 07:52:43 2014 From: gvidal at dsic.upv.es (German Vidal) Date: Sun, 1 Jun 2014 09:52:43 +0200 Subject: [Haskell] LOPSTR 2014 - Extended Deadlines References: Message-ID: <1F5400E3-54D1-4263-A118-3B4BCE38799E@dsic.upv.es> ==================== EXTENDED DEADLINES ==================== Abstract submission: June 11, 2014 Paper/Extended abstract submission: June 18, 2014 ===================== CALL FOR PAPERS ====================== 24th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2014 http://www.iasi.cnr.it/events/lopstr14/ University of Kent, Canterbury, UK, September 10-11, 2014 ============================================================ Invited Speakers: Roberto Giacobazzi (University of Verona, Italy) Viktor Kuncak (EPFL, Switzerland) ============================================================ 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 24th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2014) will be held at the University of Kent, Canterbury, United Kingdom; previous symposia were held in 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 2014 will be co-located with PPDP 2014 (International ACM SIGPLAN 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 co-chairs in case of questions). Important Dates Abstract submission: June 11, 2014 Paper/Extended abstract submission: June 18, 2014 Notification: July 18, 2014 Camera-ready (for electronic pre-proceedings): August 25, 2014 Symposium: September 10-11, 2014 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. Paper should be submitted via the Easychair submission website for LOPSTR 2014. If electronic submission is impossible, please contact the program co-chairs for information on how to submit hard copies. Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. 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. Program Committee Slim Abdennadher German University of Cairo, Egypt ?tienne Andr? Universit? Paris 13, France Martin Brain University of Oxford, UK Wei-Ngan Chin National University of Singapore, Singapore Marco Comini University of Udine, Italy Wlodzimierz Drabent IPIPAN, Poland and Link?ping University, Sweden Fabio Fioravanti University of Chieti-Pescara, Italy J?rgen Giesl RWTH Aachen University, Germany Miguel G?mez-Zamalloa Complutense University of Madrid, Spain Arnaud Gotlieb SIMULA Research Laboratory, Norway Gopal Gupta University of Texas at Dallas, USA Jacob Howe City University London, UK Zhenjiang Hu National Institute of Informatics, Japan Alexei Lisitsa University of Liverpool, UK Yanhong Annie Liu Stony Brook University, USA Jorge Navas NASA, USA Naoki Nishida Nagoya University, Japan Corneliu Popeea Technische Universit?t M?nchen, Germany Maurizio Proietti IASI-CNR, Italy (Program Co-Chair) Tom Schrijvers Ghent University, Belgium Hirohisa Seki Nagoya Institute of Technology, Japan (Program Co-Chair) Jon Sneyers K.U. Leuven, Belgium Fausto Spoto University of Verona, Italy Wim Vanhoof University of Namur, Belgium German Vidal Universitat Politecnica de Valencia, Spain Program Co-Chairs: Maurizio Proietti, IASI-CNR, Italy (maurizio.proietti at iasi.cnr.it) Hirohisa Seki, Nagoya Institute of Technology, Japan (seki at nitech.ac.jp) Symposium Co-Chairs Olaf Chitil and Andy King School of Computing University of Kent CT2 7NF Kent, UK Organizing Committee Emanuele De Angelis, University of Chieti-Pescara and IASI-CNR, Italy Fabrizio Smith, IASI-CNR, Italy From kutsia at risc.jku.at Sun Jun 1 09:03:38 2014 From: kutsia at risc.jku.at (Temur Kutsia) Date: Sun, 01 Jun 2014 11:03:38 +0200 Subject: [Haskell] 2nd CfP: SCSS 2014 Message-ID: <538AEC6A.3020602@risc.jku.at> SCSS 2014 Symbolic Computation in Software Science 6th International Symposium Second Call for Papers Gammarth, La Marsa, Tunisia, December 7-11, 2014 http://www.easychair.org/smart-program/SCSS2014/ Scope -------- The purpose of SCSS 2014 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2014 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Nikolaj Bjorner (Microsoft Research) TBA Program Chairs -------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Andrei Voronkov (University of Manchester, UK) Program Committee ------------------ Elvira Albert (Complutense University of Madrid, Spain) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) James H. Davenport (University of Bath, UK) Roberto Giacobazzi (University of Verona, Italy) Arie Gurfinkel (Carnegie Mellon University, USA) Nao Hirokawa (JAIST, Japan) Tetsuo Ida (University of Tsukuba, Japan) Florent Jacquemard (INRIA - IRCAM, France) Laura Kovacs (Chalmers University of Technology, Sweden) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) - chair Ali Mili (New Jersey Institute of Technology, USA) Joel Ouaknine (Oxford University, UK) Ruzica Piskac (Yale University, USA) Andrei Voronkov (University of Manchester, UK) - chair Dongming Wang (Beihang University, China and UPMC-CNRS, France) General Chairs --------------- Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Tetsuo Ida (University of Tsukuba, Japan) Local Chair ----------- Mohamed Becha Kaaniche (University of Carthage, Tunisia) Important Dates --------------- June 23, 2014: Abstract submission deadline June 30, 2014: Paper submission deadline August 25, 2014: Notification September 22, 2014: Camera-ready copy deadline December 7-11, 2014: SCSS 2014 in Gammarth Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2014 Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings will be published in the EasyChair Proceedings in Computing. We plan also to have a special issue of the Journal of Symbolic Computation on SCSS 2014. The full version of selected papers will be considered for the publication of the special issue subjected to the normal peer review process of the journal. From kutsia at risc.jku.at Sun Jun 1 13:04:49 2014 From: kutsia at risc.jku.at (Temur Kutsia) Date: Sun, 01 Jun 2014 15:04:49 +0200 Subject: [Haskell] UNIF 2014: Call for Participation Message-ID: <538B24F1.1000900@risc.jku.at> ==================================================== Call for Participation UNIF 2014 The 28th International Workshop on Unification July 13, 2014. Vienna, Austria a FLoC workshop hosted by RTA-TLCA and IJCAR http://vsl2014.at/unif ==================================================== Invited Speakers ---------------- * Jordi Levy, IIIA, CSIC, Barcelona, Spain * Jose Meseguer, University of Illinois at Urbana-Champaign, USA: Extensible Symbolic System Analysis Program ------- http://vsl2014.at/meetings/UNIF-program.html Registration ------------ http://vsl2014.at/registration (Don't forget the early registration deadline: June 8) We look forward to seeing you in Vienna! The UNIF 2014 organizers: Temur Kutsia Christophe Ringeissen From sabel at ki.informatik.uni-frankfurt.de Mon Jun 2 11:59:43 2014 From: sabel at ki.informatik.uni-frankfurt.de (David Sabel) Date: Mon, 02 Jun 2014 13:59:43 +0200 Subject: [Haskell] WPTE 2014: Call for Participation Message-ID: <538C672F.6040502@ki.informatik.uni-frankfurt.de> CALL FOR PARTICIPATION First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE'14) affiliated with RTA/TLCA 2014 (a FLoC 2014 workshop, FLoC is part of the Vienna Summer of Logic 2014) 13th July 2014, Vienna, Austria http://www.ki.informatik.uni-frankfurt.de/WPTE14 =========================================================================== The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. Registration ============ http://vsl2014.at/registration/ Note that early registration ends on June 8th! Program ======= * Andy Gill Invited talk, TBA * William Mansky and Elsa Gunter Verifying Optimizations for Concurrent Programs * Masanori Nagashima, Tomofumi Kato, Masahiko Sakai and Naoki Nishida Inverse Unfold Problem and Its Heuristic Solving * David Sabel Structural Rewriting in the Pi-Calculus * Guillaume Madelaine, Cedric Lhoussaine and Joachim Niehren Attractor Equivalence: An Observational Semantics for Reaction Networks * Naoki Nishida, Makishi Yanagisawa and Karl Gmeiner On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings * Manfred Schmidt-Schauss and David Sabel Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) * Yuki Chiba Verifying the Correctness of Tupling Transformations based on Conditional Rewriting * Karl Gmeiner and Naoki Nishida Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems * Georg Moser and Michael Schaper A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems From john at repetae.net Mon Jun 2 18:47:23 2014 From: john at repetae.net (John Meacham) Date: Mon, 2 Jun 2014 11:47:23 -0700 Subject: [Haskell] ANNOUNCE: jhc 0.8.2 Message-ID: Lots of internal improvements in this one, so may be of more interest to developers http://repetae.net/computer/jhc/ - completely replaced the front end parser/lexer with a new more flexible one. My rewritten one is about 3,250 lines shorter. - The new one uses a general precedence parser for application as well as infix operators, allowing consistent handling of bang, irrefutable, and @ patterns and allows prefix and infix operators with a higher precedence than application to be defined. Incidentally, this allows for ~ and @ in expressions. (~) = negate (prefixr 11) gives us a nice strongly binding negative and @ (infixr 12) is perfect for type directed name resolution without further overloading the humble dot. they parse exactly the same as they do in patterns so no new magic is being added to the symbols other than allowing them in expressions. - Layout algorithm is fully in the lexer now, no lexer/parser interaction needed and useful transformations happen between the two simplifying the parser. - updated a lot of the external libraries to new versions - improvements to the build based on feedback, now gives much better error messages about what went wrong. - include an experimental utility to automatically download 3rd party packages from hackage and install them, it has some kinks, but even if it can't do it automatically, it provides a template for easily modifying the package to work. - removed the last of the cabal-cruft from the library build system. - fixed a lot of bugs relating to errors not being caught early by jhc so they produce a cryptic message from the compiler later, attach source location to more errors for better reporting. - ghc 7.8 compatibilty contributed by others. (thanks!) - infix type constructor extension supported - field punning extension now supported - new option -fno-sugar to turn off all desugaring that would introduce any hidden dependencies, all literals are unboxed under it. WYSIWYG. - unboxed kinds now more general, work in more places - record field names may overlap - more efficient binary representation using LEB128 - Data.String added with mild magic. -- John Meacham - http://notanumber.net/ From icfp.publicity at googlemail.com Tue Jun 3 13:55:07 2014 From: icfp.publicity at googlemail.com (David Van Horn) Date: Tue, 3 Jun 2014 09:55:07 -0400 Subject: [Haskell] ICFP 2014 Student Volunteer Programme Message-ID: [With apologies for cross-posting] Please forward this to anyone who may be interested! ICFP Student Volunteer Programme http://icfpconference.org/icfp2014/sv.html We are looking for student volunteers to help with the running of ICFP 2014 in Gothenburg, Sweden. If you are a student (part-time, full-time, undergraduate, masters or PhD), and would like free registration in exchange for helping out, please consider applying! As a student volunteer, you will receive the following: * Free conference registration, including workshops and electronic proceedings * Free lunches and refreshments during breaks. * Free conference banquet ticket and access to student-only social events. * An ICFP 2014 Student Volunteers T-shirt. In return you will be expected to help with the running of the conference. Possible jobs include assisting with technical sessions, workshops, tutorials and panels and helping at the registration desk. Please note that student volunteers are responsible for their own travel arrangements and accommodation. You should be available for at least three full days between 31st of August and the 6th of September 2014 in order to offer 16 hours of volunteering work. Note that we will prioritise students who will be available the full week. Naturally presentations etc. at workshops and technical sessions take precedence. Application Deadline: 15th June 2014 Initial Acceptance and Reserve List announcement: 30th June 2014 For more information, and instructions on how to apply, please see the student volunteer information page at http://icfpconference.org/icfp2014/sv.html. From ekmett at gmail.com Tue Jun 3 22:26:47 2014 From: ekmett at gmail.com (Edward Kmett) Date: Tue, 3 Jun 2014 18:26:47 -0400 Subject: [Haskell] Core libraries committee seeking self-nominations Message-ID: The first year of the Haskell Core Libraries Committee is winding down, and we are seeking self-nominations to replace two outgoing committee members. Doug Beardsley and Brent Yorgey have offered to be the first two members of the committee to have their slots come up for renewal. To nominate yourself, please send an email to core-libraries-committee at haskell.org by June 30th and include any information that you think will help us reach a decision. The core libraries committee acts as the collective maintainer of many packages that glue together the Haskell Platform, but which otherwise do not have an individual maintainer. See Library Submissions for more details about which packages fall to the committee for maintenance. As we are now talking on more of the implementation effort for the Applicative-Monad Proposal, bringing Foldable and Traversable into Prelude, performing active maintenance on vector, etc., you should be forewarned that these are becoming increasingly active positions now that GHC 7.8 has shipped and we are ramping up for more active participation in the GHC release process. Regards, Edward Kmett Haskell Core Libraries Committee Chair -------------- next part -------------- An HTML attachment was scrubbed... URL: From john at repetae.net Wed Jun 4 06:26:52 2014 From: john at repetae.net (John Meacham) Date: Tue, 3 Jun 2014 23:26:52 -0700 Subject: [Haskell] PROPOSAL: Record field type inference Message-ID: This is also available as html at http://repetae.net/computer/jhc/record_inference.html Record Type Inference ===================== An extension to the named field mechanism that will greatly enhance the utility of them when combined with the existing `DisambiguateRecordFields`, `RecordPuns`, and `RecordWildCards`. The proposal is to allow the types of record fields to be inferred by the normal type inference engine. It would look like ~~~~ {.haskell} data Rec = Rec {fieldA,fieldB,fieldC} f Rec { .. } = Rec { .. } where fieldA = True fieldB = 4 ~~~~ This would infer the types `Bool`, `Int`, and `forall a . a` for the fields of the record constructor and `f :: Rec -> Rec` for f. For the purposes of type checking the fields are treated as monomorphic and not generalized but defaulted like normal after typechecking the module. Other than infering the types of the record fields, the records have the normal syntax. The extensions `RecordPuns`, `RecordWildCards` and `DisambiguateRecordFields` will be enabled when record field inference is enabled. Selector functions will not be created for infered records, as in, the names are field labels and not functions. This means they do not share a namespace with functions and do not conflict with each other. Multiple records may have the same field names in the same module. This means the following is fine. ~~~~ {.haskell} data Rec1 = Rec1 {input, withFoo, withoutFoo } data Rec2 = Rec2 {input, withBar, withoutBar } f Rec1 { .. } = case input of [] -> Rec1 { .. } (x:xs) -> if hasFoo x then Rec1 { withFoo = x:withFoo, .. } else Rec1 { withoutFoo = x:withoutFoo, .. } ~~~~ Possible extensions ------------------- ### as-pattern disambiguation In order to make the disambiguation of record fields more useful without relying on the type checker for disambiguation, We can declare that variables explicitly bound to a constsructor in a pattern match use that constructor to disambiguate fields for operations on the variable. This is a purely syntactic transformation that can happen before typechecking. It can be used as follows. ~~~~ {.haskell} -- use the input bound by a Rec1 to update the input bound by a Rec2 f r1 at Rec1 { input } r2 at Rec2 {} = case input of xs | any hasBar xs = f r1 { input = [] } r2 { input } ~~~~ ### Field label inference It is concievable that we may want to infer the fields themselves of a record, as in: ~~~~ {.haskell} -- infer that R has the field labels bob and susan data R = R { ..} f x at R {bob} = R {susan = bob} ~~~~ In order to implement this, a pass through the file will collect every field label that is used with an explicit R constructor and treat the record as if it were declared with those names as infered fields. From john at repetae.net Wed Jun 4 07:03:01 2014 From: john at repetae.net (John Meacham) Date: Wed, 4 Jun 2014 00:03:01 -0700 Subject: [Haskell] [Haskell-cafe] PROPOSAL: Record field type inference In-Reply-To: References: Message-ID: Yeah, I am familier with that, this is fairly orthogonal actually and both can be used together to good effect. This proposal is more about making records 'lightweight', as in, I have a recursive function that takes 5 or so recursive values and they all have to be passed as independent options (or a tuple) right now which is error prone, by making a lightweight inferred record we get named parameters that are infered just like they were listed as options and CPR analysis will even ensure there is no run time penalty, the fields will be expanded out as positional parameters internally. An issue with OverloadedRecordFields is that it relies on a lot of type system complexity, This builds on the existing DisambiguateRecordFields extension and simply removes the restriction that the records with the same field names be defined in different modules. since field names declared this way don't share a namespace with functions this isn't an issue. Notably, everything to disambiguate fields can take place in the renamer and the fields can be typechecked exactly as if they were top level pattern bindings. Another possible extension is allowing it to infer scoped type variables as well for a parameterized record type. working on something concrete for that with my jhc implementation, the issue is that the record will have to be parameterized by a type to keep them from escaping. Perhaps just a single type parameter that is existentially instantiated, syntax being data R t = R {fa,fb,fc} or putting the data declaration in a local where or let binding. but that will require some more work. (and scoped type variables in jhc are a little iffy at the moment as is) John On Tue, Jun 3, 2014 at 11:33 PM, Carter Schonwald wrote: > Hey John > in some respects, this sounds like syntax sugar around > https://ghc.haskell.org/trac/ghc/wiki/Records/OverloadedRecordFields > have you had a look at that? (its not quite merged into HEAD yet, but that > due soon i'm told) > > > On Wed, Jun 4, 2014 at 2:26 AM, John Meacham wrote: >> >> This is also available as html at >> >> http://repetae.net/computer/jhc/record_inference.html >> >> Record Type Inference >> ===================== >> >> An extension to the named field mechanism that will greatly enhance the >> utility of them when combined with the existing >> `DisambiguateRecordFields`, >> `RecordPuns`, and `RecordWildCards`. >> >> The proposal is to allow the types of record fields to be inferred by the >> normal type inference engine. It would look like >> >> ~~~~ {.haskell} >> data Rec = Rec {fieldA,fieldB,fieldC} >> >> f Rec { .. } = Rec { .. } where >> fieldA = True >> fieldB = 4 >> ~~~~ >> >> This would infer the types `Bool`, `Int`, and `forall a . a` for the >> fields of >> the record constructor and `f :: Rec -> Rec` for f. For the purposes of >> type >> checking the fields are treated as monomorphic and not generalized but >> defaulted like normal after typechecking the module. Other than infering >> the >> types of the record fields, the records have the normal syntax. The >> extensions >> `RecordPuns`, `RecordWildCards` and `DisambiguateRecordFields` will be >> enabled >> when record field inference is enabled. >> >> Selector functions will not be created for infered records, as in, the >> names >> are field labels and not functions. This means they do not share a >> namespace >> with functions and do not conflict with each other. Multiple records may >> have >> the same field names in the same module. This means the following is fine. >> >> ~~~~ {.haskell} >> data Rec1 = Rec1 {input, withFoo, withoutFoo } >> data Rec2 = Rec2 {input, withBar, withoutBar } >> >> f Rec1 { .. } = case input of >> [] -> Rec1 { .. } >> (x:xs) -> if hasFoo x >> then Rec1 { withFoo = x:withFoo, .. } >> else Rec1 { withoutFoo = x:withoutFoo, .. } >> ~~~~ >> >> Possible extensions >> ------------------- >> >> ### as-pattern disambiguation >> >> In order to make the disambiguation of record fields more useful without >> relying on the type checker for disambiguation, We can declare that >> variables >> explicitly bound to a constsructor in a pattern match use that constructor >> to >> disambiguate fields for operations on the variable. This is a purely >> syntactic >> transformation that can happen before typechecking. It can be used as >> follows. >> >> ~~~~ {.haskell} >> -- use the input bound by a Rec1 to update the input bound by a Rec2 >> f r1 at Rec1 { input } r2 at Rec2 {} = case input of >> xs | any hasBar xs = f r1 { input = [] } r2 { input } >> ~~~~ >> >> ### Field label inference >> >> It is concievable that we may want to infer the fields themselves of a >> record, >> as in: >> >> ~~~~ {.haskell} >> -- infer that R has the field labels bob and susan >> data R = R { ..} >> f x at R {bob} = R {susan = bob} >> ~~~~ >> >> In order to implement this, a pass through the file will collect every >> field >> label that is used with an explicit R constructor and treat the record as >> if >> it were declared with those names as infered fields. >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe at haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe > > -- John Meacham - http://notanumber.net/ From n.krishnaswami at cs.bham.ac.uk Fri Jun 6 13:26:18 2014 From: n.krishnaswami at cs.bham.ac.uk (Neelakantan Krishnaswami) Date: Fri, 06 Jun 2014 14:26:18 +0100 Subject: [Haskell] Final call for talk proposals: HOPE'14 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'14) Message-ID: <5391C17A.7040504@cs.bham.ac.uk> ---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2014 The 3rd ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 31, 2014 Gothenburg, Sweden (the day before ICFP 2014) http://hope2014.mpi-sws.org ---------------------------------------------------------------------- HOPE 2014 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2014 AT mpi-sws.org. Deadline for talk proposals: June 13, 2014 (Friday) Notification of acceptance: July 4, 2014 (Friday) Workshop: August 31, 2014 (Sunday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2014 --------------- Invited Speaker --------------- Verifying Security Properties of SES Programs Philippa Gardner, Imperial College London Secure ECMAScript (SES) is a subset of JavaScript, designed in such a way that untrusted code can safety co-exist with trusted code. We introduce a program logic for verifying security properties of SES programs. It follows separation logic in that we can make local assertions about local state. It is different from separation logic in that we can also make global assertions about the global state and its interface with the local state. For example, we can globally assert that untrusted objects do not contain pointers to local trusted objects. Such assertions are key for describing security properties of common SES programs. This logic builds on the work of Gardner, Maffeis and Smith on reasoning about a core fragment of JavaScript (POPL2012), and the recent work of Smith on extending the logic to handle higher-order functions. This is joint work with Gareth Smith and Thomas Wood, Imperial. --------------------- Workshop Organization --------------------- Program Co-Chairs: Neel Krishnaswami (University of Birmingham) Hongseok Yang (University of Oxford) Program Committee: Zena Ariola (University of Oregon) Ohad Kammar (University of Cambridge) Ioannis Kassios (ETH Zurich) Naoki Kobayashi (University of Tokyo) Paul Blain Levy (University of Birmingham) Aleks Nanevski (IMDEA) Scott Owens (University of Kent) Sam Staton (Radboud University Nijmegen) Steve Zdancewic (University of Pennsylvania) From coreyoconnor at gmail.com Sat Jun 7 16:26:18 2014 From: coreyoconnor at gmail.com (Corey O'Connor) Date: Sat, 7 Jun 2014 09:26:18 -0700 Subject: [Haskell] ANNOUNCE: vty-5.1 and vty-examples-5.0 Message-ID: The work never ends but, *pokes*, seems cooked to me! vty 5.1 is out: - http://hackage.haskell.org/package/vty All parts of vty have received care and a whole bunch of testing. Highlights: - Naming convention matches the Haskell standard. - User and application configurable input to event mapping. see Graphics.Vty.Config - Layer support. see Graphics.Vty.Picture - Cropping and padding of images. Great for implementing vertical splits in Yi, for instance. - Improved compatibility. - Improved performance. Full CHANGELOG: * https://raw.githubusercontent.com/coreyoconnor/vty/master/CHANGELOG -Corey O'Connor coreyoconnor at gmail.com http://corebotllc.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ky3 at atamo.com Sat Jun 7 17:04:25 2014 From: ky3 at atamo.com (Kim-Ee Yeoh) Date: Sun, 8 Jun 2014 00:04:25 +0700 Subject: [Haskell] ANNOUNCE: vty-5.1 and vty-examples-5.0 In-Reply-To: References: Message-ID: On Sat, Jun 7, 2014 at 11:26 PM, Corey O'Connor wrote: > vty 5.1 is out: > > - http://hackage.haskell.org/package/vty > > All parts of vty have received care and a whole bunch of testing. > The absence of haddock-generated html will impede adoption of the latest and greatest unfortunately. Haddock/hackage issues are most likely not your fault fwiw. -- Kim-Ee -------------- next part -------------- An HTML attachment was scrubbed... URL: From coreyoconnor at gmail.com Sat Jun 7 17:21:25 2014 From: coreyoconnor at gmail.com (Corey O'Connor) Date: Sat, 7 Jun 2014 10:21:25 -0700 Subject: [Haskell] ANNOUNCE: vty-5.1 and vty-examples-5.0 In-Reply-To: References: Message-ID: The documentation for 5.0.2 is almost identical. The only difference is with vmin and vtime configuration. * http://hackage.haskell.org/package/vty-5.0.2 This will have to do until the hackage build bot catches up. Cheers, Corey -Corey O'Connor coreyoconnor at gmail.com http://corebotllc.com/ On Sat, Jun 7, 2014 at 10:04 AM, Kim-Ee Yeoh wrote: > > On Sat, Jun 7, 2014 at 11:26 PM, Corey O'Connor > wrote: > >> vty 5.1 is out: >> >> - http://hackage.haskell.org/package/vty >> >> All parts of vty have received care and a whole bunch of testing. >> > > The absence of haddock-generated html will impede adoption of the latest > and greatest unfortunately. Haddock/hackage issues are most likely not your > fault fwiw. > > -- Kim-Ee > -------------- next part -------------- An HTML attachment was scrubbed... URL: From c.grelck at uva.nl Mon Jun 9 21:29:33 2014 From: c.grelck at uva.nl (Clemens Grelck) Date: Mon, 09 Jun 2014 23:29:33 +0200 Subject: [Haskell] Call for participation: HLPP 2014 - 7th Symposium on High-Level Parallel Programming and Applications Message-ID: <5396273D.6030701@uva.nl> =========================================================================== CALL FOR PARTICIPATION HLPP 2014 7th International Symposium on High-level Parallel Programming and Applications Amsterdam, Netherlands July 3-4, 2014 https://sites.google.com/site/hlpp2014amsterdam/ =========================================================================== Early registration deadline: June 16 =========================================================================== Keynote: Frank Schlimbach, Intel: Design and Implementation of Intel Concurrent Collections (CnC) Abstract: CnC (concurrent collections) is a parallel language in the sense that its goal is parallel execution but in fact a CnC program does not indicate what runs in parallel. Instead, it identifies what precludes parallel execution. There are exactly two reasons that computations cannot execute in parallel. If one computation produces data that the other one consumes, the producer must execute before the consumer. If one computation determines if another will execute, the controller must execute before the controllee. So CnC is not a dataflow language. It is more of a data and control flow language together with tuple-space influence. However, it is closer in philosophy to the PDG (Program Dependence Graph) intermediate form than to other parallel programming languages. The talk will introduce CnC and present some active research topics. =========================================================================== Aims and scope: As processor and system manufacturers increase the amount of both inter- and intra-chip parallelism it becomes crucial to provide the software industry with high-level, clean and efficient tools for parallel programming. Parallel and distributed programming methodologies are currently dominated by low-level techniques such as send/receive message passing, or equivalently unstructured shared memory mechanisms. Higher-level, structured approaches offer many possible advantages and have a key role to play in the scalable exploitation of ubiquitous parallelism. Since 2001 the HLPP series of workshops/symposia has been a forum for researchers developing state-of-the-art concepts, tools and applications for high-level parallel programming. The general emphasis is on software quality, programming productivity and high-level performance models. The 7th Symposium on High-Level Parallel Programming and Applications will be held July 3-4 in the historic center of Amsterdam. =========================================================================== Proceedings: Accepted papers will be distributed as informal draft proceedings during the symposium and thereafter published by Springer in a special issue of the International Journal of Parallel Programming (IJPP). =========================================================================== Topics: HLPP 2014 invites papers on all topics in high-level parallel programming, its tools and applications including, but not limited to, the following aspects: + High-level programming and performance models (BSP, CGM, LogP, MPM, etc.) and their tools + Declarative parallel programming methodologies + Algorithmic skeletons and constructive methods + Declarative parallel programming languages and libraries: semantics and implementation + Verification of declarative parallel and distributed programs + Software synthesis, automatic code generation for parallel programming + Model-driven software engineering with parallel programs + High-level programming models for heterogeneous/hierarchical platforms + High-level parallel methods for large datasets + Applications of parallel systems using high-level languages and tools + Teaching experience with high-level tools and methods =========================================================================== Programme committee: Marco Aldinucci, University of Torino, Italy Jost Berthold, University of Copenhagen, Denmark Rob Bisseling, Utrecht University, Netherlands Murray Cole, University of Edinburgh, United Kingdom Joel Falcou, MetaScale / Universit? Paris-Sud, France Clemens Grelck, University of Amsterdam, Netherlands (Chair) Ga?tan Hains, Universit? Paris-Est, France Zhenjiang Hu, National Institute of Informatics, Japan Youry Khmelevsky, University of British Columbia / Okanagan College, Canada Herbert Kuchen, University of M?nster, Germany Kiminori Matsuzaki, Kochi University of Technology, Japan Frank Penczek, Intel Ulm, Germany Susanna Pelagatti, University of Pisa, Italy Tiark Rompf, Oracle Labs / Ecole Polytechnique F?d?rale de Lausanne, Switzerland Francisco de Sande, University of La Laguna, Spain Kostis Sagonas, Uppsala University, Sweden Vijay Saraswat, IBM Thomas J. Watson Research Center, USA Sven-Bodo Scholz, Heriot-Watt University, United Kingdom =========================================================================== HLPP Organizer and programme chair: Clemens Grelck Informatics Institute University of Amsterdam Science Park 904 1098XH Amsterdam Netherlands c.grelck at uva.nl =========================================================================== HLPP steering committee: Clemens Grelck (Universiteit van Amsterdam, Netherlands) Ga?tan Hains (Universit? Paris-Est, France) Kiminori Matsuzaki (Kochi University of Technology, Japan) Fr?d?ric Loulergue (Universit? d'Orl?ans, France) Quentin Miller (Somerville College Oxford, United Kingdom) Alexander Tiskin (University of Warwick, United Kingdom) =========================================================================== Previous HLPP symposia and workshops: HLPP 2013, Paris, France HLPP 2011, Tokyo, Japan HLPP 2010, Baltimore, USA HLPP 2005, Coventry, United Kingdom HLPP 2003, Paris, France HLPP 2001, Orl?ans, France =========================================================================== -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From dstcruz at gmail.com Thu Jun 12 02:23:22 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 11 Jun 2014 22:23:22 -0400 Subject: [Haskell] Haskell Weekly News: Issue 296 Message-ID: Welcome to issue 296 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from May 25 to June 7, 2014 Quotes of the Week * mbrock: then you get into a whole thing about the epistemology of abstract algebra, and someone brings up Wittgenstein, somebody brings out a bottle of wine, and it's yet another one of those nights Top Reddit Stories * An alternative Haskell home page Domain: chrisdone.com, Score: 160, Comments: 57 Original: [1] http://goo.gl/Yw2G3a On Reddit: [2] http://goo.gl/m19Ujx * Third generation of the attoparsec parsing library Domain: serpentine.com, Score: 82, Comments: 22 Original: [3] http://goo.gl/kk8i50 On Reddit: [4] http://goo.gl/LZzevb * Music-Suite Domain: music-suite.github.io, Score: 81, Comments: 44 Original: [5] http://goo.gl/u69ybm On Reddit: [6] http://goo.gl/EYKMwI * Erik Meijer: Introduction to Functional Programming Domain: edx.org, Score: 79, Comments: 11 Original: [7] http://goo.gl/YrfbA3 On Reddit: [8] http://goo.gl/oLRm6k * The abject failure of weak typing Domain: techblog.realestate.com.au, Score: 72, Comments: 28 Original: [9] http://goo.gl/h5XDVZ On Reddit: [10] http://goo.gl/nfnLNN * Lazy Dynamic Programming Domain: jelv.is, Score: 64, Comments: 12 Original: [11] http://goo.gl/kdSbkh On Reddit: [12] http://goo.gl/I6XVa8 * First Person 3D Navigation, written in Elm Domain: github.com, Score: 62, Comments: 0 Original: [13] http://goo.gl/qLM3FD On Reddit: [14] http://goo.gl/CRNW6M * Haskell Platform Redesign Domain: self.haskell, Score: 57, Comments: 39 Original: [15] http://goo.gl/A2OqV4 On Reddit: [16] http://goo.gl/A2OqV4 * Benjamin Pierce on clean-slate security architectures Domain: intelligence.org, Score: 54, Comments: 2 Original: [17] http://goo.gl/dCWGlr On Reddit: [18] http://goo.gl/ns7SF6 * Idris 0.9.13 released, featuring a new erasure implementation, Haddock- and Hoogle-inspired tools, and improved IDE support Domain: idris-lang.org, Score: 53, Comments: 6 Original: [19] http://goo.gl/rf9i2U On Reddit: [20] http://goo.gl/tByoYR * Brilliant explanation of Free Monad + Interpreter pattern. Domain: programmers.stackexchange.com, Score: 52, Comments: 16 Original: [21] http://goo.gl/5wVfG1 On Reddit: [22] http://goo.gl/bCb0tD * I got lenses in my Functor Domain: izbicki.me, Score: 52, Comments: 35 Original: [23] http://goo.gl/9xAo4g On Reddit: [24] http://goo.gl/kZBcK8 * The GHC Runtime System [pdf] Domain: scs.stanford.edu, Score: 50, Comments: 15 Original: [25] http://goo.gl/J2iH4W On Reddit: [26] http://goo.gl/B2AiSo * The typeparams library provides a lens-like interface for type level parameters; it allows unboxing unboxed vectors (with benchmarks indicating a 25% performance gain) and supercompilation-like optimizations (with benchmarks showing 40x performance gain in some cases) Domain: github.com, Score: 49, Comments: 14 Original: [27] http://goo.gl/jzIn2E On Reddit: [28] http://goo.gl/fdiRHU * LiquidHaskell: Pointers Gone Wild Domain: goto.ucsd.edu, Score: 48, Comments: 16 Original: [29] http://goo.gl/aKyRnQ On Reddit: [30] http://goo.gl/pexvtf * Sed implementation in Haskell - Episode 6 [youtube] Domain: youtube.com, Score: 45, Comments: 5 Original: [31] http://goo.gl/JQ2ONf On Reddit: [32] http://goo.gl/vLQWVJ * Call Arity [pdf]: A new analysis implemented in GHC Domain: joachim-breitner.de, Score: 44, Comments: 6 Original: [33] http://goo.gl/BdEFfs On Reddit: [34] http://goo.gl/OSv5Rb Top StackOverflow Questions * Understanding Haskell's Bool Deriving an Ord votes: 17, answers: 2 Read on SO: [35] http://goo.gl/7W9WRb * Precise flow control in Haskell votes: 14, answers: 0 Read on SO: [36] http://goo.gl/uoA9i1 * Why aren't there existentially quantified type variables in GHC Haskell votes: 14, answers: 2 Read on SO: [37] http://goo.gl/ZeBJTK * Is the concept of an ?interleaved homomorphism? a real thing? votes: 14, answers: 3 Read on SO: [38] http://goo.gl/gpIH6b * Is it possible to get `-=` working with literals? votes: 12, answers: 1 Read on SO: [39] http://goo.gl/R40i7q * How much overhead does sparking incur? votes: 11, answers: 1 Read on SO: [40] http://goo.gl/ixWkKL Until next time, [41]+Daniel Santa Cruz References 1. http://chrisdone.com/posts/haskell-lang 2. http://www.reddit.com/r/haskell/comments/26rilp/an_alternative_haskell_home_page/ 3. http://www.serpentine.com/blog/2014/05/31/attoparsec/ 4. http://www.reddit.com/r/haskell/comments/26xyah/third_generation_of_the_attoparsec_parsing_library/ 5. http://music-suite.github.io/docs/ref/ 6. http://www.reddit.com/r/haskell/comments/27djwy/musicsuite/ 7. https://www.edx.org/course/delftx/delftx-fp101x-introduction-functional-2126 8. http://www.reddit.com/r/haskell/comments/27bnt7/erik_meijer_introduction_to_functional_programming/ 9. http://techblog.realestate.com.au/the-abject-failure-of-weak-typing/ 10. http://www.reddit.com/r/haskell/comments/26pi5b/the_abject_failure_of_weak_typing/ 11. http://jelv.is/blog/Lazy-Dynamic-Programming 12. http://www.reddit.com/r/haskell/comments/26jh2w/lazy_dynamic_programming/ 13. https://github.com/evancz/first-person-elm#first-person-3d-navigation-in-elm 14. http://www.reddit.com/r/haskell/comments/26mjak/first_person_3d_navigation_written_in_elm/ 15. http://www.reddit.com/r/haskell/comments/26g9y8/haskell_platform_redesign/ 16. http://www.reddit.com/r/haskell/comments/26g9y8/haskell_platform_redesign/ 17. http://intelligence.org/2014/05/11/benjamin-pierce/ 18. http://www.reddit.com/r/haskell/comments/274k69/benjamin_pierce_on_cleanslate_security/ 19. http://www.idris-lang.org/idris-0-9-13-released/ 20. http://www.reddit.com/r/haskell/comments/279wl7/idris_0913_released_featuring_a_new_erasure/ 21. http://programmers.stackexchange.com/questions/242795/what-is-the-free-monad-interpreter-pattern 22. http://www.reddit.com/r/haskell/comments/2788cw/brilliant_explanation_of_free_monad_interpreter/ 23. http://izbicki.me/blog/i-got-lenses-in-my-functors 24. http://www.reddit.com/r/haskell/comments/27h0wk/i_got_lenses_in_my_functor/ 25. http://www.scs.stanford.edu/14sp-cs240h/slides/ghc-rts.pdf 26. http://www.reddit.com/r/haskell/comments/26qshw/the_ghc_runtime_system_pdf/ 27. https://github.com/mikeizbicki/typeparams#the-typeparams-library 28. http://www.reddit.com/r/haskell/comments/27avw8/the_typeparams_library_provides_a_lenslike/ 29. http://goto.ucsd.edu/~rjhala/liquid/haskell/blog/blog/2014/05/28/pointers-gone-wild.lhs/ 30. http://www.reddit.com/r/haskell/comments/26redl/liquidhaskell_pointers_gone_wild/ 31. https://www.youtube.com/watch?v=GKRjVITL_oA 32. http://www.reddit.com/r/haskell/comments/26th92/sed_implementation_in_haskell_episode_6_youtube/ 33. http://www.joachim-breitner.de/publications/CallArity-TFP.pdf 34. http://www.reddit.com/r/haskell/comments/26fdxq/call_arity_pdf_a_new_analysis_implemented_in_ghc/ 35. http://stackoverflow.com/questions/23880626/understanding-haskells-bool-deriving-an-ord 36. http://stackoverflow.com/questions/23869547/precise-flow-control-in-haskell 37. http://stackoverflow.com/questions/23940487/why-arent-there-existentially-quantified-type-variables-in-ghc-haskell 38. http://stackoverflow.com/questions/24090758/is-the-concept-of-an-interleaved-homomorphism-a-real-thing 39. http://stackoverflow.com/questions/23875471/is-it-possible-to-get-working-with-literals 40. http://stackoverflow.com/questions/23877737/how-much-overhead-does-sparking-incur 41. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From danburton.email at gmail.com Thu Jun 12 09:47:54 2014 From: danburton.email at gmail.com (Dan Burton) Date: Thu, 12 Jun 2014 02:47:54 -0700 Subject: [Haskell] ANN: io-memoize 1.1 Message-ID: Have you ever wanted to restrict an IO action such that it could only be invoked once? Now you can with System.IO.Memoize.once (formerly known as ioMemo). Need slightly more complicated logic? (e.g. An IO callback that takes an argument but then only executes the first time around, essentially ignoring the argument the other times it is called.) Leverage the dead simple "write once" Control.Concurrent.Cache api for fun and profit. 1. Create an empty cache with newCache 2. fetch repeatedly from the cache, each time providing a fallback in case it is empty. 3. There is no step 3. Fetching from a Cache is thread safe: only one "fallback" will execute at a time, and after the first successful fallback, the cached value will be set and no other fallbacks will be called. -- Dan Burton -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Fri Jun 13 04:21:27 2014 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Fri, 13 Jun 2014 06:21:27 +0200 Subject: [Haskell] HART 2014 - Second Workshop on Haskell And Rewriting Techniques (co-located with ICFP 2014) Message-ID: <539A7C47.7010504@informatik.uni-bonn.de> 2nd CALL FOR PAPERS Second Workshop on Haskell And Rewriting Techniques (HART 2014) http://www.program-transformation.org/HART14/ To be held on September 5, co-located with ICFP, the Haskell Symposium, etc., in Gothenburg. Haskell is an advanced purely-functional programming language. Pure functional programming is programming with equations, often defined by pattern-matching. Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations, often constructor-based. There are strong connections between Haskell (or generally, pure functional) programming and rewriting. The purpose of the HART workshop is to foster those connections. In addition to an invited talk by Oleg Kiselyov, we plan a half day of discussions, in an informal setting, on how Haskell (and related languages) and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example: ==================================== - equational reasoning and other rewriting techniques for program verification and analysis; - lambda calculi and type systems for functional programs and higher-order rewrite systems; - rewriting of type expressions in the type checker; - rewriting of programs by refactoring tools, optimizers, code generators; - execution of programs as a form of graph rewriting (terms with sharing); - Template Haskell, generally introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. Also, the workshop is deliberately open for discussion of rewriting-related aspects of languages like Agda, Clean, ... When in doubt, please contact a member of the PC (see below). Dates: ====== July 2: deadline for submissions July 21: notification of acceptance September 5: workshop Submission and proceedings: =========================== We solicit two types of submissions: - Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. - Presentation-only papers. Describing work recently published or submitted. Only abstract will be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is electronically at https://www.easychair.org/conferences/?conf=hart2014 In line with the informal style of the workshop, the reviewing of submissions will be light. Proceedings will be made available electronically. Program committee: ================== Bertram Felgenhauer Carsten Fuhs Andy Gill Makoto Hamana Bastiaan Heeren Femke van Raamsdonk Tiark Rompf Kristoffer Rose (co-chair) Christian Sternagel Janis Voigtl?nder (co-chair) Johannes Waldmann From brucker at spamfence.net Fri Jun 13 19:39:57 2014 From: brucker at spamfence.net (Achim D. Brucker) Date: Fri, 13 Jun 2014 21:39:57 +0200 Subject: [Haskell] Second Call for Papers: OCL 2014 Message-ID: <20140613193957.GA8214@fujikawa.home.brucker.ch> (Apologies for duplicates) CALL FOR PAPERS 14th International Workshop on OCL and Textual Modeling Applications and Case Studies (OCL 2014) Co-located with ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems (MODELS 2014) September 28-30 (tbc), 2014, VALENCIA, SPAIN http://www.software.imdea.org/OCL2014/ Modeling started out with UML and its precursors as a graphical notation. Such visual representations enable direct intuitive capturing of reality, but some of their features are difficult to formalize and lack the level of precision required to create complete and unambiguous specifications. Limitations of the graphical notations encouraged the development of text-based modeling languages that either integrate with or replace graphical notations for modeling. Typical examples of such languages are OCL, textual MOF, Epsilon, and Alloy. Textual modeling languages have their roots in formal language paradigms like logic, programming and databases. The goal of this workshop is create a forum where researchers and practitioners interested in building models using OCL or other kinds of textual languages can directly interact, report advances, share results, identify tools for language development, and discuss appropriate standards. In particular, the workshop will encourage discussions for achieving synergy from different modeling language concepts and modeling language use. The close interaction will enable researchers and practitioners to identify common interests and options for potential cooperation. Topics of interest include (but are not limited to) =================================================== - Mappings between textual modeling languages and other languages/formalisms - Algorithms, evaluation strategies and optimizations in the context of textual modeling languages for -- validation, verification, and testing, -- model transformation and code generation, -- metamodeling and DSLs, and -- query and constraint specifications - Alternative graphical/textual notations for textual modeling languages - Evolution, transformation and simplification of textual modeling expressions - Libraries, templates and patterns for textual modeling languages - Complexity results for textual modeling languages - Quality models and benchmarks for comparing and evaluating textual modeling tools and algorithms - Successful applications of textual modeling languages - Case studies on industrial applications of textual modeling languages - Experience reports -- usage of textual modeling languages and tools in complex domains, -- usability of textual modeling languages and tools for end-users - Empirical studies about the benefits and drawbacks of textual modeling languages - Innovative textual modeling tools - Comparison, evaluation and integration of modeling languages - Correlation between modeling languages and modeling tasks This year, we particularly encourage submissions describing applications and case studies of textual modeling as well as test suites and benchmark collections for evaluating textual modeling tools. Venue ===== The workshop will be organized as a part of MODELS 2014 Conference in Valencia, Spain. It continues the series of OCL workshops held at UML/MODELS conferences: York (2000), Toronto (2001), San Francisco (2003), Lisbon (2004), Montego Bay (2005), Genova (2006), Nashville (2007), Toulouse (2008), Denver (2009), Oslo (2010), Zurich (2011, at the TOOLs conference), 2012 in Innsbruck, and 2013 in Miami. Similar to its predecessors, the workshop addresses both people from academia and industry. The aim is to provide a forum for addressing integration of OCL and other textual modeling languages, as well as tools for textual modeling, and for disseminating good practice and discussing the new requirements for textual modeling. Workshop Format =============== The workshop will include short (about 15 min) presentations, parallel sessions of working groups, and sum-up discussions. Submissions =========== Two types of papers will be considered: * short papers (6 pages) and * full papers (10 pages) in LNCS format. Submissions should be uploaded to EasyChair (https://www.easychair.org/conferences/?conf=ocl2014). The program committee will review the submissions (minimum 2 reviews per paper, usually 3 reviews) and select papers according to their relevance and interest for discussions that will take place at the workshop. Accepted papers will be published online in a pre-conference edition of CEUR (http://www.ceur-ws.org). Authors of selected papers will be invited to submit an extended version of their workshop paper to a special issue of the Electronic Communications of the EASST (http://journal.ub.tu-berlin.de/eceasst) Important Dates =============== Submission of papers: July 11, 2014 Notification: August 8, 2014 Workshop date: one day during September 28-30, 2014 Organizers ========== Achim D. Brucker, SAP AG, Germany Carolina Dania, IMDEA Software Institute, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Programme Committee (partly confirmation pending) =================== Michael Altenhofen, SAP AG, Germany Thomas Baar, University of Applied Sciences Berlin, Germany Mira Balaban, Ben-Gurion University of the Negev, Israel Tricia Balfe, Nomos Software, Ireland Fabian Buettner, Ecole des Mines de Nantes, France Achim D. Brucker, SAP AG, Germany Jordi Cabot, INRIA-Ecole des Mines de Nantes, France Yoonsik Cheon, University of Texas, USA Dan Chiorean, Babes-Bolyai University, Romania Robert Clariso, Universitat Oberta de Catalunya, Spain Tony Clark, Middlesex University, UK Manuel Clavel, IMDEA Software Institute, Madrid, Spain Carolina Dania, IMDEA Software Institute, Madrid, Spain Birgit Demuth, Technische Universitat Dresden, Germany Marina Egea, Atos Research, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Pieter Van Gorp, Eindhoven University of Technology, The Netherlands Heinrich Hussmann, LMU Munchen, Germany Tihamer Levendovszky, Vanderbilt University, USA Shahar Maoz, Tel Aviv University, Israel Istvan Rath, Budapest University of Technology and Economics, Hungary Bernhard Rumpe, RWTH Aachen, Germany Shane Sendall, Snowie Research SA, Switzerland Michael Wahler, ABB Switzerland Ltd Corporate Research, Switzerland Claas Wilke, Technische Universitat Dresden, Germany Edward Willink, Willink Transformations Ltd., UK Burkhart Wolff, Univ Paris-Sud, France Steffen Zschaler, King?s College, London, UK -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/ From fuuzetsu at fuuzetsu.co.uk Wed Jun 18 07:43:50 2014 From: fuuzetsu at fuuzetsu.co.uk (Mateusz Kowalczyk) Date: Wed, 18 Jun 2014 09:43:50 +0200 Subject: [Haskell] ANN: haddock-library 1.0.0 Message-ID: <53A14336.5050105@fuuzetsu.co.uk> Hi, haddock-library is a package aiming to provide bits of Haddock to the rest of the Haskell world without imposing the GHC dependency that we have on the ?haddock? package itself. Please note that this does not deprecate the ?haddock? package which aims to expose other bits of Haddock, including those talking with GHC. Specifically, 1.0.0 exposes the types used by the comment parser and the parser itself. This allows you to supply the Haddock parser with String and get a Haddock ADT back out to play with. This means that if in the past you were processing Haddock strings with your own solution (or copy + pasted Alex parser we had) then you should now switch to this package instead. The API is subject to change so upper version bound is advised. Tested on 7.6.3, 7.8.x and current HEAD. The parser exposed is what is used in Haddock itself which now internally depends on this package. There are plans to move more parts into this package, exposing as much useful functionality as possible without the GHC dependency. New releases are independent of the GHC release cycle, unlike Haddock itself. To file issues for this package, use the Haddock issue tracker that's now on GitHub. Thanks -- Mateusz K. From agocorona at gmail.com Wed Jun 18 14:02:11 2014 From: agocorona at gmail.com (Alberto G. Corona ) Date: Wed, 18 Jun 2014 16:02:11 +0200 Subject: [Haskell] ANNOUNCE: haste-perch Message-ID: Hi, haste-perch defines builder elements (perchs) for Haste.DOM elements that are appendable, so that dynamic HTML can be created in the client in a natural way, like textual HTML, but programmatically and with the advantage of static type checking. It can be ported to other haskell-js compilers. http://hackage.haskell.org/package/haste-perch This program, when compiled with haste: main= do withElem "idelem" $ build $ do div $ do div $ do p "hello" p ! atr "style" "color:red" $ "world" return () Creates these element:
<-- was already in the HTML

hello

world

Since the creation is in the browser, that permit quite dynamic pages for data presentation, and interctive textual (a.k.a "serious") applications and, in general the development of client-side web frameworks using haskell with the haste compiler. See the README in the git repository: https://github.com/agocorona/haste-perch -- Alberto. -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrew.gibiansky at gmail.com Wed Jun 18 16:11:20 2014 From: andrew.gibiansky at gmail.com (Andrew Gibiansky) Date: Wed, 18 Jun 2014 09:11:20 -0700 Subject: [Haskell] ANNOUNCE: haste-perch In-Reply-To: References: Message-ID: Could you elaborate on how this is better/different from blaze-html? I'm a bit confused - is it just the same thing but works with Haste, while blaze-html doesn't? What's the main idea? Thanks! Andrew On Wed, Jun 18, 2014 at 7:02 AM, Alberto G. Corona wrote: > Hi, > > haste-perch defines builder elements (perchs) for Haste.DOM elements that > are appendable, so that dynamic HTML can be created in the client in a > natural way, like textual HTML, but programmatically and with the advantage > of static type checking. It can be ported to other haskell-js compilers. > > http://hackage.haskell.org/package/haste-perch > > This program, when compiled with haste: > > main= do > withElem "idelem" $ build $ do > div $ do > div $ do > p "hello" > p ! atr "style" "color:red" $ "world" > > return () > > Creates these element: > >
<-- was already in the HTML >
>
>

hello

>

world

>
>
>
> > Since the creation is in the browser, that permit quite dynamic pages for > data > presentation, and interctive textual (a.k.a "serious") applications and, > in general > the development of client-side web frameworks using haskell with the haste > compiler. > > > See the README in the git repository: > > https://github.com/agocorona/haste-perch > > -- > Alberto. > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From agocorona at gmail.com Wed Jun 18 17:20:09 2014 From: agocorona at gmail.com (Alberto G. Corona ) Date: Wed, 18 Jun 2014 19:20:09 +0200 Subject: [Haskell] ANNOUNCE: haste-perch In-Reply-To: References: Message-ID: The syntax is similar to blaze-html, but haste-perch uses the HTM-DOM in the browser to create DOM elements. blaze-html creates a html bytestring in the server that the browser must load. It uses Haste.DOM http://hackage.haskell.org/package/haste-compiler-0.2.99/docs/Haste-DOM.html Haste.DOM has primitives that invoke Javascript functions in browser like: For example newElem invoke "createElement" in javascript Perch assemble a sequence of DOM calls that create the HTML tree directly in the browser. so you can create an application that run fully in the browser The tree can change depeding on different actions done by the user by changing the HTML tree dynamically. It is possible to create dynamic applications. 2014-06-18 18:11 GMT+02:00 Andrew Gibiansky : > Could you elaborate on how this is better/different from blaze-html? > > I'm a bit confused - is it just the same thing but works with Haste, while > blaze-html doesn't? What's the main idea? > > Thanks! > Andrew > > > On Wed, Jun 18, 2014 at 7:02 AM, Alberto G. Corona > wrote: > >> Hi, >> >> haste-perch defines builder elements (perchs) for Haste.DOM elements that >> are appendable, so that dynamic HTML can be created in the client in a >> natural way, like textual HTML, but programmatically and with the advantage >> of static type checking. It can be ported to other haskell-js compilers. >> >> http://hackage.haskell.org/package/haste-perch >> >> This program, when compiled with haste: >> >> main= do >> withElem "idelem" $ build $ do >> div $ do >> div $ do >> p "hello" >> p ! atr "style" "color:red" $ "world" >> >> return () >> >> Creates these element: >> >>
<-- was already in the HTML >>
>>
>>

hello

>>

world

>>
>>
>>
>> >> Since the creation is in the browser, that permit quite dynamic pages for >> data >> presentation, and interctive textual (a.k.a "serious") applications and, >> in general >> the development of client-side web frameworks using haskell with the >> haste compiler. >> >> >> See the README in the git repository: >> >> https://github.com/agocorona/haste-perch >> >> -- >> Alberto. >> >> _______________________________________________ >> Haskell mailing list >> Haskell at haskell.org >> http://www.haskell.org/mailman/listinfo/haskell >> >> > -- Alberto. -------------- next part -------------- An HTML attachment was scrubbed... URL: From agocorona at gmail.com Wed Jun 18 17:43:54 2014 From: agocorona at gmail.com (Alberto G. Corona ) Date: Wed, 18 Jun 2014 19:43:54 +0200 Subject: [Haskell] ANNOUNCE: haste-perch In-Reply-To: References: Message-ID: The readme in the Git repository tell more details https://github.com/agocorona/haste-perch/blob/master/README.md And also this blog post: http://haskell-web.blogspot.com.es/2014/06/taming-html-dom-with-monads-and-monoids.html 2014-06-18 19:20 GMT+02:00 Alberto G. Corona : > The syntax is similar to blaze-html, but haste-perch uses the HTM-DOM in > the browser to create DOM elements. blaze-html creates a html bytestring in > the server that the browser must load. > > It uses Haste.DOM > > > http://hackage.haskell.org/package/haste-compiler-0.2.99/docs/Haste-DOM.html > > Haste.DOM has primitives that invoke Javascript functions in browser like: > For example newElem invoke "createElement" in javascript > > Perch assemble a sequence of DOM calls that create the HTML tree directly > in the browser. so you can create an application that run fully in the > browser > > The tree can change depeding on different actions done by the user by > changing the HTML tree dynamically. It is possible to create dynamic > applications. > > > > > 2014-06-18 18:11 GMT+02:00 Andrew Gibiansky : > > Could you elaborate on how this is better/different from blaze-html? >> >> I'm a bit confused - is it just the same thing but works with Haste, >> while blaze-html doesn't? What's the main idea? >> >> Thanks! >> Andrew >> >> >> On Wed, Jun 18, 2014 at 7:02 AM, Alberto G. Corona >> wrote: >> >>> Hi, >>> >>> haste-perch defines builder elements (perchs) for Haste.DOM elements >>> that are appendable, so that dynamic HTML can be created in the client in a >>> natural way, like textual HTML, but programmatically and with the advantage >>> of static type checking. It can be ported to other haskell-js compilers. >>> >>> http://hackage.haskell.org/package/haste-perch >>> >>> This program, when compiled with haste: >>> >>> main= do >>> withElem "idelem" $ build $ do >>> div $ do >>> div $ do >>> p "hello" >>> p ! atr "style" "color:red" $ "world" >>> >>> return () >>> >>> Creates these element: >>> >>>
<-- was already in the HTML >>>
>>>
>>>

hello

>>>

world

>>>
>>>
>>>
>>> >>> Since the creation is in the browser, that permit quite dynamic pages >>> for data >>> presentation, and interctive textual (a.k.a "serious") applications and, >>> in general >>> the development of client-side web frameworks using haskell with the >>> haste compiler. >>> >>> >>> See the README in the git repository: >>> >>> https://github.com/agocorona/haste-perch >>> >>> -- >>> Alberto. >>> >>> _______________________________________________ >>> Haskell mailing list >>> Haskell at haskell.org >>> http://www.haskell.org/mailman/listinfo/haskell >>> >>> >> > > > -- > Alberto. > -- Alberto. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dstcruz at gmail.com Thu Jun 19 01:08:33 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 18 Jun 2014 21:08:33 -0400 Subject: [Haskell] Haskell Weekly News: Issue 297 Message-ID: Welcome to issue 297 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from June 8 to 14, 2014 Quotes of the Week * dpwright: this afternoon I've literally taken an entire (portrait) screen's worth of code and reduced it to about three lines and a few lens operators * tommd: Haskell is a great language. I needed to test a program under high CPU load, so to burn some cycles I cabal-installed lens. Is there anything Haskell can't do? * bernalex: I imagine hell as a place where spj & edwardk are holding talks at the same time and I have to choose. Top Reddit Stories * Haxl on Github Domain: github.com, Score: 124, Comments: 25 Original: [1] http://goo.gl/zw8Y8q On Reddit: [2] http://goo.gl/FoV1zw * www.dohaskell.com Domain: dohaskell.com, Score: 92, Comments: 23 Original: [3] http://goo.gl/uxmtUy On Reddit: [4] http://goo.gl/xkGJUb * cloud-haskell is on hackage now Domain: hackage.haskell.org, Score: 87, Comments: 7 Original: [5] http://goo.gl/eCHMgO On Reddit: [6] http://goo.gl/h9j7H1 * Facebook releases Haxl, a library for async data access Domain: code.facebook.com, Score: 65, Comments: 0 Original: [7] http://goo.gl/D6xEnM On Reddit: [8] http://goo.gl/GCqeEt * The problem with mtl Domain: ro-che.info, Score: 61, Comments: 58 Original: [9] http://goo.gl/hDncB8 On Reddit: [10] http://goo.gl/2uRfm2 * Why programmers can?t make any money: dimensionality and the Eternal Haskell Tax Domain: michaelochurch.wordpress.com, Score: 56, Comments: 37 Original: [11] http://goo.gl/Ums4cZ On Reddit: [12] http://goo.gl/ytLSN2 * A Year of Functional Programming Domain: japgolly.blogspot.com.au, Score: 52, Comments: 17 Original: [13] http://goo.gl/torrXD On Reddit: [14] http://goo.gl/XTSVed * Haskell for all: Spreadsheet-like programming in Haskell Domain: haskellforall.com, Score: 52, Comments: 26 Original: [15] http://goo.gl/eaaeHa On Reddit: [16] http://goo.gl/biUwQf * GHC bug squashing at ZuriHac 2014 Domain: joachim-breitner.de, Score: 50, Comments: 0 Original: [17] http://goo.gl/zgd6qV On Reddit: [18] http://goo.gl/HDp0Wt * There is no Fork?our ICFP 2014 paper about Haxl Domain: community.haskell.org, Score: 47, Comments: 4 Original: [19] http://goo.gl/yvbvAH On Reddit: [20] http://goo.gl/pwcBxO * EclipseFP 2.6.0 released Domain: jpmoresmau.blogspot.fr, Score: 46, Comments: 18 Original: [21] http://goo.gl/fohXYx On Reddit: [22] http://goo.gl/duJMir * Haskell Development Workflow Demo, first video I've made, wanted to see if any found it useful Domain: youtube.com, Score: 44, Comments: 11 Original: [23] http://goo.gl/O1REsS On Reddit: [24] http://goo.gl/KTK1kk * Announcement: Bang, a drum machine DSL for Haskell Domain: self.haskell, Score: 42, Comments: 17 Original: [25] http://goo.gl/QVlj3E On Reddit: [26] http://goo.gl/QVlj3E * How do you learn to write systems in Haskell? (and a story) Domain: self.haskell, Score: 42, Comments: 66 Original: [27] http://goo.gl/PXiZUD On Reddit: [28] http://goo.gl/PXiZUD * The Haskell Cast #7 - Chris Done on Compiling to JavaScript and SQL Domain: haskellcast.com, Score: 41, Comments: 15 Original: [29] http://goo.gl/747Kpj On Reddit: [30] http://goo.gl/n0nlLJ * ICFP 2014 accepted papers Domain: github.com, Score: 40, Comments: 3 Original: [31] http://goo.gl/XZ962N On Reddit: [32] http://goo.gl/VnuyDW * cabal - the simple guide Domain: katychuang.com, Score: 40, Comments: 16 Original: [33] http://goo.gl/svwYE1 On Reddit: [34] http://goo.gl/oGidxo * Two failed attempts at extensible effects Domain: ro-che.info, Score: 37, Comments: 12 Original: [35] http://goo.gl/DD7WX9 On Reddit: [36] http://goo.gl/wh8fWW * Follow up blog post: "Understanding the RealWorld": the Haskell heap, function calls, and primitive types. Domain: well-typed.com, Score: 34, Comments: 12 Original: [37] http://goo.gl/9OMjWu On Reddit: [38] http://goo.gl/N0B4cJ * "Why Haskell?" Elevator Pitch Domain: self.haskell, Score: 33, Comments: 70 Original: [39] http://goo.gl/xsIOqw On Reddit: [40] http://goo.gl/xsIOqw Top StackOverflow Questions * Why should Applicative be a superclass of Monad? votes: 21, answers: 3 Read on SO: [41] http://goo.gl/Z1Q6uo * What do you call the data wrapped inside a monad? votes: 15, answers: 2 Read on SO: [42] http://goo.gl/iNtQAX * What algorithm is used in Haskell (GHC) for deriving types of recursive expressions? votes: 14, answers: 1 Read on SO: [43] http://goo.gl/7QvfqM * What container really mimics std::vector in Haskell? votes: 14, answers: 4 Read on SO: [44] http://goo.gl/k0vk2n * Why the cycle function cannot work with empty list? votes: 14, answers: 2 Read on SO: [45] http://goo.gl/B5Na0a Until next time, [46]+Daniel Santa Cruz References 1. https://github.com/facebook/Haxl 2. http://www.reddit.com/r/haskell/comments/27sv88/haxl_on_github/ 3. http://www.dohaskell.com/ 4. http://www.reddit.com/r/haskell/comments/27wjwk/wwwdohaskellcom/ 5. http://hackage.haskell.org/package/cloud-haskell-0.0.1.0 6. http://www.reddit.com/r/haskell/comments/281sbp/cloudhaskell_is_on_hackage_now/ 7. https://code.facebook.com/projects/854888367872565/haxl/ 8. http://www.reddit.com/r/haskell/comments/27syj2/facebook_releases_haxl_a_library_for_async_data/ 9. http://ro-che.info/articles/2014-06-11-problem-with-mtl.html 10. http://www.reddit.com/r/haskell/comments/27vhd1/the_problem_with_mtl/ 11. http://michaelochurch.wordpress.com/2014/06/06/why-programmers-cant-make-any-money-dimensionality-and-the-eternal-haskell-tax/ 12. http://www.reddit.com/r/haskell/comments/27onwq/why_programmers_cant_make_any_money/ 13. http://japgolly.blogspot.com.au/2014/06/a-year-of-functional-programming.html 14. http://www.reddit.com/r/haskell/comments/27oxr4/a_year_of_functional_programming/ 15. http://www.haskellforall.com/2014/06/spreadsheet-like-programming-in-haskell.html 16. http://www.reddit.com/r/haskell/comments/284enc/haskell_for_all_spreadsheetlike_programming_in/ 17. http://www.joachim-breitner.de/blog/archives/651-ZuriHac-2014.html 18. http://www.reddit.com/r/haskell/comments/27p2nc/ghc_bug_squashing_at_zurihac_2014/ 19. http://community.haskell.org/~simonmar/papers/haxl-icfp14.pdf 20. http://www.reddit.com/r/haskell/comments/27tjpj/there_is_no_forkour_icfp_2014_paper_about_haxl/ 21. http://jpmoresmau.blogspot.fr/2014/06/eclipsefp-260-released.html 22. http://www.reddit.com/r/haskell/comments/27utrw/eclipsefp_260_released/ 23. https://www.youtube.com/watch?v=Li6oaO8x2VY 24. http://www.reddit.com/r/haskell/comments/27lcz3/haskell_development_workflow_demo_first_video_ive/ 25. http://www.reddit.com/r/haskell/comments/27s6py/announcement_bang_a_drum_machine_dsl_for_haskell/ 26. http://www.reddit.com/r/haskell/comments/27s6py/announcement_bang_a_drum_machine_dsl_for_haskell/ 27. http://www.reddit.com/r/haskell/comments/28575l/how_do_you_learn_to_write_systems_in_haskell_and/ 28. http://www.reddit.com/r/haskell/comments/28575l/how_do_you_learn_to_write_systems_in_haskell_and/ 29. http://www.haskellcast.com/episode/007-chris-done-on-compiling-to-javascript-and-sql/ 30. http://www.reddit.com/r/haskell/comments/27sh2d/the_haskell_cast_7_chris_done_on_compiling_to/ 31. https://github.com/yallop/icfp2014-papers/blob/master/README.md 32. http://www.reddit.com/r/haskell/comments/27p8xo/icfp_2014_accepted_papers/ 33. http://katychuang.com/cabal-guide/ 34. http://www.reddit.com/r/haskell/comments/280h9h/cabal_the_simple_guide/ 35. http://ro-che.info/articles/2014-06-14-extensible-effects-failed.html 36. http://www.reddit.com/r/haskell/comments/285prk/two_failed_attempts_at_extensible_effects/ 37. http://www.well-typed.com/blog/95/ 38. http://www.reddit.com/r/haskell/comments/27yg67/follow_up_blog_post_understanding_the_realworld/ 39. http://www.reddit.com/r/haskell/comments/282yky/why_haskell_elevator_pitch/ 40. http://www.reddit.com/r/haskell/comments/282yky/why_haskell_elevator_pitch/ 41. http://stackoverflow.com/questions/24112786/why-should-applicative-be-a-superclass-of-monad 42. http://stackoverflow.com/questions/24127190/what-do-you-call-the-data-wrapped-inside-a-monad 43. http://stackoverflow.com/questions/24105812/what-algorithm-is-used-in-haskell-ghc-for-deriving-types-of-recursive-expressi 44. http://stackoverflow.com/questions/24123967/what-container-really-mimics-stdvector-in-haskell 45. http://stackoverflow.com/questions/24223201/why-the-cycle-function-cannot-work-with-empty-list 46. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From andygill at ku.edu Sat Jun 21 14:44:24 2014 From: andygill at ku.edu (Andrew Gill) Date: Sat, 21 Jun 2014 09:44:24 -0500 Subject: [Haskell] ANNOUNCE: blank-canvas Message-ID: Announcing blank-canvas 0.4.0, a Haskell binding to the complete HTML5 Canvas API. blank-canvas allows Haskell users to write, in Haskell, interactive images onto their web browsers, via a specialized JavaScript DSL. First Example: {-# LANGUAGE OverloadedStrings #-} module Main where import Graphics.Blank -- import the blank canvas main = blankCanvas 3000 $ \ context -> do -- start blank canvas on port 3000 send context $ do -- send commands to this specific context moveTo(50,50) lineTo(200,100) lineWidth 10 strokeStyle "red" stroke() -- this draws the ink into the canvas There are around 50 examples on the blank-canvas wiki: https://github.com/ku-fpg/blank-canvas/wiki Enjoy! FPG at KU -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: Red_Line.png Type: image/png Size: 6650 bytes Desc: not available URL: From neil.ghani at strath.ac.uk Sun Jun 22 09:41:55 2014 From: neil.ghani at strath.ac.uk (Neil Ghani) Date: Sun, 22 Jun 2014 09:41:55 +0000 Subject: [Haskell] Professorship Available Message-ID: <422F5398-B4F0-4649-B3FE-FFBCF1B4C517@strath.ac.uk> Dear All We are looking for a new professor and Head of Department at Strathclyde. People on the Haskell list might be interested as there is a significant amount of functional programming done here so you should find fertile soil to put down roots. Details can be found at www.jobs.ac.uk/job/AIZ356/head-of-department/ If you are at all interested, even vaguely, then please do drop me a line. Always happy to chat ?. All the best Neil From pkaldenberg at gmail.com Mon Jun 23 00:13:12 2014 From: pkaldenberg at gmail.com (Peter Kaldenberg) Date: Mon, 23 Jun 2014 08:13:12 +0800 Subject: [Haskell] image conversion Message-ID: Dear all, I have a problem, I am working on functional images and have now a problem that I need to write a function with the following signature convert::(a->b)->Figure a ->Figure b Where Figure a :: Pos -> a and type Pos= (Double, Double) For instance I have an Image chessBoard. chessBoard::Figure Bool chessBoard(x,y)= even(round x)==even(round y) I also have a function boolChar::Bool -> Char now I want to call convert like convert boolChar chessBoard which will give me an Image with the following type Char. How can I solve this problem? Many thanks, Peter From pachopepe at gmail.com Mon Jun 23 05:22:21 2014 From: pachopepe at gmail.com (Francisco Chaves) Date: Mon, 23 Jun 2014 00:22:21 -0500 Subject: [Haskell] image conversion In-Reply-To: References: Message-ID: Following the type of convert you have convert f fig = \(x,y) -> f (fig (x,y)) = { Lambda parameter } convert f fig (x,y) = f (fig (x,y)) = { point wise } convert f fig (x,y) = (f . fig) (x,y) = { $ operator } convert f fig (x,y) = f . fig $ (x,y) = { (x,y) is a tuple parameter } convert f fig pos = f . fig $ pos All those definitions for convert are equivalent and do the trick. Moreover, if you define a Figure data type: data Figure a = Figure (Pos -> a) the convert definition is: convert f (Figure g) = Figure (\pos -> f . g $ pos) and corresponds to fmap function of the Functor class for the Figure data type, making a Figure an instance of Functor: instance Functor Figure where fmap = convert Cheers Francisco On Sun, Jun 22, 2014 at 7:13 PM, Peter Kaldenberg wrote: > Dear all, > > I have a problem, I am working on functional images and have now a problem > that I need to write a function with the following signature > > convert::(a->b)->Figure a ->Figure b > > Where Figure a :: Pos -> a and type Pos= (Double, Double) > > For instance I have an Image chessBoard. > chessBoard::Figure Bool > chessBoard(x,y)= even(round x)==even(round y) > > I also have a function boolChar::Bool -> Char > > now I want to call convert like convert boolChar chessBoard which will > give me an Image with the following type Char. > > How can I solve this problem? > > Many thanks, Peter > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -- Francisco Jose CHAVES PhD -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Mon Jun 23 13:02:36 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Mon, 23 Jun 2014 14:02:36 +0100 Subject: [Haskell] New Assistant Professorship in Nottingham Message-ID: <71BF1314-B58A-4AB9-B7A5-950F948F3FBE@exmail.nottingham.ac.uk> Dear all, The School of Computer Science at the University of Nottingham in the UK is seeking to appoint a new Assistant Professor: http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI181514 Applications in the area of the Functional Programming (FP) lab would be most welcome. The FP lab is keen to receive applications from candidates with an excellent publication record, experience in combining theory with practice, and the ability to secure external funding to support their research. Further information about the FP lab is available from: http://fp.cs.nott.ac.uk The deadline for applications is Friday 22nd August 2014. The advert mentions computer vision, but the position is open to applicants from any area of Computer Science. Best wishes, Graham Hutton -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From kutsia at risc.jku.at Tue Jun 24 17:07:39 2014 From: kutsia at risc.jku.at (Temur Kutsia) Date: Tue, 24 Jun 2014 19:07:39 +0200 Subject: [Haskell] SCSS 2014: Deadline extension Message-ID: <53A9B05B.2030204@risc.jku.at> [Please post - apologies for multiple copies.] Deadline Extension ================================================ SCSS 2014 Symbolic Computation in Software Science 6th International Symposium Gammarth, La Marsa, Tunisia, December 7-11, 2014 http://www.easychair.org/smart-program/SCSS2014/ ================================================ Important Dates --------------- July 7, 2014: Abstract submission deadline (extended) July 14, 2014: Paper submission deadline (extended) August 25, 2014: Notification September 22, 2014: Camera-ready copy deadline December 7-11, 2014: SCSS 2014 in Gammarth Scope -------- The purpose of SCSS 2014 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2014 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Nikolaj Bjorner (Microsoft Research) William M. Farmer (McMaster University) Program Chairs -------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Andrei Voronkov (University of Manchester, UK) Program Committee ------------------ Elvira Albert (Complutense University of Madrid, Spain) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) James H. Davenport (University of Bath, UK) Roberto Giacobazzi (University of Verona, Italy) Arie Gurfinkel (Carnegie Mellon University, USA) Nao Hirokawa (JAIST, Japan) Tetsuo Ida (University of Tsukuba, Japan) Florent Jacquemard (INRIA - IRCAM, France) Laura Kovacs (Chalmers University of Technology, Sweden) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) - chair Ali Mili (New Jersey Institute of Technology, USA) Joel Ouaknine (Oxford University, UK) Ruzica Piskac (Yale University, USA) Andrei Voronkov (University of Manchester, UK) - chair Dongming Wang (Beihang University, China and UPMC-CNRS, France) General Chairs --------------- Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Tetsuo Ida (University of Tsukuba, Japan) Local Chair ----------- Mohamed Becha Kaaniche (University of Carthage, Tunisia) Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2014 Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings will be published in the EasyChair Proceedings in Computing. We plan also to have a special issue of the Journal of Symbolic Computation on SCSS 2014. The full version of selected papers will be considered for the publication of the special issue subjected to the normal peer review process of the journal. From c.grelck at uva.nl Thu Jun 26 07:04:58 2014 From: c.grelck at uva.nl (Clemens Grelck) Date: Thu, 26 Jun 2014 09:04:58 +0200 Subject: [Haskell] HLPP 2014 - 7th Symposium on High-Level Parallel Programming and Applications Message-ID: <53ABC61A.8070101@uva.nl> ============================================================================== FINAL CALL FOR PARTICIPATION HLPP 2014 7th International Symposium on High-level Parallel Programming and Applications Amsterdam, Netherlands July 3-4, 2014 https://sites.google.com/site/hlpp2014amsterdam/ ============================================================================== Keynote: Frank Schlimbach, Intel: Parallelism Through CnC (Concurrent Collections) - More Flexibility, Less Pain Abstract: The major goal of CnC (Concurrent Collections) is a productive path to efficient parallel execution. And yet a CnC program does not indicate what runs in parallel. Instead, it explicitly identifies what precludes parallel execution. There are exactly two reasons that computations cannot execute in parallel. If one computation produces data that the other one consumes, the producer must execute before the consumer. If one computation determines if another will execute, the controller must execute before the controllee. CnC is a data and control flow model together with tuple-space influence. However, it is closer in philosophy to the PDG (Program Dependence Graph) intermediate form than to other parallel programming models. Its high-level abstractions allow flexible and efficient mapping of a CnC program to the target platform. The talk will introduce CnC and present some active research topics. ============================================================================== Aims and scope: As processor and system manufacturers increase the amount of both inter- and intra-chip parallelism it becomes crucial to provide the software industry with high-level, clean and efficient tools for parallel programming. Parallel and distributed programming methodologies are currently dominated by low-level techniques such as send/receive message passing, or equivalently unstructured shared memory mechanisms. Higher-level, structured approaches offer many possible advantages and have a key role to play in the scalable exploitation of ubiquitous parallelism. Since 2001 the HLPP series of workshops/symposia has been a forum for researchers developing state-of-the-art concepts, tools and applications for high-level parallel programming. The general emphasis is on software quality, programming productivity and high-level performance models. The 7th Symposium on High-Level Parallel Programming and Applications will be held July 3-4 in the historic center of Amsterdam. ============================================================================== Proceedings: Accepted papers will be distributed as informal draft proceedings during the symposium and thereafter published by Springer in a special issue of the International Journal of Parallel Programming (IJPP). ============================================================================== Topics: HLPP 2014 invites papers on all topics in high-level parallel programming, its tools and applications including, but not limited to, the following aspects: + High-level programming and performance models (BSP, CGM, LogP, MPM, etc.) and their tools + Declarative parallel programming methodologies + Algorithmic skeletons and constructive methods + Declarative parallel programming languages and libraries: semantics and implementation + Verification of declarative parallel and distributed programs + Software synthesis, automatic code generation for parallel programming + Model-driven software engineering with parallel programs + High-level programming models for heterogeneous/hierarchical platforms + High-level parallel methods for large datasets + Applications of parallel systems using high-level languages and tools + Teaching experience with high-level tools and methods ============================================================================== Programme committee: Marco Aldinucci, University of Torino, Italy Jost Berthold, University of Copenhagen, Denmark Rob Bisseling, Utrecht University, Netherlands Murray Cole, University of Edinburgh, United Kingdom Joel Falcou, MetaScale / Universit? Paris-Sud, France Clemens Grelck, University of Amsterdam, Netherlands (Chair) Ga?tan Hains, Universit? Paris-Est, France Zhenjiang Hu, National Institute of Informatics, Japan Youry Khmelevsky, University of British Columbia / Okanagan College, Canada Herbert Kuchen, University of M?nster, Germany Kiminori Matsuzaki, Kochi University of Technology, Japan Frank Penczek, Intel Ulm, Germany Susanna Pelagatti, University of Pisa, Italy Tiark Rompf, Oracle Labs / Ecole Polytechnique F?d?rale de Lausanne, Switzerland Francisco de Sande, University of La Laguna, Spain Kostis Sagonas, Uppsala University, Sweden Vijay Saraswat, IBM Thomas J. Watson Research Center, USA Sven-Bodo Scholz, Heriot-Watt University, United Kingdom ============================================================================== HLPP Organizer and programme chair: Clemens Grelck Informatics Institute University of Amsterdam Science Park 904 1098XH Amsterdam Netherlands c.grelck at uva.nl ============================================================================== HLPP steering committee: Clemens Grelck (Universiteit van Amsterdam, Netherlands) Ga?tan Hains (Universit? Paris-Est, France) Kiminori Matsuzaki (Kochi University of Technology, Japan) Fr?d?ric Loulergue (Universit? d'Orl?ans, France) Quentin Miller (Somerville College Oxford, United Kingdom) Alexander Tiskin (University of Warwick, United Kingdom) ============================================================================== Previous HLPP symposia and workshops: HLPP 2013, Paris, France HLPP 2011, Tokyo, Japan HLPP 2010, Baltimore, USA HLPP 2005, Coventry, United Kingdom HLPP 2003, Paris, France HLPP 2001, Orl?ans, France ============================================================================== -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From berthold at Mathematik.Uni-Marburg.de Thu Jun 26 08:12:08 2014 From: berthold at Mathematik.Uni-Marburg.de (Jost Berthold) Date: Thu, 26 Jun 2014 10:12:08 +0200 Subject: [Haskell] 2nd call for contributions: Haskell Implementors' Workshop 2014 Message-ID: <53ABD5D8.1030603@mathematik.uni-marburg.de> Dear fellow Haskellers, We are 20 days away from the deadline for HIW 2014. If you have an exciting topic you would like to present, please propose a talk by submitting an abstract (through easychair, see below). Best regards Jost Berthold ==================================================================== Call for Contributions ACM SIGPLAN Haskell Implementors' Workshop http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2014 Gothenburg, Sweden, 06 September, 2014 Co-located with ICFP 2014 http://www.icfpconference.org/icfp2014/ Important dates --------------- Proposal Deadline: Monday, 14 July, 2014 (anywhere on earth) Notification: 21 July 2014 Workshop: Saturday, 6 September 2014 The 6th Haskell Implementors' Workshop is to be held alongside ICFP 2014 this year in Gothenburg. It is a forum for people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure, to share their work and discuss future directions and collaborations with others. Talks and/or demos are proposed by submitting an abstract, and selected by a small program committee. There will be no published proceedings; the workshop will be informal and interactive, with a flexible timetable and plenty of room for ad-hoc discussion, demos, and impromptu short talks. Attendance figures clearly reflect the growth of the Haskell user community and a constant interest in implementation aspects. Scope and target audience ------------------------- It is important to distinguish the Haskell Implementors' Workshop from the Haskell Symposium which is also co-located with ICFP 2014. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors' Workshop will have no proceedings -- although we will aim to make talk videos, slides and presented data available with the consent of the speakers. In the Haskell Implementors' Workshop, we hope to study the underlying technology. We want to bring together anyone interested in the nitty-gritty details behind turning plain-text source code into a deployed product. Having said that, members of the wider Haskell community are more than welcome to attend the workshop -- we need your feedback to keep the Haskell ecosystem thriving. The scope covers any of the following topics. There may be some topics that people feel we've missed, so by all means submit a proposal even if it doesn't fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Talks ----- At this stage we would like to invite proposals from potential speakers for talks and demonstrations. We are aiming for 20 minute talks with 10 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 300 words. Submissions should be made via EasyChair. The website is: https://www.easychair.org/conferences/?conf=hiw2014 If you don't have an account you can create one here: https://www.easychair.org/account/signup.cgi Because the submission is an abstract only, please click the "abstract only" button when you make your submission. There is no need to attach a separate file. We will also have a lightning talks session which will be organised on the day. These talks will be 5-10 minutes, depending on available time. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Organisers ---------- * Jost Berthold (co-chair) (University of Copenhagen) * Kevin Hammond (University of St.Andrews) * Gabriele Keller (University of New South Wales) * Paul Liu (Intel Labs) * Rita Loogen (Philipps-Universitat Marburg) * Geoffrey Mainland (co-chair) (Drexel University, Philadelphia) * Carter Schonwald (WellPosed Ltd) Contact ------- * hiw2014 at easychair.org * Jost Berthold * Geoffrey Mainland From waldmann at imn.htwk-leipzig.de Thu Jun 26 14:21:06 2014 From: waldmann at imn.htwk-leipzig.de (Johannes Waldmann) Date: Thu, 26 Jun 2014 16:21:06 +0200 Subject: [Haskell] 2nd CfP: WFLP 2014 - Workshop on Functional and (Constraint) Logic Programming Message-ID: <53AC2C52.6070607@imn.htwk-leipzig.de> (note: Deadline extended to July 10th) *********************************************************** 23rd International Workshop on Functional and (Constraint) Logic Programming http://www.imn.htwk-leipzig.de/WFLP2014/ colocated with 28th Workshop on (Constraint) Logic Programming (WLP 2014) September 15 - 17, at Leucorea conference center in Lutherstadt Wittenberg, Germany. *********************************************************** Dates: * submission closes: July 10, 2014 * notification: August 4, 2014 * final version due: September 1, 2014 * workshop: September 15 - 17, 2014 *********************************************************** 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, 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. The joint workshop will consist of two tracks (WFLP and WLP). Sessions of these two tracks will be interleaved. ************************************************************ 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. ************************************************************ Program Committee (WFLP track) Elvira Albert, Complutense University of Madrid, Spain Sergio Antoy, Portland State University Mauricio Ayala-Rincon, University of Brasilia, Brazil William Byrd, University of Utah Michael Hanus , Universit?t Kiel, Germany Herbert Kuchen, Universit?t M?nster, Germany Carlos Olarte, DECC, Pontificia Universidad Javeriana Cali, Colombia Janis Voigtl?nder, Universit?t Bonn, Germany Johannes Waldmann (chair), HTWK Leipzig, Germany Peter J. Stuckey, NICTA and the University of Melbourne, Australia Ren? Thiemann, University of Innsbruck, Austria Organising Committee Stefan Brass (chair) Universit?t Halle, Germany -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 246 bytes Desc: OpenPGP digital signature URL: From icfp.publicity at googlemail.com Thu Jun 26 18:55:01 2014 From: icfp.publicity at googlemail.com (David Van Horn) Date: Thu, 26 Jun 2014 14:55:01 -0400 Subject: [Haskell] ICFP 2014 Call for Participation Message-ID: [ Please note that much of the block reservation of hotel rooms currently being held for ICFP participants will be released next week. The beginning of September is a very busy conference week in G?teborg, so there is high pressure on hotel rooms in that period. If you plan to attend ICFP 2014, it would be best to make your hotel reservations now before the block reservation expires. ] ===================================================================== Call for Participation ICFP 2014 19th ACM SIGPLAN International Conference on Functional Programming and affiliated events August 31 - September 6, 2013 Gothenburg, Sweden http://icfpconference.org/icfp2014/ ===================================================================== ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. A full week dedicated to functional programming: 1 conference, 1 symposium, 10 workshops, tutorials, programming contest results, student research competition * Accepted Papers: http://www.icfpconference.org/icfp2014/accepted.html * Local arrangements (including travel and accommodation): http://icfpconference.org/icfp2014/local.html * Registration is available via: https://regmaster4.com/2014conf/ICFP14/register.php Early registration is due 3 August, 2014. * Programming contest, 25-28 July, 2014: http://icfpcontest.org/ * Follow @icfp_conference on twitter for the latest news: http://twitter.com/#!/icfp_conference There are several events affiliated with ICFP: Sunday, August 31 ACM SIGPLAN Workshop on Generic Programming ACM SIGPLAN Workshop on Higher-order Programming with Effects Monday, September 1 ? Wednesday, September 3 ICFP Thursday, September 4 ACM SIGPLAN Commercial Users of Functional Programming: Day 1, Tutorials ACM SIGPLAN Haskell Symposium: Day 1 ACM SIGPLAN Workshop on Functional High-Performance Computing ACM SIGPLAN ML Family Workshop Friday, September 5 ACM SIGPLAN Commercial Users of Functional Programming: Day 2, Tutorials ACM SIGPLAN Haskell Symposium: Day 2 ACM SIGPLAN OCaml Workshop ACM SIGPLAN Erlang Workshop ACM SIGPLAN Workshop on Haskell and Rewriting Techniques Saturday, September 6 ACM SIGPLAN Commercial Users of Functional Programming: Day 3, Talks ACM SIGPLAN Haskell Implementors Workshop ACM SIGPLAN Workshop on Functional Art, Music, Modeling and Design Conference Organizers General Chair: Johan Jeuring, Utrecht University Program Chair: Manuel Chakravarty, University of New South Wales Local Arrangements Chair: Bj?rn von Sydow, Chalmers University Industrial Relations Chair: Anil Madhavapeddy, University of Cambridge Workshop Co-Chairs: Tom Schrijvers, Ghent University Sam Tobin-Hochstadt, Indiana University Programming Contest Co-Chairs: Duncan Coutts, Well Typed LLP Nicolas Wu, University of Oxford Student Research Competition Chair: Meng Wang, Chalmers University Publicity Chair: David Van Horn, University of Maryland Video Chair: Iavor Diatchki, Galois Malcolm Wallace, Standard Chartered Bank Industrial partners: Platinum partners Jane Street Capital Gold partners Google Microsoft Research Mozilla Oracle Labs Standard Chartered Bank Silver partners Bloomberg Credit Suisse CyberPoint Erlang Solutions Facebook Galois Klarna Lexifi Twitter Bronze partners IntelliFactory Opera Software QuviQ ===================================================================== From nick722 at gmail.com Fri Jun 27 20:24:03 2014 From: nick722 at gmail.com (Nick Shukla) Date: Fri, 27 Jun 2014 16:24:03 -0400 Subject: [Haskell] I've just published an introductory book on Haskell Data Analysis Message-ID: Dear Haskell hackers, I've just published an introductory book on *Haskell Data Analysis* . This book is not only a *learning tool* for the Haskell programing language, but also an introduction to simple *data analysis practices*. Use it as a Swiss Army Knife of *algorithms* and *code-snippets*. Try a recipe a day, like a kata for your mind. Breeze through the book for creative inspiration from catalytic *examples*. And most importantly, dive deep into the province of data analysis and machine learning in Haskell. Join the discussion on Reddit and HackerNews . If you have questions, please feel free to ask me. *Book website:* http://haskelldata.com Regards, Nishant Shukla -------------- next part -------------- An HTML attachment was scrubbed... URL: From fa-ml at ariis.it Sat Jun 28 04:34:19 2014 From: fa-ml at ariis.it (Francesco Ariis) Date: Sat, 28 Jun 2014 06:34:19 +0200 Subject: [Haskell] I've just published an introductory book on Haskell Data Analysis In-Reply-To: References: Message-ID: <20140628043419.GA31609@x60s.casa> On Fri, Jun 27, 2014 at 04:24:03PM -0400, Nick Shukla wrote: > I've just published an introductory book on *Haskell Data Analysis* > . Git repo seems interesting enough and I really appreciate DRM-free options, bought a few minutes ago! From Henrik.Nilsson at nottingham.ac.uk Mon Jun 30 11:11:22 2014 From: Henrik.Nilsson at nottingham.ac.uk (Henrik Nilsson) Date: Mon, 30 Jun 2014 12:11:22 +0100 Subject: [Haskell] FARM 2014 Call for Participation Message-ID: <53B145DA.8000803@nottingham.ac.uk> Dear Haskell interested, Please find enclosed the call for participation in FARM 2014: 2nd ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design, co-located with ICFP 2014v in Gothenburg, September. All the best, /Henrik ---------- FARM 2014 2nd ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design Gothenburg, Sweden; 6 September, 2014 http://functional-art.org/2014/ The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) gathers together people who are harnessing functional techniques in the pursuit of creativity and expression. Functional Programming has emerged as a mainstream software development paradigm, and its artistic and creative use is booming. A growing number of software toolkits, frameworks and environments for art, music and design now employ functional programming languages and techniques. FARM is a forum for exploration and critical evaluation of these developments, for example to consider potential benefits of greater consistency, tersity, and closer mapping to a problem domain. Registration ------------ You can register via the ICFP 2014 registration: https://regmaster4.com/2014conf/ICFP14/register.php Don't be confused that it says ???ICFP??? - FARM is part of a larger event around ICFP 2014, and you can register for FARM without registering for ICFP. Early registration deadline is 3 August. Accepted papers --------------- Functional Generation of Harmony and Melody. Jos?? Pedro Magalh??es, Department of Computer Science, University of Oxford; Hendrik Vincent Koops, Department of Information and Computing Sciences, Utrecht University. Exploring melody space in a live context using declarative functional programming. Thomas Kristensen, uSwitch Ltd. Making programming languages to dance to: Live Coding with Tidal. Alex McLean, Temporal semantics for a live coding language. Sam Aaron, Computer Laboratory, University of Cambridge; Dominic Orchard, Computer Laboratory, University of Cambridge; Alan Blackwell, Computer Laboratory, University of Cambridge. Tiled Polymorphic Temporal Media. Paul Hudak, Yale University; David Janin, LaBRI, Universit?? de Bordeaux. LiveCodeLab 2.0 and its language LiveCodeLang. Davide Della Casa, LiveCodeLab; Guy John, LiveCodeLab. Accepted demonstrations ----------------------- littleBits Synth Kit as a livecoded, functional, monadic, physically-embodied, domain specific programming language. James Noble, Victoria University of Wellington; Timothy Jones, Victoria University of Wellington. Scripthica: a web environment for collective algorithmic composition. Gabriel Sanchez, New York University. Music Suite: A Family of Musical Representations. Hans H??glund. Patterning: Repetitive and recursive pattern generation using Clojure and Quil. Phil Jones, Alchemy Islands. Using Haskell as DSL for controlling immersive media experiences. Henrik B????rnhielm, Integral Systems Engineering; Mikael Vejdemo-Johansson, KTH Royal Institute of Technology; Daniel Sundstr??m, Integral Systems Engineering. Sound and Soundness ??? Practical Total Functional Data-Flow Programming. Baltasar Tranc??n Y Widemann, TU Ilmenau; Markus Lepper, semantics GmbH. Live Performances ----------------- On the evening of September 6 (after the workshop) we will have an evening of live performances at 3:e V??ningen (3rd floor) (http://www.3vaningen.se/), in collaboration with with Anders Carlsson aka goto80 and Palle Dahlstedt, starting at 8PM. The evening will feature: - Sam Aaron with Dominic Orchard with Sonic Pi - LiveCodeLab - James Noble with Classic computer science algorithms assembled into algorave Details to be announced soon. Workshop Organisation --------------------- Workshop Chair: Alex McLean, School of Music, University of Leeds Program Chair: Henrik Nilsson, University of Nottingham Publicity Chair: Michael Sperber, Active Group GmbH Program Committee ----------------- - Sam Aaron, Cambridge University - David Duke, University of Leeds - Kathleen Fisher, Tufts University - Julie Greensmith, University of Nottingham - Bas de Haas, Universiteit Utrecht - Paul Hudak, Yale University - David Janin, Universit?? de Bordeaux - Richard Lewis, Goldsmiths, University of London - Louis Mandel, Coll??ge de France - Carin Meier, Neo Innovation Inc - Rob Myers, Furtherfield - Dan Piponi, Google Inc - Andrew Sorensen, Queensland University of Technology -- Henrik Nilsson School of Computer Science The University of Nottingham nhn at cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From apfelmus at quantentunnel.de Mon Jun 30 17:24:18 2014 From: apfelmus at quantentunnel.de (Heinrich Apfelmus) Date: Mon, 30 Jun 2014 19:24:18 +0200 Subject: [Haskell] I've just published an introductory book on Haskell Data Analysis In-Reply-To: References: Message-ID: Nick Shukla wrote: > Dear Haskell hackers, > > I've just published an introductory book on *Haskell Data Analysis* > . > > This book is not only a *learning tool* for the Haskell programing > language, but also an introduction to simple *data analysis practices*. Use > it as a Swiss Army Knife of *algorithms* and *code-snippets*. Try a recipe > a day, like a kata for your mind. Breeze through the book for creative > inspiration from catalytic *examples*. And most importantly, dive deep into > the province of data analysis and machine learning in Haskell. > > Join the discussion on Reddit > > and HackerNews . I cannot comment on the quality of this particular book, but I would like to remark that in general, the publisher, Packt, has a reputation for favoring quantity over quality. In 2012, Packt has contacted me several times, asking whether I would be willing to write a book "Haskell Financial Data Modeling and Predictive Analytics" (an offer later taken up by Pavel Ryzhov). Quote: We have a new Mini book about 90-100 pages on Haskell financial data modelling and predictive analysis, and we are looking for authors with the right expertise. I came across your blog* , and I thought it would be great to have you as an author for this book. Your expertise in the subject is impressive and having you as our author would be a pleasure. The word "blog" was hyperlinked to a blog post of mine [1] which has absolutely nothing to do with finance or data analysis. I don't know how, on the basis of this evidence, Packt came to the conclusion that I would have any expertise in "Haskell financial data modelling and predictive analysis". I'm not even sure what the title means, because I have trouble type checking the grammar. [1]: http://apfelmus.nfshost.com/blog/2012/10/31-frp-ji.html Further discussion on the general quality of Packt publications: [2]: https://news.ycombinator.com/item?id=6933716 Again, this may not apply to the particular book advertised here. Best regards, Heinrich Apfelmus -- http://apfelmus.nfshost.com