早稲田大学の藤原誠です。
先日ご案内させていただいた早稲田大学高等研究所 / 慶應義塾大学論理と感性のグローバル研究センター共催
「Workshop in Logic and Philosophy of Mathematics」
について最新の情報を流させていただきます。
14日15日ともに参加自由です。
どうぞふるってご参加ください。
-------------------------------------------------------------------
We apologize if you receive this message more than once.
---------------------------------------------------------------------
We announce the following “Workshop in Logic and Philosophy of Mathematics”.
The first day is at Mita campus of Keio University and the second day is at Waseda campus of Waseda University.
7月14日は慶應義塾大学三田キャンパス、7月15日は早稲田大学早稲田キャンパスでの開催になりますのでご注意下さい。
----
Workshop in Logic and Philosophy of Mathematics
Date: July 14 (Fri) and 15 (Sat), 2017
日時: 2017年7月14日(金), 7月15日(土)
Place:
G-Lab, 6th floor, East Building, Mita campus of Keio University (14th);
Meeting Room #1, 5th Floor, Bldg. 9, Waseda campus of Waseda University (15th).
場所:
慶應義塾大学三田キャンパス東館6階G-Lab (14日);
早稲田大学早稲田キャンパス9号館5階第一会議室 (15日).
For more details, please see the following page:
詳細は以下をご覧ください。
https://www.waseda.jp/inst/wias/news/2017/07/04/4467/
----
Program:
1. July 14 (Friday, G-Lab, 6th floor, East Building, Mita campus of Keio University):
Time: 13:00-18:00
Speakers: Andrew Arana (Université Paris 1 Panthéon-Sorbonne, IHPST), Kengo Okamoto (Tokyo Metropolitan University), Ryota Akiyoshi (Waseda University), Makoto Fujiwara (Waseda University)
The details will be announced soon at the following page:
https://abelard.flet.keio.ac.jp/jindex.php <https://abelard.flet.keio.ac.jp/jindex.php>
2. July 15 (Saturday, Meeting Room #1, 5th Floor, Bldg. 9, Waseda Campus of Waseda University)
Talk 1:
13:00-14:00
Ryoma Shinya (The University of Tokyo)
Title:
Almost every simply typed λ-term has a long β-reduction sequence
Abstract:
It is well known that the length of a β-reduction sequence of a simply typed λ-term of order k can be huge; it is as large as k-fold exponential in the size of the λ-term in the worst case. We consider the following relevant question about quantitative properties, instead of the worst case: how many simply typed λ-terms have very long reduction sequences? We provide a partial answer to this question, by showing that asymptotically almost every simply typed λ-term of order k has a reduction sequence as long as (k − 2)-fold exponential in the term size, under the assumption that the arity of functions and the number of variables that may occur in every subterm are bounded above by a constant. The work has been motivated by quantitative analysis of the complexity of higher-order model checking.
Talk 2:
14:00-15:00
Taishi Kurahashi (National Institute of Technology, Kisarazu College)
Title:
On partial disjunction properties of theories containing PA
Abstract:
It is well-known that intuitionistic predicate logic and Heyting Arithmetic have the disjunction property (DP). For intuitionistic logic, DP seems to reflect its constructivity. In classical logic, DP plays a different role. If a theory T in classical logic has DP, then T is complete because the law of excluded middle is valid. Thus in classical logic, every \Sigma_1-definable consistent extension of Peano Arithmetic PA does not have DP by the Gödel–Rosser first incompleteness theorem. On the other hand, PA enjoys a partial disjunction property. Let \Gamma be a class of formula. We say that a theory T has the \Gamma-disjunction property (\Gamma-DP) iff for any \Gamma sentences \varphi and \psi, at least one of \varphi or \psi is provable in T whenever \varphi \lor \psi is provable in T. It is known that PA has \Sigma_1-DP but does not have \Pi_1-DP. In this talk, we present several results concerning partial disjunction properties and other related properties of theories containing PA which is not necessarily \Sigma_1-definable.
Talk 3:
15:20-16:20
Naosuke Matsuda (Kanagawa University)
Title:
Some extensions of de Jongh's theorem
Abstract:
It is obvious that if a propositional formula A is provable in intuitionistic propositional calculus,
then each arithmetical instance is provable in Heyting Arithmetic.
The converse of this statement is known as de Jongh's theorem.
In this talk, I give an introduction to de Jongh's theorem
and introduce some extensional works.
Talk 4:
16:20-17:20
Masahiko Sato (Kyoto University)
Title:
A common notation system for lambda calculus and combinatory logic
Abstract:
We present a notation system which can be used to
faithfully represent both the terms of lambda calculus and
combinatory logic. We show the faithfullness of the
representations by observing that the representations respect the
beta and eta reduction rules. We also argue that Curry's Last
Problem (J.R.Hindley, Curry's Last Problem: Imitating
lambda-beta-reduction in Combinatory Logic) in its original form
is an ill-posed problem, and can be solved naturally by expressing
the problem in our notation system.
---------------------------------------------------------------------
Organizers:
Ryota Akiyoshi (Waseda Institute for Advanced Study, Waseda University)
Makoto Fujiwara (Waseda Institute for Advanced Study, Waseda University)
Mitsuhiro Okada (Global Research Center for Logic and Sensibility, Keio University)
Co-host: Waseda Institute for Advanced Study (Waseda University), Global Research Center for Logic and Sensibility (Keio University)
Contact:
Ryota Akiyoshi
georg.logic(a)gmail.com <mailto:[email protected]>
============================================
藤原 誠 (Makoto Fujiwara)
早稲田大学高等研究所
(Waseda Institute for Advanced Study, Waseda University)
E-mail: makoto_fujiwara(a)aoni.waseda.jp
============================================
皆様
島根大学の岩見と申します。
9月25~27日に開催される「第47回 TRS Meeting」
の参加者募集をご案内致します。
今回は水の都とよばれる松江の宍道湖岸のホテル
で開催します。皆様、ぜひ参加をご検討下さい。
講演題目と講演時間は後程連絡して頂く形で構いま
せん。和室シングルルームは宍道湖眺望ありです。
通常のシングルルームは宍道湖眺望なしです。
7月14日(金)までに岩見へメールにて連絡してく
ださい。
--
岩見 宗弘
島根大学 総合理工学研究科
情報システム学領域
E-mail: munehiro(a)cis.shimane-u.ac.jp
-----------------------------------------
47th TRS Meeting
September 25 - 27, 2017
Matsue, Japan
http://www.cis.shimane-u.ac.jp/~munehiro/trs-meeting47/
About TRS Meeting
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(s) of approximately 15 - 60
minutes in English on their research activities. The subject of the talk
may not be one's original result; for example, explaining an interesting
paper is perfectly OK. (See Rewriting Researchers Forum for further
information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/).
Basic Information
Date September 25 (Mon) - 27 (Wed), 2017
Venue Matsue New Urban Hotel (webpage in Japanese)
40-1, Nishicha-machi, Mstsue-shi, Shimane, 690-0845, Japan
Fee Registration: 6,000 JPY (includes coffee breaks and meeting room)
Accomodation: 8,400 JPY (Sep. 25) (includes breakfast and
dinner) and
12,560 JPY (Sep. 26) (includes breakfast and bunquet)
Tentative Schedule
Room Koto (we will have a screen and a whiteboard)
Opening 13:30, September 25
Closing 12:00, September 27
Timetable Tentative
Registration
Deadline July 14th (Fri), 2017
Please fill in the following registration form and send it to Munehiro
Iwami
(munehiro [at] cis.shimane-u.ac.jp) by e-mail. Items marked with * can
be sent
later.
--------------------------------------------------------------------------------------------
Registration Form of the 47th TRS Meeting
name:
affiliation:
* title of talk:
* approximate duration of talk (15 - 60 minutes):
preference on your room: [standard single room / Japanese style single
room] (choose one)
(In case of partial participation, please contact us)
--------------------------------------------------------------------------------------------
皆様、
東京大学の小林です。
FLOPS 2018 の論文募集案内をお送りいたします。
小林直樹
東京大学大学院情報理工学系研究科コンピュータ科学専攻
〒113-0033 東京都文京区本郷7-3-1
Phone: 03-5841-4124
Fax: 03-5841-4124
email: koba(a)is.s.u-tokyo.ac.jp
-----------------
FIRST Call For Papers
FLOPS 2018: 14th International Symposium on Functional and Logic Programming
9-11 May, 2018, Nagoya, Japan
http://www.sqlab.jp/FLOPS2018/
Writing down detailed computational steps is not the only way of
programming. The 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
include functional and logic programming, program transformation and
re-writing, and extracting programs from proofs of their correctness.
FLOPS aims to bring together practitioners, researchers and
implementors of the declarative programming, 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, re-writing
systems, formal methods and model checking, program transformations
and program refinements, developing programs with the help of theorem
provers or SAT/SMT solvers;
* foundations, language design, implementation issues (compilation
techniques, memory management, run-time systems), applications and
case studies.
FLOPS promotes cross-fertilization among different styles of
declarative programming. Therefore, submissions must be written to be
understandable by the wide audience of declarative programmers and
researchers. Submission of system descriptions and declarative pearls
are especially encouraged.
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 contain a link to 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.
Proceedings
The proceedings will be published by Springer International Publishing
in the Lecture Notes in Computer Science (LNCS) series, as a printed
volume as well as online in the digital library SpringerLink.
Post-proceedings: The authors of 4-7 best papers will be invited to
submit the extended version of their FLOPS paper to a special issue of
the journal Science of Computer Programming (SCP).
Important dates
13 November 2017 (any time zone): Abstract Submission
20 November 2017 (any time zone): Submission deadline
15 January 2018: Author notification
9-11 May 2018: FLOPS Symposium
Invited Talks
To be announced
Submission
Submissions must be written in English and can be up to 15 pages long
including references, though 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 a Web page, or an appendix).
Papers should be submitted electronically at
https://easychair.org/conferences/?conf=flops2018
Program Committee
Andreas Rossberg Google, Germany
Atsushi Ohori Tohoku University, Japan
Bruno C. D. S. Oliveira The University of Hong Kong, China
Carsten Fuhs Birkbeck, University of London, UK
Chung-chieh Shan Indiana University, USA
Didier Remy INRIA, France
Harald Sondergaard The University of Melbourne, Australia
Jacques Garrigue Nagoya University, Japan
Jan Midtgaard Technical University of Denmark, Denmark
Joachim Breitner University of Pennsylvania, USA
John Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain (co-chair)
Jorge A Navas SRI International, USA
Kazunori Ueda Waseda University, Japan
Kenny Zhuo Ming Lu School of Information Technology, Nanyang Polytechnic, Singapore
María Alpuente Universitat Politècnica de València, Spain
María Garcia De La Banda Monash University, Australia
Martin Sulzmann Karlsruhe University of Applied Sciences, Germany (co-chair)
Meng Wang University of Kent, UK
Michael Codish Ben-Gurion University of the Negev, Israel
Michael Leuschel University of Düsseldorf, Germany
Naoki Kobayashi University of Tokyo, Japan
Nikolaj Bjørner Microsoft Research, USA
Robert Glück University of Copenhagen, Denmark
Samir Genaim Universidad Complutense de Madrid, Spain
Siau Cheng Khoo National University of Singapore, Singapore
Organizers
Martin Sulzmann Karlsruhe University of Applied Sciences (co-chair)
John Gallagher Roskilde University and IMDEA Software Institute (co-chair)
Makoto Tatsuta National Institute of Informatics, Japan (General Chair)
Koji Nakazawa Nagoya University, Japan (Local Chair)
次の3回の連続セミナートークを予定しています。アナウンスが第1回目の開催日
に間に合わないかもしれませんが、次の内容をこのメールリストに流させて頂き
けるとありがたいです。よろしくお願いいたします。
岡田光弘 慶應義塾大学文学部哲学専攻
───────────────────────────────
<Andrew ARANA パリ第1大学哲学科准教授 数学の哲学連続トークと討
論 7月4日、11日、19日、Geometrical knowledge and geometrical
legitimacy > July 4th, 11th,19th, Mita Campus, Keio University
次のようなPhilosophy of mathematics 連続セミナートークを Andrew ARANA 博
士にお願いしています。
連続セミナートーク・テーマ Theme
Geometrical knowledge and geometrical legitimacy I, II, III
初回Iはoverview的講演をお願いしてます。
この告知メールは初回のトークのあとに届く可能性が高いですが、
2回目、3回目の内容は初回と独立にお聴きいただくこともできますので2回目以
降からのご参加も歓迎いたします。
スピーカー Speaker
Andrew Arana, パリ第1大学哲学科准教授、Dept of Philosophy, University of
Paris-1
場所:慶應大三田キャンパス大学院棟313番教室
Room 313, Graduate School Building, Mita Campus, Keio university
(構内図 Campus Mapの8番です。 #8 of this map.)
https://www.keio.ac.jp/ja/maps/mita.html
One hour talk and 30 minutes discussion
第1回7月4日 (火) July 4th (Tues) 18;00-19:30
第2回 7月11日(火) July 11th (Tues) 18:00-19:30
第3回 7月19日(火)July 19th (Tues) 18:00-19:30
----------------------------------------------------------------
この会合とは別に、早稲田大学高等研究所―慶應義塾大学論理と感性のグローバ
ル研究センター共催の「論理と数学の哲学」会合(7月14日三田キャンパス、15
日早稲田キャンパス)でもArana先生が14日に話されます。)
Andrew Arana, Proofs and Meaning in Arithmetic
14日、15日とも13:00に開始を予定しています。
こちらの案内はプログラムが決まり次第追ってお知らせします。14日は慶應大三
田キャンパス東館6階G-Lab
Also the Waseda-U=Keio U Joint Workshop on “Logic and Philosophy of
Mathematics”
Is acheduled. Prof. Arana is going to give another talk there on 14th
at G-Lab, 6th floor, East Building, Mita Campus, Keio University.
We will announce the program soon.
-------------------------------------------
論理と感性のグローバル研究センター(論理班)、三田ロジックセミナー 共催
お問い合わせ Contact:
logic(a)abelard.flet.keio.ac.jp (セミナー事務局専用アドレス) 慶応義塾大学
文学部哲学専攻岡田光弘研究室内
----------------------------------------
皆様,
群馬大学の藤田と申します.
9月の IWC 2017(Oxford)の締切が7/5まで延長されましたので
ご案内をさせていただきます.どうぞ宜しくお願い致します.
-----
(* Apologies for any cross-postings. *)
=====================================================================
Call for Papers
IWC 2017
6th International Workshop on Confluence
September 8th, 2017, Oxford, United Kingdom
Collocated with FSCD 2017
http://cl-informatik.uibk.ac.at/events/iwc-2017/
=====================================================================
Confluence provides a general notion of determinism and is widely
viewed as one of the central properties of rewriting. Confluence
relates to many topics of rewriting (completion, modularity,
termination, commutation, etc.) and has been investigated in many
formalisms of rewriting such as first-order rewriting, lambda-calculi,
higher-order rewriting, constrained rewriting, conditional rewriting,
etc. Recently there is a renewed interest in confluence research,
resulting in new techniques, tool support, certification as well as
new applications.
The International Workshop on Confluence (IWC) aims at promoting
further research in confluence and related properties. IWC 2017 is
collocated with FSCD 2017. Previous editions of the workshop were held
in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), and
Obergurgl (2016).
During the workshop, the 6th Confluence Competition (CoCo 2017) takes
place.
IMPORTANT DATES:
* submission Wednesday, July 5th, 2017 (extended)
* notification Saturday, July 22nd, 2017
* final version Saturday, August 5th, 2017
* workshop Friday, September 8th, 2017
(deadlines are AoE)
TOPICS:
Specific topics of interest include:
* confluence and related properties (unique normal forms, commutation,
ground confluence)
* completion
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence
INVITED SPEAKERS:
* Stefan Kahrs (University of Kent)
* Patrick Bahr (IT University of Copenhagen)
PROGRAM COMMITTEE:
* Beniamino Accattoli (INRIA)
* Jörg Endrullis (Vrije Universiteit Amsterdam)
* Bertram Felgenhauer (University of Innsbruck)
* Ken-Etsu Fujita (Gumma University)
* Philippe Malbos (Université Claude Bernard Lyon 1)
* Jakob Grue Simonsen (University of Copenhagen)
SUBMISSION:
We solicit short papers or extended abstracts of at most five pages.
There will be no formal reviewing. In particular, we welcome short
versions of recently published articles and papers submitted
elsewhere. The program committee checks relevance and may provide
additional feedback. The accepted papers will be made available
electronically before the workshop.
The page limit for papers is 5 pages in EasyChair style. Short papers
or extended abstracts must be submitted electronically through the
EasyChair system at:
https://www.easychair.org/conferences/?conf=iwc2017
EasyChair style:
http://easychair.org/publications/for_authors
-----