# 複数受けとられた方はご容赦ください.
皆様,
東北大学の松田です.
ICFP 2019併設の国際会議Haskell Symposium 2019(8/22-8/23@ベルリン)の
論文募集の案内を御送りいたします.
重要な日程は以下の通りです.
Early Track:
投稿〆切:3/15
採否通知:4/19
Regular Track and Demo:
投稿〆切:5/10
採否通知:6/21
会議:8/22-8/23
何卒投稿をご検討いただけますと幸いです.
CFPにあります通り,今年は軽量double blind reviewを採用しております.
投稿時はお気をつけください.
================================================================================
ACM SIGPLAN CALL FOR SUBMISSIONS
Haskell Symposium 2019
Berlin, Germany
22--23 August, 2019
http://www.haskell.org/haskell-symposium/2019/
================================================================================
The ACM SIGPLAN Haskell Symposium 2019 will be co-located with the 2019
International Conference on Functional Programming (ICFP).
**NEW THIS YEAR**: We will be using a lightweight double-blind reviewing
process. See further information below.
The Haskell Symposium presents original research on Haskell,
discusses practical experience and future development of the
language, and promotes other forms of declarative programming.
Topics of interest include:
* Language design, with a focus on possible extensions and modifications of
Haskell as well as critical discussions of the status quo;
* Theory, such as formal semantics of the present language or future
extensions, type systems, effects, metatheory, and foundations for
program analysis and transformation;
* Implementations, including program analysis and transformation,
static and dynamic compilation for sequential, parallel, and distributed
architectures, memory management, as well as foreign function and
component interfaces;
* Libraries, that demonstrate new ideas or techniques for functional
programming in Haskell;
* Tools, such as profilers, tracers, debuggers, preprocessors,
and testing tools;
* Applications, to scientific and symbolic computing, databases,
multimedia, telecommunication, the web, and so forth;
* Functional Pearls, being elegant and instructive programming examples;
* Experience Reports, to document general practice and experience in
education, industry, or other contexts;
* System Demonstrations, based on running software rather than novel
research results.
Regular papers should explain their research contributions in
both general and technical terms, identifying what has been
accomplished, explaining why it is significant, and relating it
to previous work, and to other languages where appropriate.
Experience reports and functional pearls need not necessarily
report original academic research results. For example, they may
instead report reusable programming idioms, elegant ways to
approach a problem, or practical experience that will be useful
to other users, implementers, or researchers. The key criterion
for such a paper is that it makes a contribution from which other
Haskellers can benefit. It is not enough simply to describe a
standard solution to a standard programming problem, or report on
experience where you used Haskell in the standard way and
achieved the result you were expecting.
System demonstrations should summarize the system capabilities
that would be demonstrated. The proposals will be judged on
whether the ensuing session is likely to be important and
interesting to the Haskell community at large, whether on grounds
academic or industrial, theoretical or practical, technical,
social or artistic. Please contact the program chair with any
questions about the relevance of a proposal.
Submission Details
==================
Early and Regular Track
-----------------------
The Haskell Symposium uses a two-track submission process so that
some papers can gain early feedback. Strong papers submitted to
the early track are accepted outright, and the others will be
given their reviews and invited to resubmit to the regular
track. Papers accepted via the early and regular tracks are
considered of equal value and will not be distinguished in the
proceedings. Although all papers may be submitted to the early
track, authors of functional pearls and experience reports are
particularly encouraged to use this mechanism. The success of
these papers depends heavily on the way they are presented, and
submitting early will give the program committee a chance to
provide feedback and help draw out the key ideas.
Formatting
----------
Submitted papers should be in portable document format (PDF),
formatted using the ACM SIGPLAN style guidelines. Authors should
use the `acmart` format, with the `sigplan` sub-format for ACM
proceedings. For details, see:
http://www.sigplan.org/Resources/Author/#acmart-format
It is recommended to use the `review` option when submitting a
paper; this option enables line numbers for easy reference in
reviews.
Functional pearls, experience reports, and demo proposals should be
labelled clearly as such.
Lightweight Double-blind Reviewing
----------------------------------
Haskell Symposium 2019 will use 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 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 (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.
A reviewer will learn the identity of the author(s) of a paper
after a review is submitted.
Page Limits
-----------
The length of submissions should not exceed the following limits:
Regular paper: 12 pages
Functional pearl: 12 pages
Experience report: 6 pages
Demo proposal: 2 pages
There is no requirement that all pages are used. For example, a
functional pearl may be much shorter than 12 pages. In all cases,
the list of references is not counted against these page limits.
Deadlines
---------
Early track:
Submission deadline: 15 March 2019 (Fri)
Notification: 19 April 2019 (Fri)
Regular track and demos:
Submission deadline: 10 May 2019 (Fri)
Notification: 21 June 2019 (Fri)
Camera-ready deadline for accepted papers:
30 June 2019 (Thu)
Deadlines are valid anywhere on Earth.
Submission
----------
Submissions must adhere to SIGPLAN's republication policy
(http://sigplan.org/Resources/Policies/Republication/), and authors
should be aware of ACM's policies on plagiarism
(https://www.acm.org/publications/policies/plagiarism).
The paper submission deadline and length limitations are firm.
There will be no extensions, and papers violating the length
limitations will be summarily rejected.
Papers should be submitted through HotCRP at:
https://haskell19.hotcrp.com/
Improved versions of a paper may be submitted at any point before
the submission deadline using the same web interface.
Supplementary material: Authors have the option to attach
supplementary material to a submission, on the understanding that
reviewers may choose not to look at it. This supplementary
material should not be submitted as part of the main document;
instead, it should be uploaded as a separate PDF document or
tarball.
Supplementary material should be uploaded at submission time, not
by providing a URL in the paper that points to an external
repository.
Authors are free to upload both anonymized and non-anonymized
supplementary material. Anonymized supplementary material will be
visible to reviewers immediately; non-anonymized supplementary
material will be revealed to reviewers only after they have
submitted their review of the paper and learned the identity of
the author(s).
Resubmitted Papers: Authors who submit a revised version of a
paper that has previously been rejected by another conference
have the option to attach an annotated copy of the reviews of
their previous submission(s), explaining how they have addressed
these previous reviews in the present submission. If a reviewer
identifies him/herself as a reviewer of this previous submission
and wishes to see how his/her comments have been addressed, the
principal editor will communicate to this reviewer the annotated
copy of his/her previous review. Otherwise, no reviewer will read
the annotated copies of the previous reviews.
Travel Support
==============
Student attendees with accepted papers can apply for a SIGPLAN
PAC grant to help cover travel expenses. 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 program, see its
web page (http://pac.sigplan.org).
Proceedings
===========
Accepted papers will be included in the ACM Digital
Library. Authors must grant ACM publication rights upon
acceptance (http://authors.acm.org/main.html). Authors are
encouraged to publish auxiliary material with their paper
(source code, test data, etc.); they retain copyright of
auxiliary material.
Accepted proposals for system demonstrations will be posted on the
symposium website but not formally published in the proceedings.
All accepted papers and proposals will be posted on the conference
website one week before the meeting.
Publication date: The official publication date of accepted papers 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 the
conference. The official publication date affects the deadline for any
patent filings related to published work.
Program Committee
=================
Ki-Yung Ahn Hannam University
Christiaan Baaij QBayLogic B.V.
José Manuel Calderón Trilla Galois, Inc
Benjamin Delaware Purdue University
Richard Eisenberg (chair) Bryn Mawr College
Jennifer Hackett University of Nottingham
Kazutaka Matsuda Tohoku University
Trevor McDonnell Utrecht University
Ivan Perez NIA / NASA Formal Methods
Nadia Polikarpova University of California, San Diego
Norman Ramsey Tufts University
Christine Rizkallah University of New South Wales
Eric Seidel Bloomberg LP
Alejandro Serrano Mena Utrecht University
John Wiegley Dfinity Foundation
Thomas Winant Well-Typed LLP
Ningning Xie University of Hong Kong
If you have questions, please contact the chair at: rae(a)cs.brynmawr.edu
================================================================================
皆様
2月26日(火)に行われます、ウィーン工科大学 Matthias Baaz 先生と
インスブルック大学 Cezary Kaliszyk 先生の講演のお知らせです。
皆様、どうぞ奮ってご参加ください。
廣川 直 (北陸先端科学技術大学院大学 情報科学系)
-----------------------------------------------------------------------
* JAIST Logic Seminar Series *
Date: Feb 26 (Tue), 2019, 13:30 - 15:30
Place: I-56 (Collaboration Room 7) on 5F of IS Building III at JAIST
(Access: http://www.jaist.ac.jp/english/location/access.html)
-*- -*- -*- -*- -*- -*- -*- -*- -*-
Speaker: Matthias Baaz (Vienna University of Technology)
Title: On the benefit of unsound rules: Henkin quantifiers and beyond
Abstract:
We give examples of analytic sequent calculi LK+ and LK++ that extend
Gentzen's sequent calculus LK by unsound quantifier rules in such a
way that
i) derivations lead only to true sequents,
ii) cut free proofs may be non-elementary shorter than cut free LK proofs.
This research is based on properties of Hilbert's epsilon calculus
and is part of efforts to complement Hilbert's stepwise concept of
proof by useful global concepts. We use these ideas to provide analytic
calculi for Henkin quantifiers demonstrate soundness, (cut free)
completeness and cut elimination. Furthermore, we show, that in the
case of quantifier macros such as Henkin quantifiers for a partial
semantics global calculi are the only option to preserve analyticity.
-*- -*- -*- -*- -*- -*- -*- -*- -*-
Speaker: Cezary Kaliszyk (University of Innsbruck)
Title: Learning Theorem Proving from Scratch
Abstract:
Machine learning can in some domains find algorithms that are better
than human heuristics. In this talk we will look at various theorem
proving problems and their heuristics, and see which of those can be
replaces by machine learned strategies. Instead of typical brute-force
search, we will consider Monte-Carlo simulations guided by reinforcement
learning from previous proof attempts. Various predictors for estimating
the usefulness of proof steps and the likelihood of closing the open
tableaux branches will be compared.
-----------------------------------------------------------------------