- Logic-ml - fos.kuis.kyoto-u.ac.jp

Call for contributions: TEASE-LP 2020
by Hiroshi UNNO 05 Feb '20

05 Feb '20

皆様、筑波大学の海野です。来年4月下旬に開催される ETAPS 2020 併設のワークショップ TEASE-LP 2020 の発表募集をお送りいたします。論理プログラミングの確率・高階拡張や、検証、型推論、AIへの応用といった近年のトレンドを扱うワークショップです。どうぞ参加・発表をご検討ください。 -- 海野広志筑波大学システム情報系情報工学域 ========================================================================== Call for Contributions Workshop on Trends, Extensions, Applications and Semantics of Logic Programming (TEASE-LP 2020) Dublin, Ireland, 25 April 2020 (co-located with ETAPS 2020) www.coalg.org/tease-lp Logic programming is a framework for expressing programs, propositions and relations as Horn clause theories, with the purpose of performing automatic inference in these theories. Horn clause theories are famous for their well-understood declarative semantics, in which models of logic programs are given inductively or coinductively. At the same time, Horn clauses give rise to efficient inference procedures, usually involving resolution. Logic programming found applications in type inference, verification, and AI. While logic programming was originally conceived for describing simple facts, it was extended to account for much more complex theories. This includes higher-order theories, inductive and coinductive data, and stochastic/probabilistic theories. The aim of this workshop is to bring together researchers that work on extensions of logic programming and inference methods, and to foster an exchange of methods and applications that have emerged in different communities. Venue and Event --------------------------- TEASE-LP 2020 will be held in Dublin, Ireland, co-located with ETAPS 2020 on 25 April 2020. Invited Speakers --------------------------- * Keynote: Luke Ong, University of Oxford, GBR * Tutorial: Uli Sattler, University of Manchester, GBR Important Dates --------------------------- Abstract submission: Wednesday, 26 February 2020 AoE Notification: Wednesday, 25 March 2020 AoE Camera-ready copy: Wednesday, 1 April 2020 AoE Workshop: Saturday, 25 April 2020 Topics --------------------------- The central idea of this workshop is to discuss the theory of logic programming and associated topics that have as well the goal to automatically infer knowledge and proofs. Our intention is to bring together researchers that work on the numerous topics that contribute to automatic proof inference and foster an exchange that may lead to advances in the theory of logic programming. Topics of interest include, but are not limited to, the following: * Proof theory (e.g. focalised and uniform proofs), * Logic programming beyond the classical Horn clause theories (e.g. coinduction, higher-order Horn clauses, probabilities, categorical logic, inductive LP), * Extensions of logic programming (e.g. DataLog, description logic, relational programming), * Advanced implementations (e.g. λProlog, ELPI, miniKanren), * Type theory (e.g. polarised λ-calculus, proofs-as-programs, types for logic programming), * Semantics (e.g. classical, categorical, algebraic, coalgebraic) , and * Applications. Programme Committee --------------------------- Henning Basold (chair), Leiden University, NLD Nikolaj Bjørner, Microsoft Research, USA William Byrd, University of Alabama at Birmingham, USA Gopal Gupta, The University of Texas at Dallas, USA Ekaterina Komendantskaya (chair), Heriot-Watt University, GBR Dale Miller, INRIA and LIX/Ecole Polytechnique, FRA Gopalan Nadathur, University of Minnesota, USA Frank Pfenning, Carnegie Mellon University, USA Hiroshi Unno, University of Tsukuba, JPN Noam Zeilberger, University of Birmingham, GBR Submission Instructions --------------------------- Since the aim of the workshop is to foster exchange and discussions on trends, extensions, applications and semantics of logic programming, we invite presentations of possibly already published as well as ongoing work. Submissions should be abstracts of at most two pages in EPTCS style (http://style.eptcs.org/) and will be only be published in the informal pre-proceedings and on the website of the workshop. Post-proceedings volume may be solicited by the PC, based on the quality of contributions. Contributions should be submitted via the Easychair system: https://easychair.org/my/conference?conf=teaselp2020 All contributions will be refereed by the programme committee and it is expected that at least one of the authors will be present during the workshop.

1 0

2nd Call for submissions: MT-CPS 2020
by Kohei SUENAGA 03 Feb '20

03 Feb '20

皆様，（重複してお受け取りの方はご容赦ください．）京都大学の末永です．来年4月下旬に開催される CPS-IoT Week 2020 併設のワークショップ MT-CPS 2020 の 2nd call for presentation をお送りします． https://sites.google.com/view/mt-cps2020/ サイバーフィジカルシステムのモニタリングとテストを中心として関連するトピックに関する発表を募集しております． CPS-IoT Week の会議 (HSCC, ICCPS, IPSN, RTAS, IC2E, ICFC, IoTDI) で論文が accept された皆様は特にご発表をご検討いただけると幸いです．宜しくお願いいたします．末永 ========================================================================== 5th Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS 2020) https://sites.google.com/view/mt-cps2020/home Part of CPS-IoT Week 2020 https://www.cse.unsw.edu.au/~cpsiot/cpsweek2020/ April 21, 2020 - Sydney, Australia ========================================================================== * Description Cyber-physical systems (CPS) model the integration of computational modules, like decision logic, with physical phenomena in the environment, such as the phenomenon being controlled by the logic. Several CPS applications, such as self-driving cars and other autonomous ground/aerial/underwater vehicles, medical devices, surgical robots, as well as many Internet of Things (IoT) applications, particularly for Industrial IoT or Industry 4.0, are safety-critical, where human lives can be at stake. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. Given the gap between the complexity of such systems and the scalability of current formal methods, exhaustive formal verification remains an elusive goal. However, simulation-based lightweight verification techniques, such as monitoring and testing, achieve both rigor and efficiency by enabling the evaluation of systems according to the properties of their exemplar behaviors. The Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS) aims to bring together researchers and practitioners interested in the problems of detecting, testing, measuring, and extracting qualitative and quantitative properties from individual behaviors of CPS. * Topics of interest include (but are not limited to): - Specification languages for monitoring and testing - Runtime verification and monitoring of CPS - Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing - Testing the integration of heterogeneous components - Monitoring and testing of streaming and/or historical IoT data - Interpretation of multi-dimensional counter-examples - Black-box and white-box testing - Measuring and statistical information gathering for data-driven analyses - Simulation-based verification and parameter synthesis - Fault diagnostics, localization, and recovery - Combination of static and dynamic analysis - Applications and case studies from safety-critical domains * Workshop format MT-CPS is intended to be a forum for exchanging the latest scientific activity and emerging trends between researchers and practitioners. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published or work in progress. In addition to the contributed material, the workshop will include a combination of invited talks from leading researchers and/or practitioners from industry, academia, and government research labs around the world. The workshop is intended to be an informal gathering about latest results and, as such, it will not have formal proceedings. However, we will make accepted abstracts and presentation material publicly available. Abstracts are submitted via Easychair: https://easychair.org/conferences/?conf=mtcps2020 * Submission instructions Abstracts should be in PDF form, up to 2 pages in length with 1-inch margins and at least 10-point font size, and may contain up to two figures. Abstracts should list the full names, affiliations, and contact information of all authors. If you are interested in demonstrating a technology you are working on at the workshop, please indicate so in your abstract submission. Abstracts will be reviewed by the Program Committee. Those that are selected for oral presentations will be posted on the workshop website, and will be part of the papers distributed to CPS-IoT Week participants. * Important Dates Abstract submission deadline: February 16, 2020 Notification: March 8, 2020 Final version: March 29, 2020 Workshop: April 21, 2020 * Committee - Program Chairs Paolo Arcaini, National Institute of Informatics Kohei Suenaga, Kyoto University - Program Committee Houssam Abbas, Oregon State University Shaukat Ali, Simula Research Laboratory Ezio Bartocci, Vienna University of Technology Thao Dang, Verimag Jyotirmoy Deshmukh, University of Southern California Alexandre Donzé, Decyphir Georgios Fainekos, Arizona State University Ichiro Hasuo, National Institute of Informatics Bardh Hoxha, Souther Illinois University Baekgyu Kim, Toyota InfoTechnology Center Konstantinos Mamouras, Rice University Mohammad Mousavi, University of Leicester Jens Oehlerking, Robert Bosch GmbH Akshay Rajhans, MathWorks Kristin Yvonne Rozier, Iowa State University Oleg Sokolsky, University of Pennsylvania - Steering Committee Houssam Abbas, Oregon State University Ezio Bartocci, Vienna University of Technology Jyotirmoy Deshmukh, University of Southern California Georgios Fainekos, Arizona State University Sajed Miremadi, Volvo Cars Dejan Nickovic, AIT Austrian Institute of Technology Jens Oehlerking, Bosch -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 0

証明論と計算論のワークショップ開催の案内@秋田大(3/23~3/25)
by Ryoma Sin'ya 03 Feb '20

03 Feb '20

みなさま，こんにちは、秋田大学の新屋と申します． 3月23日(月)--3月25日(水)の3日間，秋田大学にて証明論と計算論のワークショップを開催します．会場情報や講演者情報・プログラムを下記のページにて公開しています．皆様どうぞ奮ってご参加ください． https://sites.google.com/view/proof-computation-akita/home <https://sites.google.com/view/proof-computation-akita/home> 聴講参加は申し込み不要です．懇親会については事前に人数を把握しておきたいため，参加希望の方は 3月6日(金)までに新屋に懇親会参加の旨をご連絡いただけると幸いです．秋田大学数理科学コース新屋良磨

1 0

RC 2020 deadline extension
by Kazutaka Matsuda 03 Feb '20

03 Feb '20

皆様，東北大学の松田です．来年の7月9-10にオスロで開催される国際会議 RC 2020 の〆切が1週間延長されましたので，改めてご案内をお送りいたします．何卒投稿をご検討いただけますと幸いです． -------------------------------------------------- We apologize if you receive multiple copies of this Call for Papers. Please distribute to anyone who may be interested. ======================================================================= 12th Conference on Reversible Computation (RC 2020) Deadline extension July 9th-10th, 2020, Oslo, Norway Abstract Submission: February 7th, 2020 (extended) Submission Deadline: February 14th, 2020 (extended) https://reversible-computation-2020.github.io/ ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== Abstract submission: February 7, 2020 (extended) Submission deadline: February 14, 2020 (extended) Notification to authors: March 20, 2020 Final version: April 10, 2020 Conference: July 9 - July 10, 2020 ===== Invited speakers ===== Marek Perkowski (Portland State University, US) Perdita Stevens (University of Edinburgh, Scotland) ===== Special issue ===== After the conference, authors of best papers will be invited to submit an extended version of their work to a special issue to be published in Science of Computer Programming (Elsevier). ===== Paper submission ===== Interested researchers are invited to submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings and published by Springer as a Lecture Notes in Computer Science (LNCS) volume. Papers can be submitted electronically in pdf via the RC 2020 interface of the EasyChair system: https://easychair.org/conferences/?conf=rc2020 ===== General Chair ===== Rudolf Schlatte University of Oslo Norway ===== Program Chairs ===== Ivan Lanese University of Bologna/INRIA Italy Mariusz Rawski Warsaw University of Technology Poland ===== Program Committee ===== * Gerhard Dueck (University of New Brunswick, Canada) * Robert Glück (University of Copenhagen, Denmark) * Jarkko Kari (University of Turku, Finland) * Jean Krivine (CNRS, France) * Martin Lukac (Nazarbayev University, Kazakhstan) * Kazutaka Matsuda (Tohoku University, Japan) * Claudio Antares Mezzina (Università di Urbino, Italy) * Lukasz Mikulski (Nicolaus Copernicus University, Poland) * Torben Ægidius Mogensen (University of Copenhagen, Denmark) * Claudio Moraga (TU Dortmund University, Germany) * Iain Phillips (Imperial College London, UK) * Krzysztof Podlaski (University Of Lodz, Poland) * Markus Schordan (Lawrence Livermore National Laboratory, US) * Peter Selinger (Dalhousie University, Canada) * Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland) * Milena Stankovic (University of Nis, Serbia) * Himanshu Thapliyal (University of Kentucky, US) * Irek Ulidowski (University of Leicester, UK) * German Vidal (Universitat Politecnica de Valencia, Spain) * Robert Wille (Johannes Kepler University Linz, Austria) * Tetsuo Yokoyama (Nanzan University, Japan)

1 0

Call for Applications: 100 grants - “Sao Paulo School of Advanced Science on Contemporary Logic, Rationality and Information” at CLE/Unicamp, Brazil
by Hitoshi Omori 22 Jan '20

22 Jan '20

皆様、 Walter Carnielli先生の依頼で、代理投稿させていただきます。どうぞよろしくお願い致します。大森仁 ************************************* Call for Applications: 100 grants - “Sao Paulo School of Advanced Science on Contemporary Logic, Rationality and Information” at CLE/Unicamp, Brazil *https://splogic.org* Important deadlines & procedures: -Applications from January 15th to February 22th, 2020 -Notification of acceptance till March 23th, 2020 -Fast application track: https://splogic.org/call-for-entries/ - For further info: cle.fapesp.logic(a)gmail.com ************************************ We are delighted to inform that the “Sao Paulo School of Advanced Science on Contemporary Logic, Rationality and Information – SPLogiC”, promoted by the Centre for Logic, Epistemology and the History of Science (CLE) of the University of Campinas (Unicamp),Brazil, will be held at Unicamp from July 13th to 24th, 2020. The School, funded by Sao Paulo Research Foundation (FAPESP), celebrates the 90th anniversary of Newton da Costa and aims at: - Providing an overview of the state-of-art methodology and research on contemporary logic (featuring non-classical logics), rationality and information. - Attracting qualified candidates to work on research institutions in the State of São Paulo. The program comprises 9 courses and 9 plenary talks delivered in English by experts in each topic, as well as oral presentations (LED Talks) and poster sessions by the students. Topics to be covered include: • History and Philosophy of Paraconsistent Logics • The Australian, Belgian Brazilian,and Israeli schools on paraconsistency • Logic and Reasoning • Logic and Information • Logic and Argumentation • Methodological aspects on interpreting, translating and combining logics • Logic, Probabiity and Artificial Intelligence. The event will select 100 fully-funded participants (50 grantees from all states of Brazil and 50 international grantees). Funding includes airfare, medical insurance, accommodation and meals throughout the two weeks. Undergraduate, graduate students and postdoctoral fellows (up to 5 years after completion of the Ph.D) from all countries are encouraged to apply. For additional information visit the WebSite: https://splogic.org We look forward to receiving you! Itala M. Loffredo D’Ottaviano, Coordinator Walter Carnielli, Advisory Committee Chair ----------------------------------------------- Centre for Logic, Epistemology and the History of Science State University of Campinas –UNICAMP 13083-859 Campinas -SP, Brazil ----------------------------------------------- Walter Carnielli https://waltercarnielli.com/

1 0

【参加募集】第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020)
by Ryosuke SATO 22 Jan '20

22 Jan '20

皆様（重複ご容赦ください），九州大学の佐藤です． 3月2日(月) 〜 4日(水)に，佐賀県嬉野市で開催される，第22回プログラミングおよびプログラミング言語ワークショップ (PPL2020) の参加登録を開始いたしましたので，ご案内いたします．多くの方々のご参加をお待ちしております．参加登録の締切は2月16日(水)です．どうぞお早めのご登録をお願い致します．また，カテゴリ3 (ポスター・デモ発表) の発表申込締切が2月3日(金) 17:00 (JST) となっております．こちらの投稿もあわせてご検討ください． -------------------------------------------------------------------------- 第22回プログラミングおよびプログラミング言語ワークショップ（PPL2020） https://jssst-ppl.org/workshop/2019/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2020年3月2日(月) 〜 4日(水) 会場: 佐賀県嬉野市嬉野温泉「和多屋別荘」 PPL2020 は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果や新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2020/registration.html 参加登録締切：2020年2月16日(水) 問い合わせ先： ppl2020-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2020-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プラチナスポンサー KLab株式会社・ゴールドスポンサー株式会社オプト・シルバースポンサー株式会社HERP 株式会社フィックスターズ・プログラム委員会平石拓 (京都大学)[プログラム共同委員長] 森畑明昌 (東京大学)[プログラム共同委員長] 安部達也 (千葉工業大学) 荒堀喜貴 (東京工業大学) 石崎一明 (日本 IBM) 今井敬吾 (岐阜大学) 岩崎英哉 (電気通信大学) 岩間太 (日本 IBM) 馬谷誠二 (神奈川大学) 江本健斗 (九州工業大学) 大岩寛 (産業技術総合研究所) 紙名哲生 (大分大学) 亀山幸義 (筑波大学) 川端英之 (広島市立大学) 川本裕輔 (産業技術総合研究所) 菊池健太郎 (東北大学) 木村大輔 (東邦大学) 小島健介 (京都大学) 新屋良磨 (秋田大学) 関山太朗 (国立情報学研究所) 叢悠悠 (東京工業大学) 寺内多智弘 (早稲田大学) 日高宗一郎 (法政大学) 廣川直 (北陸先端科学技術大学院大学) 水島宏太 (オプト) 森口草介 (関西学院大学) ・組織委員会佐藤亮介 (九州大学)[組織委員長] 浅田和之 (東北大学)[組織副委員長] 塚田武志 (東京大学)[財務担当] 木村大輔 (東邦大学)[財務副担当] 叢悠悠 (東京工業大学)[会場担当] 新屋良磨 (秋田大学)[会場副担当] 関山太朗 (国立情報学研究所)[渉外担当] 平石拓 (京都大学)[プログラム共同委員長] 森畑明昌 (東京大学)[プログラム共同委員長] ================================================================

1 0

RC 2020 Second CFP
by Kazutaka Matsuda 17 Jan '20

17 Jan '20

皆様，東北大学の松田です．来年の7月9-10にオスロで開催される国際会議 RC 2020 の第二回論文募集の案内をお送りいたします．前回（第一回）からの主な情報の差分は招待講演者の情報です．具体的には，RC 2020の招待講演が以下の方々に決定いたしました． Marek Perkowski (Portland State University, US) Perdita Stevens (University of Edinburgh, Scotland) 何卒投稿をご検討いただければ幸いです． ------------- We apologize if you receive multiple copies of this Call for Papers. Please distribute to anyone who may be interested. ======================================================================= 12th Conference on Reversible Computation (RC 2020) July 9th-10th, 2020, Oslo, Norway Abstract Submission: January 31th, 2020 Submission Deadline: February 7th, 2020 https://reversible-computation-2020.github.io/ ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== Abstract submission: January 31, 2020 Submission deadline: February 7, 2020 Notification to authors: March 20, 2020 Final version: April 10, 2020 Conference: July 9 - July 10, 2020 ===== Invited speakers ===== Marek Perkowski (Portland State University, US) Perdita Stevens (University of Edinburgh, Scotland) ===== Special issue ===== After the conference, authors of best papers will be invited to submit an extended version of their work for a special issue in a relevant journal of the field. The name of the selected journal will be published on the RC website in the next days. ===== Paper submission ===== Interested researchers are invited to submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings and published by Springer as a Lecture Notes in Computer Science (LNCS) volume. Papers can be submitted electronically in pdf via the RC 2020 interface of the EasyChair system: https://easychair.org/conferences/?conf=rc2020 ===== General Chair ===== Rudolf Schlatte University of Oslo Norway ===== Program Chairs ===== Ivan Lanese University of Bologna/INRIA Italy Mariusz Rawski Warsaw University of Technology Poland ===== Program Committee ===== * Gerhard Dueck (University of New Brunswick, Canada) * Robert Glück (University of Copenhagen, Denmark) * Jarkko Kari (University of Turku, Finland) * Jean Krivine (CNRS, France) * Martin Lukac (Nazarbayev University, Kazakhstan) * Kazutaka Matsuda (Tohoku University, Japan) * Claudio Antares Mezzina (Università di Urbino, Italy) * Lukasz Mikulski (Nicolaus Copernicus University, Poland) * Torben Ægidius Mogensen (University of Copenhagen, Denmark) * Claudio Moraga (TU Dortmund University, Germany) * Iain Phillips (Imperial College London, UK) * Krzysztof Podlaski (University Of Lodz, Poland) * Markus Schordan (Lawrence Livermore National Laboratory, US) * Peter Selinger (Dalhousie University, Canada) * Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland) * Milena Stankovic (University of Nis, Serbia) * Himanshu Thapliyal (University of Kentucky, US) * Irek Ulidowski (University of Leicester, UK) * German Vidal (Universitat Politecnica de Valencia, Spain) * Robert Wille (Johannes Kepler University Linz, Austria) * Tetsuo Yokoyama (Nanzan University, Japan) ===== Contacts ===== rc2020(a)easychair.org https://reversible-computation-2020.github.io/

1 0

第52回TRSミーティング参加者募集のご案内
by Nao Hirokawa 03 Jan '20

03 Jan '20

皆様来年2月20日〜22日に石川県加賀市で行われます「第52回TRSミーティング」の参加者募集案内をお送り致します。本ミーティングは口頭発表からなるインフォーマルな国内集会でして、項書換え分野の発表だけでなくその隣接分野、応用分野の発表も大歓迎です。参加をご検討頂けると幸いです。廣川直 (JAIST) ====================================================================== CALL FOR PARTICIPATION 52nd TRS Meeting February 20 - 22, 2020, Kaga, Ishikawa https://www.jaist.ac.jp/~hirokawa/trs-meeting/original/52.html ====================================================================== The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk of approximately 15 to 60 minutes in English on their research activities. The subject of the talk is not required to be one's original result; for example, explaining an interesting paper is perfectly OK. See also: http://www.jaist.ac.jp/~hirokawa/trs-meeting/ * Information Date: February 20 (Thu) - 22 (Sat), 2020 Venue: Hotel Arrowle (http://www.arrowle.co.jp/) 5-1 Shibayama-cho, Kaga, Ishikawa, Japan Registration fee: tba (but most likely around 26,000 JPY) Accommodation fees: - 7,850 JPY per night for a single room - 6,200 JPY per night for a twin room shared with two persons * Registration Please send the following registration form to Nao Hirokawa <hirokawa(a)jaist.ac.jp> by January 7 (Tue), 2020. ---------------------------------------------------------------------- Registration Form of the 52nd TRS Meeting Name: Affiliation: Title of talk (*): Duration of talk (*): Preference on your room: [single / shared] [Male / Female] (leave one) Requests/comments (on foods, partial participation, etc.): ---------------------------------------------------------------------- The items marked with * can be sent later.

1 1

IJCAR 2020: CFP
by Takahito Aoto 24 Dec '19

24 Dec '19

皆様，国際会議IJCARの投稿募集です(概要締切1/16，論文締切1/23)．今回は，CADE, FroCoS, TABLEAUX だけでなくて，ITP (International Conference on Interactive Theorem Proving)の合同会議になっています．また，FSCDとの同時開催(6/29-7/5，@パリ)になります．ぜひ，ご投稿を検討頂けますよう，よろしくお願い申し上げます． --- 青戸等人(新潟大学) =============================================================================== CALL FOR PAPERS IJCAR 2020 The 10th International Joint Conference on Automated Reasoning Paris, France, June 29-July 5, 2020 https://ijcar2020.org =============================================================================== IJCAR is the premier international joint conference on all topics in automated reasoning. The IJCAR 2020 technical program will consist of presentations of high-quality original research papers, short papers describing interesting work in progress, system descriptions, and invited talks. IJCAR 2020 (+ workshops, tutorials, etc.) will take place in Paris (France) from June 29 to July 5 2020. It will be co-located with the conference FSCD. IJCAR 2020 is the merger of leading events in automated reasoning: * CADE (Conference on Automated Deduction) * FroCoS (Symposium on Frontiers of Combining Systems) * ITP (International Conference on Interactive Theorem Proving) * TABLEAUX (Conference on Analytic Tableaux and Related Methods) TOPICS ====== IJCAR 2020 invites submissions related to all aspects of automated or interactive reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems or proof assistants are solicited. IJCAR 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. The proceedings of IJCAR 2020 will be published by Springer in the LNAI/LNCS series (www.springer.com/lncs). IMPORTANT DATES =============== * Abstract submission: January 16, 2020 * Paper submission: January 23, 2020 * Rebuttal: March 6-10, 2020 * Notification: March 20, 2020 * Final version of papers due: April 10, 2020 * IJCAR Conference + Workshops: June 29 - July 5, 2020 INVITED SPEAKERS ================ * Clark Barrett (Stanford University, USA) * John Harrison (Amazon Web Services, USA) Joint IJCAR-FSCD speaker * Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) * Ruzica Piskac (Yale University, USA) * Rene Thiemann (University of Innsbruck, Austria) Joint FSCD-IJCAR speaker SUBMISSION GUIDELINES ===================== Submission is electronic, through https://easychair.org/conferences/?conf=ijcar2020 Authors are strongly encouraged to use LaTeX and the Springer "llncs" format, which can be obtained from http://www.springer.de/comp/lncs/authors.html We solicit three categories of submissions: REGULAR PAPERS. Submissions, not exceeding fifteen (15) pages excluding bibliography, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and software available with their submission for reproducibility. In particular submissions describing formal proofs are expected to be accompanied by the source files of the formalization. The PC will take availability of software and data into account when evaluating submissions. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses and strength in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. SYSTEM DESCRIPTIONS. Submissions, not exceeding seven (7) pages excluding bibliography, should describe the implemented tool and its novel features. Submissions in this category should bear the phrase "(system description)" beneath the title. One author is expected to be able to perform a demonstration on demand to accompany a tool presentation. 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. SHORT PAPERS. Submissions, not exceeding five (5) pages excluding bibliography, and describing interesting work in progress. Such a preliminary report may consist of an extended abstract. Each of these papers should bear the phrase "(short paper)" beneath the title. Accepted submissions in this category will be presented as short talks and published in the main proceedings. There will be no downgrading from regular papers or system descriptions to short papers. All submissions should meet high academic standards; proofs of theoretical results that do not fit in the page limit, executables of systems, and input data of experiments should be made available, via a reference to a website or in an appendix of the paper. BEST PAPER AWARD ================ IJCAR 2020 will recognize the most outstanding submission with a best paper award at the conference. STUDENT TRAVEL AWARDS ==================== Woody Bledsoe Travel Awards will be available to support selected students attending the conference. SPECIAL ISSUE ============= The authors of a selection of the best IJCAR 2020 papers will be invited to submit an extended version of their paper after the conference, to be published in a special issue of Logical Methods in Computer Science. ORGANIZATION ============ Conference Chair: * Kaustuv Chaudhuri (INRIA, Ecole Polytechnique) Programme Chairs: * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France), * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) Workshop, Tutorial and Competition Chairs: * Giulio Manzonetto (Université Paris-Nord, France) * Andrew Reynolds (University of Iowa, USA) Programme Committee: * Takahito Aoto (Niigata University, Japan) * Carlos Areces (FaMAF Universidad Nacional de Cordoba, Argentina) * Jeremy Avigad (Carnegie Mellon University, USA) * Franz Baader (TU Dresden, Germany) * Peter Baumgartner (Data 61 and CSIRO, Australia) * Christoph Benzmüller (Freie Universität Berlin, Germany) * Yves Bertot (INRIA, Sophia Antipolis, France) * Armin Biere (Johannes Kepler University Linz, Austria) * Nikolaj Bjorner (Microsoft Research, USA) * Jasmin Blanchette (Vrije Universiteit Amsterdam, Netherlands) * Maria Paola Bonacina (Universita degli Studi di Verona, Italy) * James Brotherston (University College London, UK) * Serenella Cerrito (IBISC, Univ. Evry, Paris Saclay University, France) * Agata Ciabattoni (Vienna University of Technology, Austria) * Koen Claessen (Chalmers University of Technology, Gothenburg, Sweden) * Leonardo de Moura (Microsoft Research, USA) * Stéphane Demri (CNRS, LSV, ENS Paris-Saclay, France) * Gilles Dowek (Inria and ENS Paris-Saclay, France) * Marcelo Finger (University of São Paulo, Brazil) * Pascal Fontaine (Universite de Lorraine, CNRS, Inria, LORIA, France) * Didier Galmiche (Universite de Lorraine - LORIA, France) * Silvio Ghilardi (Universita degli Studi di Milano, Italy) * Martin Giese (Universitetet i Oslo, Norway) * Juergen Giesl (RWTH Aachen University, Germany) * Valentin Goranko (Stockholm University, Sweden) * Rajeev Gore (The Australian National University, Australia) * Stefan Hetzl (Vienna University of Technology, Austria) * Marijn J. H. Heule (The University of Texas at Austin, USA) * Cezary Kaliszyk (University of Innsbruck, Austria) * Deepak Kapur (University of New Mexico, USA) * Laura Kovacs (Vienna University of Technology, Austria) * Andreas Lochbihler (Digital Asset (Switzerland) GmbH) * Christopher Lynch (Clarkson University, USA) * Assia Mahboubi (Inria, France) * Panagiotis Manolios (Northeastern University, USA) * Dale Miller (Inria and LIX/Ecole Polytechnique, France) * Claudia Nalon (University of Brasilia, Brazil) * Tobias Nipkow (Technical University of Munich, Germany) * Albert Oliveras (Universitat Politècnica de Catalunya, Spain) * Jens Otten (University of Oslo, Norway) * Lawrence Paulson (University of Cambridge, UK) * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France) * Frank Pfenning (Carnegie Mellon University, USA) * Andrei Popescu (Middlesex University London, UK) * Andrew Reynolds (University of Iowa, USA) * Christophe Ringeissen (LORIA-INRIA, France) * Christine Rizkallah (University of New South Wales, Australia) * Katsuhiko Sano (Hokkaido University, Japan) * Renate Schmidt (The University of Manchester, UK) * Stephan Schulz (DHBW Stuttgart, Germany) * Roberto Sebastiani (DISI, University of Trento, Italy) * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) * Matthieu Sozeau (INRIA Paris, France) * Martin Suda (Czech Technical University, Czech Republic) * Geoff Sutcliffe (University of Miami, USA) * Sofiene Tahar (Concordia University, Canada) * Cesare Tinelli (The University of Iowa, USA) * Christian Urban (King's College London, UK) * Josef Urban (Czech Technical University in Prague, Czech Republic) * Uwe Waldmann (Max Planck Institute for Informatics, Germany) * Christoph Weidenbach (Max Planck Institute for Informatics, Germany)

1 0

Call for submissions: MT-CPS 2020
by Kohei SUENAGA 17 Dec '19

17 Dec '19

皆様，（重複してお受け取りの方はご容赦ください．）京都大学の末永です．来年4月下旬に開催される CPS-IoT Week 2020 併設のワークショップ MT-CPS 2020 の発表募集をお送りします． https://sites.google.com/view/mt-cps2020/ サイバーフィジカルシステムのモニタリングとテストを中心として関連するトピックに関する発表を募集しております． CPs-IoT Week にお越しの方は特に，それ以外の方もどうぞ発表をご検討ください．末永 ========================================================================== 5th Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS 2020) https://sites.google.com/view/mt-cps2020/home Part of CPS-IoT Week 2020 https://www.cse.unsw.edu.au/~cpsiot/cpsweek2020/ April 21, 2020 - Sydney, Australia ========================================================================== * Description Cyber-physical systems (CPS) model the integration of computational modules, like decision logic, with physical phenomena in the environment, such as the phenomenon being controlled by the logic. Several CPS applications, such as self-driving cars and other autonomous ground/aerial/underwater vehicles, medical devices, surgical robots, as well as many Internet of Things (IoT) applications, particularly for Industrial IoT or Industry 4.0, are safety-critical, where human lives can be at stake. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. Given the gap between the complexity of such systems and the scalability of current formal methods, exhaustive formal verification remains an elusive goal. However, simulation-based lightweight verification techniques, such as monitoring and testing, achieve both rigor and efficiency by enabling the evaluation of systems according to the properties of their exemplar behaviors. The Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS) aims to bring together researchers and practitioners interested in the problems of detecting, testing, measuring, and extracting qualitative and quantitative properties from individual behaviors of CPS. * Topics of interest include (but are not limited to): - Specification languages for monitoring and testing - Runtime verification and monitoring of CPS - Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing - Testing the integration of heterogeneous components - Monitoring and testing of streaming and/or historical IoT data - Interpretation of multi-dimensional counter-examples - Black-box and white-box testing - Measuring and statistical information gathering for data-driven analyses - Simulation-based verification and parameter synthesis - Fault diagnostics, localization, and recovery - Combination of static and dynamic analysis - Applications and case studies from safety-critical domains * Workshop format MT-CPS is intended to be a forum for exchanging the latest scientific activity and emerging trends between researchers and practitioners. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published or work in progress. In addition to the contributed material, the workshop will include a combination of invited talks from leading researchers and/or practitioners from industry, academia, and government research labs around the world. The workshop is intended to be an informal gathering about latest results and, as such, it will not have formal proceedings. However, we will make accepted abstracts and presentation material publicly available. Abstracts are submitted via Easychair: https://easychair.org/conferences/?conf=mtcps2020 * Submission instructions Abstracts should be in PDF form, up to 2 pages in length with 1-inch margins and at least 10-point font size, and may contain up to two figures. Abstracts should list the full names, affiliations, and contact information of all authors. If you are interested in demonstrating a technology you are working on at the workshop, please indicate so in your abstract submission. Abstracts will be reviewed by the Program Committee. Those that are selected for oral presentations will be posted on the workshop website, and will be part of the papers distributed to CPS-IoT Week participants. * Important Dates Abstract submission deadline: February 16, 2020 Notification: March 8, 2020 Final version: March 29, 2020 Workshop: April 21, 2020 * Committee - Program Chairs Paolo Arcaini, National Institute of Informatics Kohei Suenaga, Kyoto University - Program Committee Houssam Abbas, Oregon State University Shaukat Ali, Simula Research Laboratory Ezio Bartocci, Vienna University of Technology Thao Dang, Verimag Jyotirmoy Deshmukh, University of Southern California Alexandre Donzé, Decyphir Georgios Fainekos, Arizona State University Ichiro Hasuo, National Institute of Informatics Bardh Hoxha, Souther Illinois University Baekgyu Kim, Toyota InfoTechnology Center Konstantinos Mamouras, Rice University Mohammad Mousavi, University of Leicester Jens Oehlerking, Robert Bosch GmbH Akshay Rajhans, MathWorks Kristin Yvonne Rozier, Iowa State University Oleg Sokolsky, University of Pennsylvania - Steering Committee Houssam Abbas, Oregon State University Ezio Bartocci, Vienna University of Technology Jyotirmoy Deshmukh, University of Southern California Georgios Fainekos, Arizona State University Sajed Miremadi, Volvo Cars Dejan Nickovic, AIT Austrian Institute of Technology Jens Oehlerking, Bosch

1 0

FSCD 2020 - Second CFP
by Nao Hirokawa 13 Dec '19

13 Dec '19

皆様 6月末にパリで行われます FSCD 2020 の二回目の論文募集案内をお送り致します。招待講演者の情報が加筆されております。ぜひ論文の投稿をご検討下さい。廣川 (JAIST) ========================================================================= Updated information on: Invited speakers ========================================================================= 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 INVITED SPEAKERS ---------------- - René Thiemann: FSCD-IJCAR joint speaker (http://cl-informatik.uibk.ac.at/users/thiemann/) - John Harrison: FSCD-IJCAR joint speaker (https://www.cl.cam.ac.uk/~jrh13/) - Brigitte Pienta (https://www.cs.mcgill.ca/~bpientka/) - Andrew Pitts (https://www.cl.cam.ac.uk/~amp12/) - Simona Ronchi della Rocca (http://www.di.unito.it/~ronchi/) 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 (poly- morphism, dependent, recursive, intersection, session, etc.); Induction, coinduction; Matching, unification, completion, order- ings; 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 sys- tems 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. Fernández, 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 F. van Raamsdonk, Vrije 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)

1 0

【投稿受付中】第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020)
by Kazuyuki ASADA 10 Dec '19

10 Dec '19

皆様，（重複受信ご容赦ください） # カテゴリ1（国内外未発表論文）の発表申込締切2週間前となりましたので， # 改めてCFPを送らせていただきます．ぜひ投稿をご検討ください．日本ソフトウェア科学会プログラミング論研究会は，第22回プログラミングおよびプログラミング言語ワークショップ（PPL 2020）を，2020年3月2日（月）～3月4日（水）に佐賀県嬉野市で開催いたします．理論・実装を問わずプログラミング・プログラミング言語に関する研究発表を幅広く募集します．どうぞ投稿をご検討ください．森畑明昌（東京大学）平石拓（京都大学）（PPL 2020 プログラム共同委員長）（代理で浅田和之（東北大学）が送信しました） ================================================== 第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020) 発表募集 2020年3月2日（月）-- 3月4日（水）佐賀県嬉野市「嬉野温泉　和多屋別荘」 https://jssst-ppl.org/workshop/2020/ ** 重要な日程 ** カテゴリ1: 発表申込締切 2019年12月24日（火）17:00 (JST) 論文提出締切 2020年 1月 7日（火）17:00 (JST) 採否通知 2020年 1月31日（金）最終原稿締切 2020年 2月12日（水）カテゴリ2: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月）カテゴリ3: 発表申込締切 2020年 2月 3日（月）17:00 (JST) 採否通知 2020年 2月 7日（金）カテゴリ4: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月） ** PPL2020とは ** PPL2020は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果や新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．代表的なトピックは以下のようなものですが，これに限らず，プログラミング・プログラミング言語に関する研究発表を幅広く受け入れます．基礎理論: 意味論，ラムダ計算，型理論，項書き換え，形式論理と証明，形式言語とオートマトン，圏論，チューリング機械，アルゴリズムなど言語デザイン: 各種プログラミングパラダイム（オブジェクト指向・関数型・論理型・アスペクト指向，その他あらゆるパラダイムを含む），モジュール化，メタプログラミング，並行・並列・分散計算，型システム，言語や言語システム等の相互運用，領域限定言語など言語処理系技術: コンパイラ，インタプリタ，実行時システム，仮想機械，プログラム最適化，プログラム解析，プログラム変換，メモリ管理などプログラミング補助: プログラム検証器，デバッガ，プロファイラ，統合開発環境，プログラム合成，リファクタリングなどケーススタディ: ソフトウェア開発報告，プログラミング技法，ツールの紹介など応用: システムソフトウェア，Webシステム，データベースシステム，数値計算，ユーザーインタフェース，セキュリティ，プログラミング教育，人工知能・機械学習など ** 招待講演 ** PPL2020では，以下のお二方の招待講演を予定しております．石川冬樹（NII）関浩之（名古屋大学）「データ値を扱うオートマトンと文法」 ** 発表募集カテゴリ ** 以下の4カテゴリの研究発表を募集します．カテゴリ1: 国内外で未発表の研究の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表カテゴリ4: サーベイ・チュートリアル発表カテゴリ1では，国内外で未発表の研究についての論文発表を募集します．PPL での議論をもとに研究を発展させ，国際会議や学術論文誌への投稿につなげることを奨励しています．会場で実りある議論ができるような，発展途上の研究を特に歓迎します．カテゴリ1の発表は，複数名の査読者によってその新規性・重要性・根拠の確かさ・説明の明瞭さを評価し，プログラム委員による議論によって採否を判断します．特に以下の点に注意してください． - 理論的な研究については，形式化の明瞭さと正しさが重要です．論文中に明示してあれば証明等が未完成でも構いませんが，証明等について議論できる程度の形式化は求められます． - 実装研究については，実装したソフトウェアやツールの有用性，実装のデザインチョイス，実装技術などが明瞭に説明されているかが重要です．論文中に明示してあれば実装や実験が未完成でも構いませんが，上記の点を議論できる程度の完成度は求められます．カテゴリ1で発表された研究のうち，PPL2020プログラム委員会により優れていると認められたものは， PPL2020終了後（2020年6月中旬投稿締切予定），「コンピュータソフトウェア」誌のPPL2020推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．また，特集号の締切後であっても，推薦を受けた研究もしくはそれをさらに発展させた研究をPPL推薦論文として「コンピュータソフトウェア」誌に投稿することが可能です．たとえば，PPLで発表した研究を国際会議等で発表した後，さらに発展させて推薦論文として投稿することができます．カテゴリ2では，国際会議や国際学術論文誌等で発表された，または採録決定済みの，国内では未発表の研究成果の紹介を募集します．PPLとの関連性・プログラム全体のバランス・発表された媒体をもとに，プログラム委員による議論によって採否を判断します．カテゴリ3では，PPLに関連する内容（未発表・既発表いずれでも構いません）についてのポスター発表を募集します．萌芽的なアイデアの紹介やツールのデモンストレーションなども歓迎します．PPLとの関連性・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ4では，既存研究のサーベイやツールのチュートリアルなど，PPLの聴衆にとって有益な学術知識の紹介を募集します．内容は未発表・既発表いずれでも構いません．PPLとの関連性・内容の重要性・発表者の経歴・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．さらに，カテゴリ1・2・4の全発表のなかから最も聴衆の支持を集めたものに発表賞，カテゴリ3の全発表のなかから最も聴衆の支持を集めたものにポスター賞を授与する予定です（いずれも一般の部・学生の部の2種類，ただし「発表賞」は既受賞者を除く）． ** 投稿・発表申込要領 ** すべてのカテゴリの投稿・発表について，以下のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2020 申込にあたってはEasyChairのアカウントが必要です．申し込み時にEasychair で入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．各カテゴリの申込要領の詳細は以下の通りです．カテゴリ1（国内外未発表論文） --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込: 著者名，所属，論文タイトル，論文概要（日本語300〜400字程度，もしくは英語200 words程度），キーワード（3つ以上）を提出してください．論文提出: 本文10〜15ページ程度（参考文献を除く）の論文（日本語もしくは英語， PDF形式．PPL2020ウェブページにて指定のスタイルファイルを利用のこと）を提出してください．最大ページ数を超える付録は投稿版に入れることができます（最終原稿においては削除いただく可能性があります）．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採録された論文の最終原稿の提出方法は，採否通知にてお知らせします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください．また，採録された論文等著作物に対して著作権の譲渡を求めません． (注) 投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ------------------------- 原論文（ページ数不問，PDF形式）と論文概要（テキスト形式）を，著者名，所属，論文タイトル，キーワード（3つ以上）と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．カテゴリ3（ポスター・デモ発表） ----------------------------- 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要（200〜 300字程度），キーワード（3つ以上）を提出してください．発表形態については発表タイトル（Title欄）の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 著者名，所属，発表タイトル，キーワード（3つ以上），発表概要（3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの）提出してください． ** プログラム委員会 ** 安部達也千葉工業大学荒堀喜貴東京工業大学石崎一明日本IBM 今井敬吾岐阜大学岩崎英哉電気通信大学岩間太日本IBM 馬谷誠二神奈川大学江本健斗九州工業大学大岩寛産業技術総合研究所紙名哲生大分大学亀山幸義筑波大学川端英之広島市立大学川本裕輔産業技術総合研究所菊池健太郎東北大学木村大輔東邦大学小島健介京都大学新屋良磨秋田大学関山太朗国立情報学研究所叢悠悠東京工業大学寺内多智弘早稲田大学日高宗一郎法政大学平石拓京都大学 (プログラム共同委員長) 廣川直北陸先端科学技術大学院大学水島宏太オプト森口草介関西学院大学森畑明昌東京大学 (プログラム共同委員長) ** スポンサー（2019/12/10現在） ** プラチナスポンサー KLab株式会社ゴールドスポンサー株式会社オプトシルバースポンサー株式会社HERP 株式会社ぺあのしすてむ ** 問い合わせ先 ** ppl2020-oc ＠ googlegroups.com（ワークショップ全般について） ppl2020-pc-chair ＠ jssst-ppl.org（発表/プログラムについて）

1 0

Arnold Beckmann教授講演会
by 山形賴之 10 Dec '19

10 Dec '19

皆様、産総研の山形と申します。Swansea大学のArnold Beckmann教授の講演会を下記の通り開催いたします。Beckmann教授は限定算術、証明複雑度およびそれらと計算複雑度との関係などを研究されています。入構に事前登録が必要なため、参加ご希望の方は12月12日正午までに山形まで、お名前と所属をお知らせください。参加ご希望の方は必ず事前に連絡していただくようお願いします。講演日時：12月13日14:00-15:00 場所：産総研関西センター C-6棟2階第16会議室 https://goo.gl/maps/ZJzcgE1agWLxypsk7 ************************* Arnold Beckmann: Consistency of equational theories and the separation problem for bounded arithmetic Abstract: The separation problem for bounded arithmetic is one of the most important problems in the area due to its tight connections to the question whether computational complexity classes can be separated, the Millennium problem whether P equals NP or not being the most well-known one. Well studied candidates for separating theories of bounded arithmetic are consistency statements of formal theories, building on Kurt Goedel's famous incompleteness theorems. The most promising consistency statements are given by those of certain equational theories. In our talk, we will review the results on consistency of equational theories in the context of the separation problem for bounded arithmetic. We explain the progress that has been made over recent years to advance this problem, and state the research programme that has resulted from it. ************************* よろしくご参集ください。 — 山形賴之国立研究開発法人産業技術総合研究所主任研究員 http://staff.aist.go.jp/yoriyuki.yamagata/

2 2

RC 2020 first CFP
by Kazutaka Matsuda 10 Dec '19

10 Dec '19

皆様，東北大学の松田です．来年の7月9-10にオスロで開催される国際会議 RC 2020 の論文募集の案内をお送りいたします．何卒投稿をご検討いただければ幸いです． ======================================================================= 12th Conference on Reversible Computation (RC 2020) July 9th-10th, 2020, Oslo, Norway Abstract Submission: January 31th, 2020 Submission Deadline: February 7th, 2020 https://reversible-computation-2020.github.io/ ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== Abstract submission: January 31, 2020 Submission deadline: February 7, 2020 Notification to authors: March 20, 2020 Final version: April 10, 2020 Conference: July 9 - July 10, 2020 ===== Invited speakers ===== TO BE ANNOUNCED ===== Paper submission ===== Interested researchers are invited to submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings and published by Springer as a Lecture Notes in Computer Science (LNCS) volume. Papers can be submitted electronically in pdf via the RC 2020 interface of the EasyChair system: https://easychair.org/conferences/?conf=rc2020 ===== General Chair ===== Rudolf Schlatte University of Oslo Norway ===== Program Chairs ===== Ivan Lanese University of Bologna/INRIA Italy Mariusz Rawski Warsaw University of Technology Poland ===== Program Committee ===== * Gerhard Dueck (University of New Brunswick, Canada) * Robert Glück (University of Copenhagen, Denmark) * Jarkko Kari (University of Turku, Finland) * Jean Krivine (CNRS, France) * Martin Lukac (Nazarbayev University, Kazakhstan) * Kazutaka Matsuda (Tohoku University, Japan) * Claudio Antares Mezzina (Università di Urbino, Italy) * Lukasz Mikulski (Nicolaus Copernicus University, Poland) * Torben Ægidius Mogensen (University of Copenhagen, Denmark) * Claudio Moraga (TU Dortmund University, Germany) * Iain Phillips (Imperial College London, UK) * Krzysztof Podlaski (University Of Lodz, Poland) * Markus Schordan (Lawrence Livermore National Laboratory, US) * Peter Selinger (Dalhousie University, Canada) * Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland) * Milena Stankovic (University of Nis, Serbia) * Himanshu Thapliyal (University of Kentucky, US) * Irek Ulidowski (University of Leicester, UK) * German Vidal (Universitat Politecnica de Valencia, Spain) * Robert Wille (Johannes Kepler University Linz, Austria) * Tetsuo Yokoyama (Nanzan University, Japan) ===== Contacts ===== rc2020(a)easychair.org https://reversible-computation-2020.github.io/

1 0

ラムダ計算と論理の早春セミナー2020
by Naosuke MATSUDA 10 Dec '19

10 Dec '19

みなさま神奈川大学の松田と申します．今年度も「ラムダ計算と論理の早春セミナー」を，下記要領で開催することになりました．場所：草津セミナーハウス日程：2020年3月7日(土)-11日(水) 詳細: https://sites.google.com/view/lls2020/home つきまして，ラムダ計算・論理およびその周辺の話題を広く募集しています．本セミナーでは，講演枠や講演時間を事前に固定せず，当日の参加者に状況に合わせて柔軟に計画をしてもらうようになっています．議論し成果を挙げる場・学生の簡単な発表の場など，さまざまな用途で利用していただければ幸いです．なお，今年度で草津セミナーハウスが閉鎖とのことで，草津セミナーハウスでの開催は今回が最後になります．多くの皆様のご参加をお待ちしております． -- 神奈川大学情報科学科松田直祐

1 0

リマインド　2020年度奨励研究生の選考について
by Teruyuki YORIOKA 06 Dec '19

06 Dec '19

みなさま静岡大学の依岡です．「２０２０年度奨励研究生」の募集期限が今月15日と近づいてまいりましたのであらためましてご案内申し上げます。 http://mathsoc.jp/publicity/news20191001/2020shourei.html 日本数学会事務局から，現時点で申請件数が極めて少ない状況であるという連絡を受けております．申請資格を持つ方々，申請資格を持つ指導学生がおられます先生方，ぜひ申請をご検討ください．よろしくお願いします．

1 0

基礎論セミナー
by arai toshiyasu 02 Dec '19

02 Dec '19

みなさま第3回の基礎論セミナーのお知らせです。どなたでも聴講できますのでご興味のおありの方はどうぞいらして下さい。 web page: https://www.ms.u-tokyo.ac.jp/seminar/logic/ 新井敏康第3回基礎論セミナー日時：2019年12月20日（金）13:00-14:30 場所：東京大学大学院数理科学研究科 156号室講演者：池上大祐 title: On supercompactness of \omega_1 abstract:: In ZFC, all the large cardinals are much bigger than \omega_1, the least uncountable cardinal, while without assuming the Axiom of Choice, \omega_1 could have some large cardinal properties. Jech and Takeuti independently proved that if the axiom system ZFC + There is a measurable cardinal is consistent, then so is ZF + \omega_1 is a measurable cardinal. Takeuti also proved that one can replace "measurable cardinal" above with "supercompact cardinal" as well as some other large cardinals. Woodin proved that one can reduce the assumption, i.e., the consistency of ZFC + a supercompact cardinal, to that of ZFC + There are proper class many Woodin cardinals which are limits of Woodin cardinals, to obtain the consistency of ZF + \omega_1 is a supercompact cardinal. Furthermore, the model he constructed also satisfies the Axiom of Determinacy (AD). In this talk, after giving some background on the connections between large cardinals and determinacy, we discuss some consequences of the axiom system ZF + \omega_1 is a supercompact cardinal. This is joint work with Nam Trang.

1 0

AWPL2020 - Deadline extended
by 小野寛晰 26 Nov '19

26 Nov '19

投稿の締め切りが　１２月２８日になりました。 ===================================================== AWPL 2020: 5th Asian Workshop on Philosophical Logic 7-9 April 2020 Hangzhou, China https://www.xixilogic.org/events/awpl2020/ <https://www.xixilogic.org/events/awpl2020/> ===================================================== CALL FOR PAPERS The 5th Asian Workshop on Philosophical Logic, 7-9 April 2020, Hangzhou, China Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second, third and fourth workshops took place successfully in Guangzhou (2014), Taipei (2016) and Beijing (2018), respectively. The previous post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer. The Fifth Asian Workshop on Philosophical Logic (AWPL 2020) will be held in Hangzhou, China, on 7-9 April 2020, organized by the Institute of Logic and Cognition at Zhejiang University. The AWPL 2020 workshop is an event in the Zhejiang Logic for AI Summit (ZjuLogAI 2020, https://www.xixilogic.org/zjulogai/ <https://www.xixilogic.org/zjulogai/>) which takes place on 6-10 April 2020. All AWPL participants are invited to attend other events as well. ------------------------ INVITED SPEAKERS (confirmed) Christoph Benzmüller <http://page.mi.fu-berlin.de/cbenzmueller/> (Freie Universität Berlin) ------------------------ SUBMISSION All submissions should present original works not previously published. Submissions should be typeset in English, using the LNCS template (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>), be prepared as a PDF file with at most 12 pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2020 <https://easychair.org/conferences/?conf=awpl2020>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series. ------------------------ IMPORTANT DATES Submission deadline: 28 December 2019. Notification: 1 January 2020 Workshop: 7-9 April 2020 ------------------------ PROGRAM COMMITTEE (to be confirmed) Thomas Ågotnes, University of Bergen Nick Bezhanishvili, University of Amsterdam Sujata Ghosh, Indian Statistical Institute Meiyun Guo, South-West University, China Fengkui Ju, Beijing Normal University Kok-Yong Lee, National Chung Cheng University Beishui Liao, Zhejiang University (chair) Hanti Lin, University of California Davis Fenrong Liu, Tsinghua University Hu Liu, Sun Yat-Sen University Xinwen Liu, Chinese Academy of Social Sciences Minghui Ma, Sun Yat-Sen University Hiroakira Ono, JAIST, Japan Eric Pacuit, University of Maryland R Ramanujam, Institute of Mathematical Sciences, India Olivier Roy, University of Bayreuth Katsuhiko Sano, Hokkaido University Yì N. Wáng, Zhejiang University (co-chair) Chin-Mu Yang, Taiwan National University Jiji Zhang, Lingnan University _______________________________________________ Logic-ml mailing list Logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:Logic-ml@fos.kuis.kyoto-u.ac.jp> http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml>

1 0

日本数学会2020年度年会講演申し込みのお知らせ
by Teruyuki YORIOKA 23 Nov '19

23 Nov '19

みなさま静岡大学の依岡です． 2020年度年会のお申し込みをしていただきましたみなさま，ありがとうございます．現時点で講演申し込みはまだ6件しかありません．大変少ない状況です．講演申し込みの締め切りは2019年11月29日（金）です．お忘れないよう，また締め切りに十分間に合いますよう，講演申し込みをお願い申し上げます． ---------- Forwarded message --------- From: Teruyuki YORIOKA <yorioka(a)shizuoka.ac.jp> Date: 2019年11月10日(日) 8:09 Subject: 日本数学会2020年度年会講演申し込みが始まっています To: <logic-ml(a)fos.kuis.kyoto-u.ac.jp>, <kisoron-ml(a)fos.kuis.kyoto-u.ac.jp> Cc: 依岡輝幸 <yorioka(a)shizuoka.ac.jp> みなさま静岡大学の依岡です．日本数学会2020年度年会講演申し込みが始まりました． http://mathsoc.jp/meeting/nichidai20mar/ 講演申し込みの締め切りは2019年11月29日（金）です．多数の方のお申し込みを願っています．ネットワークメンテナンスのため，締め切り間際である 2019年11月27日 03:00～05:00 および 11月28日 03:00～05:00 の予定で日本数学会のページおよびアクティベーション／講演申し込み／会合申し込み等の各サービスが利用できなくなるそうです．講演申し込みは時間に余裕を持って，なるべく早くにお申し込みください．

1 0

基礎論セミナー
by arai toshiyasu 20 Nov '19

20 Nov '19

みなさま直前になりましたが、第2回の基礎論セミナーのお知らせです。どなたでも聴講できますのでご興味のおありの方はどうぞいらして下さい。 web page: https://www.ms.u-tokyo.ac.jp/seminar/logic/ 新井敏康第2回基礎論セミナー日時：2019年11月21日（木）13:30-15:00 場所：東京大学大学院数理科学研究科 003号室講演者：佐藤憲太郎 title: Self-referential Theorems for Finitist Arithmetic abstract:: The finitist logic excludes,on the syntax level, unbounded quantifiers and accommodates only bounded quantifiers. The following two self-referential theorems for arithmetic theories over the finitist logic will be considered: Tarski's impossibility of naive truth predicate and Goedel's incompleteness theorem. Particularly, it will be briefly explained that (i) the naive truth theory over the finitist arithmetic with summation and multiplication is consistent and proves its own consistency, and that (ii) by the use of finitist arithmetic, the hierarchy of consistency strengths, based on Goedel's second incompleteness theorem, can be extended downward (to the area not reachable by first order predicate arithmetic). This is a joint work with Jan Walker, and overlaps significantly with his doctoral dissertation. 問合せ先：新井敏康 tosarai(a)ms.u-tokyo.ac.jp

1 1

『第7回山陰基礎論・解析学研究集会』の御案内
by 堀畑佳宏 19 Nov '19

19 Nov '19

皆さま（重複でのご案内は申し訳ございません）米子高専の堀畑です．鳥取県米子市で標記研究会を開催します．ざっくばらんな会となっていますので，お気軽にご参加ください！ ** 日時 ** 2020年1月12日（日）（10時～17時・仮） ** 場所 ** 米子コンベンションセンター 3F 第3会議室（米子駅から徒歩で5分程） http://bigship.sanin.jp/bigship/organizer/6/ 　 ** 研究会HP ** https://sites.google.com/site/yonagonctmath/slas2020 （ホームから過去開催のプログラムも見られます） ** 締切 ** 〇 12月9日（月）参加・講演申し込み　下記連絡票を堀畑（horihata(a)yonago-k.ac.xn--jp)-u63bmd1e2gs5ayc3h4683a. 　※プログラムを12/9～の週に送付予定．〇 12月23日（月）アブストラクト提出　発表者は添付ファイルで作成し，　「tex ファイル」と「コンパイルした pdf」を堀畑に送付． ** 懇親会 **　米子駅周辺にて 1月11日（土）18時頃～ 1月12日（日）18時頃～ ▼▼連絡票▼▼ （１）研究会に参加？（○ ×）（２）講演を行う？　（○ ×）（３）懇親会参加？　（両日 or 1/11のみ or 1/12のみ）（４）講演タイトル（発表者のみ）要望等： ▲▲▲▲▲▲▲ 周りで興味ありそうな方にもお声掛け頂き，本メールを転送して頂いて構いません！たくさんの方に参加して頂ければ幸いです！世話人：堀畑佳宏（米子高専教養教育科・数学） E-mail: horihata(a)yonago-k.ac.jp 会場責任者：古清水大直（米子高専教養教育科・数学）

1 0

A Workshop in Honour of John Power on the occasion of his 60th Birthday
by Masahito Hasegawa 18 Nov '19

18 Nov '19

Workshop Announcement Categorical Algebra and Computation A Workshop in Honour of John Power on the occasion of his 60th Birthday 23rd December 2019 Research Institute for Mathematical Sciences, Kyoto University http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/ We are delighted to host a workshop in honour of John Power on the occasion of his 60th birthday at RIMS, Kyoto University. John, recently retired and now a honorary professor at Macquarie University, Sydney, is staying in Kyoto as a visiting professor of RIMS for the winter of 2019/2020. During his stay in Kyoto, John turns 60. John has made substantial contributions in category theory and its applications to computer science throughout his career. At the same time, he has been a wonderful teacher, mentor and friend to many of us, with his exceptional insights, kindness, and humour. Since the 1990's John has regularly visited Japan and worked with Japanese researchers, including several PhD students and young postdocs. John's presence has made great impact on Japanese research community of semantics of computation and related fields; John has co-authored a number of papers with young Japanese researchers and served as their mentor. This workshop will feature talks by John's friends and collaborators as well as young Japanese researchers who are under the influence of John's work in a broad sense. The speakers will include - Soichiro Fujii (Kyoto University) - Shin-ya Katsumata (NII, Tokyo) - Yoshiki Kinoshita (Kanagawa University) - Yuichi Komorida (NII, Tokyo) - Steve Lack (Macquarie University) - Ken Sakayori (University of Tokyo) and John Power. Registration Attendance is free. Please register at the workshop webpage http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/ so that we can estimate the number of participants. (We plan to supply tea, coffee and sweets during the break.) Venue The workshop will take place in the conference room 420 of the RIMS main building located in the North Campus of the university. For access information and maps see http://www.kurims.kyoto-u.ac.jp/en/access-01.html Organizers - Masahito Hasegawa (local organizer) (Kyoto University) - Ichiro Hasuo (NII, Tokyo) - Makoto Takeyama (Kanagawa University)

1 0

【投稿受付開始】第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020)
by Kazuyuki ASADA 11 Nov '19

11 Nov '19

皆様，（重複受信ご容赦ください）日本ソフトウェア科学会プログラミング論研究会は，第22回プログラミングおよびプログラミング言語ワークショップ（PPL 2020）を，2020年3月2日（月）～3月4日（水）に佐賀県嬉野市で開催いたします．このたび論文の投稿受付を開始いたしましたので，改めてCFPを送らせていただきます．理論・実装を問わずプログラミング・プログラミング言語に関する研究発表を幅広く募集します．どうぞ投稿をご検討ください．よろしくお願いいたします．森畑明昌（東京大学）平石拓（京都大学）（PPL 2020 プログラム共同委員長）（代理で浅田和之（東北大学）が送信しました） ================================================== 第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020) 発表募集 2020年3月2日（月）-- 3月4日（水）佐賀県嬉野市「嬉野温泉和多屋別荘」 https://jssst-ppl.org/workshop/2020/ ** 重要な日程 ** カテゴリ1: 発表申込締切 2019年12月24日（火）17:00 (JST) 論文提出締切 2020年 1月 7日（火）17:00 (JST) 採否通知 2020年 1月31日（金）最終原稿締切 2020年 2月12日（水）カテゴリ2: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月）カテゴリ3: 発表申込締切 2020年 2月 3日（月）17:00 (JST) 採否通知 2020年 2月 7日（金）カテゴリ4: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月） ** PPL2020とは ** PPL2020は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果や新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．代表的なトピックは以下のようなものですが，これに限らず，プログラミング・プログラミング言語に関する研究発表を幅広く受け入れます．基礎理論: 意味論，ラムダ計算，型理論，項書き換え，形式論理と証明，形式言語とオートマトン，圏論，チューリング機械，アルゴリズムなど言語デザイン: 各種プログラミングパラダイム（オブジェクト指向・関数型・論理型・アスペクト指向，その他あらゆるパラダイムを含む），モジュール化，メタプログラミング，並行・並列・分散計算，型システム，言語や言語システム等の相互運用，領域限定言語など言語処理系技術: コンパイラ，インタプリタ，実行時システム，仮想機械，プログラム最適化，プログラム解析，プログラム変換，メモリ管理などプログラミング補助: プログラム検証器，デバッガ，プロファイラ，統合開発環境，プログラム合成，リファクタリングなどケーススタディ: ソフトウェア開発報告，プログラミング技法，ツールの紹介など応用: システムソフトウェア，Webシステム，データベースシステム，数値計算，ユーザーインタフェース，セキュリティ，プログラミング教育，人工知能・機械学習など ** 招待講演 ** PPL2020では，以下のお二方の招待講演を予定しております．石川冬樹（NII）関浩之（名古屋大学） ** 発表募集カテゴリ ** 以下の4カテゴリの研究発表を募集します．カテゴリ1: 国内外で未発表の研究の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表カテゴリ4: サーベイ・チュートリアル発表カテゴリ1では，国内外で未発表の研究についての論文発表を募集します．PPL での議論をもとに研究を発展させ，国際会議や学術論文誌への投稿につなげることを奨励しています．会場で実りある議論ができるような，発展途上の研究を特に歓迎します．カテゴリ1の発表は，複数名の査読者によってその新規性・重要性・根拠の確かさ・説明の明瞭さを評価し，プログラム委員による議論によって採否を判断します．特に以下の点に注意してください． - 理論的な研究については，形式化の明瞭さと正しさが重要です．論文中に明示してあれば証明等が未完成でも構いませんが，証明等について議論できる程度の形式化は求められます． - 実装研究については，実装したソフトウェアやツールの有用性，実装のデザインチョイス，実装技術などが明瞭に説明されているかが重要です．論文中に明示してあれば実装や実験が未完成でも構いませんが，上記の点を議論できる程度の完成度は求められます．カテゴリ1で発表された研究のうち，PPL2020プログラム委員会により優れていると認められたものは， PPL2020終了後（2020年6月中旬投稿締切予定），「コンピュータソフトウェア」誌のPPL2020推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．また，特集号の締切後であっても，推薦を受けた研究もしくはそれをさらに発展させた研究をPPL推薦論文として「コンピュータソフトウェア」誌に投稿することが可能です．たとえば，PPLで発表した研究を国際会議等で発表した後，さらに発展させて推薦論文として投稿することができます．カテゴリ2では，国際会議や国際学術論文誌等で発表された，または採録決定済みの，国内では未発表の研究成果の紹介を募集します．PPLとの関連性・プログラム全体のバランス・発表された媒体をもとに，プログラム委員による議論によって採否を判断します．カテゴリ3では，PPLに関連する内容（未発表・既発表いずれでも構いません）についてのポスター発表を募集します．萌芽的なアイデアの紹介やツールのデモンストレーションなども歓迎します．PPLとの関連性・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ4では，既存研究のサーベイやツールのチュートリアルなど，PPLの聴衆にとって有益な学術知識の紹介を募集します．内容は未発表・既発表いずれでも構いません．PPLとの関連性・内容の重要性・発表者の経歴・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．さらに，カテゴリ1・2・4の全発表のなかから最も聴衆の支持を集めたものに発表賞，カテゴリ3の全発表のなかから最も聴衆の支持を集めたものにポスター賞を授与する予定です（いずれも一般の部・学生の部の2種類，ただし「発表賞」は既受賞者を除く）． ** 投稿・発表申込要領 ** すべてのカテゴリの投稿・発表について，以下のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2020 申込にあたってはEasyChairのアカウントが必要です．申し込み時にEasychair で入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．各カテゴリの申込要領の詳細は以下の通りです．カテゴリ1（国内外未発表論文） --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込: 著者名，所属，論文タイトル，論文概要（日本語300〜400字程度，もしくは英語200 words程度），キーワード（3つ以上）を提出してください．論文提出: 本文10〜15ページ程度（参考文献を除く）の論文（日本語もしくは英語， PDF形式．PPL2020ウェブページにて指定のスタイルファイルを利用のこと）を提出してください．最大ページ数を超える付録は投稿版に入れることができます（最終原稿においては削除いただく可能性があります）．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採録された論文の最終原稿の提出方法は，採否通知にてお知らせします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください．また，採録された論文等著作物に対して著作権の譲渡を求めません． (注) 投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ------------------------- 原論文（ページ数不問，PDF形式）と論文概要（テキスト形式）を，著者名，所属，論文タイトル，キーワード（3つ以上）と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．カテゴリ3（ポスター・デモ発表） ----------------------------- 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要（200〜 300字程度），キーワード（3つ以上）を提出してください．発表形態については発表タイトル（Title欄）の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 著者名，所属，発表タイトル，キーワード（3つ以上），発表概要（3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの）提出してください． ** プログラム委員会 ** 安部達也千葉工業大学荒堀喜貴東京工業大学石崎一明日本IBM 今井敬吾岐阜大学岩崎英哉電気通信大学岩間太日本IBM 馬谷誠二神奈川大学江本健斗九州工業大学大岩寛産業技術総合研究所紙名哲生大分大学亀山幸義筑波大学川端英之広島市立大学川本裕輔産業技術総合研究所菊池健太郎東北大学木村大輔東邦大学小島健介京都大学新屋良磨秋田大学関山太朗国立情報学研究所叢悠悠東京工業大学寺内多智弘早稲田大学日高宗一郎法政大学平石拓京都大学 (プログラム共同委員長) 廣川直北陸先端科学技術大学院大学水島宏太オプト森口草介関西学院大学森畑明昌東京大学 (プログラム共同委員長) ** スポンサー（2019/11/11現在） ** ゴールドスポンサー株式会社オプトシルバースポンサー株式会社HERP 株式会社ぺあのしすてむ ** 問い合わせ先 ** ppl2020-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2020-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc

1 0

日本数学会2020年度年会講演申し込みが始まっています
by Teruyuki YORIOKA 09 Nov '19

09 Nov '19

みなさま静岡大学の依岡です．日本数学会2020年度年会講演申し込みが始まりました． http://mathsoc.jp/meeting/nichidai20mar/ 講演申し込みの締め切りは2019年11月29日（金）です．多数の方のお申し込みを願っています．ネットワークメンテナンスのため，締め切り間際である 2019年11月27日 03:00～05:00 および 11月28日 03:00～05:00 の予定で日本数学会のページおよびアクティベーション／講演申し込み／会合申し込み等の各サービスが利用できなくなるそうです．講演申し込みは時間に余裕を持って，なるべく早くにお申し込みください．

1 0

2020年度奨励研究生の募集開始
by Teruyuki YORIOKA 07 Nov '19

07 Nov '19

logic-ml, kisoron-ml 受信者の皆様静岡大学の依岡です．今年度からはじまりました「日本数学会奨励研究生」の来年度研究生の募集が始まりました． http://mathsoc.jp/publicity/news20191001/2020shourei.html 応募者は次のふたつのうちのいずれかに該当する必要があります． (1) 日本数学会の会員であって, 2020 年 4 月 1 日の時点で学位(博士)取得後 3 年以内(学位(博士)取得が 2017 年4月 2 日以後) の研究者. 学位(博士)取得見込みまたは会員申込中の者も申請可としますが, 採用時には学位(博士)を取得済みで, 会員となっている必要があります. (2) 2020 年度の日本学術振興会特別研究員(PD)に申請した者, または同年度外国人特別研究員(一般)において, 招へい研究者として申請した者. 日本学術振興会特別研究員に申請した方は，その申請書を日本数学会奨励研究生申請書を作成する際に大いにお役立てください．ご不明な点がありましたら私にお尋ねいただけましたら幸いです．よろしくお願いします．

1 0

J-B Joinet教授”Types and behavioral indiscernibility”　講演会　慶應大三田　11月7日　Nov. 7th 　Keio Univ.
by Mitsu Okada 06 Nov '19

06 Nov '19

ーーーーーーーーーーーーーーーーーーーーーーーーーーーー直前の告知となり申し訳けありませんが、11が月７日木曜日が講演会日の案内をさせていただければありがたいです。ご検討の程、お願い申し上げます。。　　　　　　　　　　　　　　　　　　　　　　　　　　岡田光弘　慶應義塾大学文学部哲学専攻　 ******************************************************************************************* Jean-Baptiste Joinet教授（Dept Philosophy, Univ Lyon) , 11月7日（木）Nov.7th (Thurs)　慶應大　Keio U. ****************************************************************************************** 三田ロジックセミナー Mita Logic Seminar 11月7日 November 7th 慶應義塾大学三田キャンパス Mita Campus, Keio University 講演者SPEAKER: Jean-Baptiste Joinet (Université de Lyon, IRPhiL, Idex Lyon) タイトルTITLE: Types and behavioral indiscernibility *************************************************************************** 参加自由、事前登録無し。お気軽にお立ち寄りください。No registration needed *************************************************************************** アブストラクトは以下をご覧ください。Abstract attached below. 日時Date: 11月7日(木) November 7th (Thu.), 16:30-18:00 場所Venue: 慶應義塾大三田キャンパス大学院校舎1階312番教室(下のキャンパスマップ３番) Classroom 312, 1F of Graduate School Building, Mita Campus, Keio University (#3 of the Campus Map below) 構内図Campus Map: https://www.keio.ac.jp/en/assets/download/maps/mita/map_mita.pdf お問い合わせ先:慶應義塾大学文学部岡田光弘研究室東京都港区三田2-15-45 三田ロジックセミナー Email: logic(a)abelard.flet.keio.ac.jp <mailto:logic@abelard.flet.keio.ac.jp> ---------------------------------------------------------- アブストラクトABSTRACT: Types and behavioral indiscernibility In computing theory, the type of a program is an information partially specifying the task it performs. Within the framework of (what is usually called) the Proofs-as-Programs and Propositions-as-Types paradigm, a type (a.k.a. a proposition) is defined as a set of programs having some common behavior w.r.t. a specific undecidable property (the termination of execution when entering in interaction with contexts). The talk will be devoted to investigate the underlying classifying methodology used to define the notion of type (typing by closure by bi-orthogonality) which, in that particular case, is used to classify computational behaviors.

1 0

AWPL 2020: Asian Workshop on Philosophical Logic, Hangzhou (China), 7-9 Apr 2020
by 小野寛晰 05 Nov '19

05 Nov '19

===================================== AWPL 2020: 5th Asian Workshop on Philosophical Logic 7-9 April 2020 Hangzhou, China https://www.xixilogic.org/events/awpl2020/ <https://www.xixilogic.org/events/awpl2020/> ===================================== CALL FOR PAPERS The 5th Asian Workshop on Philosophical Logic, 7-9 April 2020, Hangzhou, China Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second, third and fourth workshops took place successfully in Guangzhou (2014), Taipei (2016) and Beijing (2018), respectively. The previous post conference proceedings were published in the Studia Logica book series "Logic in Asia" (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer. The Fifth Asian Workshop on Philosophical Logic (AWPL 2020) will be held in Hangzhou, China, on 7-9 April 2020, organized by the Institute of Logic and Cognition at Zhejiang University. The AWPL 2020 workshop is an event in the Zhejiang Logic for AI Summit (ZjuLogAI 2020, https://www.xixilogic.org/zjulogai/ <https://www.xixilogic.org/zjulogai/>) which takes place on 6-9 April 2020. All AWPL participants are invited to attend other events as well. AWPL 2020 and ZJULogAI are in collaboration with the Second Tsinghua Interdisciplinary Workshop on Logic, Language, and Meaning: Monotonicity in Logic and Language, 10-12 April 2020 (http://tsinghualogic.net/JRC/?page_id=1576 <http://tsinghualogic.net/JRC/?page_id=1576>) ------------------------ INVITED SPEAKERS To be confirmed. ------------------------ SUBMISSION All submissions should present original works not previously published. Submissions should be typeset in English, using the LNCS template (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>), be prepared as a PDF file with at most 12 pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2020 <https://easychair.org/conferences/?conf=awpl2020>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the ?Logic in Asia? series. For questions please send email to awpl2020(a)xixilogic.org <mailto:awpl2020@xixilogic.org> ------------------------ IMPORTANT DATES Submission deadline: 30 November 2019 Notification: 1 January 2020 Workshop: 7-9 April 2020 ------------------------ PROGRAM COMMITTEE (to be confirmed) Thomas Ågotnes, University of Bergen Nick Bezhanishvili, University of Amsterdam Sujata Ghosh, Indian Statistical Institute Meiyun Guo, South-West University, China Fengkui Ju, Beijing Normal University Kok-Yong Lee, National Chung Cheng University Beishui Liao, Zhejiang University (chair) Hanti Lin, University of California Davis Fenrong Liu, Tsinghua University Hu Liu, Sun Yat-Sen University Xinwen Liu, Chinese Academy of Social Sciences Minghui Ma, Sun Yat-Sen University Hiroakira Ono, JAIST, Japan Eric Pacuit, University of Maryland R Ramanujam, Institute of Mathematical Sciences, India Olivier Roy, University of Bayreuth Katsuhiko Sano, Hokkaido University Yì N. Wáng, Zhejiang University (co-chair) Chin-Mu Yang, Taiwan National University Jiji Zhang, Lingnan University-- [LOGIC] mailing list http://www.dvmlg.de/mailingliste.html <http://www.dvmlg.de/mailingliste.html> Archive: http://www.illc.uva.nl/LogicList/ <http://www.illc.uva.nl/LogicList/> provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam

1 0

第54回MLG数理論理学研究集会
by Naosuke MATSUDA 29 Oct '19

29 Oct '19

第54回MLG数理論理学研究集会のご案内みなさま神奈川大学の松田です． MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です．成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています．数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています．第54回MLG数理論理学研究集会は以下の要領で開催させていただきます．多くの皆様のご参加をお待ちしております． ==開催要領== 期間： 2019年12月14日 (土) ～ 16日 (月) 場所：マホロバ・マインズ三浦〒238-0101 神奈川県三浦市南下浦町上宮田 3231 0120-046-891 幹事：松田直祐（神奈川大学） matsuda.naosuke(a)gmail.com 詳細は以下のページをご確認ください． https://sites.google.com/view/mlg2019/home ==参加希望== 参加希望者でホテルでの宿泊を希望される方は， 11月14日までに下記の情報を松田までお送りください．件名を「MLG2019」などとしていただけると助かります． -- 氏名：所属：宿泊：7日・8日（不要なものを削除してください）夕食：7日・8日（不要なものを削除してください）朝食：8日・9日（不要なものを削除してください）講演希望：あり・なし（不要なものを削除してください）講演題目：その他： -- == Naosuke Matsuda, Department of Information Sciences. Kanagawa University Tsuchiya 2946 Hiratsuka-shi, Kanagawa 259-1293, Japan

1 2

FLOPS 2020 Second Call for papers
by Keisuke Nakano 24 Oct '19

24 Oct '19

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 -------------------------------------------------------------------------------

1 0

[jssst-ppl] 准教授または講師公募(千葉大学大学院理学研究院数学・情報数理学研究部門)
by Takafumi SAKURAI 23 Oct '19

23 Oct '19

皆様、メーリングリストをお借りして、教員公募の案内をお送りいたします。複数お受け取りの場合はご容赦ください。 ------------------------------------------------------------ 職種および人員: 准教授または講師（任期なし）1名所属: 千葉大学大学院理学研究院数学・情報数理学研究部門専攻分野: 情報数理学（数理論理学、プログラム言語論、ソフトウェア基礎理論、アルゴリズム論、情報理論、符号理論、暗号理論等、科研費小区分 12030 数学基礎関連および 60010 情報学基礎論関連とその周辺）応募資格: 博士の学位を有すること着任予定時期: 令和2年4月1日以降のできるだけ早い時期応募期限: 令和元年12月20日必着提出書類や書類送付先などの詳細につきましては、公募要領 http://www.math.s.chiba-u.ac.jp/posts/koubo-info2019.pdf または JREC-IN 公募情報 https://jrecin.jst.go.jp/seek/SeekJorDetail?id=D119101395 をご覧ください。よろしくお願いいたします。桜井貴文(sakurai(a)math.s.chiba-u.ac.jp)

1 0

Fwd: [Newsletter 90] 日本数学会ニュースレター2019巻第10号(2019年10月22日発行）
by Teruyuki YORIOKA 23 Oct '19

23 Oct '19

logic-ml, kisoron-ml 受信者のみなさま静岡大学の依岡です． 9月に金沢大学で行われました分科会総会でご紹介しました「日本数学会奨励研究生」の募集が始まります．応募条件を満たす指導学生がいらっしゃいましたら，ぜひ応募を強く促してください．よろしくお願いします．「日本数学会奨励研究生」の募集について（11月1日～12月15日） ====================================================================== 日本数学会では, 「日本数学会奨励研究生」の募集を11月1日から開始いたします。日本数学会の会員であって学位 (博士) 取得後3年以内の有望研究者を「日本数学会奨励研究生」(以下、奨励研究生)として採用し研究奨励金を支給します。特に、経済的に困難な状況や研究施設が必ずしも十分ではない等の厳しい研究環境の下でも創意工夫を凝らして主体的に研究を進めている者を奨励することを目的としています。この制度の実施期間は、今年度から令和3年度までの3年間です。今回、令和2年度の募集を行いますので、希望者は下記URLからリンクされている募集要項を熟読の上、ご応募ください。 https://www.mathsoc.jp/publicity/news20191001/2020shourei.html

1 0

Nagoya logic seminar
by 吉信康夫 22 Oct '19

22 Oct '19

皆様：名古屋大学の吉信です。以下の要領で名古屋ロジックセミナーを開催します。日時：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 多数の方のご参加をお待ちしております。

1 0

Talk by Alex Kavvos (October 17th, 11.00-)
by Kazushige TERUI 15 Oct '19

15 Oct '19

みなさま今週木曜日に京都大学にて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.)

1 0

数学基礎論若手の会2019のご案内
by Takayuki Kihara 14 Oct '19

14 Oct '19

logic-mlの皆様，お世話になっております．名古屋大学の木原貴行です． 2019年度の数学基礎論若手の会のご案内をさせていただきます．数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しております．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方々のご参加およびご講演をお待ちしています．日時: 2019年12月6日 (金) 午後〜 12月8日 (日) 午前場所: 愛知県青年の家住所: 〒444-0802 愛知県岡崎市美合町並松1-2 世話人: 木原貴行 (名古屋大学) 連絡先: kihara(a)i.nagoya-u.ac.jp ウェブページ: http://www.math.mi.i.nagoya-u.ac.jp/~kihara/wakate2019.html 申し込み締め切り: 10月20日 (日) 参加費用フル参加 (2泊3日): 7,000円前後 (宿泊費・食費込) 部分参加の場合，宿泊日数や食事を取られる回数に応じて減額いたしますので，お問い合わせください．参加を希望の方は下記の情報を書いたメールを　　件名：数学基礎論若手の会参加申込にて kihara(a)i.nagoya-u.ac.jp までお送りください： —————————————————————————— 　所属大学，学部，立場（修士1年，博士2年，社会人、ポスドク，助教など）　氏名，性別　講演希望するorしない（講演希望の場合、後日題目と概要をお送りください）　6日の宿泊を希望するorしない　7日の宿泊を希望するorしない　6日の夕食を希望するorしない　7日の朝食を希望するorしない　7日の昼食を希望するorしない　7日の夕食を希望するorしない　8日の朝食を希望するorしない　8日の昼食を希望するorしない　その他（質問、講演希望日など） —————————————————————————— 以上よろしくお願い致します． -------- 木原貴行名古屋大学大学院情報学研究科数理情報学専攻 URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/index-j.html Email: kihara(a)i.nagoya-u.ac.jp

1 1

27th WoLLIC 2020 (Lima, Peru) - 1st Call for Papers
by 小野寛晰 09 Oct '19

09 Oct '19

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/>

1 0

Norbert Müller's Talk, Tue 15 Oct, Fukuoka
by Akitoshi Kawamura 08 Oct '19

08 Oct '19

皆様九州大学の河村と申します。ノルベルト・ミュラー先生（トリール大）の講演を下記の通り来週火曜日に九大で開催いたします。宜しければぜひお越し下さい。 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

1 0

FSCD 2020 - First CFP
by Nao Hirokawa 04 Oct '19

04 Oct '19

皆様 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)

1 0

基礎論セミナー
by arai toshiyasu 02 Oct '19

02 Oct '19

みなさま新井です。この度「基礎論セミナー」を不定期で開催していくことにしました。第1回の予定は下記にあります。どなたでも聴講できますのでご興味のおありの方はどうぞいらして下さい。なお、当該 web page を現在、準備中です。新井敏康第1回基礎論セミナー日時：2019年10月24日（木）13:30-15:00 場所：東京大学大学院数理科学研究科 156号室講演者：大川裕矢（千葉大学） title: 部分保存性に対する，Bennet の結果の一般化について abstract:: 文 $\varphi$ が理論 $T$ 上 $\Gamma$-保存的であるとは, 任意の $\Gamma$ 文 $\psi$ について, $T + \varphi \vdash \psi$ ならば $T \vdash \psi$ が成立することをいう. 1979 年 Guaspari は複数の理論に対して, 同時に $\Gamma$-保存的であり, 各理論では証明できない文の存在に関する部分的な議論を行ったが, その一般的な状況を解明するという問いを残していた. この問いに対し, 1986年 Bennet は特に2つの理論に対する分析を行い, 存在条件をある程度特徴付けることに成功した. 今回木更津工業高等専門学校の倉橋太志講師との共同研究により , この Bennet の結果は任意有限個の理論に拡張可能であることが判明した. 本講演ではその拡張した結果を紹介する. 問合せ先：新井敏康 tosarai(a)ms.u-tokyo.ac.jp

1 0

The 3rd International Conference on Logic and Argumentation CLAR 2020, 6-9 April 2020, Hangzhou, China
by Katsuhiko Sano 01 Oct '19

01 Oct '19

------------------------------------------------------------ The 3rd International Conference on Logic and Argumentation CLAR 2020, 6-9 April 2020, Hangzhou, China CALL FOR PAPERS ------------------------------------------------------------ The 3rd International Conference on Logic and Argumentation (CLAR 2020) invites interdisciplinary contributions from logic, artificial intelligence, philosophy, computer science, linguistics, law, and other areas studying logic and formal argumentation. CLAR 2020 will be held in Hangzhou, 6-9 April 2020, as part of the Zhejiang Logic for AI Summit (ZJULogAI 2020). With a special focus on *methods and tools for explainable AI*, a core objective of ZJULogAI is to present the latest developments and progress made on the crucial question of how to make AI more transparent, trustworthy and accountable, both in China as well as in the rest of the world. All participants to CLAR 2020 have access to all other events of ZJULogAI as well. Proceedings with accepted submissions will be available during the conference, and extended versions will be published after the conference in special issues of the Journal of Logic and Computation and the Journal of Applied Logics. More information can be found at the websites: http://www.xixilogic.org/events/clar2020 (CLAR 2020) https://www.xixilogic.org/zjulogai/ (ZJULogAI) CLAR 2020 conference highlights recent advances in the two fields of logic and argumentation and promotes communication between researchers in logic and argumentation within and outside China. Previous conferences can be accessed at: http://www.xixilogic.org/events/clar2018 http://www.xixilogic.org/events/clar2016 ************************ List of Topics ************************ Suggested topics include, but are not limited to the following: * Abstract argumentation * Applications of logic and/or argumentation * Applied logic * Argumentation and game theory * Argumentation and law * Argumentation and linguistics * Argumentation and medical reasoning * Argumentation in AI * Argument mining * Argumentation schemes * BDI logic * Computational argumentation * Deontic logic * Dynamic epistemic logic and belief revision * Formal models for dialog and argumentation * Informal logic * Judgment aggregation * Knowledge representation and reasoning * Logic for game theory * Logic for multi-agent systems * Logic for semantic web * Logic for social network * Mathematical logic * Modal logic * Nonmonotonic logics * Numerical and uncertainty reasoning * Philosophical logic * Pragma-Dialectics * Preference logic * Structured argumentation * Uncertain argumentation ************************ Submission Guidelines ************************ We invite two types of submissions: full papers (between 8 and 20 pages) describing original and unpublished work and extended abstracts (max 5 pages) of preliminary original work or extended abstracts of already published work, from either the field of logic or the field of formal argumentation. Additional support material may be included in an appendix, which may be considered or ignored by the program committee. Submissions must be prepared in LaTeX, using the LaTex template myifcolog.cls: http://icr.uni.lu/flap/ Submissions not complying with these guidelines will be desk rejected. Papers in PDF format should be submitted via EasyChair: https://easychair.org/conferences/?conf=clar2020 Each submitted paper will be carefully peer-reviewed by a panel of PC members based on originality, significance, technical soundness, clarity of exposition and relevance for the conference. For each accepted paper, at least one author is expected to register and present the paper at the conference. ************************ Important Dates ************************ Submission: 30 November 2019 Conference: 6-9 April 2020 ************************ PC Chairs ************************ Mehdi Dastani, Utrecht University Huimin Dong, Zhejiang University Leon van der Torre, University of Luxembourg ************************ Contact ************************ All questions about submissions should be emailed to: clar2020(a)xixilogic.org

1 0

公募：神戸大学大学院システム情報学研究科専任教員
by Makoto Kikuchi 01 Oct '19

01 Oct '19

皆様，神戸大学大学院システム情報学研究科情報科学専攻では，情報数理教育研究分野に属する准教授または講師1名を公募します． [専門分野] 数学基礎論・数理論理学 [募集人員（職名・採用人数）] 准教授または講師・1名 [着任時期] 2020年4月1日以降のなるべく早い時期 [募集期間] 2019年11月1日必着 [照会先] 神戸大学大学院システム情報学研究科情報科学専攻　　　専攻長ブレンドレ・ヤーグ brendle(a)kobe-u.ac.jp 詳細は添付ファイルご覧ください．菊池誠

1 0

Talk by Thomas Seiller (October 3rd, 11.00-)
by Kazushige TERUI 30 Sep '19

30 Sep '19

みなさま今週木曜日に京都大学にてThomas Seillerさんによるご講演があります。詳細は下記の通りです。よろしければぜひご参加ください。京都大学数理解析研究所照井一成 ========== Time: 11:00-12:00, October 3rd, 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: Thomas Seiller (LIPN, University of Paris 13) Title: Dynamical systems and computational complexity Abstract: Based on previous work on semantics of linear logic which used the notion of “graphing”, I started to study how these mathematical objects, which generalize partial dynamical systems, can shed new light on computability. Focussing on questions of complexity, Pellissier and I recently showed how interpreting programs as dynamical systems can lead to an abstract method for proving lower bounds that capture several previously known results. More importantly, the method can be refined to strengthen the previously best-known partial result towards settling the Ptime vs NC question negatively. Building on some realisability construction for linear logic capturing standard complexity classes, this leads to wonder about how much can be learned from dynamical systems, and if the field can provide new insights on important questions such that “Is Ptime equal to Logspace?”.

1 0

不完全性定理入門集中講義のご案内
by Toshio Suzuki 26 Sep '19

26 Sep '19

不完全性定理入門集中講義のご案内（重複して受け取られた折はご容赦ください）お世話になっております。首都大学東京の鈴木登志雄です。さて１０月・１１月に首都大学東京理学研究科数理科学専攻では，東京工業大学の鹿島先生に不完全性定理入門の集中講義をしていただきます。最終日には証明可能性論理にもふれていただける見込みです。公式にオープンセミナーとうたっているわけではありませんが，当専攻ではこの種の集中講義に数名程度まで学外の院生等が聴きに来ても黙認する慣習のようです。お近くに関心のありそうな方がいらっしゃいましたら、お知らせいただければ幸いです。 %%%%%%% ここから＊＊担当者鹿島亮先生（東京工業大学情報理工学院准教授）　＊＊授業科目名応用数理特別講義２　　　(数理科学専攻　前期課程：Ｒ００８１) タイトル不完全性定理への現代的な入門場所　首都大学東京（南大沢キャンパス）８号館６階６１０時期１０月１０日（木），１７日（木），３１日（木），１１月７日（木）の１４：４０－１７：５０（途中休憩あり）当専攻での連絡係鈴木登志雄 toshio-suzuki[atmark]tmu.ac.jp 概要ゲーデルの不完全性定理は数理論理学における重要な基本定理でありコンピュータサイエンスや哲学などにも多大な影響を与えているが，しばしば誤解もされている．本講義の目的は詳細な議論によってこの定理の数学的な正しい理解を与えることである．ゲーデルの原論文(1931)を忠実になぞるのではなく，本講義ではペアノ算術を主な対象としてより現代的な証明を行う。教科書：田中一之編『ゲーデルと２０世紀の論理学（３）不完全性定理と算術の体系』東京大学出版会 (2007) pp.37-114 所収，鹿島亮「第一不完全性定理と第二不完全性定理」。 %%%%%%% ここまで首都大学東京南大沢キャンパスへの交通 http://www.tmu.ac.jp/university/campus_guide/access.html 同・構内図 http://www.tmu.ac.jp/university/campus_guide/map.html -- 鈴木登志雄首都大学東京理学研究科数理科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

JAIST Logic Seminar Series - Beckmann 教授講演のお知らせ (10月4日)
by Nao Hirokawa 26 Sep '19

26 Sep '19

皆様１０月４日（金）に北陸先端科学技術大学院大学で行われます Arnold Beckmann 教授の講演のお知らせです。皆様、どうぞ奮ってご参加ください。廣川直 (JAIST) ----------------------------------------------------------------------- * JAIST Logic Seminar Series * Date: October 4 (Fri), 2019, 15:00 - 16:30 Place: I-65 (seminar room on 6F of IS Building III) at JAIST (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Arnold Beckmann (Swansea University) Title: Consistency of equational theories and the separation problem for bounded arithmetic Abstract: Consistency statements of formal theories have been considered as candidates for separating theories of bounded arithmetic. The most promising ones are given by consistency statements of certain equational theories. The starting points for this line of research are results by Buss and Ignjatovic 1995 [Unprovability of consistency statements in fragments of bounded arithmetic, APAL 1995, 74: 221--244], which shows that the consistency of an induction free version of the equational theory PV is not provable in the bounded arithmetic theory S^1_2, and Beckmann 2002 [Proving consistency of equational theories in bounded arithmetic. JSL 2002, 67: 279--296] which shows that the consistency of a further restricted induction free version of PV is provable in S^1_2. We review those results and in particular state them precisely. We then explain the progress that has been made over recent years to narrow the gap between provability and unprovability, and the potential research programme that is related to this question.

1 0

締切延長: フォーマルアプローチ特集論文募集のご案内
by ken.mano.eh＠hco.ntt.co.jp 18 Sep '19

18 Sep '19

皆様， IEICE フォーマルアプローチ特集ですが，多くの方に原稿をご投稿いただきたく，投稿締め切りを 2019 年 10 月 8 日まで延長いたしました．投稿をご検討いただきますよう，なにとよろしくお願い致します．真野 =========================================================================== フォーマルアプローチ特集論文募集電子情報通信学会論文誌英文 ED 分冊フォーマルアプローチ特集編集委員会フォーマルアプローチ（形式手法・形式技法・形式理論）は，情報システムや組込みシステムの設計開発における信頼性向上の鍵となる重要な基盤です．これまで，設計対象のモデル化，要求分析と仕様記述，コード自動生成，テストと検証，保守と再利用などに関する技術と理論的知見を生み出してきました．近年の情報技術の進展に伴う対象領域の拡大に伴い，フォーマルアプローチは従来にも増して多様な分野で用いられるようになり，ますます発展しています．本小特集は，情報システムや組込みシステムの設計・運用におけるフォーマルアプローチについて，基礎理論から応用まで，幅広い研究を対象にしています．個別の対象領域に特化したケーススタディから，分野横断的な手法や理論まで，様々な方面から，フォーマルアプローチ研究に携わる若手研究者を奨励するとともに，この分野の研究が更に発展することを目指しております．奮って御投稿下さいますよう御案内申し上げます． 1. 対象分野主な対象は以下のとおりですが，これに限らず，「情報システムや組込みシステム及びそれをとりまく環境を定式化した上で，そのシステムの振舞いの解析や性質の導出を厳密に行い，設計・運用に関わる種々の問題の解決を図る」ことを目指した論文を広く募集します． - 基礎理論：システムの構造や振舞いの形式記述・検証に関する基礎理論 - 形式技法：ソフトウェア，ハードウェア，ネットワークなどのシステムに対する体系だった記述・検証技法 - 形式ツール：モデル検査器や定理証明器など，形式手法に基づくツール - 応用：情報システムや組込システム，回路系，情報セキュリティ，車載システム，人工知能・機械学習システム，マルチエージェントなどへの形式手法の適用事例 - 教育：教育事例 2. 論文の執筆と取扱い論文 (一般論文)，レター，及びサーベイ論文を募集します．投稿規程等は電子情報通信学会の英文誌の規程と同じです．以下の規程を御参照下さい． "The Information for Authors" (IEICE Transactions on Information and Systems) http://www.ieice.org/eng/shiori/mokuji_iss.html 3. 主なスケジュール論文投稿締切 2019 年 10 月 8 日 (火) 23:59 JST (延長いたしました) 第一回判定通知予定 2019 年 12 月 6 日 (金) 初回修正締切 2020 年 1 月 31 日 (金) 最終判定通知予定 2020 年 3 月 20 日 (金) 発行予定 2020 年 8 月号 4. 投稿方法本特集では，電子投稿のみを受付けます．論文を下記の web page から投稿して下さい．初期投稿時に，編集可能な論文本体 (TeX/Word)，図，著者の写真，biography も投稿する必要があります． https://review.ieice.org/regist/regist_baseinfo_e.aspx 投稿の際には以下の項目を選択してください． "Journal/Section" -> "[Special FO] Formal Approaches" 同時に WEB 上で著作権譲渡手続きができます．投稿手続きについて御不明な点がございましたら，問合先まで御連絡下さい． 5. 掲載料招待論文を含むすべての著者は，論文が採録となった場合，2020 年 4 月頃に掲載料をお支払い頂くことになります．2020 年 5 月 15 日までに支払いが完了しない場合には，採録取り消しとなります． 6. オープン化，オープンアクセスオプション・オープン化：2017年1月号以降に掲載された電子情報通信学会英文論文誌Ｄのすべての論文を，J-STAGEを通じて全世界の読者へ公開しています．・2020年1月号以降に掲載される論文には，電子情報通信学会の多くの論文誌で適用することができるオープンアクセスオプションを適用することができなくなります．（オープン化は，2020年1 月以降も継続する予定です．）・オープン化とオープンアクセスオプションに関する詳細は，"Information for Authors"　(http://www.ieice.org/eng/shiori/mokuji_iss.html) を御参照下さい．・オープン化とオープンアクセスオプションに関しては，予告なく変更されることがあります． 7. 特集編集委員会委員長：真野健(NTT) 幹事：石川冬樹(情報研)，横川智教（岡山県立大）委員：青木利晃(北陸先端大)，青木善貴（日本ユニシス），來間啓伸(日立)，小林孝一(北大)，立石孝彰(日本IBM)，土屋達弘(阪大)，山口真悟(山口大) 8. 問合せ先本特集のホームページ: (和文) http://www.brl.ntt.co.jp/people/mano/fa2019/jp/ (英文) http://www.brl.ntt.co.jp/people/mano/fa2019/ 真野健 NTT コミュニケーション科学基礎研究所〒243-0198 神奈川県厚木市森の里若宮 3-1 ken.mano.eh(a)hco.ntt.co.jp =============================================================== CALL FOR PAPERS Special Section on Formal Approaches The IEICE Transactions on Information and Systems announces a forthcoming special section on Formal Approaches to be published in August 2020. Formal methods and techniques play a key role in designing and developing highly reliable information systems and embedded systems. The last decades have seen various new techniques and profound theoretical results using formal methods in surprisingly many fields such as modeling, requirements analysis, specification, automatic generation of codes, testing, verification, and maintenance. They are rapidly extending their application domains as a result of the recent growth of information and communication technologies. The Special Section on Formal Approaches aims at stimulating research on formal approaches to information systems and embedded systems, ranging from fundamental theory to practical applications. Our emphasis is put on the cross-fertilization of related research fields and encouragement of young researchers. Topics: The major topics are listed below, but we solicit submissions in all areas of formal approaches, i.e., first to formalize information systems, embedded systems, and their environment, next to analyze their behavior and to derive their properties rigorously, and then to solve various problems in designing and managing the systems. - Theoretical foundations: all aspects of theory related to formal description and verification for structure and behavior of systems. - Formal techniques: techniques for mainly describing and analyzing systems, such as software, hardware and networks. - Formal tools: tools based on formal methods such as model checkers, theorem provers, and static and dynamic analyzers. - Applications: practical experiences of applying formal methods to information systems, embedded systems, circuits, security, AI systems, machine learning systems, multi-agent systems, automotive systems, etc. - Education: education on formal methods. Submission Instructions: The deadline for submission is Oct 8, 2019, 23:59 JST(GMT+9) (Extended). Manuscripts should be carefully prepared according to the guideline in the "Information for Authors" (available at http://www.ieice.org/eng/shiori/mokuji_iss.html). The preferred length of the manuscript is 8 pages. Only electronic submission through the web page is accepted. Submit a complete paper and transfer copyright of the paper using the IEICE Web site https://review.ieice.org/regist/regist_baseinfo_e.aspx Authors should choose the [Special FO] Formal Approaches" as a "Journal/Section" on the online screen. Editorial Committee: Guest Editor-in-Chief: Ken Mano (NTT Communication Science Laboratories) Guest Editors: Fuyuki Ishikawa (National Institute of Informatics) Tomoyuki Yokogawa (Okayama Prefectural University) Members: Toshiaki Aoki (JAIST) Yoshitaka Aoki (Nihon Unisys) Koichi Kobayashi (Hokkaido University) Hironobu Kuruma (Hitachi, Ltd.) Takaaki Tateishi (IBM Japan) Tatsuhiro Tsuchiya (Osaka University) Shingo Yamaguchi (Yamaguchi University) Further information may be obtained from the web page at: http://www.brl.ntt.co.jp/people/mano/fa2019/ All inquiries should be sent to the guest editor in chief: Ken Mano NTT Communication Science Laboratories 3-1 Morinosato Wakamiya Atsugi Kanagawa 243-0198 Japan E-mail: ken.mano.eh(a)hco.ntt.co.jp Important Dates: Submission Deadline: Oct 8, 2019 23:59 JST (GMT+9) [Extended] First Notification: Dec 6, 2019 Revised Version Deadline: Jan 31, 2020 Final Notification: Mar 20, 2020 Important Notice. (1) At least one of the authors must be an IEICE member when the manuscript is submitted for review. For the application of IEICE membership, visit http://www.ieice.org/eng/member/OM-appli.html (2) When a paper has been accepted for publication, the authors are required to pay the page charges covering part of the cost of publication. Please carefully read the submission guideline at http://www.ieice.org/eng/shiori/mokuji_iss.html (3) Upon accepted for publication, all authors, including authors of invited papers, should pay the page charges covering partial cost of publication around April, 2020. If payment is not completed by May 15, 2020, your manuscript will be handled as rejection. (4) [Open Access Publishung, Open Access Option] ・Open Access Publishing: Since January 2017, all papers of the IEICE Transactions on Information and Systems stored in J-STAGE that include all papers published from January 2017 have been opened to all reader in the world through J-STAGE. ・Open Access Option for many transactions in IEICE will not be applied to papers in January 2020 issue and following issues of the IEICE Transactions on Information and Systems. (Open Access Publishing will be continued after January 2020.) ・For details on Open Access Publishing and Open Access Options, please carefully refer to “The Information for Authors” (http://www.ieice.org/eng/shiori/mokuji_iss.html). ・Note that these rules may be changed without notice.

1 0

FLOPS 2020 First Call for papers
by Keisuke Nakano 17 Sep '19

17 Sep '19

logic-mlの皆様，東北大学の中野です． FLOPS 2020 の論文募集のご案内です． 4月に秋田で4/23-25に開催予定です．ふるってご投稿ください． # ETAPSのmain conference(4/27-5/1)には重ならない日程での開催ですのでぜひご検討ください． -- 中野圭介東北大学電気通信研究所 ksk(a)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 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 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 -------------------------------------------------------------------------------

1 0

RIMS共同研究（公開型）「証明論とその周辺」のご案内
by Yoshihito Tanaka 12 Sep '19

12 Sep '19

（複数のメーリングリストにお送りしています．重複してお受け取りの際はご容赦ください）皆様，九州産業大学の田中義人と申します．例年行われている証明論を中心とした研究集会を，今年度はRIMS共同研究（公開型）「証明論とその周辺」として，下記の要領で開催する予定です．日程：2019年12月24日（火）-12月26日（木）場所：京都大学15号館201教室懇親会（予定）：12月24日（火）会費：4000円程度 Webページ：http://www.ip.kyusan-u.ac.jp/J/ms/event/pt19/proof_theory_2019.html 参加を希望される方は，11月8日（金）までに，ytanaka(a)ip.kyusan-u.ac.xn--jp,-9b4b342t 以下の項目をご連絡ください．・お名前・所属・e-mailアドレス・講演の有無．講演有の場合は，タイトルおよび，講演時間や講演日時等のご希望・旅費援助希望の有無（申し込み状況によってはご希望に添えない場合があります）・懇親会参加希望の有無多くの皆様のご講演・ご参加をお待ちしております． ********************************* 田中義人九州産業大学経済学部 813-8503 福岡市東区松香台2-3-1 092-673-5216 (直通) e-mail: ytanaka(a)ip.kyusan-u.ac.jp *********************************

1 0

LFCS 2020 CFP, deadline extension till Sept 16
by Hajime Ishihara 09 Sep '19

09 Sep '19

Symposium on LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS’20), Deerfield Beach, Florida, January 4-7, 2020. LFCS Steering Committee: Anil Nerode, (Ithaca, NY, General Chair); Stephen Cook (Toronto); Dirk van Dalen (Utrecht); Yuri Matiyasevich (St.Petersburg, Russia); Samuel Buss (San Diego); Gerald Sacks (Cambridge, MA); Andre Scedrov (Philadelphia, PA); Dana Scott, (Pittsburgh, PA - Berkeley, CA). LFCS topics of interest include, but are not limited to: constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science. LFCS’20 Program Committee: Sergei Artemov (New York, NY) - PC Chair; Eugene Asarin (Paris); Steve Awodey (Pittsburgh, PA); Lev Beklemishev (Moscow); Andreas Blass (Ann Arbor, MI); Samuel Buss (San Diego, CA); Robert Constable (Ithaca, NY); Thierry Coquand (Göteborg); Valeria de Paiva (Cupertino, CA); Ruy de Queiroz (Recife); Nachum Dershowitz (Tel Aviv); Melvin Fitting (New York, NY); Sergey Goncharov (Novosibirsk); Denis Hirschfeldt (Chicago, IL); Rosalie Iemhoff (Utrecht); Hajime Ishihara (JAIST - Kanazawa); Bakhadyr Khoussainov (Auckland); Roman Kuznets (Vienna); Daniel Leivant (Bloomington, IN); Robert Lubarsky (Boca Raton, FL); Victor Marek (Lexington, KY); Lawrence Moss (Bloomington, IN); Anil Nerode (Ithaca, NY) - General LFCS Chair; Hiroakira Ono (JAIST - Kanazawa); Alessandra Palmigiano (Delft); Ramaswamy Ramanujam (Chennai); Michael Rathjen (Leeds); Helmut Schwichtenberg (Munich); Sebastiaan Terwijn (Nijmegen). Submission details. Proceedings will be published in the Springer LNCS series. Submissions should be made electronically via easychair. Submitted papers must be in pdf/12pt format and of no more than 15 pages, present work not previously published, and must not be submitted concurrently to another conference with refereed proceedings. Submission page: https://easychair.org/conferences/?conf=lfcs2020 LFCS issues the best student paper award named after John Barkley Rosser Sr. (1907-1989), a prominent American logician with fundamental contributions in both Mathematics and Computer Science. Important Dates. Submissions deadline: midnight September 16, 2019, any time zone (extended!) Notification: October 10, 2019. Symposium dates: January 4–7, 2020. Local Arrangements. The venue of LFCS 2020 will be the spectacular Wyndham Deerfield Beach Resort, 2096 NE 2nd Street, Deerfield Beach, Florida 33441. Website: http://www.wyndhamdeerfieldresort.com LFCS’20 Local Organizing Committee Chair is Robert Lubarsky, Florida Atlantic University. Further Information about LFCS’20: https://lfcs.ws.gc.cuny.edu/lfcs-2020/ Sponsorships: The US National Science Foundation (pending), Association for Symbolic Logic, Cornell University, The City University of New York Research Foundation.

1 0

セミナー案内
by KASHIMA Ryo 06 Sep '19

06 Sep '19

数理論理学セミナーのお知らせ東工大大岡山キャンパスで定期的に開催しているセミナー（普段はlogic-mlには流していません）の特別版を　　９月８日（金）と１５日（金）に開催します。以下に「話者（所属）題目」の一覧を載せました。どなたでも参加できますが、普段のセミナー案内を受け取っていない方の場合はご一報ください。 ----- 鹿島亮東京工業大学情報理工学院数理・計算科学系 kashima(a)is.titech.ac.jp ＝＝＝＝＝＝＝＝【８日（金）】西牟田祐樹（慶應大）一般化乗法的論理結合子のシーケント化定理とdecomposabilityについて藤原誠（早大）Bar induction and restricted classical logic 武原直紀（東工大）直観主義二階命題論理と論理式完備ハイティング代数について松田直祐（神奈川大）Curry's last problemへの弱い解答中村誠希（東工大）関係Kleene代数におけるatomic negationについて（仮題）新屋良磨（東大）論文紹介 Cyclic Arithmetic Is Equivalent to Peano Arithmetic 【１５日（金）】池上貴大（東工大）様相命題論理におけるツリーシークエント計算（仮題）河野友亮（東工大）Quantum logic の implication algebra と restricted negation について（仮題）鹿島亮（東工大）２階の関数記号を持つ１階述語論理について山﨑紗紀子（首都大）ゲーデル・マッキンゼイ・タルスキの定理の証明論的証明ー後件複数な直観主義論理のG3-style sequent calculus を用いてー大森仁（京大）Jaskowskiのdiscussive logicの周辺金沢誠（国立情報学研）Context-Free Languages with Finite Context and Kernel Properties 高橋正子 Grzegorczyk階層について＝＝＝＝以上＝＝＝＝

1 8

リマインダ: フォーマルアプローチ特集論文募集のご案内
by ken.mano.eh＠hco.ntt.co.jp 02 Sep '19

02 Sep '19

皆様， IEICE フォーマルアプローチ特集の締め切り（令和元年 9 月 24 日 (火)）が近づいてまいりました．皆さまの周辺の方に再度ご周知いただき，ご投稿をご検討されている方には，ラストスパートをよろしくお願いいたします．真野 =========================================================================== フォーマルアプローチ特集論文募集電子情報通信学会論文誌英文 ED 分冊フォーマルアプローチ特集編集委員会フォーマルアプローチ（形式手法・形式技法・形式理論）は，情報システムや組込みシステムの設計開発における信頼性向上の鍵となる重要な基盤です．これまで，設計対象のモデル化，要求分析と仕様記述，コード自動生成，テストと検証，保守と再利用などに関する技術と理論的知見を生み出してきました．近年の情報技術の進展に伴う対象領域の拡大に伴い，フォーマルアプローチは従来にも増して多様な分野で用いられるようになり，ますます発展しています．本小特集（2020 年 8 月号掲載）は，情報システムや組込みシステムの設計・運用におけるフォーマルアプローチについて，基礎理論から応用まで，幅広い研究を対象にしています．個別の対象領域に特化したケーススタディから，分野横断的な手法や理論まで，様々な方面から，フォーマルアプローチ研究に携わる若手研究者を奨励するとともに，この分野の研究が更に発展することを目指しております．奮って御投稿下さいますよう御案内申し上げます． 1. 対象分野主な対象は以下のとおりですが，これに限らず，「情報システムや組込みシステム及びそれをとりまく環境を定式化した上で，そのシステムの振舞いの解析や性質の導出を厳密に行い，設計・運用に関わる種々の問題の解決を図る」ことを目指した論文を広く募集します． - 基礎理論：システムの構造や振舞いの形式記述・検証に関する基礎理論 - 形式技法：ソフトウェア，ハードウェア，ネットワークなどのシステムに対する体系だった記述・検証技法 - 形式ツール：モデル検査器や定理証明器など，形式手法に基づくツール - 応用：情報システムや組込システム，回路系，情報セキュリティ，車載システム，人工知能・機械学習システム，マルチエージェントなどへの形式手法の適用事例 - 教育：教育事例 2. 論文の執筆と取扱い論文 (一般論文)，レター，及びサーベイ論文を募集します．投稿規程等は電子情報通信学会の英文誌の規程と同じです．以下の規程を御参照下さい． "The Information for Authors" (IEICE Transactions on Information and Systems) http://www.ieice.org/eng/shiori/mokuji_iss.html 3. 主なスケジュール論文投稿締切 2019 年 9 月 24 日 (火) 23:59 JST (厳守) 第一回判定通知予定 2019 年 11 月 22 日 (金) 初回修正締切 2020 年 1 月 17 日 (金) 最終判定通知予定 2020 年 3 月 6 日 (金) 発行予定 2020 年 8 月号 4. 投稿方法投稿に際しては，著者のうち少なくとも1名は本会会員でなければなりません．ただし招待論文に関してはこの限りではありません．必要な投稿資格を満たしていない著者からの投稿論文については，投稿を受け付けないこととなりますので御注意下さい．入会の案内はこちらを御覧下さい． http://www.ieice.org/jpn/join/index.html 本特集では，電子投稿のみを受付けます．論文を下記の web page から投稿して下さい．初期投稿時に，編集可能な論文本体 (TeX/Word)，図，著者の写真， biography も投稿する必要があります． https://review.ieice.org/regist/regist_baseinfo_e.aspx 投稿の際には以下の項目を選択してください． "Journal/Section" -> "[Special FO] Formal Approaches" 同時に WEB 上で著作権譲渡手続きができます．投稿手続きについて御不明な点がございましたら，問合先まで御連絡下さい． 5. 掲載料招待論文を含むすべての著者は，論文が採録となった場合，2020 年 4 月頃に掲載料をお支払い頂くことになります．2020 年 5 月 15 日までに支払いが完了しない場合には，採録取り消しとなります． 6. オープンアクセスオプション電子情報通信学会論文誌は，2019 年 1 月号掲載論文から，著者が通常の掲載料に加え追加料金を支払うことで，論文をオープンアクセスにできる選択肢を試行的に提供致します．オープンアクセスオプションに関する詳細は，"Information for Authors" (http://www.ieice.org/eng/shiori/mokuji_iss.html)を御参照下さい（オープンアクセスオプションは試行段階であり，予告なく変更されることがあります）． 7. 特集編集委員会委員長：真野健(NTT) 幹事：石川冬樹(情報研)，横川智教（岡山県立大）委員：青木利晃(北陸先端大)，青木善貴（日本ユニシス），來間啓伸(日立)，小林孝一(北大)，立石孝彰(日本IBM)，土屋達弘(阪大)，山口真悟(山口大) 8. 問合せ先本特集のホームページ: (和文) http://www.brl.ntt.co.jp/people/mano/fa2019/jp/ (英文) http://www.brl.ntt.co.jp/people/mano/fa2019/ 真野健 NTT コミュニケーション科学基礎研究所〒243-0198 神奈川県厚木市森の里若宮 3-1 ken.mano.eh(a)hco.ntt.co.jp =========================================================================== CALL FOR PAPERS Special Section on Formal Approaches The IEICE Transactions on Information and Systems announces a forthcoming special section on Formal Approaches to be published in August 2020. Formal methods and techniques play a key role in designing and developing highly reliable information systems and embedded systems. The last decades have seen various new techniques and profound theoretical results using formal methods in surprisingly many fields such as modeling, requirements analysis, specification, automatic generation of codes, testing, verification, and maintenance. They are rapidly extending their application domains as a result of the recent growth of information and communication technologies. The Special Section on Formal Approaches aims at stimulating research on formal approaches to information systems and embedded systems, ranging from fundamental theory to practical applications. Our emphasis is put on the cross-fertilization of related research fields and encouragement of young researchers. Topics: The major topics are listed below, but we solicit submissions in all areas of formal approaches, i.e., first to formalize information systems, embedded systems, and their environment, next to analyze their behavior and to derive their properties rigorously, and then to solve various problems in designing and managing the systems. - Theoretical foundations: all aspects of theory related to formal description and verification for structure and behavior of systems. - Formal techniques: techniques for mainly describing and analyzing systems, such as software, hardware and networks. - Formal tools: tools based on formal methods such as model checkers, theorem provers, and static and dynamic analyzers. - Applications: practical experiences of applying formal methods to information systems, embedded systems, circuits, security, AI systems, machine learning systems, multi-agent systems, automotive systems, etc. - Education: education on formal methods. Submission Instructions: The deadline for submission is Sep 24, 2019, 23:59 JST(GMT+9). Manuscripts should be carefully prepared according to the guideline in the "Information for Authors" (available at http://www.ieice.org/eng/shiori/mokuji_iss.html). The preferred length of the manuscript is 8 pages. Only electronic submission through the web page is accepted. Submit a complete paper and transfer copyright of the paper using the IEICE Web site https://review.ieice.org/regist/regist_baseinfo_e.aspx Authors should choose the [Special FO] Formal Approaches" as a "Journal/Section" on the online screen. Editorial Committee: Guest Editor-in-Chief: Ken Mano (NTT Communication Science Laboratories) Guest Editors: Fuyuki Ishikawa (National Institute of Informatics) Tomoyuki Yokogawa (Okayama Prefectural University) Guest Associate Editors: Toshiaki Aoki (JAIST) Yoshitaka Aoki (Nihon Unisys) Koichi Kobayashi (Hokkaido University) Hironobu Kuruma (Hitachi, Ltd.) Takaaki Tateishi (IBM Japan) Tatsuhiro Tsuchiya (Osaka University) Shingo Yamaguchi (Yamaguchi University) Further information may be obtained from the web page at: http://www.brl.ntt.co.jp/people/mano/fa2019/ All inquiries should be sent to the guest editor in chief: Ken Mano NTT Communication Science Laboratories 3-1 Morinosato Wakamiya Atsugi Kanagawa 243-0198 Japan E-mail: ken.mano.eh(a)hco.ntt.co.jp Important Dates: Submission Deadline: Sep 24, 2019 23:59 JST (GMT+9) [strict] First Notification: Nov 22, 2019 Revised Version Deadline: Jan 17, 2020 Final Notification: Mar 6, 2020 Important Notice. (1) At least one of the authors must be an IEICE member when the manuscript is submitted for review. For the application of IEICE membership, visit http://www.ieice.org/eng/member/OM-appli.html (2) When a paper has been accepted for publication, the authors are required to pay the page charges covering part of the cost of publication. Please carefully read the submission guideline at http://www.ieice.org/eng/shiori/mokuji_iss.html (3) Upon accepted for publication, all authors, including authors of invited papers, should pay the page charges covering partial cost of publication around April, 2020. If payment is not completed by May 15, 2020, your manuscript will be handled as rejection. (4) [Open Access Option] Papers published in January 2019 issue and following issues will be offered a trial basis option which can make the papers open access if authors pay an additional charge on top of the usual page charge. For details on open access options, please carefully refer to “The Information for Authors” (http://www.ieice.org/eng/shiori/mokuji_iss.html). Note that open access option is still in the pre-trial stage, and it may be changed without notice. ===========================================================================

1 0

SLACS2019プログラム確定のお知らせ
by Kensuke Kojima 31 Aug '19

31 Aug '19

皆様（複数のメイリングリストに送信しています。重複して受信の際はご容赦ください。） SLACS2019幹事の小島です。講演・懇親会参加へお申し込み下さった皆様、どうもありがとうございました。プログラムが以下のように決まりましたのでお知らせします。 SLACS 2019（記号論理と情報科学） https://sites.google.com/view/slacs-2019/home 日時: 2019年9月9日（月）（午後1時25分開始）から2019年9月10日（火）場所: 京都大学総合研究8号館講義室3 参加費: 無料。ただし、懇親会費は別途徴収します。 9月9日 13:25-13:30 オープニング 13:30-14:30 山形頼之（国立研究開発法人産業技術総合研究所） Recent progress of consistency proofs of equational systems inside bounded arithmetics 14:50-15:30 只木孝太郎（中部大学工学部情報工学科） A refinement of quantum teleportation and superdense coding by algorithmic randomness 15:30-15:50 石原豪人 Chaos and foundation of mathematics 16:10-16:50 福田陽介（京都大学大学院情報学研究科） Call-by-name, call-by-value, and the modal linear lambda calculus 16:50-17:30 中野浩（龍谷大学理工学部）近似様相を含む型の意味論について 18:30- 懇親会 9月10日 10:00-10:40 長谷川真人（京都大学数理解析研究所） A braided lambda calculus 10:40-11:20 塚田武志（東京大学）不動点算術とプログラム検証 13:00-13:40 南規楽（京都大学数理解析研究所）論理式をやりとりするプロセス代数 13:40-14:20 村井涼（北海道大学大学院）分散知識オペレータを持つ多エージェント様相論理のシークエント計算 14:40-15:20 鴨浩靖（奈良女子大学） Prologによるビルドツールの使い心地 15:20-16:00 谷口雅弥（北陸先端科学技術大学院大学） Subjunctive Markers in Intentional Logic

1 0

第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020) 論文/発表募集
by Kazuyuki ASADA 30 Aug '19

30 Aug '19

皆様，（重複受信ご容赦ください） 2020年3月2日（月）～3月4日（水）に佐賀県嬉野市で開催予定の PPL 2020の論文/発表募集をお送りします．理論・実装を問わずプログラミング・プログラミング言語に関する研究発表を幅広く募集します．どうぞ投稿をご検討ください．よろしくお願いいたします．森畑明昌（東京大学）平石拓（京都大学）（PPL 2020 プログラム共同委員長）（代理で浅田和之（東北大学）が送信しました） ================================================== 第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020) 発表募集 2020年3月2日（月）-- 3月4日（水）佐賀県嬉野市「嬉野温泉和多屋別荘」 https://jssst-ppl.org/workshop/2020/ ** 重要な日程 ** カテゴリ1: 発表申込締切 2019年12月24日（火）17:00 (JST) 論文提出締切 2020年 1月 7日（火）17:00 (JST) 採否通知 2020年 1月31日（金）カテゴリ2: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月）カテゴリ3: 発表申込締切 2020年 2月 3日（月）17:00 (JST) 採否通知 2020年 2月 7日（金）カテゴリ4: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月） ** PPL2020とは ** PPL2020は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果や新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．代表的なトピックは以下のようなものですが，これに限らず，プログラミング・プログラミング言語に関する研究発表を幅広く受け入れます．基礎理論: 意味論，ラムダ計算，型理論，項書き換え，形式論理と証明，形式言語とオートマトン，圏論，チューリング機械，アルゴリズムなど言語デザイン: 各種プログラミングパラダイム（オブジェクト指向・関数型・論理型・アスペクト指向，その他あらゆるパラダイムを含む），モジュール化，メタプログラミング，並行・並列・分散計算，型システム，言語や言語システム等の相互運用，領域限定言語など言語処理系技術: コンパイラ，インタプリタ，実行時システム，仮想機械，プログラム最適化，プログラム解析，プログラム変換，メモリ管理などプログラミング補助: プログラム検証器，デバッガ，プロファイラ，統合開発環境，プログラム合成，リファクタリングなどケーススタディ: ソフトウェア開発報告，プログラミング技法，ツールの紹介など応用: システムソフトウェア，Webシステム，データベースシステム，数値計算，ユーザーインタフェース，セキュリティ，プログラミング教育，人工知能・機械学習など ** 発表募集カテゴリ ** 以下の4カテゴリの研究発表を募集します．詳しい募集要項は後日webページで公開します．カテゴリ1: 国内外で未発表の研究の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表カテゴリ4: サーベイ・チュートリアル発表カテゴリ1では，国内外で未発表の研究についての論文発表を募集します．PPL での議論をもとに研究を発展させ，国際会議や学術論文誌への投稿につなげることを奨励しています．会場で実りある議論ができるような，発展途上の研究を特に歓迎します．カテゴリ1の発表は，複数名の査読者によってその新規性・重要性・根拠の確かさ・説明の明瞭さを評価し，プログラム委員による議論によって採否を判断します．特に以下の点に注意してください． - 理論的な研究については，形式化の明瞭さと正しさが重要です．論文中に明示してあれば証明等が未完成でも構いませんが，証明等について議論できる程度の形式化は求められます． - 実装研究については，実装したソフトウェアやツールの有用性，実装のデザインチョイス，実装技術などが明瞭に説明されているかが重要です．論文中に明示してあれば実装や実験が未完成でも構いませんが，上記の点を議論できる程度の完成度は求められます．カテゴリ2では，国際会議や国際学術論文誌等で発表された，または採録決定済みの，国内では未発表の研究成果の紹介を募集します．PPLとの関連性・プログラム全体のバランス・発表された媒体をもとに，プログラム委員による議論によって採否を判断します．カテゴリ3では，PPLに関連する内容（未発表・既発表いずれでも構いません）についてのポスター発表を募集します．萌芽的なアイデアの紹介やツールのデモンストレーションなども歓迎します．PPLとの関連性・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ4では，既存研究のサーベイやツールのチュートリアルなど，PPLの聴衆にとって有益な学術知識の紹介を募集します．内容は未発表・既発表いずれでも構いません．PPLとの関連性・内容の重要性・発表者の経歴・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．さらに，カテゴリ1・2・4の全発表のなかから最も聴衆の支持を集めたものに発表賞，カテゴリ3の全発表のなかから最も聴衆の支持を集めたものにポスター賞を授与する予定です（いずれも一般の部・学生の部の2種類，ただし「発表賞」は既受賞者を除く）． ** プログラム委員会 ** 安部達也千葉工業大学荒堀喜貴東京工業大学石崎一明日本IBM 今井敬吾岐阜大学岩崎英哉電気通信大学岩間太日本IBM 馬谷誠二神奈川大学江本健斗九州工業大学大岩寛産業技術総合研究所紙名哲生大分大学亀山幸義筑波大学川端英之広島市立大学川本裕輔産業技術総合研究所菊池健太郎東北大学木村大輔東邦大学小島健介京都大学新屋良磨秋田大学関山太朗国立情報学研究所叢悠悠東京工業大学寺内多智弘早稲田大学日高宗一郎法政大学平石拓京都大学 (プログラム共同委員長) 廣川直北陸先端科学技術大学院大学水島宏太オプト森口草介関西学院大学森畑明昌東京大学 (プログラム共同委員長) ** 問い合わせ先 ** ppl2020-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2020-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ==================================================

1 0

Hans van Ditmarsch教授講演
by Satoshi Tojo 30 Aug '19

30 Aug '19

みなさま， LORIA-CNRSのHans van Ditmarsch教授により，以下の講演を行います．どうぞふるってご参加ください．日時：9/13(金)15:00--17:00 場所：北陸先端科学技術大学院大学　情報 II 棟コラボ6 東条 ********* One Hundred Prisoners and a Light Bulb Consider this riddle: "A group of 100 prisoners, all together in the prison dining area, are told that they will be all put in isolation cells and then will be interrogated one by one in a room containing a light with an on/off switch. The prisoners may communicate with one another by toggling the light-switch (and that is the only way in which they can communicate). The light is initially switched off. There is no fixed order of interrogation, or interval between interrogations, and the same prisoner will be interrogated again at any stage. When interrogated, a prisoner can either do nothing, or toggle the light-switch, or announce that all prisoners have been interrogated. If that announcement is true, the prisoners will (all) be set free, but if it is false, they will all be executed. While still in the dining room, and before the prisoners go to their isolation cells (forever), can the prisoners agree on a protocol that will set them free?" In this presentation I will present a solution, however I will mainly address such puzzles of knowledge in general. There are many others, such as the ‘Muddy Children Puzzle’ (also known as the ‘Wisemen Puzzle’), ‘Surprise Examination’, ‘Monty Hall’, etc. They often involve a (seemingly) paradoxical aspect making agents knowledgeable by announcements of their ignorance. Their provenance and dissemination is intriguing. Haruyuki Kawabe kindly told me that in Japan, a version of the Muddy Children Puzzle with coloured hats is known as 'Dirac's Puzzle', after the physicist Paul Dirac who introduced some Japanese physicists to the riddle about 1938, and it seems one of them wrote a novel using the idea of the puzzle in 1940. There is a relation between such knowledge puzzles and the area in logic known as ‘dynamic epistemic logic’. More information on such puzzles is found in the book also entitled 'One Hundred Prisoners and a Light Bulb' (Copernicus, 2015) and on the webpage http://personal.us.es/hvd/lightbulb.html. The puzzlebook has been translated into Japanese by Haruyuki Kawabe. Hans van Ditmarsch is a senior researcher at CNRS (the French National Research Organization), and based at LORIA in Nancy, where he is heading the research team CELLO (Computational Epistemic Logic in Lorraine). He is also affiliated to IMSc (Institute for Mathematical Sciences), in Chennai. His research is on the dynamics of knowledge and belief, information-based security protocols, modal logics, and combinatorics. He has been an editor of the Journal of Philosophical Logic. He is an author of the book Dynamic Epistemic Logic, an editor of the Handbook of Epistemic Logic. *************

1 0

AWPL2020 - CALL FOR PAPERS
by 小野寛晰 26 Aug '19

26 Aug '19

===================================================== AWPL 2020: 5th Asian Workshop on Philosophical Logic 7-9 April 2020 Hangzhou, China https://www.xixilogic.org/events/awpl2020/ <https://www.xixilogic.org/events/awpl2020/> ===================================================== CALL FOR PAPERS The 5th Asian Workshop on Philosophical Logic, 7-9 April 2020, Hangzhou, China Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second, third and fourth workshops took place successfully in Guangzhou (2014), Taipei (2016) and Beijing (2018), respectively. The previous post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer. The Fifth Asian Workshop on Philosophical Logic (AWPL 2020) will be held in Hangzhou, China, on 7-9 April 2020, organized by the Institute of Logic and Cognition at Zhejiang University. The AWPL 2020 workshop is an event in the Zhejiang Logic for AI Summit (ZjuLogAI 2020, https://www.xixilogic.org/zjulogai/ <https://www.xixilogic.org/zjulogai/>) which takes place on 6-10 April 2020. All AWPL participants are invited to attend other events as well. ------------------------ INVITED SPEAKERS To be confirmed. ------------------------ SUBMISSION All submissions should present original works not previously published. Submissions should be typeset in English, using the LNCS template (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>), be prepared as a PDF file with at most 12 pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2020 <https://easychair.org/conferences/?conf=awpl2020>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series. ------------------------ IMPORTANT DATES Submission deadline: 30 November 2019 Notification: 1 January 2020 Workshop: 7-9 April 2020 ------------------------ PROGRAM COMMITTEE (to be confirmed) Thomas Ågotnes, University of Bergen Nick Bezhanishvili, University of Amsterdam Sujata Ghosh, Indian Statistical Institute Meiyun Guo, South-West University, China Fengkui Ju, Beijing Normal University Kok-Yong Lee, National Chung Cheng University Beishui Liao, Zhejiang University (chair) Hanti Lin, University of California Davis Fenrong Liu, Tsinghua University Hu Liu, Sun Yat-Sen University Xinwen Liu, Chinese Academy of Social Sciences Minghui Ma, Sun Yat-Sen University Hiroakira Ono, JAIST, Japan Eric Pacuit, University of Maryland R Ramanujam, Institute of Mathematical Sciences, India Olivier Roy, University of Bayreuth Katsuhiko Sano, Hokkaido University Yì N. Wáng, Zhejiang University (co-chair) Chin-Mu Yang, Taiwan National University Jiji Zhang, Lingnan University

1 0

代数・論理・幾何と情報科学（ALGI）8月31日～9月1日（福岡）講演募集
by Akitoshi Kawamura 17 Aug '19

17 Aug '19

皆様（重複してお受取りの際はご容赦ください。）九大の河村と申します。標記の研究集会についてお知らせ致します。 ************************************************** 第三十回 ALGI（代数・論理・幾何と情報科学研究集会）令和元年8月31日（土）～9月1日（日）九州大学伊都キャンパス（福岡県福岡市西区）開催のお知らせと講演の募集 https://sites.google.com/site/algimeeting/ ************************************************** ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。今年は、九州大学マス・フォア・インダストリ研究所（IMI）の共同利用研究集会として開催します。第30回記念の特別企画として、 ALGI各分野の応用的側面の話題について招待講演を予定しております。奮ってご参加ください。 ●招待講演勝股審也（国立情報学研究所）竹内泉（産業技術総合研究所）長谷川勇（スクウェア・エニックス）前原貴憲（理化学研究所） ●日程令和元年（2019年）8月31日（土）～9月1日（日） ●会場九州大学　伊都キャンパス IMIコンファレンスルーム（ウエスト一号館D棟4階W1-D-414） http://www.imi.kyushu-u.ac.jp/pages/joint_research_auditorium.html 講演を希望される方は、・題目・講演者名・所属・希望時間（基本は質疑応答含め30分です）・講演に必要な道具・梗概（後日でも構いません）・講演資料を後日ご提供いただけるかどうか※［はい／いいえ］などの情報を、幹事の西澤 nishizawa(a)kanagawa-u.ac.jp までお寄せください。「講演したいと思っている」程度の不完全情報でも結構です。 ※研究所共同利用の報告書に記載するため、もし差支えなければ、　講演内容について一件3～15ページ程度の資料（スライドのコピー等でも　結構です）を御提供いただけると幸いです。　「はい」を選択いただいた方には開催終了後に改めてお伺いさせて頂きます。時間の空きがある限り、開催直前まで講演申込を受け付けるつもりですが、申込順に発表時間を割り当てていきますので、講演をお考えの方は、なるべくお早めにお知らせいただけますようにお願い致します。参加自体は申込不要で自由にご参加いただけますが、初日の夕方に予定している懇親会については、事前に詳細を告知し参加申込を受け付ける予定です。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。幹事・世話人河村彰星（九州大学）津曲紀宏（崇城大学）西澤弘毅（神奈川大学）溝口佳寛（九州大学）

1 2

PPL サマースクール 2019 のご案内
by Kohei SUENAGA 16 Aug '19

16 Aug '19

皆様，．（重複してお受け取りの場合はご容赦ください．）京都大学の末永と申します．日本ソフトウェア科学会大会併設の PPL サマースクール 2019 のご案内です．事前登録締め切りは8月19日となっております．今年は古瀬淳さんにブロックチェーンやスマートコントラクトについて Tezos を用いたハンズオンを含むセミナーをお願いしております．以下の Web サイトからご登録の上ご参加ください．よろしくお願いいたします． PPL 2019 サマースクール幹事末永幸平 -- PPLサマースクール2019：ブロックチェーンと形式検証 Webページ：http://ppl.jssst.or.jp/index.php?ss2019 参加登録：https://jssst2019.wordpress.com/participation/ 日本ソフトウェア科学会プログラミング論研究会 (PPL) 主催日本ソフトウェア科学会第36回大会併設企画講師：古瀬淳（ダイラムダ株式会社） 2019年8月26日(月) 10時～17時 (9時30分受付開始) 芝浦工業大学芝浦キャンパス（〒108-8548東京都港区芝浦3-9-14） * 概要ブロックチェーン技術というと，仮想通貨，仮想通貨というと，投機，規制，などの話題がどうしても先行しがちだが，技術面では，暗号，分散環境，プログラミング言語，形式的検証などの計算機科学最先端の技術が沢山使われている．このサマースクールでは，ブロックチェーン技術におけるこれらの理論面の関わりを，主にプログラミング言語に比重を置いて紹介し，実際に現在使用されているスマートコントラクト環境であるTezosのテストネットを使った実習を行う． * 講師紹介古瀬淳 (Jun FURUSE; ふるせじゅん) ダイラムダ株式会社代表取締役，Tezos Japan 理事．2002年パリ第七ディドロ大学博士課程修了，Ph.D．関数型言語の型システムの研究を行う．以降， LexiFi?，Jane Street Capital，Standard Chartered Bank 等で主に堅牢な金融システムを関数型言語による開発に従事．2018年から第三世代ブロックチェーン技術である Tezos のコア開発チームに唯一の日本人として参加している． * プログラム（予定） 9:30 - 10:00 受付 10:00 - 11:30 第1部: 通貨とブロックチェーンへのイントロダクション 11:30 - 13:00 昼休み 13:00 - 14:00 第2部: ブロックチェーンの基礎と Proof-of-stake 14:00 - 16:00 第3部: スマートコントラクトハンズオン 16:00 - 16:15 休憩 16:15 - 17:30 第4部: ブロックチェーンと形式検証第1部: 通貨とブロックチェーンへのイントロダクション通貨と通貨の歴史について概観し，オープンな分散データベースであるブロックチェーンが，なぜ仮想通貨の基盤として用いられているのかを解説する．また，ブロックチェーンや仮想通貨基盤における安全性の重要性について議論する．第2部: ブロックチェーンの基礎と Proof-of-stake ブロックチェーンの技術的詳細について解説する．また，代表的な合意形成アルゴリズムである proof-of-work (PoW) と proof-of-stake (PoS) について解説する．第3部: スマートコントラクトハンズオンスマートコントラクトは，ブロックチェーン上で動作する通貨授受をともなう契約自動執行プログラムであり，近年 Ethereum や Tezos において実装されている．今回は参加者の持参する PC の上で Tezos のスマートコントラクトを実際に記述し動作させてみる．第4部: ブロックチェーンと形式検証ブロックチェーンや，その上で実装される仮想通貨，スマートコントラクトにおいては，その安全性が非常に重要である．これらが安全でなかったためにこれまでに起きた事象をいくつか取り上げ，安全性を保証するための手法である形式検証がどのようにブロックチェーンやスマートコントラクトに使われているかを解説する． * 参加費学生会員1000円, 学生非会員2000円, 一般会員2000円, 一般非会員3000円参加ご希望の方は，日本ソフトウェア科学会第36回大会および併設イベントの参加申し込みページ https://jssst2019.wordpress.com/participation/ からお申し込みください．事前登録をお願いしております． * 受講者へのご連絡ハンズオンのパートは，ノート PC をご持参いただけるとよりお楽しみになれます．事前準備については，参加登録された方にメールでお知らせいたします． -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 0

リマインダ: SLACS 2019 講演募集のお知らせ
by Kensuke Kojima 12 Aug '19

12 Aug '19

皆様（複数のメイリングリストに送信しています。重複して受信の際はどうぞご容赦ください。）講演・懇親会申し込み締切まで二週間となりましたので、リマインダをお送りします。申し込み締切は8月25日です。ご検討よろしくお願いいたします。 SLACS 2019（記号論理と情報科学） https://sites.google.com/view/slacs-2019/home 日時 2019年9月9日（月）から2019年9月10日（火）場所京都市左京区吉田本町京都大学総合研究8号館3階講義室3 参加費無料。ただし、懇親会費は別途徴収します（懇親会は初日夕方に開催予定）。幹事京都大学小島健介連絡先 kozima(a)kuis.kyoto-u.ac.jp SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。 SLACS2018 (北海道大学) https://sites.google.com/view/slacs-2018/home SLACS 2017 (千葉工業大学) http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/index.html SLACS 2016 (名古屋大学) http://www.st.nanzan-u.ac.jp/info/sasaki/2016slacs/SLACS2016.html SLACS 2015 (南山大学) https://sites.google.com/site/ptslacs2015/ SLACS 2014 (東京工業大学) http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ 講演・懇親会申込方法：講演・懇親会参加を希望される方は、以下のフォームよりお申し込み下さい。（聴講のみの場合は申し込み不要です。）フォーム送信後に表示される URL を控えておくと後で回答内容を編集できます。講演申し込み: https://docs.google.com/forms/d/e/1FAIpQLSdYjYnWTM8peBMkh7NraVW3SdFPmmSz8QD… 懇親会参加申し込み: https://docs.google.com/forms/d/e/1FAIpQLSckwAzNX3nRuDfKOmju0YphATiYnjcsbT4… 講演申込期限は **2019年8月25日** としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。

1 0

９月３日(火)午後東大駒場「応用論理学」
by Toshio Suzuki 04 Aug '19

04 Aug '19

（複数お受け取りの方はご容赦下さい）首都大学東京の鈴木登志雄です。2019年9月3日午後に東大駒場で「応用論理学」という講演会を開催します。これは日本応用数理学会 2019年度年会の中の正会員主催オーガナイズドセッション（臨時の分科会）です。このセッション以外にも、年会には多くの講演が予定されています。皆様のご来場をお待ちしております。日本応用数理学会年会のプログラム・参加費・会場案内については年会ウェブページ https://annual2019.jsiam.org/ をご覧下さい。 ------- 「応用論理学」 2019年9月3日(火)16:30から17:50 東京大学駒場キャンパス21KOMCEE棟A(K211)室ご来場前に年会受付にお越し下さい：数理科学研究科（会場とは別の建物）117室チュートリアル AND-OR木の探索コスト / 鈴木登志雄 (首都大学東京) 重み付きAND-OR木の固有分布について【招待講演40分】 / 田中一之 (東北大学) ソロベイ還元と連続性 / 鈴木登志雄 (首都大学東京) (隈部正博、宮部賢志、水澤勇気との共同研究）連絡先鈴木登志雄 toshio-suzuki[atmark]tmu.ac.jp -------- セッション「応用論理学」チラシ http://toshio-suzuki-logic.jp/meeting/jsiam2019logic.pdf 日本応用数理学会年会のウェブ通常参加申込みは８月２６日まで、当日受付・当日払いもあります。 -- 鈴木登志雄首都大学東京理学研究科　数理科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

[参加募集] The Coq Workhsop 2019
by Jacques Garrigue 01 Aug '19

01 Aug '19

Logic-mlの皆様、名古屋大学のGarrigueです。 Coq Workshop 2019の開催案内をお送りします。ご参加をお待ちしております。早期参加申し込み締切：2019-08-04 ********************************************************************** The Coq Workshop 2019: Call for Participation Colocated with the 10th International Conference on Interactive Theorem Proving (ITP 2019), Portland, OR, USA ********************************************************************** We are pleased to invite you to participate in the Coq workshop 2019, which will be held on September 8 2019, in Portland, OR, USA. The Coq workshop is part of ITP 2019 (https://itp19.cecs.pdx.edu/). Topic: - The Coq workshop 2019 is the 10th Coq Workshop. The Coq Workshop series (https://coq.inria.fr/coq-workshop/) brings together Coq (https://coq.inria.fr/) users, developers, and contributors. While conferences usually provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, supplemented with invited talks. Program: - Invited talk: + Nicolas Tabareau: Not a single proof assistant for all, but proof assistants for everyone - Discussion session with the Coq development team - Accepted talks: + Kazuhiko Sakaguchi. Validating Mathematical Structures + Akira Tanaka. A Gallina Subset for C Extraction of Non-structural Recursion + Christian Doczkal and Damien Pous. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms + Bruno Bernardo, Raphaël Cauderlier, Basile Pesin, Zhenlei Hu and Julien Tesson. Mi-Cho-Coq, a framework for certifying Tezos Smart Contracts + Reynald Affeldt, Jacques Garrigue, Xuanrui Qi and Kazunari Tanaka. Experience Report: Type-Driven Development of Certified Tree Algorithms in Coq + Enrico Tassi and Erik Martin-Dorel. SSReflect in Coq 8.10 + Matthieu Sozeau, Yannick Forster, Simon Boulier, Nicolas Tabareau and Théo Winterhalter. Coq Coq Codet! + Florian Steinberg and Holger Thies. Computable analysis, exact real arithmetic and analytic functions in Coq + Florian Steinberg. _Some formal proofs about summable sequences in Coq - See https://staff.aist.go.jp/reynald.affeldt/coq2019/ for the schedule. Registration: - Early registration is before [2019-08-04 Sun] - See the ITP 2019 website for registration information: https://itp19.cecs.pdx.edu/registration/ Program Committee: - Reynald Affeldt (AIST) - Christian Doczkal (CNRS - LIP, ENS Lyon) - Jacques Garrigue (Nagoya University) - Chantal Keller (LRI, Univ. Paris-Sud) - Dominique Larchey-Wendling (CNRS, Loria) - Gregory Malecha (BedRock Systems Inc.) - Pierre-Marie Pédrot (INRIA) - Ilya Sergey (Yale-NUS College and NUS School of Computing) - John Wiegley (DFINITY) Organization contact (co-chairs): reynald.affeldt AT aist.go.jp, garrigue AT math.nagoya-u.ac.jp -- このメールは Google グループのグループ「sonoteno」に登録しているユーザーに送られています。このグループから退会し、グループからのメールの配信を停止するには sonoteno+unsubscribe(a)googlegroups.com <mailto:sonoteno+unsubscribe@googlegroups.com> にメールを送信してください。このディスカッションをウェブ上で閲覧するには https://groups.google.com/d/msgid/sonoteno/19b8a2be-d4a4-4f0b-a68a-d64955ae… <https://groups.google.com/d/msgid/sonoteno/19b8a2be-d4a4-4f0b-a68a-d64955ae…> にアクセスしてください。

1 0

PPL サマースクール 2019 のご案内
by Kohei SUENAGA 29 Jul '19

29 Jul '19

皆様，．（重複してお受け取りの場合はご容赦ください．）京都大学の末永と申します．日本ソフトウェア科学会大会と同時開催される PPL サマースクール 2019 のご案内です今年は，ダイラムダ株式会社の古瀬淳さんに，ブロックチェーンやスマートコントラクトについてハンズオンを含むセミナーをお願いしました．これらの技術に形式検証等の技術がどのように役に立つか，という話もしていただく予定です．近年よく耳にするこれらの技術ですが，実際に動かしながら学べる機会は貴重ですので，どうぞ奮ってご参加ください．事前の参加登録が必要です．以下の Web サイトからご登録の上ご参加ください．よろしくお願いいたします． PPL 2019 サマースクール幹事末永幸平 -- PPLサマースクール2019：ブロックチェーンと形式検証 Webページ：http://ppl.jssst.or.jp/index.php?ss2019 参加登録：https://jssst2019.wordpress.com/participation/ 日本ソフトウェア科学会プログラミング論研究会 (PPL) 主催日本ソフトウェア科学会第36回大会併設企画講師：古瀬淳（ダイラムダ株式会社） 2019年8月26日(月) 10時～17時 (9時30分受付開始) 芝浦工業大学芝浦キャンパス（〒108-8548東京都港区芝浦3-9-14） * 概要ブロックチェーン技術というと，仮想通貨，仮想通貨というと，投機，規制，などの話題がどうしても先行しがちだが，技術面では，暗号，分散環境，プログラミング言語，形式的検証などの計算機科学最先端の技術が沢山使われている．このサマースクールでは，ブロックチェーン技術におけるこれらの理論面の関わりを，主にプログラミング言語に比重を置いて紹介し，実際に現在使用されているスマートコントラクト環境であるTezosのテストネットを使った実習を行う． * 講師紹介古瀬淳 (Jun FURUSE; ふるせじゅん) ダイラムダ株式会社代表取締役，Tezos Japan 理事．2002年パリ第七ディドロ大学博士課程修了，Ph.D．関数型言語の型システムの研究を行う．以降， LexiFi?，Jane Street Capital，Standard Chartered Bank 等で主に堅牢な金融システムを関数型言語による開発に従事．2018年から第三世代ブロックチェーン技術である Tezos のコア開発チームに唯一の日本人として参加している． * プログラム（予定） 9:30 - 10:00 受付 10:00 - 11:30 第1部: 通貨とブロックチェーンへのイントロダクション 11:30 - 13:00 昼休み 13:00 - 14:00 第2部: ブロックチェーンの基礎と Proof-of-stake 14:00 - 16:00 第3部: スマートコントラクトハンズオン 16:00 - 16:15 休憩 16:15 - 17:30 第4部: ブロックチェーンと形式検証第1部: 通貨とブロックチェーンへのイントロダクション通貨と通貨の歴史について概観し，オープンな分散データベースであるブロックチェーンが，なぜ仮想通貨の基盤として用いられているのかを解説する．また，ブロックチェーンや仮想通貨基盤における安全性の重要性について議論する．第2部: ブロックチェーンの基礎と Proof-of-stake ブロックチェーンの技術的詳細について解説する．また，代表的な合意形成アルゴリズムである proof-of-work (PoW) と proof-of-stake (PoS) について解説する．第3部: スマートコントラクトハンズオンスマートコントラクトは，ブロックチェーン上で動作する通貨授受をともなう契約自動執行プログラムであり，近年 Ethereum や Tezos において実装されている．今回は参加者の持参する PC の上で Tezos のスマートコントラクトを実際に記述し動作させてみる．第4部: ブロックチェーンと形式検証ブロックチェーンや，その上で実装される仮想通貨，スマートコントラクトにおいては，その安全性が非常に重要である．これらが安全でなかったためにこれまでに起きた事象をいくつか取り上げ，安全性を保証するための手法である形式検証がどのようにブロックチェーンやスマートコントラクトに使われているかを解説する． * 参加費学生会員1000円, 学生非会員2000円, 一般会員2000円, 一般非会員3000円参加ご希望の方は，日本ソフトウェア科学会第36回大会および併設イベントの参加申し込みページ https://jssst2019.wordpress.com/participation/ からお申し込みください．事前登録をお願いしております． * 受講者へのご連絡ハンズオンのパートは，ノート PC をご持参いただけるとよりお楽しみになれます．事前準備については，参加登録された方にメールでお知らせいたします． -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 0

JAIST Logic Seminar Series
by Tatsuji Kawai 26 Jul '19

26 Jul '19

皆様 Padova大学のFrancesco Ciraulo先生の講演のお知らせです。どうぞふるってご参加ください。河井達治北陸先端科学技術大学院大学情報科学系 e-mail: tkawai(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks and EU Horizon 2020 Marie Skłodowska-Curie actions RISE project CID (http://www.jaist.ac.jp/logic/ja/core2core, http://cid.uni-trier.de/). Date: Wednesday 31st July, 2019, 15:20-17:00 Place: JAIST, Collaboration room 6 (I-57g) (https://www.jaist.ac.jp/english/top/access/index.html) Speaker: Francesco Ciraulo (University of Padova) Title: Overlap algebras: a constructive alternative to complete Boolean algebras Abstract: Although (complete) Boolean algebras does exist in a constructive framework, they fail to capture very basic examples, such as powersets. Constructively, the subsets of a given set form a complete Heyting algebra (locale), but one of a very special kind: it is an “overlap algebra”. The definition of an overlap algebra, as proposed by Giovanni Sambin some years ago, collapses to that of a complete Boolean algebra (Boolean locale) if the Principle of Excluded Middle (PEM) holds. Overlap algebras can be useful to obtain constructive versions of classical results about complete Boolean algebras. For instance, the regular open sets in a topological space form an overlap algebra. More generally, the smallest strongly dense sublocale of an overt locale is an overlap algebra. (The latter is a version of Isbell’s density theorem.) The sublocales of an overlap algebra have not been completely understood yet (contrary to the case of Boolean locales). At the moment we only know that the open sublocales of a given overlap algebra L are overlap algebras, and that there is a bijection between those sublocales of L which are overlap algebras, on one side, and the overt weakly closed sublocales of L (i.e. the points of its lower-powerlocale), on the other side. The internal locales in the topos of sheaves over a given locale L correspond to morphisms with codomain L in the (external) category of locales. In particular, internal overt locales correspond to open maps. Since overlap algebras are a special class of overt locales, it should be possible to identify internal overlap algebras in a localic topos as a special class of open maps. The ultimate goal would be to exploit the fact that a locale which is not an overlap algebra can “become” an overlap algebra internally in many Grothendieck toposes.

1 0

Talk by Nobuko Yoshida (July 30th, Tuesday, 14.00-)
by Kazushige TERUI 25 Jul '19

25 Jul '19

みなさま来週火曜日に京都大学にて吉田展子さん（Imperial College London）によるご講演があります。詳細は下記の通りです（いつもとは曜日・時間が異なりますのでご注意ください）。よろしければぜひご参加ください。京都大学数理解析研究所照井一成 ========== Time: 14:00-15:00, July 30th, Tuesday, 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) Title: Behavioural Type-based Static Verification Framework for Go Speaker: Nobuko Yoshida (Imperial College London) http://mrg.doc.ic.ac.uk/ Abstract: I first give an overview of recent researches of my group. Go is a production-level statically typed programming language whose design features explicit message-passing primitives and lightweight threads, enabling (and encouraging) programmers to develop concurrent systems where components interact through communication more so than by lock-based shared memory concurrency. Go can detect global deadlocks at runtime, but does not provide any compile-time protection against all too common communication mismatches and partial deadlocks. In this work we present a static verification framework for liveness and safety in Go programs, able to detect communication errors and deadlocks by model checking. Our toolchain infers from a Go program a faithful representation of its communication patterns as behavioural types, where the types are model checked for liveness and safety.

1 0

[1st CFP] SOCREAL 2019
by Katsuhiko Sano 18 Jul '19

18 Jul '19

The First Call for Papers SOCREAL 2019 5th International Workshop on Philosophy and Logic of Social Reality 15 - 17 November 2019 Hokkaido University, Sapporo, JAPAN Under the auspices of Philosophy and Ethics Laboratory at Faculty of Humanities and Human Sciences, Hokkaido University, CAEP Center for Applied Ethics and Philosophy at Faculty of Humanities and Human Sciences, Hokkaido University, and LOG-UCI An interdisciplinary study of the logical dynamics of the interaction between utterances and social contexts, A research Project funded by JSPS (JSPS KAKENHI Grant Number JP 17H02258) [About SOCREAL] Since the last years of the 20th century, a number of attempts have been made in order to model various aspects of social interaction among agents including individual agents, organizations, and individuals representing organizations. The aim of SOCREAL Workshop is to bring together researchers working on diverse aspects of such interaction in logic, philosophy, ethics, computer science, cognitive science and related fields in order to share issues, ideas, techniques, and results. The earlier editions of SOCREAL Workshop has been held in March 2007, March 2010, October 2013, and October 2016. Building upon the success of these editions, its fifth edition will be held from 15 November till 17 November 2019. SOCREAL 2019 will consist of keynote lectures by invited speakers and presentations of submitted papers. Keynote lectures will be given by Barteld Kooi (University of Groningen), Jeremy Seligman (University of Auckland), and Tomoyuki Yamada (Hokkaido University). The working language of SOCREAL Workshop is English. [Submission] Researchers from various fields, including logic, philosophy, ethics, computer science, cognitive science are hereby invited to submit an extended abstract (up to two thousand words) by 23 August 2019 to yamada(a)let.hokudai.ac.jp . Each abstract will be peer-reviewed by the program committee of the workshop. The abstract should be written in English and sent as an attachment in .pdf format. Each abstract should include a title, names and contact details of the author or all the co-authors. It is requisite for the author or at least one of the co-authors of each accepted paper to attend the workshop and present the paper. [Important Dates] Deadline for Submission of Abstracts: 23 August 2019 Notification of Acceptance: 13 September 2019 Deadline for Registration: 14 October 2019 Workshop: 15-17 November 2019 [Publication] A printed booklet containing the abstracts of all the accepted papers will be available at the workshop. On-line proceedings containing the papers and the presentation slides presented at the workshop will be made available after the workshop. Authors of the presented papers will also be encouraged to submit (the revised versions of) the full papers for publication in an issue of The Journal of Applied Ethics and Philosophy after the workshop. The papers should be written according to the submission guidelines of the journal, and will be peer-reviewed. Further particularities and instructions will be announced after the workshop. [Website] For more information, please visit the following website: http://www.asahi-net.or.jp/~yt6t-ymd/sr19/index.html . [Contact] Tomoyuki Yamada yamada(a)let.hokudai.ac.jp

1 0

Talk by Gabriele Vanoni (July 18th, 11.00-)
by Kazushige TERUI 14 Jul '19

14 Jul '19

みなさま今週木曜に京都大学にてGabriele Vanoniさんによるご講演があります。詳細は下記の通りです。よろしければご参加ください。京都大学数理解析研究所照井一成 ========== Time: 11:00-12:00, July 18th, 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: Gabriele Vanoni (Univ. Bologna) Title: The Geometry of Abstract Machines Joint work with Ugo Dal Lago and Beniamino Accattoli Geometry of Interaction (GOI) is a semantic framework describing the dynamics of cut-elimination in the Multiplicative Exponential fragment of Linear Logic (MELL). It has been formulated in many ways, from operator algebras to traced symmetrical monoidal categories. Remarkably, some of these formulations, in particular Context Semantics by Gonthier et al. led to the introduction of compilation techniques (Mackie '95) and abstract machines for higher-order functional languages (Danos and Regnier '99). However, these machines were always based on a proof-net representation of programs, via the so-called Girard translation. We introduce an abstract machine in the spirit of GOI based directly on the λ-calculus, without any explicit use of proof-nets. We prove soundness and adequacy, and we derive in our framework an optimization already presented by Danos and Regnier. We intend to analyze in the future the complexity of these machines, with particular emphasis on the trade-off between space and time efficiency.

1 0

論理学と形而上学についての講演会；7月18日14時30分より、名古屋大学情報学棟第4講義室
by 久木田水生 11 Jul '19

11 Jul '19

皆さま、 BCCにて失礼します。名古屋大学情報学研究科の久木田です。この度、岸田功平さんをお招きして下記の通り講演会を開催します。岸田功平さんはDalhousie大学のDepartment of Mathematics and Statisticsに所属されており、様相論理や圏論がご専門です。今回は様相述語論理と形而上学に関連するお話をしていただきます。岸田さんのウェブサイト https://www.mathstat.dal.ca/~kishida/ 皆様、どうぞ振るってご参加ください。また、興味のありそうな方に声をかけていただけると幸いです。久木田水生記日時：2019年7月18日（木）、14時30分から場所：名古屋大学情報学棟1F第4講義室。アクセス→ https://www.i.nagoya-u.ac.jp/access/ 講演者：岸田功平タイトル：Quantified Logic for Modal Reasoning and Theorizing 要旨： Logicians and metaphysicians have developed various models and semantics of quantified modal logic. These semantics come with ontological and metaphysical implications regarding the references of singular terms --- such as the necessity of Hesperus being Phosphorus. My primary question in this talk is how these metaphysical facts can be a posteriori facts, as opposed to a matter of logic, of the sort that a cognizer can come to know. The goal of this talk is to give a semantics that sheds new light on this aposteriority. I will take an approach in terms of intensional logic that treats all singular terms, predicates, and quantifiers as uniformly intensional. Combined with epistemic logic, my approach will provide a semantics and logic in which metaphysical principles regarding cross-world reference are substantial facts that a cognizer can both learn and use in their modal reasoning and theorizing. 以上

1 0

第41回量子情報技術研究会（QIT41）会告案内
by Yasuhito Kawano 08 Jul '19

08 Jul '19

logic-mlの皆様、 NTTの河野です。第41回量子情報技術研究会（QIT41）の会告案内をお送りします。皆様のご参加をお待ちしております。よろしくお願いします。河野泰人 ----------------------------------------------------------------- 第41回量子情報技術研究会（QIT41）研究会の内容：　　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．　情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究と　そこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を　目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に　携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的と　しています．　　第41回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，　自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，　広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も　歓迎致しますので，奮ってお申し込みください．　　なお，第38回研究会から学生発表賞を創設いたしました．応募方法等については，　下記のQITウェブサイトをご確認下さい．日時: 2019年11月18日(月)〜19日(火) 会場: 学習院大学百周年記念会館 (〒171-8588 東京都豊島区目白1-5-1) 発表募集分野 (申し込み状況によっては査読の可能性あり)：　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，　計算機科学的研究，数学的研究，および，その他関連分野．定員: 180名程度参加費：　一般4,000円，学生3,000円懇親会費：一般4,000円，学生2,000円 ※当日現地支払いの場合，参加費・懇親会費は上記に+1,000円が増額されます．　（参加事前登録または銀行振込が期限に間に合わない場合も，これに該当します．） ※学生限定・当日受付・予稿集なし・懇親会なしの参加費1,000円という選択肢もあります．　こちらは事前手続き不要です．研究会参加申込要領：　参加申込は下記 Web にて受付けます：　https://www.ieice.org/es/qit/qit41/ 　講演 (口頭，ポスター) の申込，予稿集原稿PDFの提出は，電子情報通信学会の　Webシステムを使用する予定．各種締切：【口頭講演申込締切】　　2019年10月4日（金）【ポスター講演申込締切】2019年10月18日（金）【予稿原稿提出締切】　　2019年10月18日（金）【参加申込締切】　　　　2019年11月1日（金）【問合せ先】　田崎晴明 (学習院大学) 　衞藤雄二郎（産総研）　柴田康介（学習院大学）　並木亮（学習院大学）　Email: qit41(a)qo.phys.gakushuin.ac.jp 主催: 量子情報技術特別研究専門委員会 (委員長: 平野琢也(学習院大学)) 共催: 応用物理学会量子エレクトロニクス研究会

1 0

モデル理論夏の学校・研究集会のお知らせ
by kota takeuchi 29 Jun '19

29 Jun '19

皆様２０１９年度のモデル理論夏の学校研究集会のお知らせです。本研究集会は，例年夏に開催されるモデル理論に関する研究集会です。モデル理論に興味のある方はだれでも参加していただけます。申し込み締め切り：８月２日（金）セミナーハウスに宿泊する場合は部屋数に限りがありますのでお早めにお申し込みください。また限られた予算内ですが旅費の援助も検討しています。希望される方はご相談ください。研究集会HP：https://sites.google.com/view/model-theory-summer-school-201/home 期間：２０１９年９月２日（月）午後～９月４日（水）午前場所：東海大学山中湖セミナーハウス山梨県南都留郡山中湖村山中３２３－１〒４０１－０５０１ＴＥＬ０５５５－６２－４１００世話役：竹内耕太、坪井明人筑波大学 kota(a)math.tsukuba.ac.jp, tsuboi(a)math.tsukuba.ac.jp 竹内耕太

1 0

（詳報）第18回関西集合論セミナ：2019年7月5日大阪府立大学
by Masaru KADA 21 Jun '19

21 Jun '19

みなさま：大阪府立大学嘉田勝です。過日ご案内しました小集会「第18回関西集合論セミナ」の詳報です。お問い合わせは嘉田まで。（講演のお申し込みは締め切りました）なお、関西集合論セミナの後、16:30 より、同じ講義室にて、 Paul Larson 氏による談話会講演を計画しています。（講演題目未定） ======== 第18回関西集合論セミナ 2019年7月5日（金） 13:00–-15:50 大阪府立大学中百舌鳥キャンパス A14棟333講義室プログラム（進行により多少前後します） 13:00--13:50 Paul Larson (Miami University, Ohio USA) Balanced Forcing Extensions 14:00--14:30 静間荘司（大阪府立大学） title to be announced 14:40--15:10 依岡輝幸（静岡大学） title to be announced 15:20--15:50 渕野昌（神戸大学） title to be announced ---- Paul Larson 氏講演概要 Title: Balanced Forcing Extensions Abstract: We will introduce the notions of virtual conditions and balanced conditions in definable partial orders, and apply these ideas to forcing extensions of the Solovay model. We will present a variety of independence results, and some ZF implications, for weak forms of the Axiom of Choice, and discuss related issues concerning the preservation of cardinals and chromatic numbers. Some of these results can be stated more generally using a natural classification of definable partial orders in terms of amalgamation properties. ======== -------- Masaru KADA （嘉田勝） kada(a)mi.s.osakafu-u.ac.jp --------

1 0

第18回関西集合論セミナ：2019年7月5日（金）大阪府立中百舌鳥キャンパス
by Masaru KADA 18 Jun '19

18 Jun '19

みなさま：大阪府立大学嘉田勝です。下記のとおり集合論研究者向けの小集会を開催します。ご参加、ご講演のお申し込みはお気軽に嘉田まで。 ======== 第18回関西集合論セミナ 2019年7月5日（金） 13:00–16:00（予定）大阪府立大学中百舌鳥キャンパス（講義室未定）講演者（6月18日現在）（順不同） Paul Larson (Miami University, Ohio USA) 静間荘司（大阪府立大学）依岡輝幸（静岡大学）お問い合わせ：嘉田勝 kada(a)mi.s.osakafu-u.ac.jp ======== -------- Masaru KADA （嘉田勝） kada(a)mi.s.osakafu-u.ac.jp --------

1 0

日本数学会2019年度秋季総合分科会の講演申し込みが開始されました
by Teruyuki YORIOKA 18 Jun '19

18 Jun '19

みなさま静岡大学の依岡です．日本数学会2019年度秋季総合分科会の講演申し込みが開始されました．多くのみなさまに講演をしていただきたいと思います．講演をご希望の方はなるべく早くに申し込みをしてください．講演締め切りは6月21日（金）までです． http://mathsoc.jp/meeting/kanazawa19sept/ なお，金沢駅周辺の宿泊事情により，参加ご予定の方はなるべく早めに宿泊予約をしていただくことが会場校より推奨されています．講演申し込みに併せて，早めの宿泊施設の予約もお願いします．

1 1

連続講演「計算量への数理論理学的アプローチ」
by Yoriyuki Yamagata 08 Jun '19

08 Jun '19

みなさま、下記のような連続講演を行います。表題：計算量への数理論理学的アプローチ日時：2019年7月5日20:00-21:00(初回）それ以降の開催日は参加者と相談して決定場所：大阪分散技術コミュニティ（大阪府大阪市福島区海老江２丁目８−２９ 2F）参加登録：https://connpass.com/event/134707/ 概要：計算量に関わる問題、とくにP≠NP問題を数理論理学的にアプローチする試みについて紹介します。最初に計算量理論を簡単に紹介したのち、Bussによる「限定算術」の階層がそれとどのように関わるかを説明します。さらに、限定算術の階層を等式系の無矛盾性証明を用いて分離する試みについて、講演者の次の二つの論文を紹介することにより報告します。 - CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC, Journal of Symbolic Logic 2018 - Separation of bounded arithmetic using a consistency statement, Preprint 予備知識は特に要求しません。参加は事前登録制です。なお、民間の会議室を借りて行うため、入場料1000円が必要です。また、Skypeによる遠隔参加も可能ですので、興味をお持ちの方はSkype idをメールで送付いただければと思います。本メールは興味のありそうな方に自由に転送していただいて結構です。よろしくご参集ください。 -- Yoriyuki Yamagata (Senior Researcher) National Institute of Advanced Industrial Science and Technology

1 0

[CFP] The Coq Workhsop 2019 (締切延長)
by Jacques Garrigue 05 Jun '19

05 Jun '19

logic-mlの皆様、名古屋大学のガリグです。 Coq Workshop 2019の投稿締切を2019-06-10(月)まで延長しましたのでお知らせします。ぜひ投稿をご検討ください。投稿〆切：2019-06-10 (2ページの概要) よろしくお願いいたします。 -- ********************************************************************* The Coq Workshop 2019: Call for Talk Proposals Colocated with the 10th International Conference on Interactive Theorem Proving (ITP 2019), Portland, OR, USA ********************************************************************** We are pleased to invite you to submit talk proposals for the Coq workshop 2019, which will be held on September 8 2019, in Portland, OR, USA. The Coq workshop is part of ITP 2019 (https://itp19.cecs.pdx.edu/). The Coq workshop 2019 is the 10th Coq Workshop. The Coq Workshop series (https://coq.inria.fr/coq-workshop/) brings together Coq (https://coq.inria.fr/) users, developers, and contributors. While conferences usually provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Important dates: - June 10 2019: Deadline for abstract submission (Extended) - July 2 2019: Notification to authors - September 8 2019: Workshop Submission Instructions: Authors should submit short proposals through EasyChair (https://easychair.org/conferences/?conf=coq2019) in the form of a PDF extended abstract of less than 2 pages, in full-page single-column style. Relevant subject matter includes but is not limited to: - Theory and implementation of the Calculus of Inductive Constructions - Language or tactic features - Plugins and libraries for Coq - Techniques for formalization programming languages and mathematics - Applications and experience in education and industry - Tools and platforms built on Coq (including interfaces) - Formalization tricks and pearls Program Committee: - Reynald Affeldt (AIST) - Christian Doczkal (CNRS - LIP, ENS Lyon) - Jacques Garrigue (Nagoya University) - Chantal Keller (LRI, Univ. Paris-Sud) - Dominique Larchey-Wendling (CNRS, Loria) - Gregory Malecha (BedRock Systems Inc.) - Pierre-Marie Pédrot (INRIA) - Ilya Sergey (Yale-NUS College and NUS School of Computing) - John Wiegley (DFINITY) Organization contact (co-chairs): reynald.affeldt AT aist.go.jp, garrigue AT math.nagoya-u.ac.jp For more information: https://staff.aist.go.jp/reynald.affeldt/coq2019/

1 0

2019年度数学基礎論サマースクールのご案内
by Teruyuki YORIOKA 03 Jun '19

03 Jun '19

みなさま静岡大学の依岡です． 2019年度数学基礎論サマースクールのウェブサイトを公開しました． https://www.sci.shizuoka.ac.jp/~math/yorioka/ss2019/ サマースクールに参加ご希望の方は以下の情報を8月2日(金)までに email で，件名を「SS2019」として依岡（ yorioka(a)shizuoka.ac.jp ）までお送りください．氏名：所属：身分： email アドレス：懇親会：参加・不参加みなさまぜひ9月の第1週目は静岡にお越しください．みなさまのご参加をお待ちしております．

1 0

Nagoya logic seminar
by 吉信康夫 27 May '19

27 May '19

皆様：名古屋大学の吉信です。以下の要領で名古屋ロジックセミナーを開催します。日時：5月31日(金) 15:30〜場所：名古屋大学大学院情報学研究科棟1階122室(講義室2) 講演者：渕野昌(神戸大学) タイトル：The trichotomy of the possible size of the continuum under the existence of a Laver-generic large cardinal 詳しくは名古屋ロジックセミナーのページをごらんください。 http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 多数の方のご参加をお待ちしております。

1 0

SLACS 2019 講演募集のお知らせ
by Kensuke Kojima 26 May '19

26 May '19

皆様（複数のメイリングリストに送信しています。重複して受信の際はどうぞご容赦ください。） SLACS 2019（記号論理と情報科学）幹事の京都大学の小島健介です。今年度の講演募集を以下のとおり行います。ご検討よろしくお願いいたします。 SLACS 2019（記号論理と情報科学） https://sites.google.com/view/slacs-2019/home 日時 2019年9月9日（月）から2019年9月10日（火）場所京都市左京区吉田本町京都大学総合研究8号館3階講義室3 参加費無料。ただし、懇親会費は別途徴収します（懇親会は初日夕方に開催予定）。幹事京都大学小島健介連絡先 kozima(a)kuis.kyoto-u.ac.jp SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。 SLACS2018 (北海道大学) https://sites.google.com/view/slacs-2018/home SLACS 2017 (千葉工業大学) http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/index.html SLACS 2016 (名古屋大学) http://www.st.nanzan-u.ac.jp/info/sasaki/2016slacs/SLACS2016.html SLACS 2015 (南山大学) https://sites.google.com/site/ptslacs2015/ SLACS 2014 (東京工業大学) http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ 講演・懇親会申込方法：講演・懇親会参加を希望される方は、以下のフォームよりお申し込み下さい。（聴講のみの場合は申し込み不要です。）フォーム送信後に表示される URL を控えておくと後で回答内容を編集できます。講演申し込み: https://docs.google.com/forms/d/e/1FAIpQLSdYjYnWTM8peBMkh7NraVW3SdFPmmSz8QD… 懇親会参加申し込み: https://docs.google.com/forms/d/e/1FAIpQLSckwAzNX3nRuDfKOmju0YphATiYnjcsbT4… 講演申込期限は **2018年8月25日** としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。

1 0

[CFP] The Coq Workhsop 2019
by Jacques Garrigue 22 May '19

22 May '19

Logic-mlの皆様、名古屋大学のGarrigueです。投稿締切が近づきましたので、再度Coq Workshop 2019のCFPを送らせていただきます。フランス国立情報学自動制御研究所のNicolas Tabareau博士とCoqの開発チームによる招待講演を予定しております！ぜひ投稿をご検討ください。投稿〆切：2019-06-04 (2ページの概要) よろしくお願いいたします。 -- ********************************************************************* The Coq Workshop 2019: Call for Talk Proposals Colocated with the 10th International Conference on Interactive Theorem Proving (ITP 2019), Portland, OR, USA ********************************************************************** We are pleased to invite you to submit talk proposals for the Coq workshop 2019, which will be held on September 8 2019, in Portland, OR, USA. The Coq workshop is part of ITP 2019 (https://itp19.cecs.pdx.edu/). The Coq workshop 2019 is the 10th Coq Workshop. The Coq Workshop series (https://coq.inria.fr/coq-workshop/) brings together Coq (https://coq.inria.fr/) users, developers, and contributors. While conferences usually provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Important dates: - June 4 2019: Deadline for abstract submission - July 2 2019: Notification to authors - September 8 2019: Workshop Submission Instructions: Authors should submit short proposals through EasyChair (https://easychair.org/conferences/?conf=coq2019) in the form of a PDF extended abstract of less than 2 pages, in full-page single-column style. Relevant subject matter includes but is not limited to: - Theory and implementation of the Calculus of Inductive Constructions - Language or tactic features - Plugins and libraries for Coq - Techniques for formalization programming languages and mathematics - Applications and experience in education and industry - Tools and platforms built on Coq (including interfaces) - Formalization tricks and pearls Program Committee: - Reynald Affeldt (AIST) - Christian Doczkal (CNRS - LIP, ENS Lyon) - Jacques Garrigue (Nagoya University) - Chantal Keller (LRI, Univ. Paris-Sud) - Dominique Larchey-Wendling (CNRS, Loria) - Gregory Malecha (BedRock Systems Inc.) - Pierre-Marie Pédrot (INRIA) - Ilya Sergey (Yale-NUS College and NUS School of Computing) - John Wiegley (DFINITY) Organization contact (co-chairs): reynald.affeldt AT aist.go.jp, garrigue AT math.nagoya-u.ac.jp For more information: https://staff.aist.go.jp/reynald.affeldt/coq2019/ _______________________________________________ jssst-ppl mailing list jssst-ppl(a)fos.kuis.kyoto-u.ac.jp http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl

1 0

ENTROPY 2019: Call for Participation - Co-located with EuroS&P'19
by David Nowak 21 May '19

21 May '19

*************************************************************** Call for participation — ENTROPY 2019 ENabling TRust through Os Proofs … and beYond 16 June 2019 Second International workshop on the use of theorem provers for modelling and verification at the hardware-software interface https://entropy2019.sciencesconf.org Co-located with EuroS&P'19, KTH, Stockholm, June 2019 *************************************************************** PROGRAM HIGHLIGHTS Formal Proof of a Secure OS Full Trusted Computing Base by Dominique Bolignano, Prove & Run Time protection: principled prevention of timing channels by Gernot Heiser, University of New South Wales Proving the security of interrupt handling against interrupt-based side-channel attacks: a case study by Frank Piessens, KU Leuven Nailing Down the Architectural Abstraction by Peter Sewell, University of Cambridge

1 0

Final Call for Papers: One week deadline extension of LORI-VII (18-21 October 2019@Chongqing)
by Katsuhiko Sano 15 May '19

15 May '19

Logic-ml の皆様、北海道大学の佐野勝彦です。今年10月に中国の重慶で開催される LORI-VII の final cfp をお送りいたします。皆様、奮ってご投稿ください。佐野勝彦 -------------------------------------------------------------------------------------------------------------- Final Call for Papers: One week deadline extension The Seventh International Conference on Logic, Rationality and Interaction (LORI-VII), South-West University, Chongqing, China, 18-21 October 2019. Conference Website: http://golori.org/lori2019/. The International Conference on Logic, Rationality and Interaction (LORI) conference series aims to bring together researchers working on a wide variety of logic-related fields that concern the understanding of rationality and interaction. The series aims at fostering a view of logic as an interdisciplinary endeavor, and supports the creation of an East -Asian community of interdisciplinary researchers. Keynote Speakers: Thomas Ågotnes (Bergen/Southwest) ∙ Leila Amgoud (Toulouse) ∙ Kevin Kelly (Carnegie Mellon) ∙ Rineke Verbrugge (Groningen) ∙ Michael Wooldrige (Oxford) ∙ Yanjing Wang (Beijing) We invite submission of contributed papers on any of the broad themes of the LORI series; specific topics of interest include, but are not limited to, formal approaches to: Agency, argumentation and agreement, belief representation, cooperation, belief revision and belief merging, strategic reasoning, games, decision making and planning, knowledge and action, epistemology, dynamics of informational attitudes, knowledge representation, interaction, norms and normative systems, natural language, rationality, philosophy and philosophical logic, preference and utility, social choice, probability and uncertainty, social interaction, intentions, plans, and goals. Submitted papers should be at most 12 pages long, with one additional page for references, in PDF format following the Springer LNCS style. Please submit your title and abstract by May 20, 2019, and your full paper by May 27, 2019. Submission is via the EasyChair for LORI-VII: https://easychair.org/my/conference?conf=lori7. Accepted papers will be collected as a volume in the FoLLi series on Logic, Language and Information, and extended versions of some will later be considered for publication in a special issue of the Journal of Logic, Language and Information (JoLLI). Local Chair: Meiyun Guo, South-West University, Chongqing, China. Program Committee: Andreas Herzig, Davide Grossi, Dominik Klein, Dongmo Zhang, Emiliano Lorini (co-chair), Eric Pacuit, Fengkui Ju, Fernando R. Velázquez-Quesada, Gabriella Pigozzi, Gregory Wheeler, Guo Meiyun, Hiroakira Ono, Hans van Ditmarsch, Hu Liu, Jakub Szymanik, Jeff Horty, Jeremy Seligman, Jérôme Lang, Junhua Yu, Katsuhiko Sano, Kaile Su, Kohei Kishida, Luciana Benotti, Natasha Alechina, Nina Gierasimczuk, Olivier Roy, Patrick Blackburn (co-chair), Paolo Turrini, R. Ramanujam, Robert van Rooij, Sara Negri, Sonja Smets, Soroush Rafiee Rad, Thomas Bolander, Thomas Icard, Thomas Ågotnes, Valentin Goranko, Wesley Holliday, Yì N. Wáng. Inquiries concerning the submission of papers should be addressed to Patrick Blackburn (patrick.rowan.blackburn(a)gmail.com) and Emiliano Lorini (Emiliano.Lorini(a)irit.fr).

1 0

教員公募（早稲田大学基幹理工学部、女性限定）
by USUBA Toshimichi 14 May '19

14 May '19

皆様、早稲田大学基幹理工学部の薄葉です。早稲田大学基幹理工学部応用数理学科で女性限定の公募を開始いたしました。職位：専任講師、准教授または教授 1 名【女性限定】所属：早稲田大学理工学術院専門分野：応用数理担当講義：応用数理に関する専門科目、理工学術院における一般教育数学科目着任時期：2020年4月以降なるべく早い時期勤務形態：常勤（任期なし）応募締め切り:2019年7月19日（金）（必着）詳細につきましてはリンク先のpdfをご覧ください。 https://waseda.box.com/shared/static/4oft3dtumtlz958gcl27hg5x21qlr6ih.pdf 「専門分野：応用数理」は幅広い意味でとらえていただいて構いません。関係各位にご周知いただくと共に、適任者をご存知の場合は応募をお勧めくださいますようお願い申し上げます -- Toshimichi USUBA School of Fundamental Science and Engineering, Waseda University

1 0

国際会議AQIS2019のご案内
by NISHIMURA Harumichi 13 May '19

13 May '19

logic-mlの皆様量子情報科学に関する国際会議AQIS2019のCFPを代理投稿させていただきます．締め切りまで２週間弱ですが関連する成果をお持ちの方の積極的なご投稿を宜しくお願い致します．名古屋大学大学院情報学研究科西村治道 ------------------------------------------------------------------------------------ CALL FOR PAPERS 19th Asian Conference on Quantum Information Science (AQIS'19)http://aqis-conf.org/2019/ 19-23 August 2019, Seoul, Korea Apologies if you receive this multiple times. Please forward to interested colleagues. We would like to draw your attention, and that of the quantum information community, to the 19th edition of the Asian Conference on Quantum Information Science (AQIS'19). AQIS is the leading conference in the subject in Asia and one of the longest-running worldwide, its highly successful predecessors having been EQIS'01-05 and AQIS'06-18. The topics covered include (but are not limited to) quantum computing, quantum information processing, quantum communication and cryptography, and foundations of quantum mechanics. Details about the conference are to be found on the website http://aqis-conf.org/2019/ Please check repeatedly as the information there will be updated regularly. Like its previous editions, AQIS'19 will consist of tutorials, invited talk, as well as oral and poster presentations, selected by a high-profile international program committee. Invited speakers are: * Giulio Chiribella (Hong Kong University) * Peng Xue (Beijing Computational Science Research Center) * XiaoLiang Qi (Stanford University) * Michelle Simmons (University of New South Wales / CQC2T) * Kihwan Kim (Tsinghua University) * Joe Fitzsimons (Singapore University of Technology and Design) * ChaoYang Lu (University of Science and Technology of China) * Liang Jiang (Yale University) Tutorials are: * Nathan Wiebe (Microsoft Research) ― Quantum Machine Learning * Debbie Leung (University of Waterloo) ― Embezzlement and Applications The submission deadline is 25 May 2019 (Sat), 23:59 Anywhere on Earth (AoE). All submissions should follow the guidelines specified on the web site:http://aqis-conf.org/2019/submission/ We are looking forward to seeing you in Seoul! Committee Chairs Steering Committee: Jaewan KIM (KIAS, Chair) Program Committee: Howard Wiseman (Griffith U, Chair) Runyao Duan (U Tech Sydney / Baidu, Co-Chair) Eleanor Rieffel (NASA, Co-Chair) Organizing Committee: Jaewan KIM (KIAS, Chair)

1 0

フォーマルアプローチ特集論文募集のご案内
by mano.ken＠lab.ntt.co.jp 09 May '19

09 May '19

logic-ml の皆様，電子情報通信学会論文誌英文 ED 分冊“フォーマルアプローチ特集”の，論文募集のご案内をさせていただきます．真野（NTT） =========================================================================== フォーマルアプローチ特集論文募集電子情報通信学会論文誌英文 ED 分冊フォーマルアプローチ特集編集委員会フォーマルアプローチ（形式手法・形式技法・形式理論）は，情報システムや組込みシステムの設計開発における信頼性向上の鍵となる重要な基盤です．これまで，設計対象のモデル化，要求分析と仕様記述，コード自動生成，テストと検証，保守と再利用などに関する技術と理論的知見を生み出してきました．近年の情報技術の進展に伴う対象領域の拡大に伴い，フォーマルアプローチは従来にも増して多様な分野で用いられるようになり，ますます発展しています．本小特集（2020 年 8 月号掲載）は，情報システムや組込みシステムの設計・運用におけるフォーマルアプローチについて，基礎理論から応用まで，幅広い研究を対象にしています．個別の対象領域に特化したケーススタディから，分野横断的な手法や理論まで，様々な方面から，フォーマルアプローチ研究に携わる若手研究者を奨励するとともに，この分野の研究が更に発展することを目指しております．奮って御投稿下さいますよう御案内申し上げます． 1. 対象分野主な対象は以下のとおりですが，これに限らず，「情報システムや組込みシステム及びそれをとりまく環境を定式化した上で，そのシステムの振舞いの解析や性質の導出を厳密に行い，設計・運用に関わる種々の問題の解決を図る」ことを目指した論文を広く募集します． - 基礎理論：システムの構造や振舞いの形式記述・検証に関する基礎理論 - 形式技法：ソフトウェア，ハードウェア，ネットワークなどのシステムに対する体系だった記述・検証技法 - 形式ツール：モデル検査器や定理証明器など，形式手法に基づくツール - 応用：情報システムや組込システム，回路系，情報セキュリティ，車載システム，人工知能・機械学習システム，マルチエージェントなどへの形式手法の適用事例 - 教育：教育事例 2. 論文の執筆と取扱い論文 (一般論文)，レター，及びサーベイ論文を募集します．投稿規程等は電子情報通信学会の英文誌の規程と同じです．以下の規程を御参照下さい． "The Information for Authors" (IEICE Transactions on Information and Systems) http://www.ieice.org/eng/shiori/mokuji_iss.html 3. 主なスケジュール論文投稿締切 2019 年 9 月 24 日 (火) 23:59 JST (厳守) 第一回判定通知予定 2019 年 11 月 22 日 (金) 初回修正締切 2020 年 1 月 17 日 (金) 最終判定通知予定 2020 年 3 月 6 日 (金) 発行予定 2020 年 8 月号 4. 投稿方法投稿に際しては，著者のうち少なくとも1名は本会会員でなければなりません．ただし招待論文に関してはこの限りではありません．必要な投稿資格を満たしていない著者からの投稿論文については，投稿を受け付けないこととなりますので御注意下さい．入会の案内はこちらを御覧下さい． http://www.ieice.org/jpn/join/index.html 本特集では，電子投稿のみを受付けます．論文を下記の web page から投稿して下さい．初期投稿時に，編集可能な論文本体 (TeX/Word)，図，著者の写真， biography も投稿する必要があります． https://review.ieice.org/regist/regist_baseinfo_e.aspx 投稿の際には以下の項目を選択してください． "Journal/Section" -> "[Special FO] Formal Approaches" 同時に WEB 上で著作権譲渡手続きができます．投稿手続きについて御不明な点がございましたら，問合先まで御連絡下さい． 5. 掲載料招待論文を含むすべての著者は，論文が採録となった場合，2020 年 4 月頃に掲載料をお支払い頂くことになります．2020 年 5 月 15 日までに支払いが完了しない場合には，採録取り消しとなります． 6. オープンアクセスオプション電子情報通信学会論文誌は，2019 年 1 月号掲載論文から，著者が通常の掲載料に加え追加料金を支払うことで，論文をオープンアクセスにできる選択肢を試行的に提供致します．オープンアクセスオプションに関する詳細は，"Information for Authors" (http://www.ieice.org/eng/shiori/mokuji_iss.html)を御参照下さい（オープンアクセスオプションは試行段階であり，予告なく変更されることがあります）． 7. 特集編集委員会委員長：真野健(NTT) 幹事：石川冬樹(情報研)，中川博之(阪大) 委員：青木利晃(北陸先端大)，青木善貴（日本ユニシス），來間啓伸(日立)，小林孝一(北大)，立石孝彰(日本IBM)，土屋達弘(阪大)，山口真悟(山口大) 8. 問合せ先本特集のホームページ: (和文) http://www.brl.ntt.co.jp/people/mano/fa2019/jp/ (英文) http://www.brl.ntt.co.jp/people/mano/fa2019/ 真野健 NTT コミュニケーション科学基礎研究所〒243-0198 神奈川県厚木市森の里若宮 3-1 ken.mano.eh(a)hco.ntt.co.jp =========================================================================== CALL FOR PAPERS Special Section on Formal Approaches The IEICE Transactions on Information and Systems announces a forthcoming special section on Formal Approaches to be published in August 2020. Formal methods and techniques play a key role in designing and developing highly reliable information systems and embedded systems. The last decades have seen various new techniques and profound theoretical results using formal methods in surprisingly many fields such as modeling, requirements analysis, specification, automatic generation of codes, testing, verification, and maintenance. They are rapidly extending their application domains as a result of the recent growth of information and communication technologies. The Special Section on Formal Approaches aims at stimulating research on formal approaches to information systems and embedded systems, ranging from fundamental theory to practical applications. Our emphasis is put on the cross-fertilization of related research fields and encouragement of young researchers. Topics: The major topics are listed below, but we solicit submissions in all areas of formal approaches, i.e., first to formalize information systems, embedded systems, and their environment, next to analyze their behavior and to derive their properties rigorously, and then to solve various problems in designing and managing the systems. - Theoretical foundations: all aspects of theory related to formal description and verification for structure and behavior of systems. - Formal techniques: techniques for mainly describing and analyzing systems, such as software, hardware and networks. - Formal tools: tools based on formal methods such as model checkers, theorem provers, and static and dynamic analyzers. - Applications: practical experiences of applying formal methods to information systems, embedded systems, circuits, security, AI systems, machine learning systems, multi-agent systems, automotive systems, etc. - Education: education on formal methods. Submission Instructions: The deadline for submission is Sep 24, 2019, 23:59 JST(GMT+9). Manuscripts should be carefully prepared according to the guideline in the "Information for Authors" (available at http://www.ieice.org/eng/shiori/mokuji_iss.html). The preferred length of the manuscript is 8 pages. Only electronic submission through the web page is accepted. Submit a complete paper and transfer copyright of the paper using the IEICE Web site https://review.ieice.org/regist/regist_baseinfo_e.aspx Authors should choose the [Special FO] Formal Approaches" as a "Journal/Section" on the online screen. Editorial Committee: Guest Editor-in-Chief: Ken Mano (NTT Communication Science Laboratories) Guest Editors: Fuyuki Ishikawa (National Institute of Informatics) Hiroyuki Nakagawa (Osaka University) Guest Associate Editors: Toshiaki Aoki (JAIST) Yoshitaka Aoki (Nihon Unisys) Koichi Kobayashi (Hokkaido University) Hironobu Kuruma (Hitachi, Ltd.) Takaaki Tateishi (IBM Japan) Tatsuhiro Tsuchiya (Osaka University) Shingo Yamaguchi (Yamaguchi University) Further information may be obtained from the web page at: http://www.brl.ntt.co.jp/people/mano/fa2019/ All inquiries should be sent to the guest editor in chief: Ken Mano NTT Communication Science Laboratories 3-1 Morinosato Wakamiya Atsugi Kanagawa 243-0198 Japan E-mail: ken.mano.eh(a)hco.ntt.co.jp Important Dates: Submission Deadline: Sep 24, 2019 23:59 JST (GMT+9) [strict] First Notification: Nov 22, 2019 Revised Version Deadline: Jan 17, 2020 Final Notification: Mar 6, 2020 Important Notice. (1) At least one of the authors must be an IEICE member when the manuscript is submitted for review. For the application of IEICE membership, visit http://www.ieice.org/eng/member/OM-appli.html (2) When a paper has been accepted for publication, the authors are required to pay the page charges covering part of the cost of publication. Please carefully read the submission guideline at http://www.ieice.org/eng/shiori/mokuji_iss.html (3) Upon accepted for publication, all authors, including authors of invited papers, should pay the page charges covering partial cost of publication around April, 2020. If payment is not completed by May 15, 2020, your manuscript will be handled as rejection. (4) [Open Access Option] Papers published in January 2019 issue and following issues will be offered a trial basis option which can make the papers open access if authors pay an additional charge on top of the usual page charge. For details on open access options, please carefully refer to “The Information for Authors” (http://www.ieice.org/eng/shiori/mokuji_iss.html). Note that open access option is still in the pre-trial stage, and it may be changed without notice. ===========================================================================

1 0

【Final CFP】Haskell Symposium 2019@ベルリン【投稿締切 5/10】
by Kazutaka Matsuda 07 May '19

07 May '19

（もし複数受けとりましたらご容赦ください）皆様，東北大学の松田です． ICFP併設の国際会議であるHaskell Symposium 2019のfinal CFPをお送りいたします．〆切（5/10）まで残りわずかとなりましたが，可能でしたらどうぞ投稿をご検討いだけますと幸いです．投稿の際は今年は軽量double blind reviewingが採用されていることにご注意ください． ================================================================================ 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 (Sun) 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 McDonell 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)richarde.dev ================================================================================

1 0

【参加募集】Bx 2019（6/4，フィラデルフィア）【Early Registeration〆5/4】
by Kazutaka Matsuda 25 Apr '19

25 Apr '19

皆様，東北大学の松田です．来たる6/4にアメリカのフィラデルフィアで開催される双方向変換に関する国際ワークショップBx 2019の参加募集をお送りいたします． Bx 2019 Call for Participation ============================== Highlights ---------- * Invited speaker: Zack Ives on Views, Update Propagation, and Provenance * Registration information (early deadline: May 4) * List of accepted papers and talks General Information ------------------- * 8th International Workshop on Bidirectional Transformations * http://bx-community.wikidot.com/bx2019:home * June 4, 2019, Saint Joseph’s University, Philadelphia, PA, USA * as part of the Philadelphia Logic Week (PLW) 2019: https://sites.sju.edu/plw/ Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2019 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. Bx 2019 will be a part of Philadelphia Logic Week (PLW) 2019, which also includes conference and workshops on logic, provenance, and databases, topics that we hope will complement Bx and help build engagement with these communities. Registration ------------ * https://sites.sju.edu/plw/plw-2019-registration/ * Early registration deadline: May 4 * Passes available for attending multiple co-located events, including LPNMR (Logic Programming and Nonmonotonic Reasoning) and workshops, Datalog 2.0 (Resurgence of Datalog in Academia and Industry), and TaPP (Theory and Practice of Provenance) * Opportunities for students to receive financial support from the LPNMR Doctoral Consortium Invited Talk ------------ * Views, Update Propagation, and Provenance Zachary Ives (University of Pennsylvania) http://www.cis.upenn.edu/~zives/ Accepted Papers and Talks ------------------------- The abstracts can be found at http://bx-community.wikidot.com/bx2019:accepted . * ASN.1 Encoding Schemes Done Right Using CMPCT Mark Tullsen (Galois, Inc.) * Lenses and Learners Brendan Fong (Massachusetts Institute of Technology) and Michael Johnson (Macquarie University) * Multicategories of Multiary Lenses Michael Johnson (Macquarie University) and Robert Rosebrugh (Mount Allison University) * Incremental Bidirectional Model Transformation with eMoflon::IBeX (Tool Paper) Nils Weidmann (Paderborn University), Anthony Anjorin (Paderborn University), Lars Fritsche (TU Darmstadt), Gergely Varró, Andy Schürr (TU Darmstadt), and Erhan Leblebici (TU Darmstadt) * A Bidirectional Krivine Machine (Short Paper) Mikael Mayer (University of Chicago) and Ravi Chugh (University of Chicago) * Consistent Runtime Adaptation of User Interfaces (Short Paper) Anthony Anjorin (Paderborn University), Enes Yigitbas (Paderborn University), and Hermann Kaindl (Vienna University of Technology) * Symmetric d-Lenses and Symmetric c-Lenses are not Coextensive (Short Paper) Michael Johnson (Macquarie University) and François Renaud (Université Catholique de Louvain) * A Toolbox of Lenses: Dimensions of the Lens Design Space (Talk) Zinovy Diskin (McMaster University) * Expanding the Power of Lens Synthesis (Talk) Anders Miltner (Princeton University), Solomon Maina (University of Pennsylvania), Kathleen Fisher (Tufts University), Benjamin Pierce (University of Pennsylvania), David Walker (Princeton University), and Steve Zdancewic (University of Pennsylvania) * Optics and Type Equivalences (Talk) Jacques Carette (McMaster University) and Amr Sabry (Indiana University Bloomington) * Reified Correspondences: A New Component of the Multiary Delta Lenses Framework (Talk) Zinovy Diskin (McMaster University)

1 0

ERATO 蓮尾メタ数理システムデザインプロジェクトシンポジウム--高信頼自動運転システムのための先進的研究-- のご案内
by Kohei SUENAGA 25 Apr '19

25 Apr '19

（複数受け取られましたらご容赦ください．）皆様，京大の末永です．本 ML をお借りして，5/21に行われるシンポジウムについてご案内させていただきます．NII の蓮尾先生が総括の ERATO MMSD プロジェクトのシンポジウムです．特に自動運転を対象として活発で幅広い研究活動を行っているプロジェクトで，その中間成果報告となります．どうぞご参加をご検討ください．よろしくお願いいたします． =========================================================== ERATO 蓮尾メタ数理システムデザインプロジェクトシンポジウム高信頼自動運転システムのための先進的研究数理的理論から，AI 協働，ソフトウェアプラットフォームへ https://group-mmm.org/eratommsd/ja/vvav-symposium-201905/ 《開催のご案内》 =========================================================== 蓮尾一郎 ERATO MMSD プロジェクト研究総括国立情報学研究所システム設計数理国際研究センターセンター長　ERATO 蓮尾メタ数理システムデザインプロジェクト（ERATO MMSD）は，国立研究開発法人科学技術振興機構（JST）の戦略的創造研究推進事業 ERATO 傘下の研究プロジェクトの一つです．ERATO MMSD では，Society 5.0 の大きな柱となる物理情報システムの品質保証手法の学術的研究を推進しています．特に，物理情報システムの来るべき典型例の一つとして注目を集める自動運転システムを戦略的応用対象に設定し，その信頼性保証を支えるモデリング手法・形式検証手法・テスト手法，さらにこれらを包括する実用的な V&V 技術の研究開発に取り組んでいます．　今回のシンポジウムでは，産業界で研究開発に携わるみなさまを対象として，高信頼自動運転システムに向けた国内外の研究動向，ERATO MMSD で開発している V&V 技術，及び今後の本プロジェクトのビジョンと取り組みをご紹介いたします．　自動運転システムの信頼性という大きな挑戦に取り組む上では，ソフトウェア・制御・AI といった多様な学術分野の協働が欠かせません．ERATO MMSD では，このような学術分野融合の確固とした基礎となる数理的（メタ）理論を重視し，実用的 V&V 技術とともに研究を推進しています．よって今回のシンポジウムでは， o 「今日」すぐに使える技術・ツール， o 「明日」可能になる技術，さらに， o これらの技術の進展が描き出す「明後日」の未来像，この3つを見渡すような，学術プロジェクトならではのビジョンを御覧頂けると確信しております．　また今回のシンポジウムでは，カナダ Waterloo 大学で自動運転車開発プロジェクトAutonomooseを率いる Krzysztof Czarnecki 教授も講演を行います．ソフトウェア工学の立場から，特に信頼性・安全性に重点をおいて自動運転車を開発する Czarnecki 教授は，ERATO MMSD のメンバーでもあります．　本シンポジウムをきっかけとして，今後皆様と情報を共有させていただきながら，当該分野の振興に貢献を行っていく所存です．多くの皆様のご参加をお待ちしております． ----------------------- 開催概要 ------------------------- イベント名 ERATO 蓮尾メタ数理システムデザインプロジェクトシンポジウム：高信頼自動運転システムのための先進的研究数理的理論から，AI 協働，ソフトウェアプラットフォームへ日時（予定） 2019年5月21日（火）13:00〜19:00 （受付開始 12:30）会場（予定） TKP築地新富町カンファレンスセンター（東京都中央区）主催国立研究開発法人科学技術振興機構（JST）ERATO 蓮尾メタ数理システムデザインプロジェクト（ERATO MMSD）国立情報学研究所（NII）システム設計数理国際研究センター参加対象自動車産業および関連産業において，研究・開発・調査等に携わる方々参加方法シンポジウムウェブページの参加登録フォームから事前登録をお願い致します https://group-mmm.org/eratommsd/ja/vvav-symposium-201905/ 参加登録受付は 5/10まで，参加料は無料．受付用にお名刺を二枚ご持参頂けますようお願い申し上げます．定員に達した場合，ご参加いただけない旨のご連絡を差し上げる場合があります．ご了承ください．使用言語 Krzysztof Czarnecki 教授の発表は英語，その他の発表は日本語お問い合わせ先「ERATO MMSD シンポジウム」運営事務局 E-mail: hasuolab-secr(a)nii.ac.jp Tel: 03-6273-4886 受付時間 10:00〜17:30 （土・日・祝日を除く） ---------------------- プログラム（仮）----------------------- 12:30 受付開始 13:00〜13:25 ご来賓挨拶 13:25〜13:55 （仮題）「ERATO MMSDプロジェクト紹介：物理情報システム品質保証のための包括的学術研究」蓮尾一郎国立情報学研究所，ERATO MMSDプロジェクト研究総括 13:55〜14:00 休憩 14:00〜15:00 （仮題）「自動運転システム開発プロジェクト Autonomoose：高信頼自動運転システムへのソフトウェア工学的取り組み」 Krzysztof Czarnecki Waterloo大学，ERATO MMSD グループ２リーダー Autonomoose プロジェクトリーダー 15:00〜15:15 休憩 15:15〜16:00 （仮題）「高信頼自動運転システム実現にむけて：ソフトウェア工学・機械学習の視点からの技術俯瞰」石川冬樹国立情報学研究所，ERATO MMSD グループ３リーダー 16:00〜16:45 （仮題）「高信頼自動運転システム実現にむけて：ソフトウェア科学・形式手法・数理的基盤の視点からの技術俯瞰」蓮尾一郎国立情報学研究所，ERATO MMSD 研究総括 16:45〜17:00 休憩 17:00〜18:00 研究員・大学院生による技術ショウケース 18:00〜19:00 懇談会 ---------------------- その他 ----------------------- 本件連絡先「ERATO MMSD シンポジウム」運営事務局 E-mail: hasuolab-secr(a)nii.ac.jp Tel: 03-6273-4886 受付時間 10:00〜17:30 （土・日・祝日を除く） -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 0

論理学について議論するSlackグループ
by Yoriyuki Yamagata 18 Apr '19

18 Apr '19

皆様、産総研の山形です。倫理学（数学・計算機科学・哲学・言語学その他、論理に関わる話題全般）を議論するSlackグループを作成しました。下のリンクからどなたでも参加できます。皆様のご参加をお待ちしております。よろしくお願いいたします。 https://join.slack.com/t/logic-ja/shared_invite/enQtNjExNTIyNjEzMDEyLTMyNTU… -- Yoriyuki Yamagata

1 0

Talk by Gordon Plotkin on 1st April 2019 at Kyoto
by Masahito Hasegawa 26 Mar '19

26 Mar '19

皆様、来週の月曜（４月１日）、京都大学数理解析研究所で、プログラム意味論などの研究で著名なGordon Plotkinさん（Edinburgh大学）の講演があります。詳細は下記のとおりです。関心をお持ちの方のご来聴を歓迎します。どうぞよろしくお願いいたします。京都大学数理解析研究所長谷川真人 ========== Time: 14:00-15:00, 1st April 2019 (Mon.) Place: Room 110, Research Institute for Mathematical Sciences, Kyoto University 京都大学数理解析研究所（本館）１階１１０号室 http://www.kurims.kyoto-u.ac.jp/en/access-01.html Speaker: Gordon Plotkin (LFCS, University of Edinburgh) Title: One-and-a-half simple differentiable programming languages Abstract: Languages for learning pose interesting foundational challenges. We look at one case: the foundations of differentiable programming languages with a first-class differentiation operator. Graphical and linguistic facilities for differentiation have proved their worth over recent years for deep learning (deep learning makes use of gradient descent optimisation methods to choose weights in neural nets). Automatic differentiation, also known as algorithmic differentiation, goes much further back, at least to the early 1960s, and provides efficient techniques for differentiation, e.g., via source code transformation. It seems fair to say, however, that differentiable programming languages have begun to appear only recently. It seems further fair to say that, while there has certainly been some foundational study of differentiable programming languages, there is ample opportunity to do more. We investigate the semantics of a simple first-order functional programming language with reals, product types, and a first-class reverse-mode differentiation operator (reverse-mode differentiation generalises gradients). The semantics employs a standard concept of real analysis: smooth multivariate functions with open domain. It turns out that such partial functions fit well with programming constructs such as conditionals and recursion; indeed they form a complete partial order, and so standard fixed-point methods can be applied. We give an operational semantics which, roughly, can be seen as a formalisation of a version of the trace (or tape) method used to implement automatic differentiation. The semantics consists of three parts: ordinary evaluation, symbolic evaluation to eliminate control constructs, and a source-code transformation to symbolically differentiate terms with no control constructs, >From a programming language point of view, however, many types are lacking, particularly sum types and recursive types, such as lists. We conclude with a brief presentation of notions of shapely datatypes and smooth functions. These can be used to give the semantics of such types and the usual functions between them while retaining first-class differentiation. This work constitutes only an initial exploration, and we look forward to a rich field connecting two worlds: programming languages and their foundations, and real analysis and allied areas of mathematics. ==========

1 0

第40回量子情報技術研究会(QIT40)のご案内
by Yasuhito Kawano 22 Mar '19

22 Mar '19

皆様 NTT の河野と申します。本メーリングリストをお借りして、第40回量子情報技術研究会(QIT40)の会告案内を送らせていただきます。よろしくお願いいたします。 ----------------------------------------------------------------- 第40回量子情報技術研究会（QIT40）研究会の内容：　　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．　情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究と　そこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を　目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に　携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的と　しています．　　第40回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，　自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，　広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も　歓迎致しますので，奮ってお申し込みください．　　なお，第38回研究会から学生発表賞を創設いたしました．応募方法等については，　下記のQITウェブサイトをご確認下さい．日時: 2019年5月20日(月)〜21日(火) 会場: 九州大学筑紫キャンパス筑紫ホール (〒816-8580　福岡県春日市春日公園6-1) 発表募集分野 (申し込み状況によっては査読の可能性あり)：　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，　計算機科学的研究，数学的研究，および，その他関連分野．定員: 200名参加費：　一般4,000円，学生3,000円懇親会費：一般4,000円，学生2,000円 ※当日現地支払いの場合，参加費・懇親会費は上記に+1,000円が増額されます．　（参加事前登録または銀行振込が期限に間に合わない場合も，これに該当します．） ※学生限定・当日受付・予稿集なし・懇親会なしの参加費1,000円という選択肢もあります．　こちらは事前手続き不要です．研究会参加申込要領：　参加申込は下記 Web にて受付けます：　https://www.ieice.org/es/qit/ 　講演 (口頭，ポスター) の申込，予稿集原稿PDFの提出は，電子情報通信学会の　Webシステムを使用する予定．各種締切：【口頭講演申込締切】　　2019年4月19日（金）【ポスター講演申込締切】2019年4月19日（金）【予稿原稿提出締切】　　2019年4月19日（金）【参加申込締切】　　　　2019年4月24日（水）【問合せ先】　原田裕一 (九州大学) 　落合啓之（九州大学）　廣川真男（広島大学）　和久井健太郎（情報通信研究機構）　Email: qit40(a)gic.kyushu-u.ac.jp 主催: 量子情報技術特別研究専門委員会 (委員長: 平野琢也(学習院大学)) 共催: 応用物理学会量子エレクトロニクス研究会

1 0

2nd CFP: 3rd International Workshop on User-Oriented Logic Paradigms
by Christos Rodosthenous 19 Mar '19

19 Mar '19

*** IULP 2019 *** 3rd International Workshop on User-Oriented Logic Paradigms June 3 or 4, 2019 https://iulp2019.uni-leipzig.de Collocated with the 15th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2019) Philadelphia, USA June 4 - 6, 2019 -------------------------------------------- Since the emergence of logic reasoning paradigms, such as logic programming, argumentation, and other non-monotonic reasoning formalisms, a lot of theoretical work has been done, for example with respect to different semantics and their properties. More recently, implementations and IDEs emerged which have been used for various problem-solving applications. However, user-friendliness is still an issue for both experts and non-experts working with logic paradigms; for example experts benefit from features like debugging and heuristic tuning, non-experts from educational material, explanations, and intuitive visualisations - all of which are ongoing topics of research. The 3rd International Workshop of User-Oriented Logic Paradigms (IULP) focuses on discussing different aspects involved in making logic paradigms more user-friendly/oriented, where the "user" could be either an expert of the paradigm, or a non-expert who simply uses tools developed for the paradigm in some application. IULP aims to bring together researchers working on different logic paradigms, such as answer set programming, constraint logic programming, probabilistic logic programming, abductive logic programming, inductive logic programming, argumentation, principles of teaching etc., as user- friendliness is an important topic in all of these areas. IULP aims to provide an international forum for researchers in the AI, KR, and applied sciences community to discuss and present advances in theories, formalisms, and applications to deliver the mature and well-defined methods of logic paradigms to a wider audience. We solicit the submission of papers broadly centred on issues and research related to user-friendliness in logic paradigms and related fields. We welcome papers of either theoretical or practical nature, including work in progress. IMPORTANT DATES -------------------------------------------- * Submission deadline: Sun, March 31st 2019 * Notification to authors: Mon, April 29th 2019 * Camera-ready version due: Mon, May 20th 2019 * Workshop date: June 3 or 4, 2019 TOPICS -------------------------------------------- Topics of interest include (but are not limited to): * IDEs * debugging * explanations * visualisation * best practice * modularity * usage of natural language * heuristic tuning * LP education * language extensions * transparency * algorithmic bias * credibility * accountable systems SUBMISSIONS -------------------------------------------- Papers must be formatted in Springer LNCS style (http://www.springer.com/lncs) and should not exceed 13 pages (excluding references and appendices). All submissions have to be written in English and submitted electronically as a PDF through easychair (https://easychair.org/conferences/?conf=iulp2019). A short system demonstration version which should not exceed 6 pages (excluding references and appendices) can be submitted electronically too. We encourage the submission of original research on all topics as well as relevant results that have been submitted or accepted elsewhere provided that the initial publication is mentioned in a footnote on the first page. Note that authorship is not anonymous and that at least one author of each accepted paper is required to attend the workshop to present the contribution. PROCEEDINGS -------------------------------------------- There are no formal proceedings for IULP. The accepted papers will be published as a technical report and will be made available in the Computing Research Repository (CoRR). The copyright of the papers lies with the authors and, as far as IULP is concerned, authors are free to submit their work to other conferences and workshops. COMMITTEE -------------------------------------------- Chairs: * Stefan Ellmauthaler (Leipzig University) * Christos Rodosthenous (Open University of Cyprus) Program Committee * Bart Bogaerts (Vrije Universiteit Brussel) * Gerhard Brewka (Leipzig University) * Marina De Vos (University of Bath) * Marc Denecker (Katholieke Universiteit Leuven) * Martin Gebser (Potsdam University) * Antonis C. Kakas (University of Cyprus) * Antonio Lieto (University of Turin) * Loizos Michael (Open University of Cyprus) * Yisong Wang (Guizhou University) * Stefan Woltran (Vienna University of Technology) CONTACT -------------------------------------------- iulp2019 [at] informatik [dot] uni-leipzig [dot] de HOMEPAGE -------------------------------------------- https://iulp2019.uni-leipzig.de

1 0

Nagoya logic seminar
by 吉信康夫 14 Mar '19

14 Mar '19

皆様：名古屋大学の吉信です。以下の要領で名古屋ロジックセミナーを開催します。日時：3月19日(火) 15:30〜場所：名古屋大学大学院情報学研究科棟314室講演者：Sabrina Ouazzani(エコール・ポリテクニーク) タイトル：How to compute with an infinite time Turing machine? 概要：In this talk, we present infinite time Turing machines (ITTM), from the original definition of the model to some new infinite time algorithms. We will present algorithmic techniques that allow to highlight some properties of the ITTM-computable ordinals. In particular, we will study gaps in ordinal computation times, that is to say, ordinal times at which no infinite time program halts. We will explain some properties of the gaps in the ordinal computation times. 多数の方のご参加をお待ちしております。

1 0

[CFP] The Coq Workhsop 2019
by Jacques Garrigue 13 Mar '19

13 Mar '19

皆様、名古屋大学のGarrigueです。本メーリングリストをお借りして、 2019年9月にポートランド(オレゴン州)で開催される Coq Workshop 2019の CFPを送らせていただきます。ぜひ投稿をご検討ください。投稿〆切：2019-06-04 (2ページの概要) よろしくお願いいたします。 -- ********************************************************************* The Coq Workshop 2019: Call for Talk Proposals Colocated with the 10th International Conference on Interactive Theorem Proving (ITP 2019), Portland, OR, USA ********************************************************************** We are pleased to invite you to submit talk proposals for the Coq workshop 2019, which will be held on September 8 2019, in Portland, OR, USA. The Coq workshop is part of ITP 2019 (https://itp19.cecs.pdx.edu/). The Coq workshop 2019 is the 10th Coq Workshop. The Coq Workshop series (https://coq.inria.fr/coq-workshop/) brings together Coq (https://coq.inria.fr/) users, developers, and contributors. While conferences usually provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Important dates: - June 4 2019: Deadline for abstract submission - July 2 2019: Notification to authors - September 8 2019: Workshop Submission Instructions: Authors should submit short proposals through EasyChair (https://easychair.org/conferences/?conf=coq2019) in the form of a PDF extended abstract of less than 2 pages, in full-page single-column style. Relevant subject matter includes but is not limited to: - Theory and implementation of the Calculus of Inductive Constructions - Language or tactic features - Plugins and libraries for Coq - Techniques for formalization programming languages and mathematics - Applications and experience in education and industry - Tools and platforms built on Coq (including interfaces) - Formalization tricks and pearls Program Committee: - Reynald Affeldt (AIST) - Christian Doczkal (CNRS - LIP, ENS Lyon) - Jacques Garrigue (Nagoya University) - Chantal Keller (LRI, Univ. Paris-Sud) - Dominique Larchey-Wendling (CNRS, Loria) - Gregory Malecha (BedRock Systems Inc.) - Pierre-Marie Pédrot (INRIA) - Ilya Sergey (Yale-NUS College and NUS School of Computing) - John Wiegley (DFINITY) Organization contact (co-chairs): reynald.affeldt AT aist.go.jp, garrigue AT math.nagoya-u.ac.jp For more information: https://staff.aist.go.jp/reynald.affeldt/coq2019/

1 0

UNIF 2019: 2nd CFP
by Takahito Aoto 12 Mar '19

12 Mar '19

単一化に関するワークショップのご案内です．タイトル&アブストラクトの〆切が4/14，本文の〆切が4/21となっています． FSCDのサテライトワークショップとして6/24に開催です．ご投稿を検討頂ければ幸いです． --- 青戸等人(新潟大学) ------------------------------------------------------------------ Second Call for Papers: UNIF 2019 Website: http://www.mat.unb.br/unif2019 The 33rd International Workshop on Unification is the 33rd event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of making two terms equal, finding solutions for equations, or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc. Traditionally, the scope of the UNIF workshops has covered the topic of unification in a broad sense. Topics of interest to this forum include, but are not limited to: Unification algorithms, calculi, and implementations Equational unification and unification modulo theories Admissibility of Inference Rules Unification in modal, temporal and description logics Narrowing Formalisation of unification Matching Problems Applications Unification in Special Theories Higher-Order Unification Combination problems Constraint Solving Disunification Complexity Issues Type Checking and reconstruction The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the state of the art in unification theory. The workshop is proposed to be hosted by the 4th International Conference on Formal Structures for Computation and Deduction (FSCD, Dortmund, 24-29 June 2019). ** Invited Speakers Jörg Siekmann (DFKI and University of Saarland) Narciso Marti-Oliet (Universidad Complutense de Madrid) ** Submission Instructions Following the tradition of UNIF, we call for submissions of abstracts (5 pages) in EasyChair style, to be submitted electronically as PDF through the EasyChair submission site: https://easychair.org/conferences/?conf=unif2019 Abstracts will be evaluated by the Programme Committee (if necessary with support from external reviewers) regarding their significance for the workshop. We will allow work presented/submitted in/to another conference. Accepted abstracts will be presented at the workshop and included in the informal proceedings of the workshop, available in printed form at the workshop and in electronic form from the UNIF homepage: http://www.pps.jussieu.fr/~treinen/unif/ Based on the number and quality of submissions we will decide whether to organise a special journal issue. ** Important Dates Submission of titles and abstracts: April 14, 2019 Submission of full paper: April 21, 2019 Author notification: May 31, 2019 Camera-ready papers: June 4, 2019 UNIF 2019: June 24, 2019 (intended) ** Program Committee - Serdar Erbatur (LMU Munich) co-chair - Daniele Nantes Sobrinho (Universidade de Brasília) - co-chair - Takahito Aoto (Niigata University) - Alexander Baumgartner (University of Chile) - Mauricio Ayala Rincón (Universidade de Brasília) - Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) - Kimberly Cornell (The College of Saint Rose) - Santiago Escobar (Universitat Politècnica de València) - Maribel Fernández (King's College London) - Temur Kutsia (RISC- Johannes Kepler University Linz) - Jordy Levy (IIIA - CSIC) - Hai Lin (Shenyang Normal University) - Christopher Lynch (Clarkson University) - Andrew M. Marshall (University of Mary Washington) - Catherine Meadows (US Naval Research Laboratory) - Paliath Narendran (University at Albany--SUNY) - Christophe Ringeissen (INRIA) - David Sabel (Ludwig Maximilian University of Munich) - René Thiemann ( University of Innsbruck) - Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main) - Ralf Treinen (IRIF- Université Paris-Diderot) - Daniel Lima Ventura (Universidade Federal de Goiás) ** Organizers Daniele Nantes Sobrinho (Universidade de Brasília) (dnantes(at)mat.unb.br) Serdar Erbatur (LMU Munich) (serdar.erbatur(at)ifi.lmu.de) ------------------------------------------------------------------

1 0

ENTROPY 2019: Second Call for Papers - Co-located with EuroS&P'19
by David Nowak 11 Mar '19

11 Mar '19

NEW: two more invited speakers ************************************************************************** Second Call for papers — ENTROPY 2019 ENabling TRust through Os Proofs … and beYond Second International workshop on the use of theorem provers for modelling and verification at the hardware-software interface https://entropy2019.sciencesconf.org Co-located with EuroS&P'19, KTH, Stockholm, June 2019 ************************************************************************** INVITED SPEAKERS Dominique Bolignano, Prove & Run Gernot Heiser, University of New South Wales Frank Piessens, KU Leuven Peter Sewell, University of Cambridge IMPORTANT DATES Paper submission: March 11 2019 Author notification: April 10, 2019 Camera-ready versions: April 22, 2019 (strict) Workshop: 16 June 2019 AIM AND SCOPE Low level software such as kernels and drivers, along with the hardware this software runs on, is critical for application security. In contrast with user applications, OS kernel software runs in privileged CPU mode and is thus highly critical. Large projects such as seL4, VeriSoft, CertiKoS and Prosper have invested considerable resources in developing formally verified systems such as hypervisors and microkernels, supplying proofs that they satisfy critical properties. Such proofs are delicate in terms of the scale and complexity of real systems, the models used in performing the proof search, and the relations between the two, which recent vulnerabilities such as Spectre and Meltdown have shown to be a highly non-trivial issue. The purpose of this workshop is to share, compare and disseminate best practices, tools and methodologies to verify OS kernels, also setting the stage for future steps in the direction of fully verified systems, dealing with issues related to modelling, model validation, and large proof maintenance through system evolution. On one hand, we need to make low-level proofs more scalable, modular and cost-effective. On the other hand, once certified systems are available, preservation and maintenance of their proofs of validity become key questions. The goal of the ENTROPY workshop is to provide a forum for researchers and practitioners in this space, linking operating systems, formal methods, and hardware architecture, interested in system design as well as machine verified mathematical proofs using proof assistants such as Coq, Isabelle and HOL4. This will be the second edition of the ENTROPY workshop series. The first workshop was organised by the Pip Development Team at University of Lille in 2018. TOPICS OF INTEREST Specific topics include, but are not limited to: * Verified kernels and hypervisors * Verified security architectures and models * Tools and frameworks for hardware security analysis * Tools and frameworks for security analysis * Formal hardware models and model validation techniques * Theorem prover based tools and frameworks for verification of low level code * Combinations of static analysis and theorem proving * Theories and techniques for compositional security analysis * Case studies and industrial experience reports * Proof maintenance techniques and problems * Compositional models and verification techniques * Proof oriented design The aim of the workshop is to stimulate innovation and active exchange of ideas, so position papers, work-in-progress and industrial experience submissions are welcome. SUBMISSION AND PUBLICATION There are two categories of submissions: 1. Regular papers describing fully developed work and complete results (10 pages, references included, IEEE format) 2. Short papers, position papers, industry experience reports, work-in-progress submissions (4 pages, references included, IEEE format) All papers should be in English and describe original work that has not been published or submitted elsewhere. The submission category should be clearly indicated. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in IEEE Xplore in a companion volume to the regular EuroS&P proceedings. For formatting and submission instructions see https://entropy2019.sciencesconf.org. PROGRAM CHAIRS Mads Dam, KTH Royal Institute of Technology David Nowak, CNRS and University of Lille PROGRAM COMMITTEE Christoph Baumann, Ericsson AB Gustavo Betarte, Univ. de la República, Uruguay David Cock, ETH Zurich Mads Dam, KTH Royal Institute of Technology (chair) Anthony Fox, ARM Deepak Garg, MPI Saarbrucken Ronghui Gu, Columbia University Samuel Hym, Univ. Lille Thomas Jensen, INRIA and Univ. Rennes Toby Murray, Univ. Melbourne David Nowak, CNRS & Univ. Lille (chair) Vicente Sanchez-Leighton, Orange Labs Thomas Sewell, Chalmers -- David Nowak http://www.cristal.univ-lille.fr/~nowakd/

1 1

LCC 2019（7月8日・パトラ）発表募集
by Akitoshi Kawamura 10 Mar '19

10 Mar '19

メーリングリストの皆様九大の河村と申します。7月に国際会議ICALPの併設集会としてギリシアのパトラで行われる「論理学と計算量」研究集会LCC 2019の御案内をお送りいたします。投稿は3～4ページで、締切は5月1日です。 =========================================================== First Call for Contributions LCC 2019 20th International Workshop on Logic and Computational Complexity July 8, 2019, Patras, Greece Collocated with ICALP 2019 http://www.cs.swansea.ac.uk/lcc/ =========================================================== LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission May 1, 2019 * notification May 20, 2019 * workshop July 8, 2019 SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://easychair.org/conferences/?conf=lcc19 We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Lauri Hella, Co-chair, Tampere University, Finland Monika Seisenberger, Co-chair, Swansea University, UK Sam Buss, University of California, San Diego, US Anupam Das, University of Copenhagen, Denmark Anuj, Dawar, University of Cambridge, UK Akitoshi Kawamura, Kyushu University, Fukuoka, Japan Arne, Meier, University of Hannover, Germany Lidia Tendera, University of Opole, Poland CONTACT: To contact the workshop organizers, please send an e-mail to lcc19(a)easychair.org -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 0

Nagoya logic seminar
by 吉信康夫 05 Mar '19

05 Mar '19

皆様：名古屋大学の吉信です。先日ご案内いたしました名古屋ロジックセミナーについて、概要をいただきましたのであらためてお知らせいたします。日時：3月8日(金) 15:30〜場所：名古屋大学大学院情報学研究科棟314室講演者：渕野昌(神戸大学) タイトル：Reflection axioms which imply the continuum is very large 概要：Stationary logic の variations 対する，``妥当な'' Löwenheim-Skolem Theorem が成立するべきである，という前提のもとで，連続体の濃度は $\aleph_1$ あるいは $\aleph_2$ あるいは非常に大きなもの (weakly Mahlo, weakly hyper Mahlo 等) になるかのいずれかとなることを示す．この三分律に対応する３つの generic supercompactness axioms についても論ずる．多数の方のご参加をお待ちしております。

1 0

Re: [logic-ml] CSCAT 2019 開催案内
by Kensuke Kojima 04 Mar '19

04 Mar '19

皆様京都大学の小島です。申し込み締め切りが近づいてきましたので、 CSCAT 2019 のご案内を再送いたします。懇親会・講演申し込みの締め切りは22日（金）となっております。特に懇親会に参加を希望される方は早めにお申し込み下さい。講演につきましては枠が残っている限り22日を過ぎても受け付ける予定ですが、仮プログラム作成のため早めにお知らせいただけるとありがたいです。講演申し込み https://goo.gl/forms/DscPaYGBsIbUFDua2 懇親会申し込み https://goo.gl/forms/7cCq16mOxlV1GZ6o2 小島 2019年1月13日(日) 12:40 Kensuke Kojima <kozima(a)kuis.kyoto-u.ac.jp>: > > CSCAT メーリングリストの皆様、 > > 京都大学の小島です。 > 今年の CSCAT のお知らせです。 > > 日時： 2019年3月9日（土）〜3月10日（日） > 会場：東北大学理学部数理科学記念館（川井ホール） > URL：https://sites.google.com/view/cscat2019/home > 連絡先：cscat2019(a)grp.tohoku.ac.jp > > 今年は会場の手配を東北大学の赤間先生にお願いして、 > 講演の取りまとめを小島が行う形で開催することになりました。 > > 懇親会を3月9日の夜に行う予定です。予算は一人6000円程度の見込みです。 > > 講演・懇親会への参加を希望される方は2月22日までに、 > それぞれ以下の申し込みフォームへご記入下さい。 > （聴講のみで懇親会にも参加されない場合は申し込み不要です。） > > 講演申し込み https://goo.gl/forms/DscPaYGBsIbUFDua2 > 懇親会申し込み https://goo.gl/forms/7cCq16mOxlV1GZ6o2 > > 皆様の参加をお待ちしております。 > > 小島

1 1

seminar
by 吉信康夫 03 Mar '19

03 Mar '19

皆様名古屋大学の吉信です。以下の要領で名古屋ロジックセミナーを開催します。日時：3月8日(金) 15:30〜場所：名古屋大学大学院情報学研究科棟314室講演者：渕野昌(神戸大学) タイトル：Reflection axioms which imply the continuum is very large 多数の方のご参加をお待ちしております。

1 0

Summer School in Dynamic Epistemic Logic, Sapporo (Japan), 13-23 Aug 2019
by Katsuhiko Sano 25 Feb '19

25 Feb '19

Dear all, The Department of Philosophy at Hokkaido University (Sapporo, Japan) will hold a two-week summer school in dynamic epistemic logic and its applications, jointly with one guest lecturer, Hans van Ditmarsch, from LORIA in Nancy, between August 13 and August 23 as part of Hokkaido Summer Institute (HSI) 2019. The following two intensive courses are scheduled to be offered during the summer school. Course 1 (13/Aug/2019 - 17/Aug/2019): Introduction to Logic 2019 (For details, see https://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G096) Course 2 (19/Aug/2019 - 23/Aug/2019): Dynamic Epistemic Logic and its Applications 2019 (For details, see https://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G099) The main lecturer of Course 1 is Katsuhiko Sano (Department of Philosophy, Hokkaido University). The main lecturer of Course 2 is Hans van Ditmarsch (Lorraine Research Laboratory in Computer Science and its Applications, Centre national de la recherche scientifique, France). Tomoyuki Yamada (Hokkaido University) will also join the classes to help students follow the lectures, and communicate with the lecturers. The courses are intended for graduate students. Course 1 is meant for students without prior knowledge of logic and will prepare them for Course 2. Each course is designed to be independent from the other course. Those students who have some familiarity with basics of propositional logic, first-order logic, and modal logic can skip Course 1, and those who wish to take only Course 1 can learn basics of logic. There are several application periods for students from universities other than Hokkaido University: 1st application: ** from February 1 to February 28 2019.** 2nd application: ** from April 4 to 10 2019.** 3rd application: ** from April 26 to May 8 2019.** For more details about applications, please check the HSI official website: https://hokkaidosummerinstitute.oia.hokudai.ac.jp/applications/ As the summer in Sapporo is beautiful and pleasant, it's a good idea to learn logic this summer in Sapporo. Katsuhiko Sano Department of Philosophy Graduate School of Letters Hokkaido University

1 0

「圏論シンポジウム」開催のお知らせ; Symposium on the Categorical Unity of the Sciences
by Yoshihiro Maruyama 25 Feb '19

25 Feb '19

皆様、 Oxford大学のSamson Abramsky教授来日に際し、下記の通り圏論シンポジウムを開催いたします。登録不要ですので、お気軽にお立ち寄り下さい。 ------------------------------------------------------------------------------ 圏論シンポジウム Symposium on the Categorical Unity of the Sciences 3月22-23日、益川ホール、北部キャンパス、京都大学 22-23 March at Maskawa Hall, Kyoto University, Japan https://sites.google.com/view/categorical-unified-science/ 講演者 Speakers - Samson Abramsky (University of Oxford) - 久木田水生 (名古屋大学) - 谷村省吾 (名古屋大学) - 蓮尾一郎 (国立情報学研究所) - 春名太一 (東京女子大学) - 丸山善宏 (京都大学) - 三好博之 (京都産業大学) 事前登録/参加費不要。 No registration required. 問い合わせ先 Contact 丸山善宏（京都大学） maruyama(a)i.h.kyoto-u.ac.jp 旅費援助を希望される方は、上記までお早めにご連絡下さい。 (可能な数に限りはございます.) Limited travel funding is available; contact the organizer asap. ------------------------------------------------------------------------------ なおスケジュール詳細はウェブページの方にあります。どうぞよろしくお願い致します。丸山善宏（京都大学白眉センター）

1 0

CTFMのご案内
by 小俣安彦 22 Feb '19

22 Feb '19

皆様 CTFM主催者である彭寧寧氏(武漢理工大学)に代わり，下記のご案内をさせていただきます． Computability Theory and Foundations of Mathematics (CTFM) 昨年の明治大学での開催につづき，本年は標記国際会議が下記の日程で開催されます．日程：2019年 3月 21 日 (木) Registaration 　　　22日〜 25日 Lectures and Talks 　　　26-27日 Discussions and Excursions 場所：中国　武漢理工大学参加申し込みなどさらに詳しい情報は，次のウェブサイトをご覧ください． http://www.ctfm2019.com/index.html 講演申し込みはすでに締め切っておりますが，追加講演が認められる場合もございますので，何かご要望等がございましたら ctfm2019(a)gmail.com　までご相談ください．よろしくお願いします．田中一之（東北大学）小俣安彦（東北大学）

1 0

【参加募集(最終案内)】第21回プログラミングおよびプログラミング言語ワークショップ（PPL2019）
by Kazuyuki ASADA 19 Feb '19

19 Feb '19

PPLの皆様（重複ご容赦ください），東北大学の浅田です． 3月6日(水) 〜 8日(金)に，岩手県花巻市で開催される，第21回プログラミングおよびプログラミング言語ワークショップ (PPL2019) の参加登録の最終案内をいたします．参加登録の締切は明日2月20日(水)です．送迎バスアンケートの締切も同日です．締切までの参加費等のお支払いを忘れずにお願いいたします．会議のプログラムを公開いたしました： https://jssst-ppl.org/workshop/2019/program.html 多くの方々のご参加をお待ちしております． -------------------------------------------------------------------------- 第21回プログラミングおよびプログラミング言語ワークショップ（PPL2019） https://jssst-ppl.org/workshop/2019/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2019年3月6日(水) 〜 8日(金) 会場: 岩手県花巻市志戸平温泉「湯の杜ホテル志戸平」 PPL2019は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2019/registration.html 参加登録締切：2019年2月20日(水) 問い合わせ先： ppl2019-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2019-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会笹田耕一 (クックパッド)[プログラム共同委員長] 末永幸平 (京都大学)[プログラム共同委員長] 青谷知幸 (東京工業大学) 赤間陽二 (東北大学) 浅井健一 (お茶の水女子大学) 稲葉一浩 (Google) 鵜川始陽 (高知工科大学) 遠藤侑介 (クックパッド) Jacques Garrigue (名古屋大学) Oleg Kiselyov (東北大学) 酒井政裕 (PFN) 佐藤重幸 (東京大学) 関山太朗 (国立情報学研究所) 高野保真 (青山学院大学) 田中哲 (産業技術総合研究所) 千代英一郎 (成蹊大学) 千葉滋 (東京大学) 塚田武志 (東京大学) 照井一成 (京都大学) 中澤巧爾 (名古屋大) 林崎弘成 (Google) 平井洋一 (brainbot technologies AG) 堀江倫大 (日本IBM) 前田敦司 (筑波大学) 森畑明昌 (東京大学) 山田晃久 (国立情報学研究所) ・組織委員会浅田和之 (東北大学)[組織委員長] 平石拓 (京都大学)[組織副委員長] 木村大輔 (東邦大学)[財務担当] 森口草介 (関西学院大学)[財務副担当] 新屋良磨 (秋田大学)[会場担当] 安部達也 (千葉工業大学)[会場副担当] 佐藤亮介 (九州大学)[渉外担当] 笹田耕一 (クックパッド)[プログラム共同委員長] 末永幸平 (京都大学)[プログラム共同委員長] ================================================================

1 0

CADE-27: Second Call for Papers
by Nao Hirokawa 19 Feb '19

19 Feb '19

皆様来年８月にブラジル・ナタールで開催されます、自動演繹に関する国際会議 CADE の論文募集の案内をお送り致します。締切が少し延び、概要締切が20日、論文締切が 27 日 (AoE) となりました。是非、投稿をご検討下さい。廣川 (JAIST) --- The 27th International Conference on Automated Deduction (CADE-27) Natal, Brazil 25-30 August 2019 http://www.cade-27.info CALL FOR PAPERS CADE is the major international forum for presenting research on all aspects of automated deduction. High-quality submissions on the general topic of automated deduction, including foundations, applications, implementations, theoretical results, practical experiences and user studies are solicited. Key dates: Abstract deadline (extended): 20 February 2019 Submission deadline (extended): 27 February 2019 * Logics of interest include propositional, first-order, equational, higher-order, classical, description, modal, temporal, many-valued, constructive, other non-classical, meta-logics, logical frameworks, type theory, set theory, as well as any combination thereof. * Paradigms of interest include theorem proving, model building, constraint solving, computer algebra, model checking, proof checking, and their integration. * Methods of interest include resolution, superposition, completion, saturation, term rewriting, decision procedures, model elimination, connection methods, tableaux, sequent calculi, natural deduction, as well as their supporting algorithms and data structures, including matching, unification, orderings, induction, indexing techniques, proof presentation and explanation, proof planning. * Applications of interest include program analysis, verification and synthesis of software and hardware, formal methods, computational logic, computer mathematics, natural language processing, computational linguistics, knowledge representation, ontology reasoning, deductive databases, declarative programming, robotics, planning, and other areas of artificial intelligence. Submissions can be made in two categories: regular papers and system descriptions. The page limit in Springer LNCS style is 15 pages excluding references for regular papers and 10 pages excluding references for system descriptions. Submissions must be unpublished and not submitted for publication elsewhere. They will be judged on relevance, originality, significance, correctness, and readability. System descriptions must contain a link to a working system and will also be judged on usefulness and design. Proofs of theoretical results that do not fit in the page limit, executables of systems, and input data of experiments should be made available, via a reference to a website or in an appendix of the paper. For papers containing experimental evaluations, all data needed to rerun the experiments must be available. Reviewers will be encouraged to consider this additional material, but submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chair may solicit further reviews after the rebuttal period. The proceedings of the conference will be published in the Springer LNCS/LNAI series. Formatting instructions and the LNCS style files can be obtained at http://www.springer.de/comp/lncs/authors.html At every CADE conference the Program Committee selects one of the accepted papers to receive the CADE Best Paper Award. The award recognizes a paper that the Program Committee collegially evaluates as the best in terms of originality and significance, having substantial confidence in its correctness. Overall technical quality, completeness, scholarly accuracy, and readability are also considered. Characteristics associated with a best paper include, for instance, introduction of a strong new technique or approach, solution of a long-standing open problem, introduction and solution of an interesting and important new problem, highly innovative application of known ideas or existing techniques, and presentation of a new system of outstanding power. Under exceptional circumstances, the Program Committee may give two awards (ex aequo) or give no award. IMPORTANT DATES Abstract deadline: 20 February 2019 Submission deadline: 27 February 2019 Rebuttal phase: 2 April 2019 Notification: 15 April 2019 Final version: 27 May 2019 SUBMISSION INSTRUCTIONS Papers should be submitted via https://easychair.org/conferences/?conf=cade27 CADE-27 ASSOCIATED EVENTS Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE), http://cl-informatik.uibk.ac.at/users/swinkler/arcade/ The CADE ATP System Competition, http://www.tptp.org/CASC/27/ Deduction Mentoring Workshop Logical and Semantic Frameworks, with Applications (LSFA), https://sites.google.com/view/lsfa2019 Proof eXchange for Theorem Proving (PxTP), http://pxtp.gforge.inria.fr/2019/ Theorem Prover Components for Educational Software (ThEdu'19), http://www.uc.pt/en/congressos/thedu/thedu19 The 6th Vampire Workshop CADE-27 ORGANIZERS Conference Chair: Elaine Pimentel Federal University of Rio Grande do Norte, Brazil Organizers: Carlos Olarte Federal University of Rio Grande do Norte, Brazil Joao Marcos Federal University of Rio Grande do Norte, Brazil Claudia Nalon University of Brasilia, Brazil Giselle Reis CMU, Qatar Program Committee Chair: Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France Workshop, Tutorial, and Competition Chair: Giles Reger University of Manchester, UK Publicity Chair: Geoff Sutcliffe University of Miami, USA Program Committee: Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Franz Baader, TU Dresden, Germany Clark Barrett, Stanford University, USA Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands Maria Paola Bonacina, Universita degli Studi di Verona, Italy Leonardo Mendonca de Moura, Microsoft Research, USA Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan Clare Dixon, University of Liverpool, UK Mnacho Echenim, Universite de Grenoble, France Marcelo Finger, University of Sao Paulo, Brazil Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France Silvio Ghilardi, Universita degli Studi di Milano, Italy Juergen Giesl, RWTH Aachen University, Germany Rajeev Gore, The Australian National University, Australia Stefan Hetzl, Technische Universitaet Wien, Austria Marijn J. H. Heule, The University of Texas at Austin, USA Nao Hirokawa, JAIST, Japan Moa Johansson, Chalmers University of Technology, Sweden Cezary Kaliszyk, University of Innsbruck, Austria Deepak Kapur, University of New Mexico, USA Benjamin Kiesl, Technische Universitaet Wien, Austria Konstantin Korovin, The University of Manchester, UK Laura Kovacs, Technische Universitaet Wien, Austria Ramana Kumar, DeepMind, UK Claudia Nalon, University of Brasilia, Brazil Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany Carlos Olarte, Federal University of Rio Grande do Norte, Brazil Jens Otten, University of Oslo, Norway Andre Platzer, Carnegie Mellon University, USA Andrew Reynolds, The University of Iowa, USA Philipp Ruemmer, Uppsala University, Sweden Renate A. Schmidt, The University of Manchester, UK Stephan Schulz, DHBW Stuttgart, Germany Roberto Sebastiani, University of Trento, Italy Natarajan Shankar, SRI International, USA Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany Martin Suda, Czech Technical University, Czech Republic Geoff Sutcliffe, University of Miami, USA Rene Thiemann, University of Innsbruck, Austria Uwe Waldmann, Max Planck Institute for Informatics, Germany Christoph Weidenbach, Max Planck Institute for Informatics, Germany Sarah Winkler, University of Innsbruck, Austria

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml