SECOND Call For Papers
FLOPS 2020: 15th International Symposium on Functional and Logic Programming
In-Cooperation with ACM SIGPLAN
===============================
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 cross-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
https://easychair.org/conferences/?conf=flops2020
Springer Guidelines
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…
*** Proceedings ***
The proceedings will be published by Springer International Publishing
in the Lecture Notes in Computer Science (LNCS) series
(www.springer.com/lncs).
*** 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
*** Programming Comittee ***
Elvira Albert Universidad Complutense de Madrid
María Alpuente Universitat Politècnica de València
Edwin Brady University of St Andrews
Michael Hanus CAU Kiel
Nao Hirokawa JAIST
Zhenjiang Hu Peking University
John Hughes Chalmers University of Technology
Kazuhiro Inaba Google
Shin-Ya Katsumata National Institute of Informatics
Ekaterina Komendantskaya Heriot-Watt University
Leonidas Lampropoulos University of Pennsylvania
Akimasa Morihata The University of Tokyo
Shin-Cheng Mu Academia Sinica
Keisuke Nakano Tohoku University (co-chair)
Koji Nakazawa Nagoya University
Enrico Pontelli New Mexico State University
Didier Remy INRIA
Ricardo Rocha University of Porto
Konstantinos Sagonas Uppsala University (co-chair)
Ilya Sergey Yale-NUS College
Kohei Suenaga Kyoto University
Tachio Terauchi Waseda University
Kazushige Terui Kyoto University
Simon Thompson University of Kent
*** 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
-------------------------------------------------------------------------------
皆様:
名古屋大学の吉信です。
以下の要領で名古屋ロジックセミナーを開催します。
日時:10月26日(金) 15:30〜
場所:名古屋大学大学院情報学研究科棟2階206室
講演者:宮元 忠敏(南山大学)
タイトル:A note on a countable fast function, its forcing axiom, and a weak tail club guessing
アブストラクト:
The countable fast function poset is strongly sigma-closed but does not
have a usual chain condition.
It forces a closed and cofinal subset of the second uncountable cardinal.
Therefore its forcing axiom that takes care of appropriate number of
dense sets kills a weak tail club guessing.
This weak club guessing is a consequence of a tiny fragment of GCH. We
discuss a consistency of the forcing axiom together with CH.
We use an Aspero-Mota type iterated forcing with countable symmetric
systems of sigma-closed uncountabe elementary substructres
of relevant expanding relational structures on a fixed trasitive set
universe of a large fragment of set theory.
We also dicuss a class of posets that includes this poset and posts with
stronger forms of relevant chain condition.
名古屋ロジックセミナーについてはセミナーのページをごらんください。
http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html
多数の方のご参加をお待ちしております。
みなさま
今週木曜日に京都大学にてAlex Kavvosさんによるご講演があります。
詳細は下記の通りです。よろしければぜひご参加ください。
京都大学数理解析研究所
照井一成
==========
Time: 11:00-12:00, October 17th, 2019
Place: Rm 478, Research Building 2, Main Campus, Kyoto University
京都大学 本部構内 総合研究2号館 4階478号室
http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34)
Speaker: Alex Kavvos (Aarhus University)
Title: Modalities, Cohesion, and Information Flow
Abstract: It is informally understood that the purpose of modal type
constructors in programming calculi is to control the flow of information
between types. I will introduce a number of such constructors that are
useful for security-aware functional programming, i.e. for writing programs
without accidental high-level leaks of information flow. Following that, I
will prove that the well-typed programs in calculi of this sort preserve
confidentiality and integrity by design, by using some categorical algebra
and a few background ideas from topology. (This talk is based on
arXiv:1809.07897.)
CALL FOR PAPERS
WoLLIC 2020
27th Workshop on Logic, Language, Information and Computation
August 4th to 7th, 2020
Lima, Peru
ORGANISATION
Universidad de Ingenieria y Tecnologia, Lima, Peru
Centro de Informática, Universidade Federal de Pernambuco, Brazil
CALL FOR PAPERS
WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-seventh WoLLIC will be held at Universidad de Ingenieria y Tecnologia, Lima, Peru from August 4th to 7th, 2020. It is scientifically sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).
PAPER SUBMISSION
Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2020 EasyChair website. (Please go to http://wollic.org/wollic2020/instructions.html <http://wollic.org/wollic2020/instructions.html> for instructions.)
PROCEEDINGS
The proceedings of WoLLIC 2020, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2020 issue of a scientific journal (to be confirmed).
INVITED SPEAKERS
(tba)
STUDENT GRANTS
ASL sponsorship of WoLLIC 2020 will permit ASL student members to apply for a limited travel grant (deadline: 90 days before the event starts). Visit https://aslonline.org/meetings/student-travel-awards/ <https://aslonline.org/meetings/student-travel-awards/> for details.
IMPORTANT DATES
April 15, 2020: Full paper deadline
May 23, 2020: Author notification
May 30, 2019: Final version deadline (firm)
PROGRAMME COMMITTEE
Carlos Areces (Cordoba, Argentina)
Arthur Amorim Azevedo (CMU, USA)
Paul Brunet (UCL, UK)
Nina Gierasimczuk (Technical University of Denmark, Denmark)
Helle Hansen (TU Delft, The Netherlands)
Justin Hsu (University of Wisconsin–Madison, USA)
Fairouz Kamareddine (Heriot-Watt University, UK)
Sandra Kiefer (Aachen University, Germany)
Clemens Kupke (Strathclyde University, Scotland)
Konstantinos Mamouras (Rice University, USA)
Maria Vanina Martinez (Universidad de Buenos Aires, Argentina)
Larry Moss (Indiana Univ, USA)
Claudia Nalon (University of Brasília, Brazil)
Valeria de Paiva (Samsung Research, USA)
Elaine Pimentel (UFRN, Brazil)
Revantha Ramanayake (TU Wien, Austria)
Jurriaan Rot (Radboud University, The Netherlands)
Yamilet Serrano (UTEC, Peru)
Alexandra Silva (Univ College London) (Co-Chair)
Christine Tasson (IRIF, France)
Sebastiaan Terwijn (Radboud University, The Netherlands)
Renata Wassermann (Univ São Paulo) (Co-Chair)
STEERING COMMITTEE
Samson Abramsky, Anuj Dawar, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Lawrence Moss, Luke Ong, Valeria de Paiva, Ruy de Queiroz.
ADVISORY COMMITTEE
Johan van Benthem, Joe Halpern, Wilfrid Hodges, Angus Macintyre, Hiroakira Ono, Jouko Väänänen.
ORGANISING COMMITTEE
Ernesto Quadro-Vargas (Universidad de Ingenieria y Tecnologia, Lima, Peru) (Local chair)
Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil)
Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair)
SCIENTIFIC SPONSORSHIP
Interest Group in Pure and Applied Logics (IGPL)
The Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
European Association for Theoretical Computer Science (EATCS)
ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)
SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS
It is planned to have a special session with the exhibition of a one-hour documentary film about a remarkable mathematician whose contributions were recognized with a Fields Medal just a few years before her untimely death. It is a joint production (still on its course) of The Mathematical Sciences Research Institute (MSRI) and George Csicsery (Zala Films): ‘Secrets of the Surface - The Mathematical Vision of Maryam Mirzakhani’. “The biographical film is about Maryam Mirzakhani, a brilliant woman, and Muslim immigrant to the United States who became a superstar in her field. The story of her life will be complemented with sections about Mirzakhani’s mathematical contributions, as explained by colleagues and illustrated with animated sequences. Throughout, we will look for clues about the sources of Mirzakhani’s insights and creativity." (http://www.zalafilms.com/secrets/ <http://www.zalafilms.com/secrets/>)
FURTHER INFORMATION
Contact one of the Co-Chairs of the Organising Committee.
WEB PAGE
http://wollic.org/wollic2020/ <http://wollic.org/wollic2020/>
皆様
九州大学の河村と申します。ノルベルト・ミュラー先生(トリール大)の講演を
下記の通り来週火曜日に九大で開催いたします。宜しければぜひお越し下さい。
http://www.fc.inf.kyushu-u.ac.jp/seminars/R011015.html
----------------------------------------------------------------------
October 15, 2019, Tuesday, 15:00–
Room 1019, Ito Campus West Building 2, Kyushu University
(九州大学伊都キャンパスウエスト二号館1019室)
----------------------------------------------------------------------
Joint approximations for multivariate real functions
Norbert Müller (Universität Trier)
----------------------------------------------------------------------
As a generalization of the well-known NP-complete problem SAT from
propositional logic, the task in SMT (Satisfiability Modulo Theories) is
to determine whether certain quantifier-free formulae in first-order
logic are satisfiable. Popular solvers for such problems are Z3, CVC4 or
MathSAT.
We are interested in the case where the first-order logic is on real
numbers. For formulae describing linear arithmetic on this set, the
implementations mentioned above are quite efficient (as far as possible,
having to deal with NP-completeness).
However, nonlinear arithmetic on real numbers is far harder, as general
issues concerning decidability arise. In addition, techniques for the
treatment of nonlinear formulae are still under development. Our
approach combines ideas from CDCL-style SMT solving, computable analysis
and the numerical approach of Taylor models.
In the talk we will give brief introductions into these topics and
present a prototypical implementation meant for augmenting existing SMT
solvers with nonlinear arithmetic.
----------------------------------------------------------------------
--
河村彰星
九州大学システム情報科学研究院情報学部門
〒819-0395 福岡市西区元岡744
092-802-3806
kawamura(a)inf.kyushu-u.ac.jp
皆様
6月末にパリで行われます FSCD 2020 の論文募集案内をお送り致します。
ぜひ論文の投稿をご検討下さい。
廣川 (JAIST)
CALL FOR PAPERS
Fifth International Conference on
Formal Structures for Computation and Deduction (FSCD 2020)
June 29 -- July 5, 2020, Paris, France
http://fscd2020.org/
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions
will not be considered.
Abstract: February 6, 2020
Submission: February 9, 2020
Rebuttal: March 27-29, 2020
Notification: April 13, 2020
Final version: April 27, 2020
FSCD (http://fscdconference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, models of computation,
semantics and verification in new challenging areas. The suggested,
but not exclusive, list of topics for submission is:
1. Calculi: Rewriting systems (string, term, higher-order, graph,
conditional, modulo, infinitary, etc.); Lambda calculus; Logics
(first-order, higher-order, equational, modal, linear, classical,
constructive, etc.); Proof theory (natural deduction, sequent
calculus, proof nets, etc.); Type theory and logical frameworks;
Homotopy type theory; Quantum calculi.
2. Methods in Computation and Deduction: Type systems (polymorphism,
dependent, recursive, intersection, session, etc.); Induction,
coinduction; Matching, unification, completion, orderings;
Strategies (normalization, completeness, etc.); Tree automata;
Model building and model checking; Proof search and theorem
proving; Constraint solving and decision procedures.
3. Semantics: Operational semantics and abstract machines; Game
Semantics and applications; Domain theory and categorical models;
Quantitative models (timing, probabilities, etc.); Quantum
computation and emerging models in computation.
4. Algorithmic Analysis and Transformations of Formal Systems: Type
inference and type checking; Abstract Interpretation; Complexity
analysis and implicit computational complexity; Checking
termination, confluence, derivational complexity and related
properties; Symbolic computation.
5. Tools and Applications: Programming and proof environments;
Verification tools; Proof assistants and interactive theorem
provers; Applications in industry; Applications of formal systems
in other sciences.
6. Semantics and Verification in new challenging areas: Certification;
Security; Blockchain protocols; Data Bases; Deep learning and
machine learning algorithms; Planning.
PUBLICATION
-----------
The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs) of Schloss
Dagstuhl. All LIPIcs proceedings are open access.
SPECIAL ISSUE
-------------
Authors of selected papers will be invited to submit an extended
version to a special issue of Logical Methods in Computer Science.
SUBMISSION GUIDELINES
---------------------
Submissions can be made in two categories. Regular research papers are
limited to 15 pages (including references, with the possibility to add
an annex for technical details, e.g. proofs) and must present original
research which is unpublished and not submitted elsewhere. System
descriptions are limited to 15 pages (including references) and must
present new software tools in which FSCD topics play an important
role, or significantly new versions of such tools. Complete
instructions on submitting a paper can be found on the conference web
site.
BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The program committee will select a paper in which at least one author
is a junior researcher, i.e. either a student or whose PhD award date
is less than three years from the first day of the meeting. Other
authors should declare to the PC Chair that at least 50% of
contribution is made by the junior researcher(s).
PROGRAM COMMITTEE CHAIR
-----------------------
Zena M. Ariola, University of Oregon
fscd2020(a)easychair.org
PROGRAM COMMITTEE
-----------------
M. Alpuente, Technical Univ. of Valencia
S. Alves, University of Porto
A. Bauer, University of Ljubljana
M. P. Bonacina, Università degli studi di Verona
P-L. Curien, CNRS - Univ. of Paris Diderot
P. Dybjer, Chalmers Univ. of Technology
U. De’Liguoro, University of Torino
M. Fernandez, King’s College London
M. Gaboardi, Boston University
D. Ghica, University of Birmingham
S. Ghilezan, University of Novi Sad
J. Giesl, RWTH Aachen University
S. Guerrini, University of Paris 13
R. Harper, Carnegie Mellon University
M. Hasegawa, Kyoto University
N. Hirokawa, JAIST
P. Johann, Appalachian State University
O. Kammar, University of Edinburgh
D. Kesner, University of Paris Diderot
C. Kop, Radboud University
O. Laurent, ENS Lyon
D. Licata, Wesleyan University
A. Middeldorp, University of Innsbruck
J. Mitchell, Stanford University
K. Nakata, SAP Postdam
M. Pagani, University of Paris Diderot
E. Pimentel, Fed. Univ. Rio Grande do Norte Vrije
F. van Raamsdonk, University Amsterdam
G. Rosu, University of Illinois
A. Sabry, Indiana University
A. Stump, University of Iowa
P. Urzyczyn, University of Warsaw
T. Uustalu, Reykjavik University
S. Zdancewic, University of Pennsylvania
CONFERENCE CHAIR
----------------
Stefano Guerrini, University of Paris 13
WORKSHOP CHAIR
--------------
Giulio Manzonetto, University of Paris 13
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
J. Vicary, Oxford University
PUBLICITY CHAIR
---------------
S. Alves, University of Porto
FSCD STEERING COMMITTEE
-----------------------
S. Alves (University of Porto),
M. Ayala-Rincón (University of Brasilia)
C. Fuhs (Birkbeck, London University)
H. Geuvers (Radboud University)
D. Kesner (Chair, University of Paris Diderot )
H. Kirchner (Inria)
C. Kop (Radboud University)
D. Mazza (University of Paris 13)
D. Miller (Inria)
L. Ong (Oxford University)
J. Rehof (TU Dortmund)
S. Staton (Oxford University)