From casperbp at gmail.com Sun Sep 1 21:13:21 2019 From: casperbp at gmail.com (Casper Bach Poulsen) Date: Sun, 1 Sep 2019 23:13:21 +0200 Subject: [Haskell] PEPM 2020 Call for Papers Message-ID: -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2020 =============================================================================== * Website : https://popl20.sigplan.org/home/pepm-2020 * Time : 20th - 21st January 2020 * Place : New Orleans, Louisiana, United States (co-located with POPL 2020) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM), which has a history going back to 1991 and has co-located with POPL every year since 2006, originates in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2020 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2020 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Casper Bach Poulsen (http://casperbp.net) and Zhenjiang Hu (http://sei.pku.edu.cn/~hu/). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: Regular Research Papers and Short Papers. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages (excluding bibliography). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages (excluding bibliography). Both kinds of submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm20.hotcrp.com/ PEPM 2020 will employ lightweight double-blind reviewing according to the rules of POPL 2020. Quoting from POPL 2020’s call for papers: “submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work ...” but rather “We build on the work of ...”). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their paper as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas.” See POPL 2020’s Submission and Reviewing FAQ page for more information: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-Reviewing-FAQ Submissions are welcome from PC members (except the two co-chairs). Accepted papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Authors of short papers, however, can ask for their papers to be left out of the formal proceedings. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM 2020 web site: https://popl20.sigplan.org/home/pepm-2020 Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page: https://www.sigplan.org/PAC/ Important dates --------------- * Paper submission deadline : Friday 18th October 2019 (AoE) * Author notification : Monday 11th November 2019 (AoE) * Workshop : Monday 20th and Tuesday 21st January 2020 The proceedings are expected to be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Best paper award ---------------- PEPM 2020 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- * Andreas Abel (Chalmers U.) * Guillaume Allais (U. Strathclyde) * Nada Amin (Cambridge U.) * Casper Bach Poulsen (co-chair) (TU Delft) * Patrick Bahr (Copenhagen U.) * Aggelos Biboudis (EPFL) * Olivier Danvy (National U. Singapore) * Álvaro García-Pérez (IMDEA) * Jeremy Gibbons (Oxford U.) * Robert Glück (Copenhagen U.) * Torsten Grust (U. Tubingen) * Zhenjiang Hu (co-chair) (Peking U./NII) * Hideya Iwasaki (U. Electro-Communications) * Oleg Kiselyov (Tohoku U.) * Hedehiko Masuhara (Tokyo I. Technology) * Keisuke Nakano (Tohoku U.) * Bruno Oliveira (U. Hong Kong) * Jens Palsberg (UCLA) * João Saraiva (Minho U.) * Tom Schrijvers (KU Leuven) * Eijiro Sumii (Tohoku U.) * Walid Taha (Halmstad U.) * Nobuko Yoshida (Imperial C. London) -------------- next part -------------- An HTML attachment was scrubbed... URL: From chisvasileandrei at gmail.com Mon Sep 2 12:04:45 2019 From: chisvasileandrei at gmail.com (Andrei Chis) Date: Mon, 2 Sep 2019 14:04:45 +0200 Subject: [Haskell] SLE 2019: Call for Endorsements - Most Influential Paper (MIP) Award Message-ID: ------------------------------------------------------------------------ Call for Endorsements: ACM SIGPLAN International Conference on Software Language Engineering (SLE) - Most Influential Paper Award SLE MIP Awards: http://www.sleconf.org/mip Follow us on twitter: https://twitter.com/sleconf SLE 2019: https://conf.researchr.org/home/sle-2019 ------------------------------------------------------------------------ Starting in 2019, the ACM SIGPLAN International Conference on Software Language Engineering (SLE) delivers annually an award to the Most Influential Paper (MIP) presented at the SLE conference held 10 years prior to the award year. The SLE MIP Award distinguishes the authors of the paper having the greatest impact (either scientific, societal or industrial). The papers are judged by their influence over the past decade. The SLE MIP Award is delivered by the current members of the Steering Committee (SC) of the conference, considering: i) endorsements from the community, and ii) the synthesis of some facts and metrics collected in advance by selected SC members. The vote is by majority of the SC members, after a discussion during the online meetings. Authors are informed at once, and awarded at the coming conference. In 2019 we offer two awards: one for the authors of the MIP from the 2009 program (http://www.sleconf.org/2009/Program.html), and another one for the authors of the MIP from the 2008 program (http://www.sleconf.org/2008/program.html), back to the first edition of the conference. SLE MIP Award 2019: - Program SLE 2009: http://www.sleconf.org/2009/Program.html; - Endorsement: http://tiny.cc/slemip2019 (deadline: Sep. 20th, 2019) SLE MIP Award 2018: - Program SLE 2008: http://www.sleconf.org/2008/program.html; - Endorsement: http://tiny.cc/slemip2018 (deadline: Sep. 20th, 2019) From nevrenato at gmail.com Tue Sep 3 09:52:57 2019 From: nevrenato at gmail.com (Renato Neves) Date: Tue, 03 Sep 2019 10:52:57 +0100 Subject: [Haskell] FM'19 - 2nd Call for Participation Message-ID: <000309a86710b559fd51f7fe4b1de56f9aa06e42.camel@gmail.com> 3rd World Congress on Formal Methods Porto, October 7-11, 2019 http://formalmethods2019.inesctec.pt/ @formalmethods19 ______________________________________________________________ *** Apologies for cross-posting *** ______________________________________________________________ *** FM Week News: Tony Hoare's keynote (Oct 8) jointly organized by UTP'19, LOPSTR'19, MPC'19, PPDP'19 and RV'19 will mark the 50th anniversary (October 1969) of the publication of "An Axiomatic Basis for Computer Programming”. ______________________________________________________________ The FM'19 World Congress on Formal Methods will take place at the Alfandega do Porto Congress Center, Porto, October 7-11, 2019, under the motto "The Next 30 Years". Registration is open at https://bit.ly/2JfdBjO as follows: . Early – until Sep 10 (AoE) . Late – from Sep 11 until Oct 5 (AoE) . On site – from Oct 6 to Oct 11 (AoE) Further to the Industry day, Tool Exhibition, Doctoral Symposium (and a social event on Oct 10), FM'19 involves more than 30 parallel events (symposia, conferences, workshops and tutorials) spreading over several FM related areas: . FM 2019 – 23rd International Symposium on Formal Methods . LOPSTR 2019 – 29th International Symposium on Logic-Based Program Synthesis and Transformation . MPC 2019 – 13th International Conference on Mathematics of Program Construction . PPDP 2019 – 21st International Symposium on Principles and Practice of Declarative Programming . RV 2019 – 19th International Conference on Runtime Verification . SAS 2019 – 26th International Static Analysis Symposium . TAP 2019 – 13th International Conference on Tests and Proofs . UTP 2019 – 7th International Symposium on Unifying Theories of Programming . VECoS 2019 – 13th International Conference on Verification and Evaluation of Computer and Communication Systems . AFFORD 2019 – Practical Formal Verification for Software Dependability . DALI 2019 – 2nd Workshop on Dynamic Logic: New Trends and Applications . DataMod 2019 – 8th International Symposium “From Data to Models and Back (DataMod)” . FMAS 2019 – Formal Methods for Autonomous Systems . FMBC 2019 – Workshop on Formal Methods for Blockchains . FMIS 2019 – 8th Formal Methods for Interactive Systems Workshop . FMTea 2019 – Formal Methods Teaching Workshop and Tutorial . F-IDE 2019 – 5th Workshop on Formal Integrated Development Environment . HFM 2019 – History of Formal Methods . NSAD 2019 – 8th International Workshop on Numerical and Symbolic Abstract Domains . OpenCERT 2019 – 9th Int. Workshop on Open Community approaches to Education, Research and Technology . OVT 2019 – 17th Overture Workshop . REFINE 2019 – 19th Refinement Workshop . RPLA 2019 – Reversibility in Programming, Languages, and Automata . SASB 2019 – 10th International Workshop on Static Analysis and Systems Biology . TAPAS 2019 – 10th Workshop on Tools for Automatic Program Analysis . ALLOY – Formal software design with Alloy and Electrum (Tutorial) . CbC – The Correctness by Construction Approach to Programming (Tutorial) . FM4BioMed – Formal Methods for BioMedicine (Tutorial) . FRAMA-C-IoT – Formal Verification of IoT Software with Frama-C (Tutorial) . KEYMAERA X – Modular Formal Verification of Cyber-Physical Systems with KeYmaera X (Tutorial) . MLFV – ML + FV = ♥? A Gentle Introduction to the use of Machine Learning within Formal Verification Tools (Tutorial) . SRV – Stream-based Runtime Verification (Tutorial) As a whole, the FM'19 congress will bring together a distinguished group of 40+ world-top guest speakers whose short bios can be found at https://bit.ly/2Io2Lsh. The FM'19 organizers thank all corporations that have been so kind to sponsor the Congress – please see the 'Sponsor FM'19' gallery at https://bit.ly/2CrKnMA. For more information, please visit the following pages of the FM'19 website: . FM Week - https://bit.ly/2zsyCUu . Accepted papers - https://bit.ly/2YtIp9Y (updated as data arrive from event chairs; currently: 344 papers involving 750 authors) . Call for participation - https://bit.ly/2JfdBjO . Registration page - https://bit.ly/2NTR9SR . Venue - https://bit.ly/2MdNCMu . Accommodation - https://bit.ly/2OuHXEu . Getting to Porto - https://bit.ly/2ykguKN . Social program - https://bit.ly/2JfdBjO . Weather forecast - https://bit.ly/2SLOKZ5 (or https://bit.ly/2YjeEo3 for more details) Contact: contactfm2019 at inesctec.pt We are also on Twitter: @formalmethods19 _____________________________________________________________ *** Welcome to FM'19 *** *** Welcome to PORTO *** *** Welcome to Portugal *** ______________________________________________________________ From aggelos.biboudis at epfl.ch Wed Sep 4 13:12:13 2019 From: aggelos.biboudis at epfl.ch (Aggelos Biboudis) Date: Wed, 4 Sep 2019 15:12:13 +0200 Subject: [Haskell] SPLASH 2019 Call for Participation (early reg.: Sep.20!) Message-ID: ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'19) Athens, Greece Sun 20 - Fri 25 October 2019 2019.splashcon.org twitter.com/splashcon www.facebook.com/SPLASHCon Sponsored by ACM SIGPLAN SPLASH is the ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity. SPLASH embraces all aspects of software construction and delivery, to make it the premier conference on the applications of programming languages--at the intersection of programming languages and software engineering. SPLASH 2019 will take place in Athens from Sunday 20th to Friday 25th of October 2019. SPLASH includes the following co-located conferences: OOPSLA, Onward!, GPCE, SLE, DLS (note changed date), and MPLR; as well as a large array of workshops and events. The Rebase track (formerly “SPLASH-I”) aims to deliver presentations of interest to software practitioners and researchers alike. Rebase will feature perspectives from industry giants, to rocketship startups, to academic research, and solutions from algorithms to physical computing, to quantum computing. Registration ------------ ** Friday, 20th September 2019 (Early Deadline) ** <-- very soon! * Contact: info at splashcon.org * Register: https://2019.splashcon.org/attending/Registration * Venue: https://2019.splashcon.org/venue/splash-2019-venue Conference ---------- OOPSLA 2019 https://2019.splashcon.org/track/splash-2019-oopsla Onward! Papers https://2019.splashcon.org/track/splash-2019-Onward-papers Onward! Essays https://2019.splashcon.org/track/splash-2019-Onward-essays Rebase https://2019.splashcon.org/track/splash-2019-rebase Dynamic Languages Symposium (DLS) *Note*: DLS’19 will be on Sunday instead of its usual slot https://conf.researchr.org/home/dls-2019 Generative Programming: Concepts & Experiences (GPCE) https://conf.researchr.org/home/gpce-2019 Software Language Engineering (SLE) https://conf.researchr.org/home/sle-2019 Managed Programming Languages and Runtimes (MPLR) https://conf.researchr.org/home/mplr-2019 SPLASH-E https://2019.splashcon.org/track/splash-2019-SPLASH-E Doctoral Symposium http://2019.splashcon.org/track/splash-2019-Doctoral-Symposium Student Research Competition https://2019.splashcon.org/track/splash-2019-SRC Workshops --------- AGERE (Actors, Agents, and Decentralized Control) https://2019.splashcon.org/home/agere-2019 AI-SEPS (AI-Inspired and Empirical Methods for SE on Parallel Computing Systems) https://2019.splashcon.org/home/seps-2019 DSM (Domain-Specific Modeling) https://2019.splashcon.org/home/dsm-2019 IC (Incremental Computing) https://2019.splashcon.org/home/ic-2019 LIVE (Live Programming) https://2019.splashcon.org/home/live-2019 META (Metaprogramming) https://2019.splashcon.org/home/meta-2019 NJR (Normalized Java Resource) https://2019.splashcon.org/home/njr-2019 REBLS (Reactive and Event-based Languages and Systems) https://2019.splashcon.org/home/rebls-2019 STOKED (Spatio-Temporal platforms for Observations and Knowledge of Earth Data) https://2019.splashcon.org/home/stoked-2019 VMIL (Virtual Machines and Intermediate Languages) https://2019.splashcon.org/home/vmil-2019 Looking forward to seeing you in Athens! From Dominique.Devriese at vub.be Fri Sep 6 07:34:34 2019 From: Dominique.Devriese at vub.be (Dominique DEVRIESE) Date: Fri, 6 Sep 2019 07:34:34 +0000 Subject: [Haskell] CFP for Certified Programs and Proofs (CPP 2020) Message-ID: ## CFP for Certified Programs and Proofs (CPP 2020) ## Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider certification as an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with the production of independently checkable certificates. CPP spans areas of computer science, mathematics, logic, and education. CPP 2020 will be held on 20-21 January 2020 in New Orleans, Louisiana, United States and will be co-located with POPL 2020. CPP 2020 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. For more information about this edition and the CPP series please visit: https://popl20.sigplan.org/home/CPP-2020 ### News - Submission guideline news: **lightweight double-blind reviewing process** and **unrestricted appendices** that don't count against the page limit - Delighted to announce that the **invited speakers** for CPP 2020 will be: Adam Chlipala (MIT CSAIL) and Grigore Rosu (UIUC and Runtime Verification) - CPP 2020 will also host the **POPLmark 15 Year Retrospective Panel** ### Important Dates - Abstract Deadline: 16 October 2019 at 23:59 AoE (UTC-12h) - Paper Submission Deadline: 21 October 2019 at 23:59 AoE (UTC-12h) - Notification: 27 November 2019 - Camera Ready Deadline: 20 December 2019 - Conference: 20 - 21 January 2020 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are tight and there will be **no extensions**. ### Topics of Interest We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interests to CPP: - certified or certifying programming, compilation, linking, OS kernels, runtime systems, and security monitors; - certified mathematical libraries and mathematical theorems; - proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL, HOL-Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc) - new languages and tools for certified programming; - program analysis, program verification, and program synthesis; - program logics, type systems, and semantics for certified code; - logics for certifying concurrent and distributed systems; - mechanized metatheory, formalized programming language semantics, and logical frameworks; - higher-order logics, dependent type theory, proof theory, logical systems, separation logics, and logics for security; - verification of correctness and security properties; - formally verified blockchains and smart contracts; - certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; - certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; - certificates for program termination; - formal models of computation; - mechanized (un)decidability and computational complexity proofs; - user interfaces for proof assistants and theorem provers; - original formal proofs of known results in math or computer science; - teaching mathematics and computer science with proof assistants. ### Program Committee Members - Jasmin Christian Blanchette (VU Amsterdam, Netherlands -- co-chair) - Catalin Hritcu (Inria Paris, France -- co-chair) - Nada Amin (Harvard University - USA) - Jesús María Aransay Azofra (Universidad de La Rioja - Spain) - Mauricio Ayala-Rincon (Universidade de Brasilia - Brazil) - Liron Cohen (Cornell University - USA) - Dominique Devriese (Vrije Universiteit Brussel - Belgium) - Jean-Christophe Filliâtre (CNRS - France) - Adam Grabowski (University of Bialystok - Poland) - Warren Hunt (University of Texas - USA) - Ori Lahav (Tel Aviv University - Israel) - Peter Lammich (The University of Manchester - UK) - Dominique Larchey-Wendling (Univ. de Lorraine, CNRS, LORIA - France) - Hongjin Liang (Nanjing University - China) - Assia Mahboubi (Inria and VU Amsterdam - France) - Cesar Munoz (NASA - USA) - Vivek Nigam (fortiss GmbH - Germany) - Benjamin Pierce (University of Pennsylvania - USA) - Vincent Rahli (University of Luxembourg, SnT - Luxembourg) - Christine Rizkallah (UNSW Sydney - Australia) - Ilya Sergey (Yale-NUS College and National University of Singapore) - Kathrin Stark (Saarland University - Germany) - Nikhil Swamy (Microsoft Research - USA) - Nicolas Tabareau (Inria - France) - Dmitriy Traytel (ETH Zürich - Switzerland) - Floris van Doorn (University of Pittsburgh - USA) - Akihisa Yamada (National Institute of Informatics - Japan) - Roberto Zunino (University of Trento - Italy) ### Submission Guidelines Prior to the paper submission deadline, the authors should upload their **anonymized** paper in PDF format through the HotCRP system at https://cpp2020.hotcrp.com Submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the paper. Submitted papers must be formatted following the [ACM SIGPLAN Proceedings](http://www.sigplan.org/Resources/Author/) format using the `acmart` style with the `sigplan` option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., ``` \documentclass[sigplan,10pt,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} ``` Submitted papers should not exceed 12 pages, including tables and figures, but **excluding bibliography and clearly marked appendices**. The paper should be self contained without the appendices. Shorter papers are welcome and will be given equal consideration. Papers not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2020 will employ a **lightweight double-blind reviewing process**. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work …" but rather “We build on the work of …"). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their paper as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. POPL has answers for frequently asked questions addressing many common concerns: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-Reviewing-FAQ We encourage authors to provide any supplementary material that is required to support the claims made in the paper, such as proof scripts or experimental data. These materials must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: - Anonymous supplementary material is available to the reviewers before they submit their first-draft reviews. - Non-anonymous supplementary material is available to the reviewers after they have submitted their first-draft reviews and learned the identity of the authors. Use the anonymous form whenever possible, so that the materials can be taken into account from the beginning of the reviewing process. Submitted papers must adhere to the SIGPLAN Republication Policy and the ACM Policy on Plagiarism. Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the conference. ### Publication, copyright, and open access The CPP proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: 1. Author retains copyright of the work and grants ACM **a non-exclusive permission-to-publish license** and, optionally, licenses the work under a Creative Commons license; 2. Author retains copyright of the work and grants ACM **an exclusive permission-to-publish license**; 3. Author **transfers copyright** of the work to ACM. For authors who can afford it, we recommend option 1, which will make the paper **Gold Open Access**, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option 2, which is free and allows you to achieve **Green Open Access**, by uploading a pre-print of your paper to a repository that guarantees permanent archival such as arXiv or HAL. This is anyway a good idea for **timely dissemination** even if you chose option 1. Ensuring timely dissemination is particularly important for this edition, since, because of the very tight schedule, the official proceedings might not be available in time for CPP. The official CPP 2020 proceedings will also be available via SIGPLAN OpenTOC. For ACM's take on this, see their Copyright Policy and Author Rights. ### Contact For any questions please contact the two PC chairs: Catalin Hritcu >, Jasmin Christian Blanchette > -------------- next part -------------- An HTML attachment was scrubbed... URL: From yazan.mualla at utbm.fr Mon Sep 16 13:10:36 2019 From: yazan.mualla at utbm.fr (Yazan Mualla) Date: Mon, 16 Sep 2019 15:10:36 +0200 (CEST) Subject: [Haskell] CFP - The 4th International Workshop on Agent-based Modeling and Applications with SARL (SARL-20) Message-ID: <341181264.17484119.1568639436266.JavaMail.zimbra@utbm.fr> CALL FOR PAPERS The 4th International Workshop on Agent-based Modeling and Applications with SARL (SARL-20) ------------------------------------------------------------------------------------------- In conjunction with the 11th International Conference on Ambient Systems, Networks, and Technologies ANT 2020 and the European SarlCon 2020 April 6 - 9, 2020, Warsaw, Poland. http://www.multiagent.fr/Conferences:SARL20 ------------------------------------------------------------------------------------------- Description =========== Research on Agents and Multi-Agent Systems has matured during the last decade and many effective applications of this technology are now deployed. SARL-20 provides an international forum to present and discuss the latest scientific developments and their effective applications, to assess the impact of the approach, and to facilitate technology transfer. SARL workshop was born with the SARL agent programming language, but the scientific results presented in SARL-20 are not restricted to SARL; other languages and agent platforms may be presented. SARL aims at providing the fundamental abstractions for dealing with concurrency, distribution, interaction, decentralization, reactivity, autonomy and dynamic reconfiguration. These high-level features are now considered as the major requirements for an easy and practical implementation of modern complex software applications. We are convinced that the agent-oriented paradigm holds the keys to effectively meet these features. Considering the variety of existing approaches and meta-models in the field of agent-oriented engineering and more generally multi-agent systems, our approach remains as generic as possible and highly extensible to easily integrate new concepts and features. The goal of SARL-20 is to provide a place where the different points of view on the modeling and the simulation with agent platforms and agent programming languages may be discussed. SARL-20 will be held in Warsaw, Poland (April 6 - 9, 2020) in conjunction with the 11th International Conference on Ambient Systems, Networks, and Technologies (ANT 2020) and the European SarlCon 2020. Topics ====== The main topics of the SARL-20 workshop are (but not restricted to): * Methods and Models: * Agent based Modeling and Simulation; * Agent programming language; * Agent based Simulation; * Agent oriented analysis and design methods; * Ontologies and theories about large urban systems; * Formal models of agent-based simulation; * Organizational models. * Applications: * Traffic/Transport; * Crowds; * Smart grids and smart buildings; * Land-Use; * Energy. Important Dates =============== * Submission deadline: December 15, 2019; * Notification: January 13, 2020; * Final date for camera-ready copy: February 10, 2020; * Workshop: April 6 - 9, 2020. Submission ========== All workshop accepted papers will be included in the conference proceedings published by Elsevier Science in the open-access Procedia Computer Science series online. The submitted paper must be formatted according to the guidelines of Procedia Computer Science, Elsevier. You are invited to submit full length papers in PDF format on EasyChair (https://www.easychair.org/conferences/?conf=sarl20), not exceeding 6 pages in length, in single-column format including diagrams and references while following the Procedia Computer Science guidelines. Papers that do not follow these guidelines may be rejected without consideration of their merits. All papers will be reviewed by at least two Program Committee members on the basis of technical quality, originality, clarity, and relevance to the track topics listed above. At least one author of each paper must attend the workshop to present the paper. Workshop Chairs =============== Stéphane GALLAND (Univ. de Technologie de Belfort-Montbéliard, France) Sebastian RODRIGUEZ (RMIT, Australia) Publicity Chair ================ Yazan MUALLA (Univ. de Technologie de Belfort-Montbéliard, France). -------------- next part -------------- An HTML attachment was scrubbed... URL: From yazan.mualla at utbm.fr Mon Sep 16 13:12:16 2019 From: yazan.mualla at utbm.fr (Yazan Mualla) Date: Mon, 16 Sep 2019 15:12:16 +0200 (CEST) Subject: [Haskell] Invitation to the 2nd European Forum for the SARL Users and Developers (EuSarlCon-20) Message-ID: <77698044.17486528.1568639536610.JavaMail.zimbra@utbm.fr> INVITATION FOR PAPERS AND TALKS The 2nd European Forum for the SARL Users and Developers (EuSarlCon-20) ----------------------------------------------------------------------- In conjunction with: * the 11th International Conference on Ambient Systems, Networks, and Technologies (ANT 2020); * the 9th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS-20); * the 4th International Workshop on Agent-based Modeling and Applications with SARL (SARL-20). April 6-9, 2020, Warsaw, Poland. http://www.multiagent.fr/Conferences:EuSarlCon20 ------------------------------------------------------------------- Description =========== The 2020 European SarlCon is the SARL user meeting that is organized in Europe in order to provide a place where SARL users and developers could exchange their experiences. It will be held on April 6-9, 2020, at Warsaw, Poland. That is the last day of the ANT-2020 conference, the ABMTRANS-20 and the SARL-20 workshops. Submissions directly for the EuSarlCon should take the form of an abstract (< 1000 words), and are to be submitted before February 10, 2020, through EasyChair. ABMTRANS-20 and SARL-20 are providing an alternative for publishing longer papers. Important Dates =============== * Submission deadline: January 31, 2020; * Notification: February 10, 2020; * Forum: April 6-9, 2020. Submission ========== You are invited to submit the abstract in PDF format on EasyChair (https://easychair.org/conferences/?conf=eusarlcon2020), not exceeding 1000 words in length. Organizer ========= Stéphane GALLAND (Univ. de Technologie de Belfort-Montbéliard, France) Yazan MUALLA (Univ. de Technologie de Belfort-Montbéliard, France). Registration ============ You must be registered to the ANT20 conference (http://cs-conferences.acadiau.ca/ant-20/), which provides access to its facilities, in order to be included in the list of the participants. When registering, you could select the specific fee of EuSarlCon20 about 100 euros. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Tue Sep 17 07:34:42 2019 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 17 Sep 2019 10:34:42 +0300 Subject: [Haskell] NWPT 2019 submission deadline extended Message-ID: <20190917103442.095d3aea@cs.ioc.ee> Extended submission deadline: 26 September 2019 CALL FOR CONTRIBUTIONS 31st Nordic Workshop on Programming Theory, NWPT 2019 Tallinn, Estonia, 13-15 November 2019 http://cs.ttu.ee/events/nwpt2019 Important Dates Submission of abstracts 26 September 2019 Notification 7 October 2019 Final versions 15 October 2019 Registration 15 October 2019 Background The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries, but also from elsewhere. List of Topics Semantics of programming languages Programming language design and programming methodology Programming logics Formal specification of programs Program verification Program construction Tools for program verification and construction Program transformation and refinement Real-time and hybrid systems Models of concurrency and distributed computing Model-based testing Language-based security Invited Speakers Mohamed Bettaz, Philadelphia University, Amman, Jordan Ando Saabas, Bolt, Estonia Pawel Sobocinski, Tallinn University of Technology, Estonia Submission Guidelines Authors wishing to give a talk at the workshop are requested to submit abstracts of 2-3 pages (pdf, printable on A4 paper, using easychair.cls) through EasyChair (https://easychair.org/conferences/?conf=nwpt2019) by 26 September 2019. Work in progress as well as abstracts of manuscripts submitted for formal publication elsewhere are permitted. The abstracts of the accepted contributions will be available electronically before the workshop. By submitting to EasyChair you agree that your abstract will be publicly available. Moreover, you as an author are responsible for the content. Post-workshop Publication We have arranged a special issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP) devoted to the best contributions to the workshop. The contributions will be selected by the PC. They will be invited after the workshop and will undergo a rigorous, journal-strength review process according to the standards of JLAMP. Program Committee Antonis Achilleos, Reykjavík University, Iceland Johannes Borgström, Uppsala University, Sweden Martin Elsman, University of Copenhagen, Denmark Daniel Fava, University of Oslo, Norway John Gallagher, RUC, Denmark Michael R. Hansen, DTU, Denmark Magne Haveraaen, University of Bergen, Norway Keijo Heljanko, University of Helsinki, Finland Thomas T. Hildebrandt, ITU Copenhagen, Denmark Einar Broch Johnsen, University of Oslo, Norway Jaakko Järvi, University of Bergen, Norway Yngve Lamo, Western Norway Univ. of Applied Sciences, Norway Kim G. Larsen, Aalborg University, Denmark Alberto Lluch Lafuente, DTU, Denmark Fabrizio Montesi, University of Southern Denmark, Denmark Wojciech Mostowski, Halmstad University, Sweden Olaf Owe, University of Oslo, Norway Philipp Rümmer, Uppsala University, Sweden Gerardo Schneider, University of Gothenburg, Sweden Cristina Seceleanu, Mälardalen University, Sweden Jiri Srba, Aalborg University, Denmark Tarmo Uustalu, Reykjavík University, Iceland Jüri Vain, Tallinn University of Techn., Estonia Antti Valmari, University of Jyväskylä, Finland Marina Waldén, Åbo Akademi University, Finland Organizing Committee Jüri Vain (chair) Tarmo Uustalu Leonidas Tsiopoulos Juhan Ernits Marko Kääramees Venue The 31st Nordic Workshop on Programming Theory 2019 will take place in the campus of Tallinn University of Technology. Contact Further information can be obtained by mailing the organizers at nwpt2019 at ttu.ee. From ksk at riec.tohoku.ac.jp Tue Sep 17 10:34:19 2019 From: ksk at riec.tohoku.ac.jp (Keisuke Nakano) Date: Tue, 17 Sep 2019 19:34:19 +0900 Subject: [Haskell] FLOPS 2020 First Call for papers Message-ID: <078F5504-EE68-46A2-A977-A5BC0130D879@riec.tohoku.ac.jp> FIRST Call For Papers FLOPS 2020: 15th International Symposium on Functional and Logic Programming =============================== 23-25 April, 2020, Akita, Japan https://www.ipl.riec.tohoku.ac.jp/FLOPS2020/ Writing down detailed computational steps is not the only way of programming. An alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style of programming include functional and logic programming, program transformation and rewriting, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming paradigm, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. *** Scope *** FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, rewriting systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers, verifying properties of programs using declarative programming techniques; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems, etc.), applications and case studies. FLOPS promotes ross-fertilization among different styles of declarative programming. Therefore, research papers must be written to be understandable by the wide audience of declarative programmers and researchers. In particular, each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant for its area, and comparing it with previous work. Submission of system descriptions and declarative pearls are especially encouraged. *** Submission *** Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should describe a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication. Submissions must be written in English and can be up to 15 pages excluding references, though system descriptions and pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to an anonymized Web page or an appendix, which does not count towards the page limit). However, it is the responsibility of the authors to guarantee that their paper can be understood and appreciated without referring to this supporting information; reviewers may simply choose not to look at it when writing their review. FLOPS 2020 will employ a lightweight double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work …" but rather "We build on the work of …"). The purpose of this process is to help the reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. Papers should be submitted electronically at EasyChair which will be available soon from the Web Site of FLOPS 2020. *** Proceedings *** The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series. *** Important Dates *** 15 November 2019 (AoE): Abstract submission 22 November 2019 (AoE): Submission deadline 24 January 2020: Author notification 16 February 2020: Camera ready due 23-25 April 2020: FLOPS Symposium *** Organizers *** Keisuke Nakano Tohoku University, Japan (PC Co-Chair, General Chair) Kostis Sagonas Uppsala University, Sweden (PC Co-Chair) Kazuyuki Asada Tohoku University, Japan (Local Co-Chair) Ryoma Sin'ya Akita University, Japan (Local Co-Chair) Katsuhiro Ueno Tohoku University, Japan (Local Co-Chair) *** Contact Address *** flops2020 _AT_ easychair.org ------------------------------------------------------------------------------- > From stefan.wehr at gmail.com Tue Sep 17 12:24:07 2019 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Tue, 17 Sep 2019 14:24:07 +0200 Subject: [Haskell] Call for Contributions: BOB 2020 [Feb 28, Deadline Nov 8] Message-ID: BOB Conference 2020 "What happens when we use what's best for a change?" http://bobkonf.de/2020/cfc.html Berlin, February 28 Call for Contributions Deadline: November 8, 2019 You are actively engaged in advanced software engineering methods, implement ambitious architectures and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! NOTE: The conference fee will be waived for presenters. Travel expenses will not be covered (for exceptions see "Speaker Grants"). Speaker Grants BOB has Speaker Grants available to support speakers from groups under-represented in technology. We specifically seek women speakers and speakers who are not be able to attend the conference for financial reasons. Shepherding ----------- The program committee offers shepherding to all speakers. Shepherding provides speakers assistance with preparing their sessions, as well as a review of the talk slides. Topics ------ We are looking for talks about best-of-breed software technology, e.g.: - functional programming - persistent data structures and database - event-based modelling and architectures - types - formal methods for correctness and robustness - abstractions for concurrency and parallelism - metaprogramming - probabilistic programming - math and programming - controlled side effects - beyond REST and SOAP - effective abstractions for data analytics - ... everything really that isn’t mainstream, but you think should be. Presenters should provide the audience with information that is practically useful for software developers. We're especially interested in experience reports. Other topics are also relevant, e.g.: - introductory talks on technical background - overviews of a given field - demos and how-tos Requirements ------------- We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. Your proposal should include (in your presentation language of choice): - An abstract of max. 1500 characters. - A short bio/cv - Contact information (including at least email address) - A list of 3-5 concrete ideas of how your work can be applied in a developer's daily life - additional material (websites, blogs, slides, videos of past presentations, …) Submit here: https://bobcfc.active-group.de/en/bob2020/cfp Organisation ------------ - Direct questions to contact at bobkonf dot de - Proposal deadline: November 8, 2019 - Notification: November 22, 2019 - Program: December 6, 2019 Program Committee ----------------- (more information here: https://bobkonf.de/2020/programmkomitee.html) - Matthias Fischmann, Wire - Matthias Neubauer, SICK AG - Nicole Rauch, Softwareentwicklung und Entwicklungscoaching - Michael Sperber, Active Group - Stefan Wehr, factis research Scientific Advisory Board - Annette Bieniusa, TU Kaiserslautern - Torsten Grust, Uni Tübingen - Peter Thiemann, Uni Freiburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Sat Sep 21 12:55:51 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Sat, 21 Sep 2019 12:55:51 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mm2 -- the library that can be used for optimization of multiple (Ord a) => a -> b transformations References: <318589141.14043764.1569070551084.ref@mail.yahoo.com> Message-ID: <318589141.14043764.1569070551084@mail.yahoo.com> Hello! My library that can help to optimize usage of the 'case ... of ...' construction if there are multiple (more than at least 5) variants is published on Hackage.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 14:20:02 GMT+2, Олександр Жабенко написав: Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. | | | | mm2: The library that can be used for optimization of multiple (Ord a) =... Install via `cabal install mm2`. | | | -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Sat Sep 21 12:59:38 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Sat, 21 Sep 2019 12:59:38 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> Message-ID: <621948562.14027387.1569070778626@mail.yahoo.com> Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. -------------- next part -------------- An HTML attachment was scrubbed... URL: From matthewtpickering at gmail.com Sat Sep 21 13:46:25 2019 From: matthewtpickering at gmail.com (Matthew Pickering) Date: Sat, 21 Sep 2019 14:46:25 +0100 Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <621948562.14027387.1569070778626@mail.yahoo.com> References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> <621948562.14027387.1569070778626@mail.yahoo.com> Message-ID: Have you benchmarked this library? I don't see how using a vector can be any faster than using a case. On Sat, 21 Sep 2019, 14:00 olexandr543--- via Haskell, wrote: > Hello! > > My library that can help to optimize using 'case ... of ...' construction > if there are multiple (more than at least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => > a -> b transformations > > Best regards, > Oleksandr Zhabenko. > > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Sat Sep 21 18:29:02 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Sat, 21 Sep 2019 18:29:02 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <1632488484.14151346.1569090395703@mail.yahoo.com> References: <1632488484.14151346.1569090395703.ref@mail.yahoo.com> <1632488484.14151346.1569090395703@mail.yahoo.com> Message-ID: <2132552454.14172643.1569090542641@mail.yahoo.com> Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:26:35 GMT+3, Олександр Жабенко написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 20:04:32 GMT+2, olexandr543 at yahoo.com написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 15:46:38 GMT+2, Matthew Pickering написав: Have you benchmarked this library?  I don't see how using a vector can be any faster than using a case. On Sat, 21 Sep 2019, 14:00 olexandr543--- via Haskell, wrote: Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. _______________________________________________ Haskell mailing list Haskell at haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell -------------- next part -------------- An HTML attachment was scrubbed... URL: From david.feuer at gmail.com Sat Sep 21 18:39:04 2019 From: david.feuer at gmail.com (David Feuer) Date: Sat, 21 Sep 2019 14:39:04 -0400 Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <621948562.14027387.1569070778626@mail.yahoo.com> References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> <621948562.14027387.1569070778626@mail.yahoo.com> Message-ID: Case matching is already optimized in GHC. There might be ways to improve it, but it already uses binary search and/or jump tables to improve performance when there are many branches. On Sat, Sep 21, 2019, 8:59 AM olexandr543--- via Haskell < haskell at haskell.org> wrote: > Hello! > > My library that can help to optimize using 'case ... of ...' construction > if there are multiple (more than at least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => > a -> b transformations > > Best regards, > Oleksandr Zhabenko. > > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: From godzbanebane at gmail.com Sat Sep 21 18:40:16 2019 From: godzbanebane at gmail.com (Georgi Lyubenov) Date: Sat, 21 Sep 2019 21:40:16 +0300 Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <2132552454.14172643.1569090542641@mail.yahoo.com> References: <1632488484.14151346.1569090395703.ref@mail.yahoo.com> <1632488484.14151346.1569090395703@mail.yahoo.com> <2132552454.14172643.1569090542641@mail.yahoo.com> Message-ID: case_of_ in Haskell should be constant - Your constructors are ints, you know in advance how many there are, so you can just jump with an offset? (I haven't actually checked this, but it doesn't seem unreasonable to me, that this would be the implementation) ======= Georgi -------------- next part -------------- An HTML attachment was scrubbed... URL: From bryon at btjanaka.net Sat Sep 21 18:43:08 2019 From: bryon at btjanaka.net (Bryon Tjanaka) Date: Sat, 21 Sep 2019 11:43:08 -0700 Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> <621948562.14027387.1569070778626@mail.yahoo.com> Message-ID: At any rate, using binary search doesn’t automatically guarantee faster runtime. Constant factors can add up, and there might not even be enough elements to warrant binary search. Benchmarking on realistic data is definitely a good idea. On Sat, Sep 21, 2019 at 11:39 AM David Feuer wrote: > Case matching is already optimized in GHC. There might be ways to improve > it, but it already uses binary search and/or jump tables to improve > performance when there are many branches. > > On Sat, Sep 21, 2019, 8:59 AM olexandr543--- via Haskell < > haskell at haskell.org> wrote: > >> Hello! >> >> My library that can help to optimize using 'case ... of ...' construction >> if there are multiple (more than at least 5) variants. >> mm2: The library that can be used for optimization of multiple (Ord a) => >> a -> b transformations >> >> Best regards, >> Oleksandr Zhabenko. >> >> >> _______________________________________________ >> Haskell mailing list >> Haskell at haskell.org >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell >> > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > -- [image: logo] Bryon Tjanaka *"Audentes fortuna iuvat"* btjanaka.netgithub.com/btjanaka -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Sat Sep 21 18:59:03 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Sat, 21 Sep 2019 18:59:03 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <1736239575.14166935.1569091938892@mail.yahoo.com> References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> <621948562.14027387.1569070778626@mail.yahoo.com> <1736239575.14166935.1569091938892@mail.yahoo.com> Message-ID: <1768102992.14159666.1569092343190@mail.yahoo.com> Yes, you can use IntMap. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping.  For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do          args <- getArgs         let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"]          b :: I.CuckooHashTable String Char <- I.fromList a          c <- I.lookup b ("kn")          let d1 u = do                   d <- I.lookup b u                  print c                  if isJust d                     then putStrLn . show . fromJust $ d                     else putStrLn "Nothing"                  return ()          if null args            then d1 "fa"           else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:52:18 GMT+3, olexandr543 at yahoo.com написав: Yes, you can. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do          args <- getArgs         let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"]          b :: I.CuckooHashTable String Char <- I.fromList a          c <- I.lookup b ("kn")          let d1 u = do                   d <- I.lookup b u                  print c                  if isJust d                     then putStrLn . show . fromJust $ d                     else putStrLn "Nothing"                  return ()          if null args            then d1 "fa"           else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:34:38 GMT+3, Henning Thielemann написав: On Sat, 21 Sep 2019, olexandr543--- via Haskell wrote: > My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at > least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Isn't this a problem you would solve using Data.Map? -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Sat Sep 21 19:09:29 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Sat, 21 Sep 2019 19:09:29 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations In-Reply-To: <1453995847.14170788.1569092845546@mail.yahoo.com> References: <621948562.14027387.1569070778626.ref@mail.yahoo.com> <621948562.14027387.1569070778626@mail.yahoo.com> <1736239575.14166935.1569091938892@mail.yahoo.com> <1768102992.14159666.1569092343190@mail.yahoo.com> <1453995847.14170788.1569092845546@mail.yahoo.com> Message-ID: <289934451.14142091.1569092969439@mail.yahoo.com> I did not check the code for 'case ... of ...' constuction in GHC, my intention comes from the explanations how this construction works in Haskell in some teaching materials.So, definitely I should do more exploratory work. Nevertheless, the type signatures and sorting is realized for rather general situation and can be therefore preferable for some situations. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:07:25 GMT+2, Олександр Жабенко написав: I did not check the code for 'case ... of ...' constuction in GHC, my intention comes from the explanations how this construction works in Haskell in some teaching materials.So, definitely I should do more exploratory work. Nevertheless, the type signatures and sorting is realized for rather general situation and can be therefore preferable for some situations. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 20:59:03 GMT+2, olexandr543 at yahoo.com написав: Yes, you can use IntMap. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping.  For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do          args <- getArgs         let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"]          b :: I.CuckooHashTable String Char <- I.fromList a          c <- I.lookup b ("kn")          let d1 u = do                   d <- I.lookup b u                  print c                  if isJust d                     then putStrLn . show . fromJust $ d                     else putStrLn "Nothing"                  return ()          if null args            then d1 "fa"           else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:52:18 GMT+3, olexandr543 at yahoo.com написав: Yes, you can. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do          args <- getArgs         let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"]          b :: I.CuckooHashTable String Char <- I.fromList a          c <- I.lookup b ("kn")          let d1 u = do                   d <- I.lookup b u                  print c                  if isJust d                     then putStrLn . show . fromJust $ d                     else putStrLn "Nothing"                  return ()          if null args            then d1 "fa"           else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:34:38 GMT+3, Henning Thielemann написав: On Sat, 21 Sep 2019, olexandr543--- via Haskell wrote: > My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at > least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Isn't this a problem you would solve using Data.Map? -------------- next part -------------- An HTML attachment was scrubbed... URL: From olexandr543 at yahoo.com Tue Sep 24 19:39:07 2019 From: olexandr543 at yahoo.com (olexandr543 at yahoo.com) Date: Tue, 24 Sep 2019 19:39:07 +0000 (UTC) Subject: [Haskell] ANNOUNCE: mmsyn2 -- a new library instead of deprecated mm2 References: <383506651.16074054.1569353947171.ref@mail.yahoo.com> Message-ID: <383506651.16074054.1569353947171@mail.yahoo.com> Hello! I made mm2 deprecated because of collision with other names (see e. g.: MM2 | | | | MM2 Mm2 is a short form for square megameter, also an international unit of area. | | | ). Now its successor is named mmsyn2 (mmsyn2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations | | | | mmsyn2: The library that can be used for optimization of multiple (Ord a... Install via `cabal install mmsyn2`. | | | ). I made some optimization improvements while benchmark testing, but the last one is not yet complete and ready at the moment. Therefore, I left the documentation (except some minor corrections) and work on testing.  Best regards,Oleksandr Zhabenko. вівторок, 24 вересня 2019 р., 22:37:03 GMT+3, Олександр Жабенко написав: Hello! I made mm2 deprecated because of collision with other names (see e. g.: MM2 | | | | MM2 Mm2 is a short form for square megameter, also an international unit of area. | | | ). Now its successor is named mmsyn2 (mmsyn2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations | | | | mmsyn2: The library that can be used for optimization of multiple (Ord a... Install via `cabal install mmsyn2`. | | | ). I made some optimization improvements while benchmark testing, but the last one is not yet complete and ready at the moment. Therefore, I left the documentation (except some minor corrections) and work on testing.  Best regards,Oleksandr Zhabenko. -------------- next part -------------- An HTML attachment was scrubbed... URL: From nevrenato at gmail.com Wed Sep 25 22:06:00 2019 From: nevrenato at gmail.com (Renato Neves) Date: Wed, 25 Sep 2019 23:06:00 +0100 Subject: [Haskell] FM'19 - Last call for participation References: <000309a86710b559fd51f7fe4b1de56f9aa06e42.camel@gmail.com> Message-ID: <5577d11c2ef318f93d06244e54a4e5761dc887cd.camel@gmail.com> 3rd World Congress on Formal Methods Porto, October 7-11, 2019 http://formalmethods2019.inesctec.pt/ @formalmethods19 ______________________________________________________________ *** Apologies for cross-posting *** ______________________________________________________________ *** FM Week News: Tony Hoare's keynote (Oct 8) jointly organized by UTP'19, LOPSTR'19, MPC'19, PPDP'19 and RV'19 will mark the 50th anniversary (October 1969) of the publication of "An Axiomatic Basis for Computer Programming”. ______________________________________________________________ The FM'19 World Congress on Formal Methods will take place at the Alfandega do Porto Congress Center, Porto, October 7-11, 2019, under the motto "The Next 30 Years". Registration is open at https://bit.ly/2JfdBjO as follows: . Early – until Sep 10 (AoE) . Late – from Sep 11 until Oct 5 (AoE) . On site – from Oct 6 to Oct 11 (AoE) Further to the Industry day, Tool Exhibition, Doctoral Symposium (and a social event on Oct 10), FM'19 involves more than 30 parallel events (symposia, conferences, workshops and tutorials) spreading over several FM related areas: . FM 2019 – 23rd International Symposium on Formal Methods . LOPSTR 2019 – 29th International Symposium on Logic-Based Program Synthesis and Transformation . MPC 2019 – 13th International Conference on Mathematics of Program Construction . PPDP 2019 – 21st International Symposium on Principles and Practice of Declarative Programming . RV 2019 – 19th International Conference on Runtime Verification . SAS 2019 – 26th International Static Analysis Symposium . TAP 2019 – 13th International Conference on Tests and Proofs . UTP 2019 – 7th International Symposium on Unifying Theories of Programming . VECoS 2019 – 13th International Conference on Verification and Evaluation of Computer and Communication Systems . AFFORD 2019 – Practical Formal Verification for Software Dependability . DALI 2019 – 2nd Workshop on Dynamic Logic: New Trends and Applications . DataMod 2019 – 8th International Symposium “From Data to Models and Back (DataMod)” . FMAS 2019 – Formal Methods for Autonomous Systems . FMBC 2019 – Workshop on Formal Methods for Blockchains . FMIS 2019 – 8th Formal Methods for Interactive Systems Workshop . FMTea 2019 – Formal Methods Teaching Workshop and Tutorial . F-IDE 2019 – 5th Workshop on Formal Integrated Development Environment . HFM 2019 – History of Formal Methods . NSAD 2019 – 8th International Workshop on Numerical and Symbolic Abstract Domains . OpenCERT 2019 – 9th Int. Workshop on Open Community approaches to Education, Research and Technology . OVT 2019 – 17th Overture Workshop . REFINE 2019 – 19th Refinement Workshop . RPLA 2019 – Reversibility in Programming, Languages, and Automata . SASB 2019 – 10th International Workshop on Static Analysis and Systems Biology . TAPAS 2019 – 10th Workshop on Tools for Automatic Program Analysis . ALLOY – Formal software design with Alloy and Electrum (Tutorial) . CbC – The Correctness by Construction Approach to Programming (Tutorial) . FRAMA-C-IoT – Formal Verification of IoT Software with Frama-C (Tutorial) . KEYMAERA X – Modular Formal Verification of Cyber-Physical Systems with KeYmaera X (Tutorial) . SRV – Stream-based Runtime Verification (Tutorial) As a whole, the FM'19 congress will bring together a distinguished group of 40+ world-top guest speakers whose short bios can be found at https://bit.ly/2Io2Lsh. The FM'19 organizers thank all corporations that have been so kind to sponsor the Congress – please see the 'Sponsor FM'19' gallery at https://bit.ly/2CrKnMA. For more information, please visit the following pages of the FM'19 website: . FM Week - https://bit.ly/2zsyCUu . Accepted papers - https://bit.ly/2YtIp9Y (updated as data arrive from event chairs; currently: 344 papers involving 750 authors) . Call for participation - https://bit.ly/2JfdBjO . Registration page - https://bit.ly/2NTR9SR . Venue - https://bit.ly/2MdNCMu . Accommodation - https://bit.ly/2OuHXEu . Getting to Porto - https://bit.ly/2ykguKN . Social program - https://bit.ly/2JfdBjO . Weather forecast - https://bit.ly/2SLOKZ5 (or https://bit.ly/2YjeEo3 for more details) Contact: contactfm2019 at inesctec.pt We are also on Twitter: @formalmethods19 _____________________________________________________________ *** Welcome to FM'19 *** *** Welcome to PORTO *** *** Welcome to Portugal *** ______________________________________________________________ From wim.ectors at uhasselt.be Thu Sep 26 11:10:12 2019 From: wim.ectors at uhasselt.be (Wim Ectors) Date: Thu, 26 Sep 2019 06:10:12 -0500 Subject: [Haskell] [ABMTRANS-2020] 9th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications. Warsaw, Poland (April 6-9, 2020) Message-ID: The 11th International Conference on Ambient Systems, Networks and Technologies (ANT) Warsaw, Poland April 6-9, 2020 Conference Website: http://cs-conferences.acadiau.ca/ant-20/ Workshops: http://cs-conferences.acadiau.ca/ant-20/#workshop Tutorials: http://cs-conferences.acadiau.ca/ant-20/#tutorial Important Dates - Workshops Proposals Due: October 15, 2019 - Paper Submission Due: November 15, 2019 - Acceptance Notification: January 13, 2020 - Camera-Ready Submission: February 10, 2020 ANT 2020 accepted papers will be published by Elsevier Science in the open-access Procedia Computer Science series on-line. Procedia Computer Science is hosted by Elsevier on www.Elsevier.com and on Elsevier content platform ScienceDirect (www.sciencedirect.com), and will be freely available worldwide. All papers in Procedia will be indexed by Scopus ( www.scopus.com) and by Thomson Reuters' Conference Proceeding Citation Index (http://thomsonreuters.com/conference-proceedings-citation-index/). All papers in Procedia will also be indexed by Scopus (www.scopus.com) and Engineering Village (Ei) (www.engineeringvillage.com). This includes EI Compendex (www.ei.org/compendex). Moreover, all accepted papers will be indexed in DBLP (http://dblp.uni-trier.de/). The papers will contain linked references, XML versions and citable DOI numbers. You will be able to provide a hyperlink to all delegates and direct your conference website visitors to your proceedings. Selected papers will be invited for publication, in the special issues of: - Journal of Ambient Intelligence and Humanized Computing (IF: 1.910), by Springer (http://www.springer.com/engineering/journal/12652) - International Journal of Computing and Informatics (IF: 0.524), by Computing and Informatics (http://www.cai.sk/ojs/index.php/cai/index) ANT 2020 will be held in Warsaw, Poland. Warsaw is the capital and largest city of Poland. The metropolis stands on the Vistula River in east-central Poland and its population is officially estimated at 1.770 million residents within a greater metropolitan area of 3.1 million residents, which makes Warsaw the 8th most-populous capital city in the European Union. The city limits cover 516.9 square kilometres (199.6 sq mi), while the metropolitan area covers 6,100.43 square kilometres (2,355.39 sq mi). Warsaw is an alpha global city, a major international tourist destination, and a significant cultural, political and economic hub. Its historical Old Town was designated a UNESCO World Heritage Site. ANT 2020 will be held in conjunction with the 3rd International Conference on Emerging Data and Industry 4.0 (EDI40, http://cs-conferences.acadiau.ca/edi40-20/). Conference Tracks - Agent Systems, Intelligent Computing and Applications - Big Data and Analytics - Cloud Computing - Context-awareness and Multimodal Interfaces - Emerging Networking, Tracking and Sensing Technologies - Human Computer Interaction - Internet of Things - Mobile Networks, Protocols and Applications - Modelling and Simulation in Transportation Sciences - Multimedia and Social Computing - Service Oriented Computing for Systems & Applications - Smart, Sustainable Cities and Climate Change Management - Smart Environments and Applications - Systems Security and Privacy - Systems Software Engineering - Vehicular Networks and Applications - General Track Committees General Chairs Atta Badii, University of Reading, UK Albert Zomaya, The University of Sydney, Australia Program Chairs Hossam Hassanein, Queen's University, Canada Ansar-Ul-Haque Yasar, IMOB – Hasselt University, Belgium Local Chair Nuno Varandas, F6S (Where Founders Grow Together), Portugal Workshops Chair Stephane Galland, UTBM, France Program Vice Chairs Boulmakoul Azedine, Hassan II University, Morocco Nik Bessis, Edge Hill University, UK Kechar Bouabdellah, Oran 1 Ahmed BenBella University, Algeria Samia Bouzefrane,CEDRIC Lab Conservatoire National des Arts et Métiers, France Robertas Damasevicius, Kaunas University of Technology, Lithuania Roberto Di Pietro, Hamad Bin Khalifa University, Qatar Salem Gharbia, University College Dublin, Ireland Jason Jaskolka, Carleton University, Canada Faouzi Kammoun, Ecole Supérieure Privée d'Ingénierie et de Technologies, Tunis Natalia Kryvinska, University of Vienna, Austria Flavio Lombardi, Roma Tre University of Rome, Italy Vuk Marojevic, Mississippi State University, USA Haroon Malik, Marshall University, USA Ahmed Nait Sidi Moh, University of Picardie Jules Verne, France Aneta Poniszewska-MaraÅ„da, Lodz University of Technology, Poland Stefan Schulte, TU Wien, Austria Miguel Sepulcre, Miguel Hernandez University of Elche, Spain Khaled Shaaban, Qatar University, Qatar Yves Vanrompay, Hasselt University, Belgium Publicity Chairs Wim Ectors, Hasselt University, Belgium Joanna Ochelska-Mierzejewska, Lodz University of Technology, Poland Josep-Maria Salanova, CERTH, Greece International Journals Chair Michael Sheng, Macquarie University, Australia Advisory Committee Reda Alhajj, University of Calgary, Canada Sajal K. Das, The University of Texas at Arlington, USA Erol Gelenbe, Imperial College, UK Ibad Kureshi, Inlecomm Systems, Belgium Vincenzo Loia, University of Salerno, Italy Peter Sloot, Universiteit van Amsterdam, Netherlands Ralf Steinmetz, Technische Universitaet Darmstadt, Germany Katia Sycara, Carnegie Mellon University, USA Peter Thomas, Manifesto Research, Australia International Liaison Chairs Soumaya Cherkaoui, Sherbrooke University, Canada Paul Davidsson, Malmo University, Sweden David Taniar, Monash University, Australia Technical Program Committee http://cs-conferences.acadiau.ca/ant-20/#programCommittees Steering Committee Chair and Founder of ANT Elhadi Shakshuki, Acadia University, Canada Sent via Mail Merge -------------- next part -------------- An HTML attachment was scrubbed... URL: From wim.ectors at uhasselt.be Thu Sep 26 11:14:50 2019 From: wim.ectors at uhasselt.be (Wim Ectors) Date: Thu, 26 Sep 2019 06:14:50 -0500 Subject: [Haskell] [EDI-2020] Call for workshop proposals: 3rd International Conference on Emerging Data and Industry 4.0. Warsaw, Poland (April 6-9, 2020) Message-ID: *************************************************************************** The 3rd International Conference on Emerging Data and Industry 4.0 (EDI40) Warsaw, Poland April 6-9, 2020 *************************************************************************** Conference Website: http://cs-conferences.acadiau.ca/EDI40-20/ Workshops: http://cs-conferences.acadiau.ca/EDI40-20/#workshop Important Dates - Workshops Proposals Due: October 15, 2019 - Paper Submission Due: November 15, 2019 - Acceptance Notification: January 13, 2020 - Camera-Ready Submission: February 10, 2020 EDI40 2020 accepted papers will be published by Elsevier Science in the open-access Procedia Computer Science series on-line. Procedia Computer Science is hosted by Elsevier on www.Elsevier.com and on Elsevier content platform ScienceDirect (www.sciencedirect.com), and will be freely available worldwide. All papers in Procedia will be indexed by Scopus ( www.scopus.com) and by Thomson Reuters' Conference Proceeding Citation Index (http://thomsonreuters.com/conference-proceedings-citation-index/). All papers in Procedia will also be indexed by Scopus (www.scopus.com) and Engineering Village (Ei) (www.engineeringvillage.com). This includes EI Compendex (www.ei.org/compendex). Moreover, all accepted papers will be indexed in DBLP (http://dblp.uni-trier.de/). The papers will contain linked references, XML versions and citable DOI numbers. You will be able to provide a hyperlink to all delegates and direct your conference website visitors to your proceedings. Selected papers will be invited for publication, in the special issues of: - International Journal of Ambient Intelligence and Humanized Computing (IF: 1.910), by Springer (http://www.springer.com/engineering/journal/12652) - International Journal of Computing and Informatics (IF: 0.524), by Computing and Informatics (http://www.cai.sk/ojs/index.php/cai/index) EDI40 2019 will be held in Warsaw, Poland. Warsaw is the capital and largest city of Poland. The metropolis stands on the Vistula River in east-central Poland and its population is officially estimated at 1.770 million residents within a greater metropolitan area of 3.1 million residents, which makes Warsaw the 8th most-populous capital city in the European Union. The city limits cover 516.9 square kilometres (199.6 sq mi), while the metropolitan area covers 6,100.43 square kilometres (2,355.39 sq mi). Warsaw is an alpha global city, a major international tourist destination, and a significant cultural, political and economic hub. Its historical Old Town was designated a UNESCO World Heritage Site. EDI40 2019 will be held in conjunction with the 11th International Conference on Ambient Systems, Networks and Technologies (ANT, http://cs-conferences.acadiau.ca/ant-20/). Conference Tracks - Benefits of Industry 4.0 - Big Data and Analytics - Cloud Computing - Cognitive Computing - Computational Intelligence - Cyber-Physical Systems (CPS) - Fog Computing and Edge Computing - Internet of Everything (IoE) - Standards for IoT Application Integration - The New Business Models in Industry 4.0 - General Track: Digitalization Startegies Committees General Chair Danny Hughes, CTO VeraSense NV, Belgium Program Chairs Jamal Bentahar, Concordia University, Canada Haroon Malik, Marshall University, USA Local Chair Nuno Varandas, F6S (Where Founders Grow Together), Portugal Workshops Chair Stephane Galland, UTBM, France Program Advisory Committee Reda Alhajj, University of Calgary, Canada Ladislav Hluchy, Institute of Informatics, Slovak Academy of Sciences, Slovakia Vincenzo Loia, University of Salerno, Italy Peter Sloot, Universiteit van Amsterdam, Netherlands Peter Thomas, Manifesto Research, Australia Mohamed Younis, University of Maryland Baltimore County, USA International Journals Chair Michael Sheng, Macquarie University, Australia Publicity Chairs Wim Ectors, Hasselt University, Belgium Faouzi Kammoun, Ecole Supérieure Privée d'Ingénierie et de Technologies, Tunis Aneta Poniszewska-MaraÅ„da, Lodz University of Technology, Poland Technical Program Committee http://cs-conferences.acadiau.ca/EDI40-20/#programCommittees International Liaison Chairs Soumaya Cherkaoui, Sherbrooke University, Canada Nik Bessis, Edge Hill University, UK David Taniar, Monash University, Australia Steering Committee Chair and Founder Elhadi Shakshuki, Acadia University, Canada Sent via Mail Merge -------------- next part -------------- An HTML attachment was scrubbed... URL: