From jv at informatik.uni-bonn.de Mon Aug 1 14:23:35 2016 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Mon, 1 Aug 2016 16:23:35 +0200 Subject: [Haskell] Call for Participation: WFLP 2016 and co-located events Message-ID: 24th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2016) https://wflp2016.github.io/ September 13-14, part of the Leipzig Week of Declarative Programming (L-DEC 2016) Registration is now open, see: http://nfa.imn.htwk-leipzig.de/LDEC2016/registration/ Note the package prices combining co-located events, and the early registration deadline of August 15 (bank transfer must have been received by that date to secure the reduced fee). A highlight at WFLP will be an invited talk by Anthony Anjorin. *********************************************************** The international workshops on functional and (constraint) logic programming aim at bringing together researchers, students, and practitioners interested in functional programming, logic programming, and their integration. This year the workshop is co-located with * WLP 2016, September 12-13 and * HaL 2016, September 14-15 in order to promote the cross-fertilizing exchange of ideas and experiences among and between the communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. Combined, the three workshops offer two invited talks, an invited musical performance, and more than 25 contributed talks and tutorials. The lists of presentations can be found at: * http://nfa.imn.htwk-leipzig.de/WLP2016/WLP16accepted.html * https://wflp2016.github.io/accepted.html * http://hal2016.haskell.org/#program and the layout of the overall programme at http://nfa.imn.htwk-leipzig.de/LDEC2016/program/ From storm at cwi.nl Mon Aug 1 22:30:03 2016 From: storm at cwi.nl (Tijs van der Storm) Date: Mon, 01 Aug 2016 22:30:03 +0000 Subject: [Haskell] SPLASH'16 Final CFP: Workshops, SPLASH-E, SRC, PLMW Message-ID: ################################################# ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'16) ################################################# Amsterdam, The Netherlands Sun 30th October - Fri 4th November , 2016 http://2016.splashcon.org https://twitter.com/splashcon https://www.facebook.com/SPLASHCon/ Keynotes: Benjamin Pierce and Andy Ko Sponsored by ACM SIGPLAN Combined Call for Contributions to Collocated Events: - SPLASH-E, Student Research Competition, Programming Languages Mentoring Workshop - Workshops: AGERE, DSLDI, DSM, FOSD, ITSLE, LWC at SLE, META, MOBILE!, NOOL, PLATEAU, Parsing at SLE, REBLS, SA-MDE, SEPS, VMIL, WODA The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction, to make it the premier conference at the intersection of programming, languages, systems, and software engineering. SPLASH'16 hosts a record number collocated tracks and events, from associated conferences (GPCE, SLE) and symposia (DLS, Scala), to 16 workshops! Please see below about important dates. We look forward to your submissions! SPLASH'16 Tracks =========================== ## SPLASH-E: Foundational Concepts of Computation SPLASH-E will be a one-day working meeting, with the following goals: - Building on prior work, identify and enumerate the foundational concepts of computation. - More ambitiously, for each concept, create a detailed plan for a lesson (or short sequence of lessons) for 8 year olds, to teach the concept. We do not solicit publications, but we ask prospective participants to submit a one-paragraph position statement. Website: http://2016.splashcon.org/track/splash-2016-splash-e ## Student Research Competition Continuing the successes of previous years, SPLASH is again hosting an ACM SIGPLAN Student Research Competition (ACM SRC). The competition is an internationally-recognized venue that enables undergraduate and graduate students to experience the research world and to share their research results with other students and SPLASH attendees. The competition has separate categories for undergraduate and graduate students and awards prizes to the top three students in each category. The ACM SIGPLAN Student Research Competition shares the Poster session’s goal to facilitate interaction with researchers and industry practitioners, providing both sides with the opportunity to learn of ongoing, current research. Additionally, the Student Research Competition gives students experience with both formal presentations and evaluations. Submission deadline: Mon 15 Aug 2016 Website: http://2016.splashcon.org/track/splash-2016-src ## PLMW: Programming Language Mentoring Workshop The purpose of Programming Languages Mentoring Workshop (PLMW) is to give promising students who consider pursuing a graduate degree in this field an overview of what research in this field looks like and how to get into and succeed in graduate school. In other words, a combination whirlwind tour of this research area, networking opportunity, and how-to-succeed guide. The program of PLMW will include talks by prominent researchers of the field of programming languages and software engineering providing an insight in their research. To learn more about PLMW, please see the SIGPLAN PLMW web page (http://www.sigplan.org/Conferences/PLMW/). Application deadline: Sun 14 Aug 2016 Website: http://2016.splashcon.org/track/splash-2016-plmw Workshops ========= SPLASH'16 will host a record number of 16 workshops: ## AGERE! Programming based on Actors, Agents, and Decentralized Control The AGERE! workshop is aimed at focusing on programming systems, languages and applications based on actors, active/concurrent objects, agents and – more generally – high-level programming paradigms promoting a mindset of decentralized control in solving problems and developing software. The workshop is designed to cover both the theory and the practice of design and programming, bringing together researchers working on models, languages and technologies, and practitioners developing real-world systems and applications. Abstract submission deadline: Mon 8 Aug 2016 (EXTENDED) Paper submission deadline: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/agere2016 ## DSLDI: Domain-specific Language Design and Implementation Domain-Specific Language Design and Implementation (DSLDI) is a workshop intended to bring together researchers and practitioners interested in discussing how DSLs should be designed, implemented, supported by tools, and applied in realistic contexts. The focus of the workshop is on all aspects of this process, from soliciting domain knowledge from experts, through the design and implementation of the language, to evaluating whether and how a DSL is successful. More generally, we are interested in continuing to build a community that can drive forward the development of modern DSLs. Submission deadline talk proposals: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/dsldi2016 ## DSM: Domain-Specific Modeling Domain-specific languages provide a viable and time-tested solution for continuing to raise the level of abstraction, and thus productivity, beyond coding, making systems development faster and easier. When accompanied with suitable automated modeling tools and generators it delivers to the promises of continuous delivery and devops. In domain-specific modeling (DSM) the models are constructed using concepts that represent things in the application domain, not concepts of a given programming language. The modeling language follows the domain abstractions and semantics, allowing developers to perceive them- selves as working directly with domain concepts. Together with frameworks and platforms, DSM can automate a large portion of software production. Submission deadline: Mon 15 Aug 2016 Website: http://2016.splashcon.org/track/dsm2016 ## FOSD: Feature-oriented Software Development Feature orientation is an emerging paradigm of software development. It supports the automatic generation of large-scale software systems from a set of units of functionality, called features. The key idea of feature-oriented software development (FOSD) is to explicitly represent similarities and differences of a family of software systems for a given application domain (e.g., database systems, banking software, text processing systems) with the goal of reusing software artifacts among the family members. Submission deadline: Mon 15 Aug 2016 (EXTENDED) Website: http://www.fosd.net/workshop2016 Call for papers: http://conf.researchr.org/getImage/FOSD-2016/orig/FOSD+2016+-+CFP.pdf ## ITSLE: Industry Track Software Language Engineering Industry Track for Software Language Engineering (ITSLE) is a workshop to bring together practitioners and researchers from industry and academia working on the area of software language engineering. Domain Specific Languages (DSLs) and Model-Driven Software Engineering (MDSE) techniques are being developed and used broadly in industry. However, as the size and complexity of software systems steadily increase, so does the cost of maintaining and improving the DSL and MDSE techniques and tools. It introduces new challenges such as language co-evolution, maintainability of legacy software using older version of DSLs and MDSE techniques, and extendability and scalability of these techniques. Some of these challenges have been addressed by the SLE research community and some remain unsolved. Submission deadline: Mon 8 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/itsle2016 ## LWC at SLE: Language Workbench Challenge Language workbenches are tools for software language engineering. They distinguish themselves from traditional compiler tools by providing integrated development environment (IDE) support for defining, implementing, testing and maintaining languages. Not only that, languages built with a language workbench are supported by IDE features as well (e.g., syntax highlighting, outlining, reference resolving, completion etc.). As a result, language workbenches achieve a next level in terms of productivity and interactive editor support for building languages, in comparison to traditional batch-oriented, compiler construction tools. The goal of this workshop is twofold. First: exercise and assess the state-of-the-art in language workbenches using challenge problems from the user perspective (i.e. the language designer). Second: foster knowledge exchange and opportunities for collaboration between language workbench implementors and researchers. Submission deadline of solutions: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/lwc2016 ## META The Meta’16 workshop aims to bring together researchers working on metaprogramming and reflection, as well as users building applications, language extensions such as contracts, or software tools. With the changing hardware and software landscape, and increased heterogeneity of systems, metaprogramming becomes an important research topic to handle the associate complexity once more. Contributions to the workshop are welcome on a wide range of topics related to design, implementation, and application of metaprogramming techniques, as well as empirical studies on and typing for such systems and languages. Abstract submission: Mon 8 Aug 2016 (EXTENDED) Paper submission: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/meta2016 ## Mobile! Mobile application use and development is experiencing enormous growth, and by 2016 more than 200 billion apps have been downloaded. The mobile domain presents new challenges to software engineering. Mobile platforms are rapidly changing, with diverse capabilities including various input modes, wireless communication types, on-device memory and disk capacities, and sensors. Applications function on wide ranges of platforms, requiring scaling according to hardware. Many applications interact with third-party services, requiring application development with effective security and authorization processes for those dataflows. “Bring your own device” policies pose security challenges including employer and employee data privacy. Developing secure mobile applications requires new tools and practices such as improved refactoring tools for hybrid applications; polyglot applications; and testing techniques for multiple devices. This workshop aims to establish a community of researchers and practitioners, leading to further research in mobile development. Paper submission deadline: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/mobile2016 ## NOOL: New Object-Oriented Languages NOOL-16 is a new unsponsored workshop to bring together users and implementors of new(ish) object oriented systems. Through presentations, and panel discussions, as well as demonstrations, and video and audiotapes, NOOL-16 will provide a forum for sharing experience and knowledge among experts and novices alike. We invite technical papers, case studies, and surveys in the following areas, related to theory of object oriented programming, new languages, implementation of languages, tools and environment, applications and related work. Abstract submission deadline: Thu 1 Sep 2016 Website: http://2016.splashcon.org/track/nool2016 ## PLATEAU: Workshop on Evaluation and Usability of Programming Languages and Tools Programming languages exist to enable programmers to develop software effectively. But how efficiently programmers can write software depends on the usability of the languages and tools that they develop with. The aim of this workshop is to discuss methods, metrics and techniques for evaluating the usability of languages and language tools. The supposed benefits of such languages and tools cover a large space, including making programs easier to read, write, and maintain; allowing programmers to write more flexible and powerful programs; and restricting programs to make them more safe and secure. PLATEAU gathers the intersection of researchers in the programming language, programming tool, and human-computer interaction communities to share their research and discuss the future of evaluation and usability of programming languages and tools. Paper submission deadline: Thu 11 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/plateau2016 ## Parsing at SLE Parsing at SLE 2016 is the fourth annual workshop on parsing programming languages. The intended participants are the authors of parser generation tools and parsers for programming languages and other software languages. For the purpose of this workshop “parsing” is a computation that takes a sequence of characters as input and produces a syntax tree or graph as output. This possibly includes tokenization using regular expressions, deriving trees using context-free grammars, and mapping to abstract syntax trees. The goal is to bring together today’s experts in the field of parsing, in order to explore open questions and possibly forge new collaborations. The topics may include algorithms, implementation and generation techniques, syntax and semantics of meta formalisms (BNF), etc. We expect to attract participants that have been or are developing theory, techniques and tools in the broad area of parsing. Abstract submission deadline: Fri 9 Sep 2016 Website: http://2016.splashcon.org/track/parsing2016 ## REBLS: Reactive and Event-based Languages & Systems Reactive programming and event-based programming are two closely related programming styles that are becoming ever more important with the advent of advanced HPC technology and the ever increasing requirement for our applications to run on the web or on collaborating mobile devices. A number of publications on middleware and language design — so-called reactive and event-based languages and systems (REBLS) — have already seen the light, but the field still raises several questions. For example, the interaction with mainstream language concepts is poorly understood, implementation technology is in its infancy and modularity mechanisms are almost totally lacking. Moreover, large applications are still to be developed and patterns and tools for developing reactive applications is an area that is vastly unexplored. Paper submission deadline: Thu 11 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/rebls2016 ## SA-MDE: Tutorial on MDD with Model Catalogue and Semantic Booster With the model-driven development (MDD) approach to software, rather than building each system from scratch, one specifies a metamodel covering a whole class of similar systems, provides a universal generator to transform metamodel instances into executable programs, and specifies each system by a higher-level model conforming to the metamodel. When the application domain concerns semantically rich datasets—with structured entities, interlinked data, and sophisticated integrity constraints—then the MDD tools should support this richness: in the metamodel, in individual system models, and in the generation process. In this tutorial, we present the Model Catalogue and Semantic Booster, tools respectively for curating and exploiting semantically rich data in a MDD workflow, which are under development as part of ALIGNED. Participants will learn what the tools can do, gain hands-on experience with using them, and be able to contribute challenges and suggestions for future development. Website: http://2016.splashcon.org/track/samde2016 ## SEPS: Software Engineering for Parallel Systems This workshop provides a stable forum for researchers and practitioners dealing with compelling challenges of the software development life cycle on modern parallel platforms. The increased complexity of parallel applications on modern parallel platforms (e.g. multicore/manycore, distributed or hybrid) requires more insight into development processes, and necessitates the use of advanced methods and techniques supporting developers in creating parallel applications or parallelizing and re-engineering sequential legacy applications. We aim to advance the state of the art in different phases of parallel software development, covering software engineering aspects such as requirements engineering and software specification; design and implementation; program analysis, profiling and tuning; testing and debugging. Paper submission deadline: Mon 15 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/seps2016 ## VMIL: Virtual Machines and Intermediate Languages The VMIL workshop is a forum for research in virtual machines and intermediate languages. It is dedicated to identifying programming mechanisms and constructs that are currently realized as code transformations or implemented in libraries but should rather be supported at VM level. Candidates for such mechanisms and constructs include modularity mechanisms (aspects, context-dependent layers), concurrency (threads and locking, actors, capsules, processes, software transactional memory), transactions, development tools (profilers, runtime verification), etc. Topics of interest include the investigation of which such mechanisms are worthwhile candidates for integration with the run-time environment, how said mechanisms can be elegantly (and reusably) expressed at the intermediate language level (e.g., in bytecode), how their implementations can be optimized, and how virtual machine architectures might be shaped to facilitate such implementation efforts. Paper submission deadline: Mon 8 Aug 2016 (EXTENDED) Website: http://2016.splashcon.org/track/vmil2016 ## WODA: Workshop on Dynamic Analysis The International Workshop on Dynamic Analysis (WODA) is the place where researchers interested in dynamic analysis and related topics can meet and discuss current research, issues, and trends in the field. WODA exists since 2003 and has been co-located with several different SE/PL conferences in the past, including ICSE, ISSTA, ASPLOS, and SPLASH. See https://sites.google.com/site/scwoda/ for the history of WODA. The 2016 edition of WODA will be a mix of invited talks by high-visibility researchers in the community and presentations of submitted workshop papers. Submission deadline: Fri 19 Aug 2016 Website: http://2016.splashcon.org/track/woda2016 # SPLASH Supporters SPLASH'16 is kindly supported by the following organizations: - ACM: http://www.acm.org/ - SIGPLAN: http://www.sigplan.org/ - LogicBlox (Gold): http://www.logicblox.com/ - Oracle (Silver): http://www.oracle.com/index.html - TU Delft (Silver): http://tudelft.nl/ - Huawei (Bronze): http://www.huawei.com/en/ - Facebook (Bronze): https://research.facebook.com/ - IBM Research (Bronze): http://www.research.ibm.com/ - Google (Bronze): https://www.google.com - Itemis (Bronze): https://www.itemis.com/en/ Want to support SPLASH'16? See our options here: http://2016.splashcon.org/attending/support-program. -------------- next part -------------- An HTML attachment was scrubbed... URL: From gvidal at dsic.upv.es Tue Aug 2 08:51:16 2016 From: gvidal at dsic.upv.es (German Vidal) Date: Tue, 2 Aug 2016 10:51:16 +0200 Subject: [Haskell] Last Call for Participation: PPDP 2016 - 18th International Symposium on Principles and Practice of Declarative Programming Message-ID: <74D76972-7182-4553-ACD2-7B87074BCAC1@dsic.upv.es> ============================================================ LAST CALL FOR PARTICIPATION: PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming Edinburgh, UK, September 5-7, 2016 http://ppdp16.webs.upv.es/ co-located with LOPSTR 2016 26th International Symposium on Logic-Based Program Synthesis and Transformation Edinburgh, UK, September 6-8, 2016 http://www.cliplab.org/Conferences/LOPSTR16/ and SAS 2016 23rd Static Analysis Symposium Edinburgh, UK, September 8-10, 2016 http://staticanalysis.org/sas2016/ ============================================================ Registration is open at: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ ** EARLY REGISTRATION UNTIL AUGUST 15 ** VISA Please check here: https://www.gov.uk/check-uk-visa whether you require a visa to visit the UK. This can take 6-8 weeks. If so, please contact James Cheney as soon as possible to obtain a visa support letter. INVITED TALKS * Elvira Albert: Testing of Concurrent and Imperative Software using CLP * Greg Morrisett (jointly with LOPSTR'16): Challenges in Compiling Coq * Francesco Logozzo (jointly with LOPSTR'16): Abstract interpretation for taint analysis at scale ACCEPTED PAPERS - Davide Fusca, Stefano Germano, Jessica Zangari, Marco Anastasio, Francesco Calimeri and Simona Perri. A Framework for Easing the Development of Applications Embedding Answer Set Programming - Dimitrios Kouzapas, Ornela Dardha, Roly Perera and Simon Gay. Typechecking Protocols with Mungo and StMungo - Joaquin Arias Herrero and Manuel Carro. Description and Evaluation of a Generic Design to Integrate CLP and Tabled Execution - Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo. Reducing the Overhead of Runtime Checks via Static Analysis - Takahiro Nagao and Naoki Nishida. Proving Inductive Validity of Constrained Inequalities - Vincenzo Mastandrea, Elena Giachino, Ludovic Henrio and Cosimo Laneve. Actors may synchronize, safely! - Frederic Mesnard, Etienne Payet and Wim Vanhoof. Towards a Framework for Algorithm Recognition in Binary Code - Jan Midtgaard, Flemming Nielson and Hanne Riis Nielson. Iterated Process Analysis over Lattice-Valued Regular Expressions - Nick Benton, Martin Hofmann and Vivek Nigam. Effect-Dependent Transformations for Concurrent Programs - Manfred Schmidt-Schauss and David Sabel. Unification of Program Expressions with Recursive Bindings - Stefan Fehrenbach and James Cheney. Language-integrated provenance - Clara Bertolissi, Jean-Marc Talbot and Didier Villevalois. Analysis of Access Control Policy Updates through Narrowing - Sylvia Grewe, Sebastian Erdweg, Michael Raulf and Mira Mezini. Exploration of Language Specifications by Compilation to First-Order Logic - Angelos Charalambidis, Panos Rondogiannis and Antonis Troumpoukis. Higher-Order Logic Programming: an Expressive Language for Representing Qualitative Preferences - Thomas Ehrhard and Giulio Guerrieri. The bang calculus: an untyped lambda-calculus generalizing Call-By-Name and Call-By-Value - Fan Yang, Santiago Escobar, Catherine Meadows, Jose Meseguer and Sonia Santiago. Strand Spaces with Choice via a Process Algebra Semantics - Yanhong A. Liu, Jon Brandvein, Scott Stoller and Bo Lin. Demand-Driven Incremental Object Queries Hope to see you in Edinburgh! From breitner at kit.edu Tue Aug 2 12:17:09 2016 From: breitner at kit.edu (Joachim Breitner) Date: Tue, 02 Aug 2016 08:17:09 -0400 Subject: [Haskell] Haskell in Leipzig 2016: Call for Participation Message-ID: <1470140229.3408.30.camel@kit.edu>                              Haskell in Leipzig                             September 14-15, 2016                             HTKW Leipzig, Germany                          http://hal2016.haskell.org/ We have received many interesting submissions for HAL and were able to assemble a great program, which you can find here: http://hal2016.haskell.org/program.html Abstracts and final schedule will be added soonish™. As you can see, we have an interesting program spanning from practical, real-word uses of Haskell over data structures and libraries to game- and music programming. Besides the 12 talks, there are three tutorials to attend. As a special treat, on the evening of September 14, Anton Kholomiov will give a live music coding performance! If you are interested in attending, please head over to  http://nfa.imn.htwk-leipzig.de/LDEC2016/registration/ and follow the instructions. HAL is cheap, and even cheaper for students, and yet cheaper if you pay by the early registration deadline of August 15¹ Also check out the other two conferences of LDEC (WLP and WLFP), and if you like them, make it a week full of functional programming! Thanks, Joachim Breitner on behalf of the program committee ¹ Note that the early registration deadline is for the money, so make    sure you allow for the bank to transfer it in time. -- Dr. rer. nat. Joachim Breitner Wissenschaftlicher Mitarbeiter http://pp.ipd.kit.edu/~breitner -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 819 bytes Desc: This is a digitally signed message part URL: From harendra.kumar at gmail.com Thu Aug 4 02:00:43 2016 From: harendra.kumar at gmail.com (Harendra Kumar) Date: Thu, 4 Aug 2016 07:30:43 +0530 Subject: [Haskell] ANN: unicode-transforms-0.1.0.1 (unicode normalization) Message-ID: This is for those who want unicode normalization but do not want a dependency on the heavyweight icu libraries. It has the same API as the text-icu package. It is based on the utf8proc C implementation. https://hackage.haskell.org/package/unicode-transforms https://github.com/harendra-kumar/unicode-transforms A pure Haskell implementation is a work in progress, it works for the NFD normalization form as of now. I could make it perform better than the current utf8proc C implementation and it even beats the ICU implementation in one of the benchmarks. I intend to finish it when I find time to work on it again. Contributions are welcome! -harendra -------------- next part -------------- An HTML attachment was scrubbed... URL: From kameyama at acm.org Thu Aug 4 02:05:57 2016 From: kameyama at acm.org (Yukiyoshi Kameyama) Date: Thu, 04 Aug 2016 11:05:57 +0900 (JST) Subject: [Haskell] FHPC 2016; CALL FOR PARTICIPATION Message-ID: <20160804.110557.372609773.kam@cs.tsukuba.ac.jp> ====================================================================== CALL FOR PARTICIPATION FHPC 2016 The 5th ACM SIGPLAN Workshop on Functional High-Performance Computing Nara, Japan September 22, 2016 https://sites.google.com/site/fhpcworkshops/ Co-located with the International Conference on Functional Programming (ICFP 2016) ====================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where high performance is essential. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as maintainable and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. Registration: ============= Registration for FHPC should be done using the ICFP 2016 page at: http://conf.researchr.org/attending/icfp-2016/Registration Click the button for FHPC in the Thursday (Sep. 22) activities. Early registration deadline is August 17. Invited Speaker: ================ Akimasa Morihata University of Tokyo, Japan Workshop Program (tentative) ============================ THURSDAY September 22, 2016 9:15--10:15 Invited Talk From identification of parallelizability to derivation of parallelizable codes Akimasa Morihata 10:35--11:25 DSLs Icicle: write once, run once Amos Robinson, Ben Lippmeier Using Fusion to Enable Late Design Decisions for Pipelined Computations Máté Karácsony, Koen Claessen 11:45--12:35 Code Generation Automatic generation of efficient codes from mathematical descriptions of stencil computation Takayuki Muranushi, Seiya Nishizawa, Hirofumi Tomita, Keigo Nitadori, Masaki Iwasawa, Yutaka Maruyama, Hisashi Yashiro, Yoshifumi Nakamura, Hideyuki Hotta, Junichiro Makino, Natsuki Hosono, Hikaru Inoue JIT Costing Adaptive Skeletons for Performance Portability Patrick Maier, John Magnus Morton, Phil Trinder 14:00--14:50 GPUs Low-level functional GPU programming for parallel algorithms Martin Dybdal, Martin Elsman, Bo Joel Svensson, Mary Sheeran APL on GPUs - A TAIL from the Past, Scribbled in Futhark Troels Henriksen, Martin Dybdal, Henrik Urms, Anna Sofie Kiehn, Daniel Gavin, Hjalte Abelskov, Martin Elsman, Cosmin Oancea 15:20--16:10 Streaming and Dataflow Streaming Nested Data Parallelism on Multicores Frederik Meisner Madsen, Andrzej Filinski Polarised Data Parallel Data Flow Ben Lippmeier, Fil Mackay, Amos Robinson 16:40--17:05 Graph processing s6raph: Vertex-centric Graph Processing Framework with Functional Interface Onofre Coll Ruiz, Kiminori Matsuzaki, Shigeyuki Sato 17:05--17:30 Discussion Program Committee ================== David Duke (co-chair) University of Leeds, UK Yukiyoshi Kameyama (co-chair) University of Tsukuba, Japan Baris Aktemur Özyeğin University, Turkey Marco Aldinucci University of Touring, Italy Jost Berthold Commonwealth Bank, Australia Kei Davis Los Alamos National Laboratory, USA Kento Emoto Kyushu Institute of Technology, Japan Zhenjiang Hu National Institute of Informatics, Japan Ben Lippmeier University of New South Wales, Australia Rita Loogen University of Marburg, Germany Geoffrey Mainland Drexel University, USA Mike Rainey INRIA, France Mary Sheeran Chalmers University of Technology, Sweden Satnam Singh Facebook, UK From walkiner at eecs.oregonstate.edu Fri Aug 5 00:03:02 2016 From: walkiner at eecs.oregonstate.edu (Eric Walkingshaw) Date: Thu, 4 Aug 2016 17:03:02 -0700 Subject: [Haskell] DSLDI 2016: Final Call for Talk Proposals (Extended Deadline) Message-ID: ********************************************************************* FINAL CALL FOR TALK PROPOSALS DSLDI 2016 Fourth Workshop on Domain-Specific Language Design and Implementation October 31, 2016 Amsterdam, Netherlands Co-located with SPLASH http://2016.splashcon.org/track/dsldi2016 https://twitter.com/wsdsldi ********************************************************************* Deadline for talk proposals: August 15, 2016 (extended!) *** Workshop Goal *** Well-designed and implemented domain-specific languages (DSLs) can achieve both usability and performance benefits over general-purpose programming languages. By raising the level of abstraction and exploiting domain knowledge, DSLs can make programming more accessible, increase programmer productivity, and support domain-specific optimizations. The goal of the DSLDI workshop is to bring together researchers and practitioners interested in discussing how DSLs should be designed, implemented, supported by tools, and applied in realistic contexts. The focus of the workshop is on all aspects of this process, from soliciting domain knowledge from experts, through the design and implementation of the language, to evaluating whether and how a DSL is successful. More generally, we are interested in continuing to build a community that can drive forward the development of modern DSLs. An additional goal of this year's workshop is to encourage discussion about the usability of DSLs, and to establish connections with researchers in related areas, such as end-user software engineering, who have studied human factors of programming languages and tools. *** Workshop Format *** DSLDI is a single-day workshop and will consist of moderated audience discussions structured around a series of talks. The role of the talks is to facilitate interesting and substantive discussion. Therefore, we welcome and encourage talks that express strong opinions, describe open problems, propose new research directions, and report on early research in progress. Proposed talks should be on topics within DSLDI's area of interest, which include but are not limited to: * solicitation and representation of domain knowledge * DSL design principles and processes * DSL implementation techniques and language workbenches * domain-specific optimizations * human factors of DSLs * tool support for DSL users * community and educational support for DSL users * applications of DSLs to existing and emerging domains * studies of usability, performance, or other benefits of DSLs * experience reports of DSLs deployed in practice *** Call for Submissions *** We solicit talk proposals in the form of short abstracts (max. 2 pages). A good talk proposal describes an interesting position, open problem, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Publication of accepted abstracts and slides on the website is voluntary. * Deadline for talk proposals: August 15, 2016 * Notification: September 5, 2016 * Workshop: October 31, 2016 * Submission website: https://dsldi16.hotcrp.com/ *** Workshop Organization *** Organizers: * Eric Walkingshaw (Oregon State University) * Tijs van der Storm (CWI) Program committee: * Iman Avazpour (Deakin University) * Christopher Bogart (Carnegie Mellon University) * Andy Gill (University of Kansas) * Sylvia Grewe (TU Darmstadt) * Kate Howland (University of Sussex) * Lindsey Kuper (Intel Labs) * Darya Kurilova (Carnegie Mellon University) * Ralf Lämmel (University of Koblenz-Landau) * Tanja Mayerhofer (Vienna University of Technology) * Marjan Mernik (University of Maribor) * Sarah Mount (King's College London) * Justin Pombrio (Brown University) * Tillmann Rendel (University of Tübingen) * Tiark Rompf (Purdue & Oracle Labs) * Sonja Schimmler (Bundeswehr University Munich) * Markus Völter (itemis) * Peng Wu (Huawei America Lab) From sperber at deinprogramm.de Sun Aug 7 19:15:43 2016 From: sperber at deinprogramm.de (Michael Sperber) Date: Sun, 07 Aug 2016 21:15:43 +0200 Subject: [Haskell] Call for Participation: Functional Art, Music, Modelling and Design (September 24, Nara, Japan) Message-ID: 4th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design Nara, Japan September 24, 2016 (co-located with ICFP 2016) http://functional-art.org/2016 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. This year, authors at FARM will present research papers, demos of new tools, and calls for collaboration. The evening will also feature computer music performances of artists integrating functional programming techniques into their work. To register for FARM, visit the ICFP registration page - early registration ends August 17. Some funding support is available for the main ICFP conference and related workshops like FARM. This information can be found on the travel support page. Registration ------------ You can register via the ICFP 2016 registration: http://conf.researchr.org/attending/icfp-2016/Registration Early registration deadline is August 17. Program --------------- 9:15 - 10:15 Bithoven: Gödel Encoding of Chamber Music and Functional 8-Bit Audio Synthesis Jay McCarthy Structured reactive programming with polymorphic temporal tiles David Janin and Simon Archipoff 10:35-11:25 Juniper: A Functional Reactive Programming Language for the Arduino Caleb Helbling and Samuel Guyer Demo: Juniper: A Functional Reactive Programming Language for the Arduino Caleb Helbling and Samuel Guyer 11:45-12:35 Arrp: A Functional Language with Multi-dimensional Signals and Recurrence Equations Jakob Leben Demo: Klangmeister Chris Ford 14:00-14:50 o.OM: Structured-Functional Communication between Computer Music Systems using OSC and Odot Jean Bresson, John MacCallum and Adrian Freed Demo: VoxelCAD, a collaborative voxel-based CAD tool Csongor Kiss and Toby Shaw 16:20-16:10 Call for Collaboration: Algomusicology, ????, Profit Chris Ford Demo: Alda: A text-based music composition language Dave Yarwood 16:40-18:00 A Livecoding Semantics for Functional Reactive Programming Tom E. Murphy Demo: Epimorphism Francis Shuman Live Performances 19:30-21:30 @ Live House Beverly Hills, Nara, Japan Tentative lineup includes: - Akihiro Kubota: Live Coding Cosmic Sound Poetry - Selçuk Artut, Alp Tuğan: RAW - Atsuro Hoshino: Warm Fuzzy Thing - Alexandra Cárdenas (via remote streaming) - Renick Bell Workshop Organisation --------------------- - Workshop Chair: David Janin, University of Bordeaux - Program Chair: Mike Sperber, Active Group GmbH - Publicity Chair: Mark Santolucito, Yale - Performance Chair: Renick Bell Program Committee: --------------------- - Renick Bell (performance chair) - Rebecca Fiebrink, Goldsmiths University of London - David Janin, University of Bordeaux (co-chair) - Akihiro Kubota, Tama Art University - John Lato, Google - José Pedro Magalhães, Standard Chartered Bank and Chordify - Alex McLean, University of Leeds - Dan Piponi, Google - Prabhakar Ragde, University of Waterloo - Mark Santolucito, Yale (publicity chair) - Fabienne Serrière, KnitYak - Michael Sperber, Active Group GmbH (co-chair) - John Stell, University of Leeds From w.s.swierstra at uu.nl Tue Aug 9 12:51:14 2016 From: w.s.swierstra at uu.nl (Wouter Swierstra) Date: Tue, 9 Aug 2016 14:51:14 +0200 Subject: [Haskell] PhD position in computational music structure analysis using functional programming Message-ID: ============================================================== VACANCY : PhD position in computational music structure analysis using functional programming ============================================================== The research group of Software Technology is part of the Software Systems division of in the department of Information and Computer Science at the Utrecht University. We focus our research on functional programming, compiler construction, program analysis, validation, and verification. We are currently advertising a PhD position, together with the Interaction Technology group, to explore the use of functional programming -- and data type generic programming in particular -- to describe and analyze musical structure. This project continues the line of research initiated by Bas de Haas and José Pedro Magalhães, that has lead to several successful publications and a flourishing start-up, Chordify. Besides research, the successful candidate will be expected to help supervise MSc students and assist teaching courses. Candidates must be willing to start before January 2017. --------------------------------- What we are looking for --------------------------------- The ideal candidate should have an MSc in Computer Science, be highly motivated, speak and write English well, and be proficient in producing scientific reports. Furthermore, candidates should be able to demonstrate * experience with functional programming languages, such as Haskell, OCaml, ML, Agda, Idris, or Coq; * an interest in music and musical theory. --------------------------------- What we offer --------------------------------- The candidate is offered a full-time position for four years. A part-time of at least 0.8 fte may also be possible. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. In addition we offer: a pension scheme, partially paid parental leave, and flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. The research group will provide the candidate with necessary support on all aspects of the project. More information is available on the website: Terms and employment: http://bit.ly/1elqpM7 Utrecht is consistently ranked as one of the best places in the world to live: http://bbc.in/2aFS5n1 --------------------------------- In order to apply --------------------------------- To apply please attach a letter of motivation, a curriculum vitae, and (email) addresses of two referees. Make sure to also include a transcript of the courses you have followed (at bachelor and master level), with the grades you obtained, and to include a sample of your scientific writing, such as your master thesis. It is possible to apply for this position if you are close to obtaining your Master's. In that case include a letter of your supervisor with an estimate of your progress, and do not forget to include at least a sample of your technical writing skills. Application closes on September 7th. You can apply through the University's website: http://bit.ly/2abk3pe --------------- Contact --------------- For further information you can direct your inquiries to: Wouter Swierstra e-mail: w.s.swierstra at uu.nl. Anja Volk email: a.volk at uu.nl From pedro.lopez at imdea.org Tue Aug 9 18:27:30 2016 From: pedro.lopez at imdea.org (pedro.lopez) Date: Tue, 09 Aug 2016 20:27:30 +0200 Subject: [Haskell] Call for Participation: LOPSTR 2016 - 26th Intl. Symp. on Logic-Based Program Synthesis and Transformation Message-ID: ============================================================ CALL FOR PARTICIPATION: LOPSTR 2016 26th International Symposium on Logic-Based Program Synthesis and Transformation, Edinburgh, Scotland UK, September 6-8, 2016 http://www.cliplab.org/Conferences/LOPSTR16/ co-located with PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, Scotland UK, September 5-7, 2016 http://ppdp16.webs.upv.es/ and SAS 2016 23rd Static Analysis Symposium, Edinburgh, Scotland UK, September 8-10, 2016 http://staticanalysis.org/sas2016/ ============================================================ Registration is open at: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ ** EARLY REGISTRATION UNTIL AUGUST 15 ** VISA Please check here: https://www.gov.uk/check-uk-visa whether you require a visa to visit the UK. If so, contact us as soon as possible as explained here: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/registration.html Getting a visa can take from 3-6 weeks depending on the nationality and country from which applying. We recommend that anyone considering attending who needs a visa register now and apply now. If you are eventually unable to attend due to visa issues we will refund your registration fee. INVITED TALKS - Greg Morrisett, Cornell University, USA (jointly with PPDP'16): Challenges in Compiling Coq. - Francesco Logozzo, Facebook, USA (jointly with PPDP'16): Abstract interpretation for taint analysis at scale. - Martin Vechev, ETH Zurich, Switzerland (jointly with SAS'16): Learning from Programs: Probabilistic Models, Program Analysis and Synthesis. ACCEPTED PAPERS - Symbolic Abstract Contract Synthesis in a Rewriting Framework. María Alpuente, Daniel Pardo and Alicia Villanueva. - Coinductive Soundness of Corecursive Type Class Resolution. Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond and Peng Fu. - MiniZinc with Strings. Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey and Guido Tack. - On the Completeness of Selective Unification in Concolic Testing of Logic Programs. Fred Mesnard, Etienne Payet and German Vidal. - Verification of Time-Aware Business Processes using Constrained Horn Clauses. Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi and Maurizio Proietti. - Tuning Fuzzy Logic Programs with Symbolic Execution. Gines Moreno, Jaime Penabad and German Vidal. - A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Paul Tarau. - A New Functional-Logic Compiler for Curry: Sprite. Sergio Antoy and Andy Jost. - Towards Reversible Computation in Erlang. Naoki Nishida, Adrian Palacios and German Vidal. - Slicing Concurrent Constraint Programs. Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte and Catuscia Palamidessi. - Scaling Bounded Model Checking By Transforming Programs With Arrays. Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niyas C. - Hierarchical Shape Abstraction of Free-List Memory Allocators. Bin Fang and Mihaela Sighireanu. - A Productivity Checker for Logic Programming. Ekaterina Komendantskaya, Patricia Johann and Martin Möhrmann. - Automata Theory Approach to Predicate Intuitionistic Logic. Maciej Zielenkiewicz and Aleksy Schubert. - Nominal Unification of Higher Order Expressions with Recursive Let. Manfred Schmidt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret. - A Formal, Resource Consumption-Preserving Translation of Actors to Haskell. Elvira Albert, Nikolaos Bezirgiannis, Frank De Boer and Enrique Martin-Martin. - Partial Evaluation of Order-sorted Equational Programs modulo Axioms. María Alpuente, Angel Cuenca, Santiago Escobar and Jose Meseguer. - lpopt: A Rule Optimization Tool for Answer Set Programming. Manuel Bichler, Michael Morak and Stefan Woltran. - CurryCheck: Checking Properties of Curry Programs. Michael Hanus. - Intuitionistic Logic for SQL. Fernando Saenz-Perez. Hope to see you in Edinburgh! Manuel Hermengildo and Pedro Lopez-Garcia LOPSTR 2016 Co-chairs From pedro.lopez at imdea.org Mon Aug 15 07:25:22 2016 From: pedro.lopez at imdea.org (=?UTF-8?B?UGVkcm8gTMOzcGV6IEdhcmPDrWE=?=) Date: Mon, 15 Aug 2016 09:25:22 +0200 Subject: [Haskell] Last Call for Participation: LOPSTR 2016 - 26th Intl. Symp. on Logic-Based Program Synthesis and Transformation Message-ID: ============================================================ LAST CALL FOR PARTICIPATION: LOPSTR 2016 26th International Symposium on Logic-Based Program Synthesis and Transformation, Edinburgh, Scotland UK, September 6-8, 2016 http://www.cliplab.org/Conferences/LOPSTR16/ co-located with PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, Scotland UK, September 5-7, 2016 http://ppdp16.webs.upv.es/ and SAS 2016 23rd Static Analysis Symposium, Edinburgh, Scotland UK, September 8-10, 2016 http://staticanalysis.org/sas2016/ ============================================================ Registration is open at: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ ** EARLY REGISTRATION UNTIL AUGUST 15 ** VISA Please check here: https://www.gov.uk/check-uk-visa whether you require a visa to visit the UK. If so, contact us as soon as possible as explained here: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/registration.html Getting a visa can take from 3-6 weeks depending on the nationality and country from which applying. We recommend that anyone considering attending who needs a visa register now and apply now. If you are eventually unable to attend due to visa issues we will refund your registration fee. INVITED TALKS - Greg Morrisett, Cornell University, USA (jointly with PPDP'16): Challenges in Compiling Coq. - Francesco Logozzo, Facebook, USA (jointly with PPDP'16): Abstract interpretation for taint analysis at scale. - Martin Vechev, ETH Zurich, Switzerland (jointly with SAS'16): Learning from Programs: Probabilistic Models, Program Analysis and Synthesis. ACCEPTED PAPERS - Symbolic Abstract Contract Synthesis in a Rewriting Framework. María Alpuente, Daniel Pardo and Alicia Villanueva. - Coinductive Soundness of Corecursive Type Class Resolution. Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond and Peng Fu. - MiniZinc with Strings. Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey and Guido Tack. - On the Completeness of Selective Unification in Concolic Testing of Logic Programs. Fred Mesnard, Etienne Payet and German Vidal. - Verification of Time-Aware Business Processes using Constrained Horn Clauses. Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi and Maurizio Proietti. - Tuning Fuzzy Logic Programs with Symbolic Execution. Gines Moreno, Jaime Penabad and German Vidal. - A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Paul Tarau. - A New Functional-Logic Compiler for Curry: Sprite. Sergio Antoy and Andy Jost. - Towards Reversible Computation in Erlang. Naoki Nishida, Adrian Palacios and German Vidal. - Slicing Concurrent Constraint Programs. Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte and Catuscia Palamidessi. - Scaling Bounded Model Checking By Transforming Programs With Arrays. Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niyas C. - Hierarchical Shape Abstraction of Free-List Memory Allocators. Bin Fang and Mihaela Sighireanu. - A Productivity Checker for Logic Programming. Ekaterina Komendantskaya, Patricia Johann and Martin Möhrmann. - Automata Theory Approach to Predicate Intuitionistic Logic. Maciej Zielenkiewicz and Aleksy Schubert. - Nominal Unification of Higher Order Expressions with Recursive Let. Manfred Schmidt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret. - A Formal, Resource Consumption-Preserving Translation of Actors to Haskell. Elvira Albert, Nikolaos Bezirgiannis, Frank De Boer and Enrique Martin-Martin. - Partial Evaluation of Order-sorted Equational Programs modulo Axioms. María Alpuente, Angel Cuenca, Santiago Escobar and Jose Meseguer. - lpopt: A Rule Optimization Tool for Answer Set Programming. Manuel Bichler, Michael Morak and Stefan Woltran. - CurryCheck: Checking Properties of Curry Programs. Michael Hanus. - Intuitionistic Logic Programming for SQL. Fernando Saenz-Perez. Hope to see you in Edinburgh! Manuel Hermengildo and Pedro Lopez-Garcia LOPSTR 2016 Co-chairs -------------- next part -------------- An HTML attachment was scrubbed... URL: From klaus.ostermann at uni-tuebingen.de Fri Aug 19 09:45:54 2016 From: klaus.ostermann at uni-tuebingen.de (Klaus Ostermann) Date: Fri, 19 Aug 2016 11:45:54 +0200 Subject: [Haskell] Postdoctoral position in programming languages at U Tuebingen Message-ID: <5ef91f94-99f5-24fd-b846-1a1938ee875a@uni-tuebingen.de> I'm pleased to announce that we have an open position for a Postdoc in programming languages. The position is for up to 36 months and can start on January 1, 2017 or later. The position is part of the chair on programming languages and software technology in the department of computer science at the University of Tuebingen in Germany. The position is not bound to a particular project or research topic, hence it enables the Postdoc to build his or her own research field and lay the foundation for an academic or industrial research career. We have a generous budget for traveling and equipment and will provide the opportunity to participate in a range of research projects in our group. The Postdoc will have the opportunity to form his/her own research group and participate in the supervision of PhD students. Topics that are of particular interest for this position include: Probabilistic programming, type and module systems, domain-specific languages, programming language design, programming education, generative programming, programming techniques, programming and theorem proving. Applicants for the postdoctoral position should have a PhD (or be close to completion) in computer science, with a track record of high quality publications in programming languages. Fluency in German is not a requirement; the working language in our research group is English. More information about the research group can be found at: http://ps.informatik.uni-tuebingen.de Please send informal enquiries about the position via email to Klaus Ostermann http://ps.informatik.uni-tuebingen.de/team/ostermann/ -- Klaus From tarmo at cs.ioc.ee Mon Aug 22 11:54:57 2016 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Mon, 22 Aug 2016 14:54:57 +0300 Subject: [Haskell] ETAPS 2017 2nd joint call for papers Message-ID: <20160822145457.20f2444f@duality> ****************************************************************** JOINT CALL FOR PAPERS 20th European Joint Conferences on Theory And Practice of Software ETAPS 2017 Uppsala, Sweden, 22-29 April 2017 http://www.etaps.org/2017 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2017 is the twentieth event in the series. -- MAIN CONFERENCES (24-28 April) -- * ESOP: European Symposium on Programming (PC chair Hongseok Yang, University of Oxford, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs Marieke Huisman, Universiteit Twente, The Netherlands, and Julia Rubin, University of British Columbia, Canada) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs Javier Esparza, Technische Universität München, Germany, Andrzej Murawski, University of Warwick, UK) * POST: Principles of Security and Trust (PC chairs Matteo Maffei, Universität des Saarlandes, Germany, Mark D. Ryan, University of Birmingham, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Axel Legay, INRIA Rennes, France, and Tiziana Margaria, LERO, Ireland) TACAS '17 hosts the 6th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Michael Ernst (University of Washington, USA) Kim G. Larsen (Aalborg University, DK) * FoSSaCS invited speaker: Joel Ouaknine (University of Oxford, UK) * TACAS invited speaker: Dino Distefano (Facebook and Queen Mary University of London, UK) -- IMPORTANT DATES -- * Abstracts due (ESOP, FASE, FoSSaCS, TACAS): 14 October 2016 * Papers due: 21 October 2016 * Rebuttal (ESOP and FoSSaCS only): 7-9 December 2016 * Notification: 22 December 2016 * Camera-ready versions due: 20 January 2017 -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere (this does not apply to abstracts). In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE will use a light-weight double-blind review process (see http://www.etaps.org/2017/fase). - Research papers FASE, FoSSaCS and TACAS have a page limit of 15 pp (excluding bibliography of max 2 pp) for research papers, whereas POST allows at most 20 pp (excluding bibliography of max 2 pp) and ESOP 25 pp (excluding bibliography of max 2 pp). Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pp, excluding bibliography of max 2 pp). Both TACAS and FASE solicit also regular tool papers (at most 15 pp, excluding bibliography of max 2 pp). The rationale of a separate page limit for the bibliography is to remove the possibility to win space for the body of a paper by cutting the bibliography, a practise that has a negative effect on our competitiveness as a community. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated. ESOP and FoSSaCS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (22-23 April, 29 April) -- Around 20 satellite workshops will take place before and after the main conferences: BX, CREST, DICE-FOPARA, FESCA, GALOP, GaM, HotSpot, LiVe, MARS, MBT, QAPL, SNR, SynCoP, VerifyThis, VPT. -- HOST CITY -- Uppsala city holds a rich history, having for long periods been the political, religious and academic centre of Sweden. Uppsala University is over 500 years old and ranked among the top 100 in the World and has hosted many great scientists over the years, for instance Carl von Linné, Anders Celsius and Anders Jonas Ångström. The proximity to the capital of Sweden, Stockholm, provides additional benefits as a potential site for arranging both pre- and post congress tours, as well as for excursions or tourism. -- HOST INSTITUTION -- ETAPS 2017 is hosted by the Department of Information Technology, Uppsala University. -- ORGANIZERS Parosh Abdulla (General chair), Mohamed Faouzi Atig, Andreina Francisco, Kaj Lampka, Philipp Rümmer, Konstantinos Sagonas, Björn Victor, Wang Yi, Tjark Weber, Yunyun Zhu -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at parosh.abdulla at it.uu.se, mohamed_faouzi.atig at it.uu.se From marlowsd at gmail.com Wed Aug 24 14:46:06 2016 From: marlowsd at gmail.com (Simon Marlow) Date: Wed, 24 Aug 2016 15:46:06 +0100 Subject: [Haskell] Haskell positions at Facebook Message-ID: Want to write Haskell for a living? At Facebook we're looking for Spam Fighters. A large part of this job involves writing Haskell code to run on our Sigma/Haxl platform. It's a fascinating and exciting area to work in, using state of the art tools and systems, working with amazing people, and of course you get to write Haskell every day. Come and see what it's like to write Haskell code that runs at Facebook scale! Job description and application: https://www.facebook.com/careers/jobs/a0I1200000IA7KYEA1/ Note: this is for the Menlo Park (California, USA) office. -------------- next part -------------- An HTML attachment was scrubbed... URL: From CCUTM at web.de Sun Aug 28 10:43:07 2016 From: CCUTM at web.de (CCUTM at web.de) Date: Sun, 28 Aug 2016 12:43:07 +0200 Subject: [Haskell] I repeat my Question becaue I not really sure to do it right Message-ID: An HTML attachment was scrubbed... URL: From ivan.miljenovic at gmail.com Sun Aug 28 11:49:06 2016 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Sun, 28 Aug 2016 21:49:06 +1000 Subject: [Haskell] I repeat my Question becaue I not really sure to do it right In-Reply-To: References: Message-ID: On 28 August 2016 at 20:43, wrote: > Ok Haskell is good. > Ok Laska is great. > And my Ubuntu Studio ist rubish > So I try to install Laska on Ubuntu Studio > But when I do this, i will get a long list of dependecies > which could not reallise > So I not know what should I do Which question? What is Laska that you're having trouble installing it? > > Mungo1981 > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > -- Ivan Lazar Miljenovic Ivan.Miljenovic at gmail.com http://IvanMiljenovic.wordpress.com From CCUTM at web.de Sun Aug 28 12:40:12 2016 From: CCUTM at web.de (CCUTM at web.de) Date: Sun, 28 Aug 2016 14:40:12 +0200 Subject: [Haskell] I repeat my Question becaue I not really sure to do it right In-Reply-To: References: , Message-ID: An HTML attachment was scrubbed... URL: From ivan.miljenovic at gmail.com Sun Aug 28 12:50:50 2016 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Sun, 28 Aug 2016 22:50:50 +1000 Subject: [Haskell] I repeat my Question becaue I not really sure to do it right In-Reply-To: References: Message-ID: On 28 August 2016 at 22:40, wrote: > This is Leksah http://leksah.org/ > Please excuse my false name for it > And the Question is why can I install it. What error messages do you have when you try? >From here, this is what you need to do: https://github.com/leksah/leksah/wiki/download > cabal install gtk2hs-buildtools > cabal install leksah > > excuse me. > Mungo1981 > > Gesendet: Sonntag, 28. August 2016 um 13:49 Uhr > Von: "Ivan Lazar Miljenovic" > An: CCUTM at web.de > Cc: "Haskell List" > Betreff: Re: [Haskell] I repeat my Question becaue I not really sure to do > it right > On 28 August 2016 at 20:43, wrote: >> Ok Haskell is good. >> Ok Laska is great. >> And my Ubuntu Studio ist rubish >> So I try to install Laska on Ubuntu Studio >> But when I do this, i will get a long list of dependecies >> which could not reallise >> So I not know what should I do > > Which question? > > What is Laska that you're having trouble installing it? > >> >> Mungo1981 >> >> _______________________________________________ >> Haskell mailing list >> Haskell at haskell.org >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell >> > > > > -- > Ivan Lazar Miljenovic > Ivan.Miljenovic at gmail.com > http://IvanMiljenovic.wordpress.com > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > -- Ivan Lazar Miljenovic Ivan.Miljenovic at gmail.com http://IvanMiljenovic.wordpress.com From david.feuer at gmail.com Wed Aug 31 05:51:40 2016 From: david.feuer at gmail.com (David Feuer) Date: Wed, 31 Aug 2016 01:51:40 -0400 Subject: [Haskell] Announcing containers 0.5.8.1 Message-ID: There's a lot to see in this one. There are plenty of brand-new functions in Data.Map, Data.Set, and Data.Sequence, including a highly-optimized lens-inspired map alteration function and a brand-new API for merging maps efficiently. Several key map, set, and sequence functions have sped up considerably. The full change log is below. I have tried to give appropriate credit to all the non-maintainers who contributed to this release, some of whom made very major contributions indeed. If I missed anyone, please give a shout. General package changes: Remove all attempts to support nhc98 and any versions of GHC before 7.0. Integrate benchmarks with Cabal. (Thanks, Gabriel Gonzalez!) Make Cabal report required extensions properly, and stop using default extensions. Note that we do not report extensions conditionally enabled based on GHC version, as doing so would lead to a maintenance nightmare with no obvious benefits. Use BangPatterns throughout to reduce noise. This extension is now required to compile containers. Improve QuickCheck properties taking arbitrary functions by using Test.QuickCheck.Function.Fun instead of evil Show instances for functions. Expose several internal modules through Cabal (as requested by Edward Kmett). These remain completely unsupported. New exports and instances: Add alterF, restrictKeys, and withoutKeys to Data.Map and Data.IntMap. Add take, drop, splitAt, takeWhileAntitone, dropWhileAntitone, and spanAntitone for Data.Map and Data.Set. Thanks to Cale Gibbard for suggesting these. Add merge, mergeA, and associated merge tactics for Data.Map. Many thanks to Cale Gibbard, Ryan Trinkle, and Dan Doel for inspiring the merge idea and helping refine the interface. Add fromDescList, fromDescListWith, fromDescListWithKey, and fromDistinctDescList to Data.Map. Add fromDescList and fromDistinctDescList to Data.Set. Add Empty, :<|, and :|> pattern synonyms for Data.Sequence, as originally envisioned in the finger tree paper by Paterson and Hinze. Add adjust', (!?), lookup, chunksOf, cycleTaking, insertAt, deleteAt, intersperse, foldMapWithIndex, and traverseWithIndex for Data.Sequence. Derive Generic and Generic1 for Data.Tree.Tree, Data.Sequence.ViewL, and Data.Sequence.ViewR. Add foldTree for Data.Tree. (Thanks, Daniel Wagner!) Semantic changes: Make Data.Sequence.splitAt strict in its arguments. Previously, it returned a lazy pair. Fix completely erroneous definition of length for Data.Sequence.ViewR. Make Data.Map.Strict.traverseWithKey force result values before installing them in the new map. Make Data.Tree.drawTree handle newlines better. (Thanks, recursion-ninja!) Deprecations: All functions in Data.Map proper that have been documented as deprecated since version 0.5 or before now have DEPRECATED pragmas and will actually be removed after another cycle or two. Tree printing functions in Data.Map intended for library debugging are now deprecated. They will continue to be available for the foreseeable future in an internal module. Performance changes: Substantially speed up splitAt, zipWith, take, drop, fromList, partition, foldl', and foldr' for Data.Sequence. Special thanks to Lennart Spitzner for digging into the performance problems with previous versions of fromList and finding a way to make it really fast. Slightly optimize replicateA. Stop traverse from performing many unnecessary fmap operations. Most operations in Data.Sequence advertised as taking logarithmic time (including >< and adjust) now use their full allotted time to avoid potentially building up chains of thunks in the tree. In general, the only remaining operations that avoid doing more than they really need are the particular bulk creation and transformation functions that really benefit from the extra laziness. There are some situations where this change may slow programs down, but I think having more predictable and usually better performance more than makes up for that. Add rewrite rules to fuse fmap with reverse for Data.Sequence. Switch from hedge algorithms to divide-and-conquer algorithms for union, intersection, difference, and merge in both Data.Map and Data.Set. These algorithms are simpler, are known to be asymptotically optimal, and are faster according to our benchmarks. Speed up adjust for Data.Map. Allow map to inline, and define a custom (<$). This considerably improves mapping with a constant function. Remove non-essential laziness throughout the Data.Map.Lazy implementation. Slightly speed up deletion and alteration functions for Data.IntMap. From heraldhoi at gmail.com Wed Aug 31 07:36:52 2016 From: heraldhoi at gmail.com (Geraldus) Date: Wed, 31 Aug 2016 07:36:52 +0000 Subject: [Haskell] [Haskell-cafe] Announcing containers 0.5.8.1 In-Reply-To: References: Message-ID: Wow, thanks! ср, 31 авг. 2016 г. в 10:52, David Feuer : > There's a lot to see in this one. There are plenty of brand-new > functions in Data.Map, Data.Set, and Data.Sequence, including a > highly-optimized lens-inspired map alteration function and a brand-new > API for merging maps efficiently. Several key map, set, and sequence > functions have sped up considerably. The full change log is below. I > have tried to give appropriate credit to all the non-maintainers who > contributed to this release, some of whom made very major > contributions indeed. If I missed anyone, please give a shout. > > > General package changes: > > Remove all attempts to support nhc98 and any versions of GHC before 7.0. > > Integrate benchmarks with Cabal. (Thanks, Gabriel Gonzalez!) > > Make Cabal report required extensions properly, and stop using default > extensions. Note that we do not report extensions conditionally > enabled based on GHC version, as doing so would lead to a maintenance > nightmare with no obvious benefits. > > Use BangPatterns throughout to reduce noise. This extension is now > required to compile containers. > > Improve QuickCheck properties taking arbitrary functions by using > Test.QuickCheck.Function.Fun instead of evil Show instances for > functions. > > Expose several internal modules through Cabal (as requested by Edward > Kmett). These remain completely unsupported. > > > > New exports and instances: > > Add alterF, restrictKeys, and withoutKeys to Data.Map and Data.IntMap. > > Add take, drop, splitAt, takeWhileAntitone, dropWhileAntitone, and > spanAntitone for Data.Map and Data.Set. Thanks to Cale Gibbard for > suggesting these. > > Add merge, mergeA, and associated merge tactics for Data.Map. Many > thanks to Cale Gibbard, Ryan Trinkle, and Dan Doel for inspiring the > merge idea and helping refine the interface. > > Add fromDescList, fromDescListWith, fromDescListWithKey, and > fromDistinctDescList to Data.Map. > > Add fromDescList and fromDistinctDescList to Data.Set. > > Add Empty, :<|, and :|> pattern synonyms for Data.Sequence, as > originally envisioned in the finger tree paper by Paterson and Hinze. > > Add adjust', (!?), lookup, chunksOf, cycleTaking, insertAt, deleteAt, > intersperse, foldMapWithIndex, and traverseWithIndex for > Data.Sequence. > > Derive Generic and Generic1 for Data.Tree.Tree, Data.Sequence.ViewL, > and Data.Sequence.ViewR. > > Add foldTree for Data.Tree. (Thanks, Daniel Wagner!) > > > > Semantic changes: > > Make Data.Sequence.splitAt strict in its arguments. Previously, it > returned a lazy pair. > > Fix completely erroneous definition of length for Data.Sequence.ViewR. > > Make Data.Map.Strict.traverseWithKey force result values before > installing them in the new map. > > Make Data.Tree.drawTree handle newlines better. (Thanks, recursion-ninja!) > > > > Deprecations: > > All functions in Data.Map proper that have been documented as > deprecated since version 0.5 or before now have DEPRECATED pragmas and > will actually be removed after another cycle or two. > > Tree printing functions in Data.Map intended for library debugging are > now deprecated. They will continue to be available for the foreseeable > future in an internal module. > > > > Performance changes: > > Substantially speed up splitAt, zipWith, take, drop, fromList, > partition, foldl', and foldr' for Data.Sequence. Special thanks to > Lennart Spitzner for digging into the performance problems with > previous versions of fromList and finding a way to make it really > fast. Slightly optimize replicateA. Stop traverse from performing many > unnecessary fmap operations. > > Most operations in Data.Sequence advertised as taking logarithmic time > (including >< and adjust) now use their full allotted time to avoid > potentially building up chains of thunks in the tree. In general, the > only remaining operations that avoid doing more than they really need > are the particular bulk creation and transformation functions that > really benefit from the extra laziness. There are some situations > where this change may slow programs down, but I think having more > predictable and usually better performance more than makes up for > that. > > Add rewrite rules to fuse fmap with reverse for Data.Sequence. > > Switch from hedge algorithms to divide-and-conquer algorithms for > union, intersection, difference, and merge in both Data.Map and > Data.Set. These algorithms are simpler, are known to be asymptotically > optimal, and are faster according to our benchmarks. > > Speed up adjust for Data.Map. Allow map to inline, and define a custom > (<$). This considerably improves mapping with a constant function. > > Remove non-essential laziness throughout the Data.Map.Lazy implementation. > > Slightly speed up deletion and alteration functions for Data.IntMap. > _______________________________________________ > Haskell-Cafe mailing list > To (un)subscribe, modify options or view archives go to: > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe > Only members subscribed via the mailman list are allowed to post. -------------- next part -------------- An HTML attachment was scrubbed... URL: