Kisoron-ml

kisoron-ml@fos.kuis.kyoto-u.ac.jp

599 discussions

照会：シンポジウム・研究集会の記録について
by Toshio Suzuki 01 Mar '16

01 Mar '16

数学基礎論および歴史分科会の皆様首都大学東京の鈴木登志雄です．３月１日から，２年目評議員となりました．また，神戸大学の菊池誠さんが１年目評議員になりました．よろしくお願いします．分科会の連絡責任評議員と受賞候補推薦委員は，正式には３月の年会での評議員会を経て決まります．それぞれ，２年目，１年目評議員が就くのが例年のならわしになっています．さて，毎年恒例のことですが，雑誌‘数学’の編集長から，シンポジウム・研究集会記録の原稿について問い合わせがあります．年度ごとの記録を一覧表にして‘数学’６８巻４号に掲載する予定です．以下の条件に当てはまる研究集会・シンポジウムを主催された方は，お手数ですが５月１３日（金）までに，鈴木登志雄 toshio-suzuki[atmark]tmu.ac.jp までおしらせください． ------ 期間： 2015年4月1日から2016年3月31日までに開催されたもの付帯条件： 20人以上の集会，または(20人以下でも)報告集のある集会．ただし，京大数理研の共同利用研究計画に掲載されたものは除きます．（条件にあてはまるか迷う場合：とりあえずおしらせいただければ幸いです．当方で，編集部に報告するかどうか判断します．）２．名称(主題) 主催者と所属(所属は大学等の略称のみで，学部名は不要) 開催場所開催時期報告集の有無　有で入手可能な場合に連絡先となる方のお名前と所属 ------ ６７巻４号（２０１５年１０月）p.428-447 と６７巻２号（２０１５年４月）p.222-224 のそれぞれに，条件にあてはまる集会・あてはまらない集会（RIMS関係）の昨年度版があります．それでは，よろしくおねがいします． -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

春の学会の日程
by ikeda＠hosei.ac.jp 26 Feb '16

26 Feb '16

数学基礎論および歴史分科会会員の皆様，連絡責任評議員の池田です．春の学会（２０１６年３月１６日−１９日，筑波大学）のプログラムが確定しておりますので，念のためお知らせいたします。 http://mathsoc.jp/meeting/tsukuba16mar/ なお，今回の本分科会特別講演は Byunghan Kim氏（Yonsei University），The Lascar group and 1st homology groups in model theory 　　　　　です（３月１６日１６：１５−１７：１５）． Byunghan Kim氏は，モデル理論における安定性理論(Stability Theory）を一般化した単純理論（Simplicity Theory）の土台を作り，現在においても精力的に研究をされています．どうぞ奮ってご参加ください。池田宏一郎（数学基礎論および歴史分科会　連絡責任評議員）

1 0

TYPES 2016 extended deadline
by Fujita Kenetsu 23 Feb '16

23 Feb '16

(* Apologies for any cross-postings. *) [New deadline 29 February 2016, submission deadline extended by a week. Consider contributing.] ================================================================== CALL FOR CONTRIBUTIONS 22nd International Conference on Types for Proofs and Programs, TYPES 2016 23-26 May 2016 Novi Sad, Serbia http://www.types2016.uns.ac.rs <http://www.types2016.uns.ac.rs/> BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Homotopy type theory; * Applications of type theory; * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. INVITED SPEAKERS (NEW) Simon Gay (University of Glasgow) Dale Miller (INRIA Saclay & LIX École Polytechnique) Simona Ronchi della Rocca (Università di Torino) CONTRIBUTED TALKS We solicit contributed talks based on extended abstracts/short papers of 2 pages prepared in LaTeX and formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2016. Important Dates: * submission of abstracts: 29 February 2016 (extended) * notification of acceptance: 21 March 2016 * camera-ready version of abstracts: 11 April 2016 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to earlier TYPES conferences, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPiCS) series. Submission to that volume would be open for everyone. Tentative submission deadline: October 2016. VENUE The conference will be held at the University of Novi Sad, University Central Building. SATELLITE EVENT: The 9th Workshop Computational Logic and Applications - CLA 2016 will be held on May 27-28, 2016. PROGRAMME COMMITTEE Thorsten Altenkirch (University of Nottingham) Zena Ariola (University of Oregon) Andrej Bauer (University of Ljubljana) Marc Bezem (University of Bergen) Malgorzata Biernacka (University of Wroclaw) Edwin Brady (University of St Andrews) Thierry Coquand (University of Gothenburg) Jose Espirito Santo (University of Minho) Ken-etsu Fujita (Gunma University) Silvia Ghilezan (University of Novi Sad) (co-chair) Hugo Herbelin (INRIA Paris-Rocquencourt) Jelena Ivetic (University of Novi Sad) (co-chair) Marina Lenisa (University of Udine) Elaine Pimentel (Federal University of Rio Grande do Norte) Andrew Polonsky (University Paris Diderot) Jakob Rehof (Technical University of Dortmund) Claudio Sacerdoti Coen (University of Bologna) Carsten Schürmann (IT University of Copenhagen) Dieter Spreen (University of Siegen) Wouter Swierstra (Utrecht University) Nicolas Tabareau (INRIA) Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordström, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993), Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015). ORGANIZERS University of Novi Sad Faculty of Technical Sciences Mathematical Institute SASA CONTACT: types2016(a)uns.ac.rs <mailto:types2016@uns.ac.rs> =================================================

1 0

TYPES 2016
by Fujita Kenetsu 09 Feb '16

09 Feb '16

皆様， TYPES 2016のご案内をさせていただきます．どうぞよろしくお願い致します．群馬大学　藤田憲悦 -------------------------- (Apologies for multiple copies of this announcement. Please circulate.) ================================================================== CALL FOR CONTRIBUTIONS 22nd International Conference on Types for Proofs and Programs, TYPES 2016 23-26 May 2016 Novi Sad, Serbia http://www.types2016.uns.ac.rs <http://www.types2016.uns.ac.rs/> BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Homotopy type theory; * Applications of type theory; * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. INVITED SPEAKERS (NEW) Simon Gay (University of Glasgow) Dale Miller (INRIA Saclay & LIX École Polytechnique) Simona Ronchi della Rocca (Università di Torino) CONTRIBUTED TALKS We solicit contributed talks based on extended abstracts/short papers of 2 pages prepared in LaTeX and formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2016. Important Dates: * submission of abstracts: 22 February 2016 * notification of acceptance: 21 March 2016 * camera-ready version of abstracts: 11 April 2016 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to earlier TYPES conferences, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPiCS) series. Submission to that volume would be open for everyone. Tentative submission deadline: October 2016. VENUE The conference will be held at the University of Novi Sad, University Central Building. SATELLITE EVENT: The 9th Workshop Computational Logic and Applications - CLA 2016 will be held on May 27-28, 2016. PROGRAMME COMMITTEE Thorsten Altenkirch (University of Nottingham) Zena Ariola (University of Oregon) Andrej Bauer (University of Ljubljana) Marc Bezem (University of Bergen) Malgorzata Biernacka (University of Wroclaw) Edwin Brady (University of St Andrews) Thierry Coquand (University of Gothenburg) Jose Espirito Santo (University of Minho) Ken-etsu Fujita (Gunma University) Silvia Ghilezan (University of Novi Sad) (co-chair) Hugo Herbelin (INRIA Paris-Rocquencourt) Jelena Ivetic (University of Novi Sad) (co-chair) Marina Lenisa (University of Udine) Elaine Pimentel (Federal University of Rio Grande do Norte) Andrew Polonsky (University Paris Diderot) Jakob Rehof (Technical University of Dortmund) Claudio Sacerdoti Coen (University of Bologna) Carsten Schürmann (IT University of Copenhagen) Dieter Spreen (University of Siegen) Wouter Swierstra (Utrecht University) Nicolas Tabareau (INRIA) Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordström, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993), Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015). ORGANIZERS University of Novi Sad Faculty of Technical Sciences Mathematical Institute SASA CONTACT: types2016(a)uns.ac.rs <mailto:types2016@uns.ac.rs> =================================================

1 0

Kusatsu Seminar 2016
by Toshihiko Kurata 03 Feb '16

03 Feb '16

皆様，ラムダ計算と論理のセミナーが計画されていますので御案内をさせて頂きます．春休みに研究上の議論を進めたいと考えている個人・グループの皆様，気軽にこの機会を御活用頂けたらと思います．期間：2016年3月19日ー23日場所：国立大学草津セミナーハウス申込み等の詳細情報は http://www.i.hosei.ac.jp/~kurata/2016LLS/ にありますので御覧下さい．よろしくお願いいたします． -- Toshihiko Kurata, Hosei University e-mail: kurata(a)hosei.ac.jp

1 0

Tenth NII Type Theory Workshop
by Makoto Tatsuta 31 Jan '16

31 Jan '16

Tenth NII Type Theory Workshop Date: February 3, 2016, 13:30--17:00 Place: National Institute of Informatics, Room 2006 (20th floor) 場所: 国立情報学研究所 20階 2006室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Program: 13:30--14:10 Mahmudul faisal Al Ameen (National Institute of Informatics) Title: Completeness for Recursive Procedures in Separation Logic 14:10--14:50 Daisuke Kimura (National Institute of Informatics) Title: An Implementation of Cyclic Proof-Search in Separation Logic with Inductive Definitions 14:50--15:00 Break 15:00--15:50 Makoto Tatsuta (National Institute of Informatics) Title: Completeness of Cyclic Proofs for Symbolic Heaps 15:50--16:00 Break 16:00--17:00 Stefano Berardi (Torino University) Title: Game Semantics and the Complexity of Interaction Abstracts: ---------------------------------------------------------------------- Mahmudul faisal Al Ameen (National Institute of Informatics) Title: Completeness for Recursive Procedures in Separation Logic Abstract: This talk proves the completeness of an extension of Hoare's logic and separation logic for pointer programs with mutual recursive procedures. A new system will be discussed by introducing two new inference rules, and removes an axiom that is unsound in separation logic and other redundant inference rules for showing completeness. It introduces a novel expression that is used to describe complete information of a given state in a precondition. It also uses the necessary and sufficient precondition of a program for the abort-free execution, which enables us to utilize strongest postconditions. Admissibility of the frame rules in the system will also be discussed. ---------------------------------------------------------------------- Daisuke Kimura (National Institute of Informatics) Title: An Implementation of Cyclic Proof-Search in Separation Logic with Inductive Definitions Abstract: The entailment problem in separation logic is important for program verification. This talk presents a proof system for a fragment of separation logic with inductive definitions, whose proofs have cyclic graph structures. The system is sound for validity of entailments, and provides a decision procedure of entailment problem based on proof-search of its cyclic proofs. We implement this decision procedure, and report the results evaluating our decision procedure with benchmark files of SLCOMP14. ---------------------------------------------------------------------- Makoto Tatsuta (National Institute of Informatics) Title: Completeness of Cyclic Proofs for Symbolic Heaps Abstract: Separation logic is successful for software verification in both theory and practice. Decision procedure for symbolic heaps is one of key issues. This talk proposes a cyclic proof system for symbolic heaps with general form of inductive definitions, and discusses its soundness, completeness, and decidability. The decision procedure of entailments of symbolic heaps with inductive definitions is also discussed. Decidability of entailments of symbolic heaps with inductive definitions is an important question. Completeness of cyclic proof systems is also an important question. The results of this talk tries to answer both questions. The system is based on cyclic proof systems by Brotherston et al, and the bounded-treewidth inductive definitions by Iosif et al. In order for obtaining the completeness, some restrictions are added to inductive definitions, an entailment is extended to a multiple entailment which allows disjunction in the succeedent, and it introduces new predicates for describing whether a given address is in the heap or not. The inductive definitions under the restrictions are quite general, since they covers doubly-linked lists, nested lists, and skip lists. The main techniques are grouping for showing the local completeness of the rule of splitting separating conjunction, and normal form of multiple entailments, which has some upper bounds for both the number of disjuncts and the length of spatial parts. ---------------------------------------------------------------------- Stefano Berardi (Torino University) Title: Game Semantics and the Complexity of Interaction (about a result of Federico Aschieri) Abstract: We present a new abstract complexity result obtained by F. Aschieri about Coquand and Hyland-Ong game semantics, that will lead to new bounds on the length of first-order cut-elimination, normalization, interaction between expansion trees and any other dialogical process game semantics can model and apply to. In particular, Aschieri provides a novel method to bound the length of interactions between visible strategies and to measure precisely the tower of exponentials defining the worst-case complexity. This study improves the old estimates by possibly several exponentials and is based on Berardi-de'Liguoro notion of level of backtracking. ---------------------------------------------------------------------- 問合せ先　龍田 (tatsuta(a)nii.ac.jp)

1 0

SLS 2016：Vaught予想他
by Tanaka Kazuyuki 11 Jan '16

11 Jan '16

皆様冬の恒例行事となりました仙台ロジックスクールSLSを本年も下記の日程で開催致します。２０１６年１月２８日（木）～２９日（金）東北大学理学部青葉山キャンパス合同C棟１階多目的室（サイエンスホールでない方）備考：昨年１２月に地下鉄東西線が開通しましたので、仙台駅から青葉山駅まで１０分足らずで着き、会場の理学部合同C棟は青葉山駅を出てすぐの所にあります（１階にセブン・イレブンが見える建物）。今回は主なチュートリアルとして、カリフォルニア大学バークレー校のMontalban先生に、最近話題になっている「Vaught予想」への計算可能性理論からの取り組みについてご紹介いただくことになっています。また、シンガポール南洋大学の呉国華先生には、 automatic sequences と transcendence property についてご講演いただく予定です。この他にもいくつか研究発表などを計画しています。時間割の詳細などは、遅くなって申し訳ありませんが、１月２０日頃ウェブサイトでご案内致します。 http://www.sendailogic.com/SLS2016/index_J.html 講演会自体は無料ですが、会場や懇親会等の付加的準備の都合上、ご参加を予定される方は下記アドレスまで一言ご連絡くだされば幸いです。連絡先：sendailogicschool[at]gmail.com 尚、私は海外出張中のため、お問い合わせにはすぐお応えできないかもしれませんが、どうぞ悪しからず。広い分野から気楽なご参加をお待ちしております。田中一之

1 0

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 07 Dec '15

07 Dec '15

皆様，証明論研究集会とSLACSの講演申込みを有難うございました．暫定版プログラムなど詳しい情報はHP https://sites.google.com/site/ptslacs2015/ から御確認頂けたらと思います．現状で枠に若干の余裕が出来ましたので，埋まるまでの間は講演の募集を続けることとなりました．希望をされる方は申し込みを頂けますと幸いです．あと，都合により懇親会は月曜日に行うこととなりました．御不便をお掛けしますが，よろしくお願いいたします．佐々木克巳（南山大学）倉田俊彦（法政大学）

1 0

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 27 Nov '15

27 Nov '15

皆様，以前御連絡しました「証明論研究集会とSLACS」の案内を再送させて頂きます．題目などの情報は後から御連絡頂いても構いませんので，話題をお持ちの方はお気軽に申し込み頂けますと幸いです．よろしくお願いいたします．佐々木克巳（南山大学）倉田俊彦（法政大学） ------------------------------------- 2015年度の「証明論研究集会」と「記号論理と情報科学研究集会（SLACS）」について，合同開催の案内をメイルさせて頂きます．どちらの研究集会も数理論理学，計算の理論，情報科学などの理論・応用に関係する様々な話題が発表されていて研究者・学生の貴重な相互交流の場となっています．完成された研究のみならず発展途上の話題も大歓迎ですので，気軽に講演・参加を御検討下さい．開催日：2015年12月14日（月）〜16日（水）場所：南山大学名古屋キャンパスS棟(教室棟)7階S74教室世話役：佐々木克巳（南山大学）倉田俊彦（法政大学）詳細はHP https://sites.google.com/site/ptslacs2015/ をご覧頂けたらと思います．講演を希望される方は，御手数ですが ------------------------------------- 題目講演者名所属 e-mail アドレス概要講演時間懇親会参加希望その他の希望（講演日など） ------------------------------------- を pt.slacs2015(a)gmail.com までメイル下さい．申込の期限は12月04日（金）と設定していますので，よろしくお願いいたします．

1 0

春の学会、一般講演申込の締切
by ikeda＠hosei.ac.jp 21 Nov '15

21 Nov '15

数学基礎論および歴史分科会　会員の皆様、連絡責任評議員の池田です．２０１６年度年会（筑波大学，３月１６日−１９日）の一般講演申し込み締切は　　　　　　　　１１月２７日（金）となります。講演申込みを予定されている方は、何卒よろしくお願いいたします。池田宏一郎（連絡責任評議員，法政大学）

1 0

← Newer
1
...
36
37
38
39
40
41
42
...
60
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml