次のご案内をさせていただけると幸いです。
慶應大 岡田光弘 峯島宏次
ーーーーーーーーーーーーーーーーーーー
論理―計A算―哲学セミナーLogic-Computation-Philosophy Seminar
「プログラム」「アルゴリズム」「計算モデル」を「定義する」ことに関する
Prof. Thomas Seillerの講義をご案内させていただきます。
ハイブリッド形式
講義Title« Defining "program", "algorithm", and "model of computation" —
including a discussion on how models of linear logic emerge by generalizing
geometry of interaction and transcendental syntax constructions »
We will put updated information in any, here.最新情報URL
https://abelard.flet.keio.ac.jp/2024/seminar_talk_202405
<https://abelard.flet.keio.ac.jp/satellite-workshop_202406/poster_ja.pdf>
5月28日火曜日 17:30-19:00 May 28 Thuesday
慶應義塾大学三田キャンパス東館(東門の建物)4階オープンラボ
三田キャンパス:アクセス:[慶應義塾] (keio.ac.jp) <https://www.keio.ac.jp/ja/maps/mita.html>
キャンパスマップ13番
At the Open-Lab, 4th floor of the East (Research) Building at the East Gate
of Mita-Campus of Keio University
Mita Campus: Keio University <https://www.keio.ac.jp/en/maps/mita.html>
Building # 13 on the Campus Map
要事前登録・Preregistration required
登録用のリンク Hybrid Meeting
https://forms.gle/cbPr2vQrJA4haVFW7
Speaker:Thomas Seiller -(CNRS-LIPN, IHPST)
Title of the Talk
« Defining "program", "algorithm", and "model of computation" — including
a discussion on how models of linear logic emerge by generalizing geometry
of interaction and transcendental syntax constructions »
Abstract:
What is a model of computation? What is a program, an algorithm? While
theoretical computer science has been founded on computability theory, the
latter does not answer these questions. Indeed, it is a mathematical theory
of computable functions, and does not account for computation itself. A
symptomatic consequence is the notion of Turing-completeness. This standard
(sole?) equivalence between models of computation is purely extensional: it
does only care about what is computed and not how, blind to complexity
aspects and the question of algorithmic completeness. More importantly, the
theory of computation is continuously growing further from how actual
machines compute.
I will present a proposal for alternative foundations more faithful to
computer science practice and interests. This mathematisation of computer
science is grounded within the theory of dynamical systems, focussing on
*how* computation is performed rather than only on *what* is computed. I
will argue that it generalises computability theory while still allowing to
recover standard results.
This point of view can be used to:
provide a uniform account of several lower bounds from algebraic complexity
and strengthen them
define static analysis methods which can be implemented in usable tools
define families of linear realisability models (realisability models for
linear logic)
lead to a semantic approach of implicit computational complexity
propose a formal definition of the notion of algorithm
In this talk, I will focus on two aspects from this list, namely points 3
and 5:
First, I will explain how abstract programs give rise to models of
(fragments of) linear logic, generalising Jean-Yves Girard’s geometry of
interaction (or more recent transcendental syntax) constructions. I will
also explain how these technical developments shed a new light on the
question of defining logical constants.
Second, I will present the formal definition of algorithm that stems from
the approach, discuss its properties and provide a few examples.
問い合わせ先Logic-Computation-Philosophy Group, Dept. Philoophy Keio Univ
logic[AT]abelard.flet.keio.ac.jp 岡田光弘 峯島宏次
皆様,
京都大学の池渕です.APLAS 2024のfinal CfPをお送りします.
Submission deadlineが延期され,5/31(金)になりました.
======================================================
Final CFP: Deadline extended till May 31
APLAS 2024 -- The 22nd Asian Symposium on Programming Languages and Systems
October 22-24, 2024, Kyoto, Japan
https://conf.researchr.org/home/aplas-2024/ <https://conf.researchr.org/home/aplas-2024/>
APLAS 2024 aims to bring together programming language researchers,
practitioners and implementors *worldwide*, to present and discuss the
latest results and exchange ideas in all areas of programming
languages and systems. APLAS 2024 is co-located with the
22nd International Symposium on Automated Technology for Verification
and Analysis (ATVA).
We solicit submissions in the form of regular research papers
describing original scientific research results, including system
development and case studies. Among others, solicited topics include:
programming paradigms and styles; methods and tools to specify and
reason about programs and languages; programming language foundations;
methods and tools for implementation; concurrency and distribution;
applications, case studies and emerging topics.
Submissions should not exceed 17 pages, excluding bibliography, in the
Springer LNCS format. The reviewing process is light double-blind,
with a rebuttal phase to address factual errors and minor
misunderstandings.
Proceedings of APLAS 2024 will be published by Springer as part of
Lecture Notes in Computer Science (LNCS).
https://link.springer.com/conference/aplas <https://link.springer.com/conference/aplas>
APLAS 2024 continues the tradition of the best paper award.
Submission deadline: Fri May 31 (EXTENDED, firm)
Response period: Jul 24-26
Acceptance notification: Fri Aug 2
Camera-ready: Sat Aug 31
The submission website is now open: https://aplas24.hotcrp.com/ <https://aplas24.hotcrp.com/>
General Chair: Jacques Garrigue (Nagoya U.)
Publicity Chairs: Ryosuke Sato (TUAT U.), Mirai Ikebuchi (Kyoto U.)
Program Committee:
Beniamino Accattoli (Inria & Ecole Polytechnique)
Pierre-Evariste Dagand (IRIF / CNRS)
Silvia Ghilezan (University of Novi Sad, Mathematical Institute SASA)
Fritz Henglein (DIKU and Deon Digital)
Mirai Ikebuchi (Kyoto University)
Patrik Jansson (Chalmers University of Technology and University of Gothenburg)
Oleg Kiselyov (Tohoku University, PC Chair)
Hsiang-Shang ‘Josh’ Ko (Academia Sinica)
Daan Leijen (Microsoft Research)
Martin Lester (University of Reading)
Fredrik Nordvall Forsberg (University of Strathclyde)
Matija Pretnar (University of Ljubljana)
Peter Schachte (The University of Melbourne)
Sven-Bodo Scholz (Radboud University)
Philipp Schuster (University of Tübingen)
Taro Sekiyama (NII)
Amir Shaikhha (University of Edinburgh)
Pavle Subotic (Fantom Foundation)
Yong Kiam Tan (Institute for Infocomm Research, A*STAR)
Kazunori Ueda (Waseda University)
Yuting Wang (Shanghai Jiao Tong University)
Ki Yung Ahn (Hannam University)
皆様,
東北大学の竹田です.
以下の通りセミナーを開催いたしますのでご案内いたします.
https://sites.google.com/view/sendai-logic/
日時:5月24日(金)15:00〜
場所:東北大学理学研究科合同A棟801号室 (zoom配信あり)
講演者:鈴木悠大 (国立沖縄高専)
題目 On the Pi^1_2, Sigma^1_2 and Boole(Pi^1_2) sentences provable from Pi^1_1-CA_0
概要 In [1], we introduced some characterizations of the set of Pi^1_2 sentences provable from Pi^1_1-CA_0 and a hierarchy dividing it. For a detailed study of the properties of this hierarchy, it was important to focus on the statements of the form [every coded beta-model satisfies sigma] for some specific sentences sigma.
In this talk, we summarize a part of [1]. Then we give a characterization of the set of Sigma^1_2 or Boole(Pi^1_2) sentences provable from Pi^1_1-CA_0 by statements of the form [every coded beta-model satisfies sigma]. Here, Boole(Pi^1_2) is the class of formulas generated by disjunction, conjunction and negation starting from Pi^1_2.
This is joint work with J. Aguilera and K. Yokoyama.
[1] Suzuki, Y., & Yokoyama, K. (2024). On the $\Pi^ 1_2 $ consequences of $\Pi^ 1_1 $-$\mathsf {CA} _0$. arXiv preprint arXiv:2402.07136.
オンライン参加を希望される方は竹田(yuto.takeda.t8(a)dc.tohoku.ac.xn--jp)-u63baam6azav5czbevh0gij9rvoja5sb4j6736j2rvgn34dhb1b
どうぞよろしくお願いいたします.
竹田 侑人
yuto.takeda.t8(a)dc.tohoku.ac.jp