From stefan.wehr at gmail.com Wed Dec 1 13:32:31 2021 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Wed, 1 Dec 2021 14:32:31 +0100 Subject: [Haskell] 2nd Call for Contributions: BOB 2022 [March 11, Deadline Dec 6] Message-ID: ================================================================================ BOB Conference 2022 "What happens when we use what's best for a change?" https://bobkonf.de/2022/cfc.html Berlin, Mar 11 Call for Contributions Deadline: December 6, 2021 ================================================================================ You are actively engaged in advanced software engineering methods, solve ambitious problem with software 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"). Online or Onsite ---------------- We expect we'll be able to hold BOB 2022 in Berlin. If that is not possible, we'll make BOB a successful online event, like BOB 2021. Should BOB happen online, we will likely ask for pre-recorded talks to make room for questions and social interactions during the actual conference day. (Of course, we'll provide assistance making those recordings.) Tutorials will likely happen as a live-session. Shepherding ----------- The program committee offers shepherding to all speakers. Shepherding provides speakers assistance with preparing their sessions. Specifically: - advice on structure and presentation - review of talk slides - assistance with recording - review of recording, if applicable Speaker Grants -------------- BOB has Speaker Grants available to support speakers from groups under-represented in technology. We specifically seek women speakers, speakers of color, and speakers who are not able to attend the conference for financial reasons. Topics ------ We are looking for talks about best-of-breed software technology, e.g.: - functional programming - persistent data structures and databases - event-based modelling and architecture - "fancy types" (dependent types, gradual typing, linear types, ...) - formal methods for correctness and robustness - abstractions for concurrency and parallelism - metaprogramming - probabilistic programming - math and programming - controlled side effects - program synthesis - next-generation IDEs - 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. Challenges ---------- Furthermore, we seek contributions on successful approaches for solving hard problems, for example: - bias in machine-learning systems - digital transformation in difficult settings - accessibiltity - systems with critical reliability requirements - ecologically sustainable software development 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, …) - Don't be confused: The system calls a submission event. Organisation ------------ - Direct questions to contact at bobkonf dot de - Proposal deadline: December 6, 2021 - Notification: December 17, 2021 - Program: December 22, 2021 Submit here: https://bobcfc.active-group.de/en/bob2022/cfp Program Committee ----------------- (more information here: https://bobkonf.de/2022/programmkomitee.html) - Matthias Fischmann, Wire - Matthias Neubauer, SICK AG - Nicole Rauch, Softwareentwicklung und Entwicklungscoaching - Michael Sperber, Active Group - Stefan Wehr, Hochschule Offenburg 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 icfp.publicity at googlemail.com Wed Dec 8 20:01:03 2021 From: icfp.publicity at googlemail.com (Ilya Sergey) Date: Thu, 09 Dec 2021 04:01:03 +0800 Subject: [Haskell] Call for Workshop Proposals: ICFP 2022 Message-ID: <61b10eff11980_15adc3fdd9842ffd057270@ilya-work-macbook.mail> CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2022 27th ACM SIGPLAN International Conference on Functional Programming September 11 - 16, 2022 Ljubljana, Slovenia https://icfp22.sigplan.org/ The 27th ACM SIGPLAN International Conference on Functional Programming will be held in Ljubljana, Slovenia on September 11 - 16, 2022, with the option of virtual participation. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as symposiums) to be affiliated with ICFP 2022 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 11th (the day before ICFP) and September 15-16th (the two days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 24, 2021 Notification of acceptance: January 10, 2022 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2022 workshop co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou) via email to icfp-workshops-2022 at googlegroups.com by December 24, 2021. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by January 10, 2022, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2022-files/icfp22-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Proposals/Sponsored/ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2022 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Arthur Azevedo de Amorim (Boston University) Workshop Co-Chair: Zoe Paraskevopoulou (Northeastern University) General Chair: Andrej Bauer (University of Ljubljana) Program Chair: Zena Ariola (University of Oregon) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou), via email to icfp-workshops-2022 at googlegroups.com. From andrei.h.popescu at gmail.com Thu Dec 9 00:14:36 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Thu, 9 Dec 2021 00:14:36 +0000 Subject: [Haskell] Certified Programs and Proofs (CPP) 2022: Call for Participation Message-ID: *** Call for Participation *** *** Certified Programs and Proofs (CPP) 2022 *** - Early registration deadline: 3 January 2022 - Getting a visa: https://popl22.sigplan.org/attending/visa-information - Registration: https://popl22.sigplan.org/attending/registration - Further reduced student participation fee: see below - Accommodation: https://popl22.sigplan.org/venue/POPL-2022-venue Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2022 (https://popl22.sigplan.org/home/CPP-2022) will be held on 17-18 January 2022 and will be co-located with POPL 2022. CPP 2022 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG, and supported by a diverse set of industrial sponsors. Similarly to other events collocated with POPL 2022, CPP will take place as an in-person event at the Westin Philadelphia (99 South 17th Street at Liberty Place, 19103 Philadelphia), and will require attendees to provide proof of vaccination (details will be available soon). Authors who are unable to attend CPP in person will be able to present remotely. All talks will be recorded, and all recordings will be available either as a livestream or soon afterwards. For more information about this edition and the CPP series, please visit https://popl22.sigplan.org/home/CPP-2022 ### Invited talks * June Andronick (UNSW Sydney). The seL4 verification: the art and craft of proof and the reality of commercial support * Andrew W. Appel (Princeton). Coq’s vibrant ecosystem for verification engineering * Cesar Munoz (Currently at AWS, Formerly at NASA, USA). Structural Embeddings Revisited ### Accepted papers The list of accepted papers is available at https://popl22.sigplan.org/home/CPP-2022#event-overview ### Subsidized student registration To facilitate in-person participation of undergraduate and graduate students who require financial assistance, CPP 2022 offers the opportunity to register at a special reduced rate, determined on a case-by-case basis, and implemented using a special-purpose registration code on POPL's registration website. Students wishing to apply for such support may do so by sending an email to the CPP conference co-chairs (Beringer and Krebbers, see below for their email) preferably by December 24, 2021, with a brief description of their situation. Notifications will be sent out at most one week later; hence, students who cannot be supported will still have the opportunity to register at the publicly available reduced rate, which is available until January 3rd. Applications arriving after December 24th will be considered only in exceptional cases. Students who already receive registration support for PLMW or are supported by SIGPLAN PAC are not eligible. CPP's student support is made possible by our generous industrial supporters: https://popl22.sigplan.org/home/CPP-2022 ### Contact For any questions please contact the chairs: Andrei Popescu (PC co-chair) Steve Zdancewic (PC co-chair) Lennart Beringer (conference co-chair) Robbert Krebbers (conference co-chair) From alex at ittc.ku.edu Thu Dec 9 16:23:57 2021 From: alex at ittc.ku.edu (Perry Alexander) Date: Thu, 9 Dec 2021 10:23:57 -0600 Subject: [Haskell] Tenure Track Position at University of Kansas Message-ID: The University of Kansas (KU) Department of Electrical Engineering and Computer Science (EECS) seeks outstanding individuals for a full-time, tenure track, academic year (9-month) position in Computer Science. Successful candidates are expected to contribute to the development of academic programs and contribute to the research community. Applicants are expected to have an earned doctorate, or equivalent in Computer Science, Computer Engineering, Electrical Engineering, or closely related fields at the time of appointment. The following position is open at the assistant professor (tenure-track) level, with experience in any area related to programming languages and/or static analysis, including but not limited to: type systems; language semantics; automated software engineering; program analysis; partial evaluation; symbolic execution; and/or model checking. Application areas including high-assurance systems; resiliency; trustworthy systems; and/or secure systems are particularly desirable. Exceptional applicants in other closely related areas to the above topics may be considered. EECS is the largest department in the KU School of Engineering with 34 faculty members and a research volume of over $6 million per year. Faculty engage in research projects across multiple areas of interest through the department, the Information and Telecommunication Technology Center (ITTC), the Center for Remote Sensing of Ice Sheets (CReSIS), and the KU Medical Center. The EECS department offers undergraduate and graduate degrees in electrical engineering, computer engineering, computer science, and interdisciplinary computing. The department has approximately 750 undergraduate and 150 graduate students. The University of Kansas School of Engineering (SoE) and the EECS Department strongly value diversity, equity, and inclusion. In a continuing effort to enrich its academic environment and provide equal educational and employment opportunities, the university actively encourages applications from members of underrepresented groups in higher education. Please visit https://employment.ku.edu/academic/20401BR to apply. -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 528 bytes Desc: Message signed with OpenPGP URL: From james.cheney at gmail.com Tue Dec 14 14:57:06 2021 From: james.cheney at gmail.com (James Cheney) Date: Tue, 14 Dec 2021 14:57:06 +0000 Subject: [Haskell] Call for Participation: 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Message-ID: === Call for Participation === 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Philadelphia, Pennsylvania, United States 17-18th January 2022 https://popl22.sigplan.org/home/PADL-2022 Co-located with POPL 2022 == Venue and Conference Format == PADL 2022 is co-located with POPL 2022, which will be held in-person in Philadelphia at the Westin Philadelphia ( https://www.marriott.com/hotels/travel/phlwi-the-westin-philadelphia). Authors that are unable to be at PADL in person can give their talk remotely. All talks will be recorded, and all recordings will be available either as a livestream or soon afterwards. For more details visit the POPL 2022 website: https://popl22.sigplan.org/ == Program == Conference program can be found at: https://popl22.sigplan.org/home/PADL-2022#program == Invited Talks== PADL 2022 features two invited talks: “People, Ideas, and the Path Ahead” by Marcello Balduccini (https://www.sju.edu/faculty/marcello-balduccini/) “Declarative Programming and Education” by Shriram Krishnamurthi (https://cs.brown.edu/~sk/) == Registration == Registration is open at: https://popl22.sigplan.org/attending/registration The early registration deadline is January 3. At least one author of each accepted paper must get registered. == Conference Description == Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already successfully applied to many different real-world situations, ranging from database management to active networks to software engineering to decision support systems. New developments in theory and implementation fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. == Program Chairs == - James Cheney, University of Edinburgh - Simona Perri, University of Calabria == Program Committee == Andres Löh, WellTyped Chiaki Sakama, Wakayama University Daniela Inclezan, Miami University Ekaterina Komendantskaya, Heriot-Watt University Esra Erdem, Sabanci University Francesco Calimeri, University of Calabria Jan Christiansen, Flensburg University of Applied Sciences Konstantin Schekotihin, University of Klagenfurt Lionel Parreaux, Hong Kong University of Science and Technology Lukasz Ziarek, University at Buffalo, United States Marco Maratea, University of Genova Marina De Vos, University of Bath Martin Erwig, Oregon State University Martin Gebser, University of Klagenfurt Michael Greenberg, Stevens Institute of Technology Paul Tarau, University of North Texas Pavan Kumar Chittimalli, TCS Research, India Pedro Cabalar, University of Corunna Roly Perera, The Alan Turing Institute Tomas Petricek, University of Kent Torsten Grust, University of Tübingen Tran Cao Son, New Mexico State University Yukiyoshi Kameyama, University of Tsukuba -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Wed Dec 15 10:36:25 2021 From: brucker at spamfence.net (Achim D. Brucker) Date: Wed, 15 Dec 2021 10:36:25 +0000 Subject: [Haskell] Fully (UK Home) Funded PhD Positions in the Safety and Security of Advanced Systems Group (Exeter, UK, Deadline 2021-01-24) Message-ID: Several fully funded PhD scholarships for UK applicants are available in the Security and Trust of Advanced Systems Group [1] (Prof. Achim Brucker [2] and Dr. Diego Marmsoler [3]) at the Department of Computer Science of the University of Exeter, UK [4]. We are looking for enthusiastic and outstanding Computer Science or Mathematics students with a strong background in at least one of the following topics: * safety or security of (software) systems, * formal modelling or formal reasoning/verification, * program analysis or program verification, * language-based security * semantics of programming languages, * theorem proving, model checking, * cryptographic protocols, * distributed systems (e.g., blockchain), * specification-based testing, and * design and implementation of security architectures. This award provides annual funding to cover UK tuition fees and a tax-free stipend. For students who pay UK tuition fees the award will cover the tuition fees in full, plus at least £15,009 per year tax-free stipend. The studentship will be awarded on the basis of merit for 3.5 years of full-time study. Interested candidates should contact the potential supervisors Prof. Achim Brucker (a.brucker at exeter.ac.uk) or Dr. Diego Marmsoler (d.marmsoler at exeter.ac.uk) to discuss their application. For more details, please consult the official advertisements: * Compositional Verification of Smart Contracts in Isabelle: https://www.exeter.ac.uk/study/funding/award/?id=4326 * Formal Verification for Safety- or Security-Critical Systems: https://www.exeter.ac.uk/study/funding/award/?id=4328 * Software Engineering for Security- or Safety-Critical Systems: https://www.exeter.ac.uk/study/funding/award/?id=4329 * Open Call: https://www.exeter.ac.uk/study/funding/award/?id=4343 The closing date for applications is midnight on the 24th of January 2022. Best, Achim and Diego [1] http://emps.exeter.ac.uk/computer-science/research/cyber-security/ [2] https://www.brucker.ch/ [3] https://marmsoler.com/ [4] http://emps.exeter.ac.uk/computer-science/ -- Prof. Achim Brucker | Chair in Cybersecurity & Head of Group | University of Exeter https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking From ccst at wsconf.org Thu Dec 16 20:26:03 2021 From: ccst at wsconf.org (IACTE - World Science Conferences) Date: Thu, 16 Dec 2021 20:26:03 +0000 Subject: [Haskell] CFP : INTERNATIONAL CONFERENCE ON INTERDISCIPLINARY ASPECTS OF COMPUTER TECHNOLOGY AND ENGINEERING Message-ID: <2a5ce039482b835b360b4bf20908abcb@wsconf.org> Call for papers ************************************************* International Conference on Interdisciplinary aspects of computer technology and Engineering (IACTE- 2022) Lisbon, Portugal 02-03 June 2022 http://wsconf.org/Conference/IACTE https://service.wsconf.org/campaigns/mm862x7t1g027/track-url/od7037q0dae65/2aaddf527384c4b295c6fb2997a6f5a7ff73d07d *************************************************************************** IMPORTANT DATES: - Paper Submission: February 14, 2022 - Acceptance Notification: March 07, 2022 - Final Manuscript Due: April 04, 2022 *************************************************************************** TOPICS: Authors are invited to submit their original papers to address the topics of the conference, including but not limited to: Fundamental and theories COGNITIVE COMPUTING BIG DATA ANALYTICS CLOUD COMPUTING QUANTUM COMPUTING SECURITY AND PRIVACY INTERNET OF THINGS (IOT) SOFTWARE-AS-A-SERVICE ADAPTIVE SYSTEM SERVICE SYSTEMS DATABASE TECHNOLOGIES MACHINE LEARNING HARDWARE ACCELERATORS MOBILE APPLICATION FRAMEWORKS AND PLATFORMS Business Intelligence ARCHITECTURE AND SYSTEMS DESIGN FOR INTERNET OF THINGS ALGORITHM DESIGN AND ANALYSIS BIG DATA BIOMETRICS INFORMATION SYSTEMS Computer aided education tools CLOUD COMPUTING COGNITIVE SCIENCE COMPUTATIONAL COMPLEXITY THEORY COMPUTATIONAL LINGUISTICS AND NEUROSCIENCE COMPUTER ANIMATION COMPUTER SECURITY COMPUTER SYSTEMS GREEN COMPUTING Internet of things ROBOTICS NETWORK SECURITY NUMERICAL ANALYSIS PROGRAMMING PARADIGMS QUANTUM COMPUTING THEORY REQUIREMENTS ANALYSI S SCIENTIFIC COMPUTING SUSTAINABLE COMPUTING OPERATING SYSTEMS Database management system EVOLUTIONARY COMPUTATION EXPERT SYSTEMS INFORMATION THEORY INFORMATION SCIENCE INFORMATION SECURITY INFORMATION SYSTEM Logical Programming MACHINE LEARNING TECHNIQUE NATURAL LANGUAGE PROCESSING NETWORK TOPOLOGY NEW MEDIA TECHNOLOGY MOBILE NETWORK AND SECURITY NUMERICAL ALGORITHMS Software Design SOFTWARE DEVELOPMENT PROCESS SOFTWARE ENGINEERING AND TESTING SYMBOLIC MATHEMATICS UBIQUITOUS COMPUTING *************************************************************************** OUTSTANDING PAPERS: Based on the peer review scores as well as the presentations at the conference, the authors of outstanding papers will be invited to extend their works for a potential publication in journals special issues with high impact factors. *************************************************************************** PAPER SUBMISSION: For more information, please refer to the conference website: http://wsconf.org/Conference/IACTE https://service.wsconf.org/campaigns/mm862x7t1g027/track-url/od7037q0dae65/2aaddf527384c4b295c6fb2997a6f5a7ff73d07d *************************************************************************** CONTACT For more information, please send an email to iacte at wsconf.org This email was sent by World Science Conferences https://wsconf.org/. If you don't want to receive this type of email in the future, please , Unsubscribe https://service.wsconf.org/lists/vd017z84knbd4/unsubscribe/od7037q0dae65/mm862x7t1g027 -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Fri Dec 17 11:36:35 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Fri, 17 Dec 2021 11:36:35 +0000 Subject: [Haskell] IJCAR 2022 - Call for Papers Message-ID: IJCAR 2022 - Call for Papers https://easychair.org/smart-program/IJCAR2022/. ***Important Dates*** Submission deadline February 11, 2022 Start of authors response period April 16, 2022 End of authors response period April 18, 2022 Authors notification April 25, 2022 ************ ****Overview***** IJCAR is the premier international joint conference on all aspects of automated reasoning. IJCAR 2022 is the 11th edition of IJCAR. It will be held in Haifa (Israel), during August 7-12, 2022, as part of FLoC 2022. IJCAR 2022 is the merger conference of the following leading events in automated reasoning: CADE (Conference on Automated Deduction) FroCoS (Symposium on Frontiers of Combining Systems) TABLEAUX (Conference on Analytic Tableaux and Related Methods) ****Submission Guidelines**** IJCAR 2022 invites submissions related to all aspects of automated or interactive reasoning, including foundations, implementations, and applications. All papers must be original and not simultaneously submitted to another journal or conference. The following paper categories are welcome: - Regular papers describing solid new research results. They can be up to 16 pages long, including figures but excluding references and appendices. Where applicable, regular papers are supported by experimental validation. Submissions reporting on case studies in an industrial context are strongly invited as regular papers, and should describe details, weaknesses and strength in sufficient depth. - System description papers describing implementations of systems, reporting on novel features and experiments with implemented systems. System description papers can be up to 7 pages long, including figures but excluding references and appendices. System description papers should also be supported by a link to the artifact/experimental evaluation available to the reviewers. Each of these papers should mention the phrase ``(system description)" beneath the title. Papers describing tools that have already been presented in other conferences before will be accepted only if significant and clear enhancements to the tool are reported and implemented. Both types of papers must be formatted using the Springer LNCS styles and submitted in PDF via EasyChair: https://easychair.org/conferences/?conf=ijcar2022 Authors of accepted papers are required to ensure that at least one of them will present the paper at the conference. ****List of Topics**** IJCAR 2022 topics include the following ones: * Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, type theory. * Methods of interest include: tableaux, sequent calculi, resolution, model- elimination, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures,model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, automated theorem proving, combination of decision or proof procedures, SAT and SMT solving, integration of proof assistants with automated provers and other symbolic tools, etc. * Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, education, formalization of mathematics etc. ****Publication**** IJCAR 2022 proceedings will be published in the Springer LNCS series. Springer encourages authors to include their ORCIDs in their papers. ****Conference Chair**** Arnon Avron (Tel-Aviv University) ****Program Committee Chairs**** Jasmin Blanchette (Vrije Universiteit Amsterdam) - chair Laura Kovacs (Vienna University of Technology) - chair Dirk Pattinson (The Australian National University) - chair ****Workshop Chairs**** Simon Robillard (Université de Montpellier) Sophie Tourret (Max Planck Institute for Informatics)) ****Tutorials and Competition Chair**** Yoni Zohar (Stanford University) ****Publicity Chair**** Geoff Sutcliffe (University of Miami) ****Program Committee**** Erika Abraham (RWTH Aachen University) Carlos Areces (FaMAF - Universidad Nacional de Córdoba) Bernhard Beckert (Karlsruhe Institute of Technology) Alexander Bentkamp (Vrije Universiteit Amsterdam) Armin Biere (Albert-Ludwigs-Universität Freiburg) Nikolaj Bjørner (Microsoft) Jasmin Blanchette (Vrije Universiteit Amsterdam) Frédéric Blanqui (INRIA) Maria Paola Bonacina (Università degli Studi di Verona) Kaustuv Chaudhuri (INRIA) Agata Ciabattoni (Vienna University of Technology) Stéphane Demri (CNRS, LMF, ENS Paris-Saclay) Clare Dixon (University of Manchester) Huimin Dong (Sun Yat-Sen University) Katalin Fazekas (TU Wien) Mathias Fleury (University of Freiburg) Pascal Fontaine (Université de Liège, Belgium) Nathan Fulton (IBM Corporation) Silvio Ghilardi (Dipartimento di Matematica, Università degli Studi di Milano) Jürgen Giesl (RWTH Aachen University) Rajeev Gore (The Australian National University) Marijn Heule (Carnegie Mellon University) Radu Iosif (Verimag, CNRS, University of Grenoble Alpes) Mikolas Janota (Czech Technical University in Prague) Moa Johansson (Chalmers University of Technology) Cezary Kaliszyk (University of Innsbruck) Laura Kovacs (Vienna University of Technology) Orna Kupferman (Hebrew University) Cláudia Nalon (University of Brasília) Vivek Nigam (Huawei ERC) Tobias Nipkow (Technical University of Munich) Jens Otten (University of Oslo) Dirk Pattinson (The Australian National University) Nicolas Peltier (CNRS - LIG) Brigitte Pientka (McGill University) Elaine Pimentel (UFRN) André Platzer (Carnegie Mellon University) Giles Reger (Amazon Web Services and The University of Manchester) Andrew Reynolds (University of Iowa) Simon Robillard (Université de Montpellier) Albert Rubio (Universidad Complutense de Madrid) Philipp Ruemmer (Uppsala University) Renate A. Schmidt (The University of Manchester) Stephan Schulz (DHBW Stuttgart) Roberto Sebastiani (University of Trento) Martina Seidl (Johannes Kepler University Linz) Viorica Sofronie-Stokkermans (University Koblenz-Landau) Lutz Straßburger (INRIA Saclay --- Ile-de-France) Martin Suda (Czech Technical University in Prague) Tanel Tammet (Tallinn University of Technology) Sophie Tourret (Max Planck Institute for Informatics) Uwe Waldmann (MPI for Informatics) Christoph Weidenbach (Max Planck Institute for Informatics) Sarah Winkler (Free University of Bozen-Bolzano) Yoni Zohar (Stanford University) From wadler at inf.ed.ac.uk Mon Dec 27 16:54:27 2021 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Mon, 27 Dec 2021 16:54:27 +0000 Subject: [Haskell] Postdoctoral Research Assistant position at University of Edinburgh Message-ID: The School of Informatics, University of Edinburgh invites applications for a postdoctoral research assistant on the SAGE project (Scoped and Gradual Effects), funded by Huawei. The post will be for eighteen months. We seek applicants at an international level of excellence. The School of Informatics at Edinburgh is among the strongest in the world, and Edinburgh is known as a cultural centre providing a high quality of life. If interested, please contact Prof. Philip Wadler . Full details are here . Applications close at 5pm on 14 January 2021. The Opportunity: In the early 2000s, Plotkin and Power introduced an approach to computational effects in programming languages known as *algebraic effects*. This approach has attracted a great deal of interest and further development, including the introduction by Plotkin and Pretnar of *effect handlers*. Several research languages, such as Eff, Frank, Koka, and Links, support the use of algebraic effects. A few languages, including Multicore O'Caml and WebAssembly, support specific algebraic effects, and we may see general algebraic effects make their way into mainstream languages in the future. The proposed research has two focusses: (a) a simpler version of static scoping for algebraic effect handlers, and (b) gradual types for algebraic effect systems. The former is a question of how to match an effect with its corresponding handler. This issue arises when two effects have the same name, and you expect the handler for one but invoke the handler for the other. Some current solutions, like tunnelling and instance variables, are based on lexical scoping. However, despite this insight, tunnelling and instance variables are more complex than lexical binding of a variable to a value. In particular, the type system needs to track that an effect does not escape the scope of its surrounding handler (reminiscent of the funarg problem with dynamic variable binding). Can we do better? The latter is a question of how to integrate legacy code that lacks typed effects with new code that supports typed effects. Usually, integration of dynamically and statically typed languages is best explored in the context of gradual types, which support running legacy code and new code in tandem. To date there is only a tiny amount of work in the area of gradual types for effects, and important aspects of algebraic effects, such as effect handlers, have yet to be addressed. Overall, work to date on effect handlers is often complex, and attention is required to where ideas can be simplified, which is the ultimate objective of this project. Your skills and attributes for success: Essential • PhD (or close to completion) in programming languages or a related discipline. • Expertise and experience in relevant areas, including lambda calculus, type systems, and compilation. • Ability to implement prototype language processors in O’Caml, Haskell, or a related language. • Excellence in written and oral communication, analytical, and time management skills. • Ability to collaborate with a team. Desirable • Published research in programming languages or a related field, preferably in top-tier conferences. • Experience in presenting at conferences or seminars. • Knowledge of effect systems or gradual type systems. • Experience with a proof assistant, such as Agda or Coq. • Strong programming and software engineering skills. . \ Philip Wadler, Professor of Theoretical Computer Science, . /\ School of Informatics, University of Edinburgh . / \ and Senior Research Fellow, IOHK . http://homepages.inf.ed.ac.uk/wadler/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: not available URL: From tarmo at cs.ioc.ee Tue Dec 28 19:27:34 2021 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 28 Dec 2021 21:27:34 +0200 Subject: [Haskell] ETAPS Test of Time Award 2022, call for nominations Message-ID: <20211228212734.2d26cfa5@cs.ioc.ee> The ETAPS Test of Time Award recognizes outstanding papers published more than 10 years in the past in one of the constituent conferences of ETAPS. The Award recognises the impact of excellent research results that have been published at ETAPS. See https://etaps.org/about/test-of-time-award . Nominations Nominations for the 2022 ETAPS Test of Time Award are solicited from the ETAPS community. A nomination should include the title and publication details of the nominated paper, explain the influence it has had since publication, and why it merits the award. The nomination should phrase it in terms that are understandable by the members of the award committee and suitable for use in the award citation and should be endorsed by at least 2 people other than the person submitting the nomination. Self-nominations are not allowed. Nominations should be sent by Monday 14 February 2022 to the chair of the award committee, Don Sannella . Award committee The 2022 award committee consists of Rance Cleaveland, Ugo Dal Lago, Marieke Huisman, Jan Křetínský, Don Sannella (chair), Gabriele Taentzer and Peter Thiemann.