Logic-ml January 2018

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

4 participants
7 discussions

セミナー案内
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 koba＠kb.is.s.u-tokyo.ac.jp 28 May '18

28 May '18

＃複数受け取られましたらご容赦ください．東京大学の小林と申します．当研究室では現在，高階モデル検査（高階再帰スキームのモデル検査）とそのプログラム検証などへの応用をテーマとした研究を精力的に進めており，プロジェクトに携わる特任研究員を探しております．身近にご興味のある方がいらっしゃいましたら，10月20日までに小林 (koba(a)is.s.u-tokyo.ac.jp) までメールでお知らせいただければ幸いです。その際、できれば略歴および論文リスト（フォーマット自由）もメールに添えるかまたは郵送でお送りください。（後日、さらに詳細な資料をお願いする可能性があります）．募集の条件は概ね以下のとおりです。 ================ 着任時期：2018年4月（数ヵ月の前後は応相談）任期：年度単位の更新で、業績により最長2020年3月まで延長可能給与：月額38～45万円　　（大学の規定および本人の実績による．細かい条件は応相談.）研究テーマ：高階モデル検査（高階再帰スキームのモデル検査）および、そのプログラム検証やデータ圧縮、知識発見などへの応用。高階モデル検査については，プロジェクトのページ　　　http://www-kb.is.s.u-tokyo.ac.jp/~koba/hmc/ および下の参考文献をご覧ください。　　本プロジェクトは科学研究費補助金基盤研究(S)：　　　課題名：高階モデル検査の深化と発展　　　研究代表者：小林直樹（東京大学）　　　研究分担者：五十嵐淳（京都大学）、篠原歩（東北大学）　　の支援をいただいており、その補助金で研究員を雇用する予定です。条件： - 着任時に博士号を取得していること - 理論計算機科学全般に明るいこと． - 以下の中の１つ以上のトピックに詳しくプログラミング能力が高いか、　　　２つ以上のトピックに詳しいことモデル検査（特にソフトウェアモデル検査）型システムプログラム意味論プログラム解析・検証・変換オートマトンと形式言語理論自動定理証明　　　　　計算量理論 (可逆)データ圧縮技術自然言語処理ゲノムデータ解析問い合わせ先：　　小林直樹　　東京大学大学院情報理工学系研究科コンピュータ科学専攻　　〒113-0033 東京都文京区本郷7-3-1 　　Phone: 03-5841-4124 　　Fax: 03-5841-4114 　　email: koba(a)is.s.u-tokyo.ac.jp 参考文献の抜粋 ------------- 高階モデル検査の概要： Naoki Kobayashi, "Model Checking Higher-Order Programs", Journal of the ACM, 60(3), 2013. Naoki Kobayashi, "Higher-Order Model Checking: From Theory to Practice", Invited paper in Proceedings of LICS 2011. (A very brief survery of the field) 高階モデル検査/高階言語の理論： Naoki Kobayashi, Etienne Lozes, Florian Bruse, "On the relationship between higher-order recursion schemes and higher-order fixpoint logic", POPL 2017, pp.246-259, 2017 Kazuyuki Asada, Naoki Kobayashi, "Pumping Lemma for Higher-order Languages", ICALP 2017, 97:1-97:14, 2017. Ryoma Sinya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada, "Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence", FoSSaCS 2017, pp.53-68 プログラム検証への応用: Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno, "Predicate Abstraction and CEGAR for Higher-Order Model Checking", Proceedings of PLDI 2011, pp.222-233, 2011. Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno, "Temporal verification of higher-order functional programs", POPL 2016, pp.57-68 データ圧縮への応用: Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi, "Functional Programs as Compressed Data", Higher-Order and Symbolic Computation, 2(1), pp.39-84, 2012.

1 1

Talk by Silvia Ghilezan (1st Feb., 11:00-)
by Kazushige TERUI 31 Jan '18

31 Jan '18

皆様、直前の連絡になってしまい大変申し訳ありません。明日木曜日に、京都大学でSilvia Ghilezanさんの講演があります。詳細は以下のとおりです。どうぞご参加ください。京都大学数理解析研究所照井一成 ==================== Time: 11:00-12:00, 1st Feb., 2018 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: Silvia Ghilezan (University of Novi Sad, Mathematical Institute SASA, Serbia) Title: Types in logic, computation and concurrency - an overview Abstract: In this talk, we present an overview of results obtained for type systems of computational interpretations of intuitionistic and classical logic with applications to programming languages. We further present results obtained for type systems for concurrency and discuss the role of types in security, access control and privacy issues in these settings. ==================== ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

【参加募集】第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018）
by 安部達也 24 Jan '18

24 Jan '18

皆様千葉工業大学の安部です． 3月5日(月)～7日(水)に，鳥取県米子市で開催される，第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) の参加登録を開始いたしましたので，ご案内いたします．多くの方々のご参加をお待ちしております．参加登録の締切は2月16日(金)です．どうぞお早めのご登録をお願い致します．また，カテゴリ3(ポスター・デモ発表)の発表申込締切が2月5日(月)17:00(JST) となっております．こちらの投稿もあわせてご検討ください． -------------------------------------------------------------------------- 第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018） https://jssst-ppl.org/workshop/2018/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)～3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2018/registration.html 参加登録締切：2018年2月16日(金) 問い合わせ先： ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] 上野雄大 (東北大) 鵜川始陽 (高知工科大) 海野広志 (筑波大学) 江本健斗 (九州工業大) 勝股審也 (NII) 河内谷清久仁 (日本IBM) 倉光君郎 (横浜国立大) 光来健一 (九州工業大) 櫻井孝平 (金沢大) 笹田耕一 (クックパッド) 新屋良磨 (秋田大学) 澄川靖信 (東京理科大) 田辺良則 (鶴見大) 対馬かなえ (NII) 土屋達弘 (大阪大) 鍋島英知 (山梨大) 浜名誠 (群馬大) 星野直彦 (京都大) 堀江倫大 (日本IBM) 前田敦司 (筑波大) 増原英彦 (東京工業大) 松田一孝 (東北大) 南出靖彦 (東京工業大) 森畑明昌 (東京大学) 結縁祥治 (名古屋大) ・組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] ================================================================

1 0

Talk by Bakh Khoussainov (25 Jan, 11.00-)
by Kazushige TERUI 20 Jan '18

20 Jan '18

みなさま来週木曜日に京都大学にてBakh Khoussainovさんによる講演があります。詳細は下記の通りです。よろしければご参加ください。京都大学数理解析研究所照井一成 ========== Time: 11:00-12:00, 25 Jan, 2018 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: Bakh Khoussainov (University of Auckland) Title: Finitely presented expansions of semigroups, algebras, and groups. Abstract: Finitely presented algebraic systems, such as groups and semigroups, are of foundational interest in algebra and computation. Finitely presented algebraic systems necessarily have a computably enumerable (c.e. for short) word equality problem and these systems are finitely generated. Call finitely generated algebraic systems with a c.e. word equality problem computably enumerable. Computably enumerable finitely generated algebraic systems are not necessarily finitely presented. This paper is concerned with finding finitely presented expansions of finitely generated c.e. algebraic systems. The method of expansions of algebraic systems, such as turning groups into rings or distinguishing elements in the underlying algebraic systems, is an important method used in algebra, model theory, and in various areas of theoretical computer science. Bergstra and Tucker proved that all c.e. algebraic systems with decidable word problem possess finitely presented expansions. Then they, and, independently, Goncharov asked if every finitely generated c.e. algebraic system has a finitely presented expansion. We build examples of finitely generated c.e. semigroups, groups, and algebras that fail to possess finitely presented expansions, thus answering the question of Bergstra-Tucker and Goncharov for the classes of semigroups, groups and algebras. We also construct an example of a residually finite, infinite, and algorithmically finite group, thus answering the question of Miasnikov and Osin. Our constructions are based on the interplay between key concepts and known results from computability theory (such as simple and immune sets) and algebra (such as residual finiteness and the theorem of Golod-Shafaverevich). The work is joint with D. Hirschfeldt and A. Miasnikov. ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

“Lambek Calculus and Linear Logic” Meeting　（１月２５日、慶応大三田キャンパス）のお知らせ
by Mitsu Okada 17 Jan '18

17 Jan '18

“Lambek Calculus and Linear Logic” Meeting　（１月２５日、慶応大三田キャンパス）国立情報学研究所教授金沢誠先生、ペンシルバニア大学数学科及び計算機科学科教授Andre Scedrov先生、リヨン大学哲学科教授Jean-Baptiste Joinet先生先生をお招きして、Lambek Calculus 及びLogic & Computationに関する次のようなミニ・シンポジウム形式集会を開催いたします。事前登録なし、参加自由です。 https://abelard.flet.keio.ac.jp/seminar/lambak_calculs.html なお１月１９日（金）―２０日（土）”Philosophy of Logic & Mathematics” Workshopの確定プログラムを https://abelard.flet.keio.ac.jp/seminar/frjp18jan.htmlに上げました。日時・会場日時:Jan. 25th, Thurs. 2018 / 2018年1月25日(木) 15:30 - 18:30 場所:8F, East Building, Mita Campus of Keio University / 慶應義塾大学三田キャンパス東館8階ホール Building #3 on this map. / キャンパスマップ3番の建物です。招待講演者/ Speakers •Jean-Baptiste Joinet教授(リヨン第3大学哲学科・パリ高等師範学校カバイエス研究センター) •Makoto Kanazawa/金沢誠教授(国立情報学研究所NII) •Andre Scedrov教授(ペンシルバニア大学数学科および計算機科学科）プログラム（アブストラクトは、 https://abelard.flet.keio.ac.jp/seminar/lambak_calculs.html を参照ください。） •15:20 Registration •15:30-16:30 Jean-Baptiste Joinet (リヨン第3大学哲学科・パリ高等師範学校カバイエス研究所)“Logic and Dialectical Time” •16:30-17:30 Andre Scedrov (ペンシルバニア大学数学科および計算機科学科）“Lambek Calculus Extended with Bracket and Subexponential Modalities” •17:30-18:30 Makoto Kanazawa (国立情報学研究所NII)“On the Recognizing Power of the Lambek Calculus with Brackets” 共催 •慶應義塾大学論理と感性のグローバル研究センター同大学•次世代研究推進プロジェクト •CNRS(フランス) 問い合わせ先：東京都港区三田２－１５－４５文学部岡田光弘研究室 logic(a)abelard.flet.keio.ac.jp --------------------------------------------------------------------

1 0

[最終CFP] Bx 2018: 7th International Workshop on Bidirectional Transformations (投稿締切：1月19日)
by Kazutaka Matsuda 05 Jan '18

05 Jan '18

皆様，東北大学の松田です．投稿〆切（1月19日）が近づいてまいりましたので， <Programming> 2018併設の双方向変換に関する国際ワークショップBx 2018の案内を再々度御送りいたします．どうぞ，投稿をご検討いただけますと幸いです． ----------------------------------------------------------------------------- FINAL CALL FOR PAPERS ===================== Bx 2018: 7th International Workshop on Bidirectional Transformations Nice, France (co-located with <Programming> 2018) https://2018.programming-conference.org/track/bx-2018-papers ---------------------------------------------------------------------- *NOTE: Deadline (Jan. 19) approaching!* 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 2018 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. IMPORTANT DATES --------------- - Paper submission: Jan. 19, 2018 - Author notification: Feb. 17, 2018 - Workshop: Apr. 10, 2018 AIM & TOPICS ------------ The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support PAPER CATEGORIES ---------------- The BX 2018 program committee considers five categories of submissions: - Full Research Papers (up to 10 pages) * in-depth presentations of novel concepts and results * applications of bx to new domains * survey papers providing novel comparisons between existing bx technologies and approaches case studies - Tool Papers (up to 6 pages) * guideline papers presenting best practices for employing a specific bx approach (with a specific tool) * presentation of new tools or substantial improvements to existing ones * qualitative and/or quantitative comparisons of applying different bx approaches and tools - Experience Report (up to 4 pages) * sharing experiences and lessons learned with bx tools/frameworks/languages * how bx is used in (research/industrial/educational) projects - Extended Abstracts (up to 3 pages) * work in progress * small focused contributions * position papers and research perspectives * critical questions and challenges for bx - Talk Proposals (up to 2 pages) * proposed lectures about topics of interest for bx * existing work representing relevant contributions for bx * promising contributions that are not mature enough to be proposed as papers of the other categories All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers. Talk proposals are expected to present works of particular interest for the community and that are worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g. via Share - http://share20.eu) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. PROCEEDINGS ----------- The workshop proceedings, including all accepted papers (except talk proposals), will be published as International Conference Proceedings Series in the ACM Digital Library before the workshop. SUBMISSION GUIDELINE -------------------- Submission site: https://easychair.org/conferences/?conf=bx2018 Submissions should use the ACM Conference acmart Format with the ‘sigconf’ option (http://www.acm.org/publications/proceedings-template) with a font size of 10 point and the font family Times New Roman. All submissions should be in PDF format. If you use LaTeX or Word, please use the provided ACM acmart templates. Otherwise, please follow the ACM author instructions. If you are formatting your paper using LaTeX, you will need to set the 10pt option in the \documentclass command. If you are formatting your paper using Word, you may wish to use the provided Word template that supports this font size. Please include page numbers in your submission for review using the LaTeX command \settopmatter{printfolios=true} (see examples in template). Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible. Submissions not complying with the above guidelines may be excluded from the reviewing process without further notice. If a paper is accepted, at least one author of the paper is expected to participate in the workshop to present it. Authors of accepted tool papers are also expected to be available to demonstrate their tool at the event. PROGRAM COMMITTEE MEMBERS ------------------------- Jens Weber (University of Victoria, co-chair) Kazutaka Matsuda (Tohoku Universiy, co-chair) Anthony Anjorin (University of Paderborn) James Cheney (University of Edinburgh) Anthony Cleve (University of Namur) Alcino Cunha (University of Minho and INESC TEC) Zinovy Diskin (McMaster University) Romina Eramo (University of L’Aquila) Jeremy Gibbons (University of Oxford) Holger Giese (Potsdam University) Boris Glavic (Illinois Institute of Technology) Martin Gogolla (University of Bremen) Soichiro Hidaka (Hosei University) Zhenjiang Hu (National Institute of Informatics) Michael Johnson (Macquarie University) Ekkart Kindler (Technical University of Denmark) Erhan Leblebici (TU Darmstadt) Fernando Orejas (Universitat Politècnica de Catalunya) Hugo Pacheco (University of Minho) Richard Paige (University of York) Arend Rensink (University of Twente) Andy Schürr (TU Darmstadt) Perdita Stevens (University of Edinburgh) James Terwilliger Janis Voigtländer (University of Duisburg-Essen) Meng Wang (University of Bristol) Bernhard Westfechtel (University of Bayreuth)

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml January 2018