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

【投稿〆切せまる：概要5/9，論文5/16】CFP: PPDP2016
by Kazutaka Matsuda 02 May '16

02 May '16

logic-ml関係者の皆様，東北大学の松田です．複数受け取られた場合はご容赦ください．投稿〆切が近付いてまいりましたので，イギリスのエジンバラにて9/5〜9/7で開催されます宣言的プログラミングに関する国際会議 PPDP 2016 の論文募集のご案内を再度お送りいたします．投稿〆切はアブストラクト：　5月9日論文：　　　　　　5月16日となっております．どうぞ論文の投稿をご検討いただけますと幸いです． ====================================================================== Second call for papers 18th International Symposium on Principles and Practice of Declarative Programming PPDP 2016 Special Issue of Science of Computer Programming (SCP) Edinburgh, UK, September 5-7, 2016 (co-located with LOPSTR and SAS) http://ppdp16.webs.upv.es/ ====================================================================== SUBMISSION DEADLINE: 9 MAY (abstracts) / 16 MAY (papers) ---------------------------------------------------------------------- INVITED SPEAKERS Elvira Albert, Complutense University of Madrid, Spain ---------------------------------------------------------------------- PPDP 2016 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modeling in a declarative language and modeling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 26th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) and the 23rd Static Analysis Symposium (SAS 2016). The conference will be held in Edinburgh, UK. Previous symposia were held at Siena (Italy), Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). You might have a look at the contents of past PPDP symposia, http://sites.google.com/site/ppdpconf/ Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2017. Important Dates Abstract submission: 9 May, 2016 Paper submission: 16 May, 2016 Notification: 20 June, 2016 Final version of papers: 17 July, 2016 Symposium: 5-7 September, 2016 Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted to the submission website for PPDP 2016. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist the program committee in selecting appropriate reviewers for the paper. Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Program Committee Sandra Alves, University of Porto, Portugal Zena M. Ariola, University of Oregon, USA Kenichi Asai, Ochanomizu University, Japan Dariusz Biernacki, University of Wroclaw, Poland Rafael Caballero, Complutense University of Madrid, Spain Iliano Cervesato, Carnegie Mellon University Marina De Vos, University of Bath, UK Agostino Dovier, Universita degli Studi di Udine, Italy Maribel Fernandez, King's College London, UK John Gallagher, Roskilde University, Denmark, and IMDEA Software Institute, Spain Michael Hanus, CAU Kiel, Germany Martin Hofmann, LMU Munchen, Germany Gerda Janssens, KU Leuven, Belgium Kazutaka Matsuda, Tohoku University, Japan Fred Mesnard, Universite de la Reunion, France Emilia Oikarinen, Finnish Institute of Occupational Health, Finland Alberto Pettorossi, Universita di Roma Tor Vergata, Italy Tom Schrijvers, KU Leuven, Belgium Josep Silva, Universitat Politecnica de Valencia, Spain Perdita Stevens, University of Edinburgh, UK Peter Thiemann, Universitat Freiburg, Germany Frank D. Valencia, CNRS-LIX Ecole Polytechnique de Paris, France, and Pontificia Universidad Javeriana de Cali, Colombia German Vidal, Universitat Politecnica de Valencia, Spain (Program Chair) Stephanie Weirich, University of Pennsylvania, USA Program Chair German Vidal Universitat Politecnica de Valencia Camino de Vera, S/N E-46022 Valencia, Spain Email: gvidal(a)dsic.upv.es Organizing committee James Cheney (University of Edinburgh, Local Organizer) Moreno Falaschi (University of Siena, Italy) ----------------------------------------------------------------------

1 0

ワークショップ「証明論的意味論の最前線」のお知らせ
by Shunsuke Yatabe 01 May '16

01 May '16

皆様このたび、5月8（日）に、東京・慶応大学において、以下の要領で論理学の哲学に関するワークショップを開催することになりましたので、ご案内申し上げます。 ******************************************************************** 応用哲学会WSワークショップ「証明論的意味論の最前線」日時：5月8日（日）15:30-17:30 場所：慶應義塾大学三田キャンパス１０２教室（D会場）応用哲学会2016年度大会において行われます <http://www.jacap.org/events/jacap2016.html> http://www.jacap.org/events/jacap2016.html 発表者：五十嵐涼介、鈴木右京、矢田部俊介ワークショップ証明論的意味論の最前線証明論的意味論は、意味の使用説および推論主義に影響を受け、論理結合子の意味はその導入規則と除去規則によって与えられると考える論理学の哲学上の立場である。通常よく使われるモデル論的な意味論と異なり、推論規則自身が論理結合子の意味を与えるとみなす立場は、計算機科学における帰納的データ型の考え方などと親和性も高く、近年、広く研究されるようになってきた。かつては、ダメットらが証明論的意味論で正当化できるのは直観主義論理であり、その点で直観主義論理は古典論理と比べてアドバンテージを持つと論じていたが、ラムフィットらの古典論理も同じ枠組みで正当化できるのではないかという研究も登場した。同時に、多くの非古典論理の体系についても、この枠組みから意味論を与える研究が行われている。本WS では、この話題に関し、導入的な説明を行うとともに、以下の二つのラムフィットに関連する先端的な研究を紹介し、現在の証明論的意味論研究の最前線と、その哲学的意義を検討する。（１）双側面説・古典論理・否認の価値（鈴木右京） PTS （証明論的意味論）とは、自然演繹における導入規則、及び除去規則を利用して、論理結合子の意味を説明するとともに、一定の論理体系を正当化しようとするプログラムのことを指す。ダメットやプラヴィッツによって唱導されてきた従来型の PTS は、直観主義論理のみを対象としたものであったが、ラムフィットは、従来の主張だけを基礎的言語行為と認めるやり方ではなく、否認も文の意味決定に参入する双側面説の立場を取れば、古典論理を含む体系 BCLにPTSを与えることができると論じた。本発表では、BCLが含む「協調規則」について論じる。協調規則は、文の意味の定め方に対する要請、主張条件と否認条件が適切に関係していると言えるための条件として解釈すべきである。そのため、協調規則を設定するなら、なぜ文の意味の定め方に特定の要請が課せられるのか正当化しなければならない。BCL の協調規則のうち、無矛盾則とマイナスの帰謬法についてはこれが可能であるが、プラスの帰謬法については一定の困難がある。双側面説に加えて反証主義の立場を取ることで、プラスの帰謬法を認めることができる。（２）符号付き自然演繹を用いた否定概念の分析（五十嵐涼介）これまで多くの研究者が古典的否定、直観主義否定を始めとした様々な否定概念の差異および関係の分析を行なってきた（cf. Dunn; 1999, Shramko; 2005, Ripley 2009) 。これらの研究は主にモデル論的な観点から成されており、可能世界意味論および両立不可能性関係などの道具立てを用いて、多様な否定概念を統一的に扱っている。ところで近年、鈴木 (2015) はRumfitt(2000) において提示された符号付き自然演繹の体系を発展させ、古典論理に対して証明論的意味論の立場からより適切な正当化を与えた。本研究はこの結果を発展させ、否定概念を分析するための統一的な枠組みを与えることを目的としている。本研究は以下のような着想に基づいている。証明論的意味論の立場から様々な論理体系を統一的に扱う枠組みとしては、Dosen (1989) およびSambin et al (2000) のものがあるが、彼らはシークエント計算を用いた上で、推論規則を論理結合子の振舞いを記述する操作規則と、メタレベルの構造の関係を記述する構造規則の区別に着目した。操作規則は論理規則の定義そのもであるため、すべての体系を通じて同一である。その上で、各々の体系はどの構造規則を採用するかによって特徴付けられる。Rumfitt (2000) および鈴木 (2015) の体系も同様に、論理結合子の定義にあたる操作規則と、符号同士の関係を一般的に定めるところの協調規則を持つ。本研究では、各々の協調規則がそれぞれどのような否定概念（および論理体系）に対応するのかを明かにし、同時にそれらに対する証明論的意味論の立場からの直観的な解釈を行う。参考文献 Rummfitt, I. (2000). Yes'and `No',' Mind,109,436 781-823. (2007). `Assertingand excluding: Steps towards an anti-realist account of classical consequence,'in Auxier, R. & Hahn, L. eds. The Philosophy of Michael Dummett: Open CourtPub Co, 639-693.

1 0

応用哲学会サテライト研究会「論数哲2016」のお知らせ
by Shunsuke Yatabe 01 May '16

01 May '16

皆様、このたび、5月6日（金）に、応用哲学会第8回研究大会（2016）のサテライト研究会として、東京・お茶の水女子大学において、以下の要領で論理学と数学の哲学に関する研究会を開催することになりましたので、ご案内申し上げます。 ******************************************************************** 応用哲学会第8回研究大会（2016）サテライト研究会「論数哲2016」日時：5月6日（金）13:00-17:50 場所：お茶の水女子大学理学部３号館２Ｆ会議室（以下の地図の建物20） http://www.ocha.ac.jp/help/campusmap_l.html <http://www.ocha.ac.jp/access/campusmap_l.html> 東京都文京区大塚2-1-1 丸ノ内線茗荷谷駅徒歩7分、または有楽町線護国寺駅徒歩7分）備考：お茶の水女子大学に入構する際には、守衛所にて身分証明書の提示を求められます。＊終了後には懇親会を予定しています。【講演者・スケジュール】 1. 小山田圭一（東京工業大学） - 講演：13:00-14:00 題目：名辞・概念・対象の意味論的関係に基づく新しい論理体系について - 要旨：本発表では、名辞・概念・対象の意味論的関係を反映した内包的論理の新しい体系を提示する。提示される体系の意味論では、可能世界意味論に基づく内包的論理の体系では扱うことができない古典的な意味での内包や外延を定義することができる。また、「２は最小の素数である」のような数学的命題を必然的なものとした場合、可能世界意味論を用いた理論では、「２」の内包と「最小の素数」の内包を区別できないことになってしまうが（この取り扱いは、例えば「２は最小の素数である」を綜合命題としながらその必然性を認める立場を排除してしまう）、我々が導入する体系はその区別を可能にするものであることが示される。さらに、新しい意味論における完全性定理など、いくつかの結果についても概観される。 - 質疑応答：14:00-14:30 2. 大森仁（京都大学） - 講演：14:40-15:40 題目：Towards a unification of paraconsistent logics - 概要： Paraconsistent logics are characterized by the failure of *ex contradictione quodlibet* (ECQ hereafter). Since the modern birth of paraconsistency, infinitely many systems of paraconsistent logic have been devised and studied based on various motivations. After all, it seems that paraconsistent logics are only loosely connected to each other by a rather general requirement that ECQ should be invalid. But is it really impossible to unify paraconsistent logics? The purpose of the paper is to explore that possibility. The paper aims at the following claim: paraconsistent negations of the four-valued logic of Nuel Belnap and Michael Dunn and the three-valued logic known as the Logic of Paradox, developed by Graham Priest, are at the core of paraconsistency. Different systems of paraconsistent logic can then be classified by the additional connectives and their semantics. The first half of the paper discusses the classification. In the second half of the paper, we address the question as to whether we can include Jaskowski’s discussive logic in this picture. We show that there is an affirmative answer to this question. - 質疑応答：15:40-16:10 3. 山森真衣子（京都大学） - 講演：16:20-16:50 題名「語り得ぬもの」のパラドクス講演要旨「語り得ぬもの」という語は古今東西を問わず様々な思想で立ち現れてきた概念である。しかし広く知られているように、この概念は矛盾を惹起する。というのも、「xは語り得ぬものである」と言ったとき、xは当の「語り得ぬものである」という語によって事実語られてしまうため、「xは語り得ぬものである、かつ、語り得ぬものではない」が導かれてしまうからだ。このパラドクスを解消して「語り得ぬもの」を無矛盾に使用しようとしてきた人々もあったが、彼らの試みは失敗に終わっている。その理由として、一つには、彼らはこのパラドクスがなぜ生じるのかということに、すなわちパラドクスのメカニズムにあまり注目してこなかったことが挙げられよう。本発表は、このパラドクスのメカニズムにフォーカスを当てるものである。 - 質疑応答：16:50-17:20 4. 福田陽介（京都大学） - 講演：17:30-18:00 Title: Lambda Calculus for Classical Logic and Bilateralism in Proof-Theoretic Semantics - Abstract: The Curry-Howard isomorphism is a notion which expresses the correspondence between mathematical proofs and computer programs. It is also known as "propositions-as-types" or "proofs-as-programs": propositions corresponds to types (which are restrictions for programs as Russell used for his theory in order to overcome the Russell's paradox); proofs corresponds to programs since some kind of programming language can be seen as realizability interpretation models of constructive logic. Thanks to the isomorphism, we can clarify what notions are common, and what notions essentially belong in part of logic or part of computation. In this talk, two parts will be given. Firstly, I will introduce a well-known isomorphism, which was originally found by Griffin, between a lambda calculus (a programming language) and a classical natural deduction. Secondly, I will discuss similarities and dissimilarities between such calculi for classical logic and bilateralism in proof-theoretic semantics. - 質疑応答：18:00-18:30 オーガナイザー：五十嵐涼介、矢田部俊介

1 0

CFP: 日本ソフトウェア科学会第33回大会
by KIKUCHI Kentaro 28 Apr '16

28 Apr '16

(重複して受け取られた場合は御容赦ください) 皆様、東北大学の菊池健太郎と申します。 9月に東北大学片平キャンパスにて開催されます日本ソフトウェア科学会第33回大会の開催案内・参加募集をお送りいたします。理論的な話題も歓迎(昨年は中澤先生のご発表が「高橋奨励賞」を受賞されました)ですので、是非発表申込をご検討いただければ幸いです。どうぞよろしくお願いいたします。 --- 東北大学電気通信研究所菊池健太郎 (kentaro(a)nue.riec.tohoku.ac.jp) ------------------------------------------------------------------------ 日本ソフトウェア科学会第33回大会開催案内・参加募集 http://jssst2016.wordpress.com/ 日時：2016年9月6日(火)〜9日(金) (6日(火)はプレイベント) 会場：東北大学片平キャンパス (〒980-8577 仙台市青葉区片平2-1-1) 今年も一般セッション，研究会セッション，ソフトウェア論文セッションにおける登壇発表，ならびにデモ・ポスター発表の場が用意されています．予稿の共著者に会員が含まれていれば非会員でも登壇発表できますので，是非，発表をご検討ください．未来のソフトウェアとそれを支えるソフトウェア科学に関する活発な議論を期待しております． ■開設セッション 1. 一般セッション：ソフトウェア科学全般についての発表の場です． 2. 研究会セッション：研究会と連携した企画による発表の場です．・プログラミング論研究会 (PPL) ・ソフトウェア工学の基礎研究会 (FOSE) ・実践的IT教育研究会 (rePiT) 3. ソフトウェア論文セッション：先進的なアイデアを実現したソフトウェアの成果発表の場です．ソフトウェア論文特集号への投稿を前提としたメンタリングを受けることができます． 4. デモ・ポスターセッション：研究アイデアやそれを実現したソフトウェアの紹介と議論の場です．予稿なしで発表することができます．上記以外にも，招待講演，特別講演(トップコンファレンス採択論文の著者による講演)，FTDなどを予定しています． ■投稿に関する日程・一般セッション，研究会セッション，ソフトウェア論文セッション　発表申込締切： 2016年7月8日(金) 　予稿原稿締切： 2016年8月5日(金) ・デモ・ポスター発表　発表申込締切： 2016年8月23日(火) 　(デモ・ポスターに予稿はありません） ■発表申込要領予稿の共著者(デモ・ポスターセッションの場合は発表者)に少なくとも1名の正会員，学生会員または名誉会員が含まれている必要があります．ただし，発表申込時に入会手続中の場合も含みます．予稿はEasyChairシステムを使ってPDFファイルで提出してください．詳しい予稿作成要領は大会ホームページでお知らせします． ■学会誌への同時投稿登壇発表の予稿は通常論文として学会誌に同時投稿できます．大会発表で得られたコメントを反映した上での大会後投稿も可能です．詳細は，大会ホームページに掲載される大会同時投稿要領をご覧ください． ■大会組織大会委員長：大堀淳 (東北大学) 運営委員長：上野雄大 (東北大学) プログラム委員長：光来健一 (九州工業大学) プログラム副委員長：松崎公紀 (高知工科大学) 広報委員長：山田浩史 (東京農工大学)

1 0

Talk by Cho Kenta (Nijmegen), Tue 10 May
by Takumi Akazaki 27 Apr '16

27 Apr '16

皆様, (重複して受け取られた方はご容赦ください) 東京大学蓮尾研の赤崎と申します。以下の要領で, 再来週の火曜日に、Nijmegenの長健太さんをお招きして講演をしていただきます。ぜひご参加くださいませ。日時: 5月10日 13:00-15:00 場所: 東京大学理学部７号館214教室 ----------- Tue 10 May 2016, 13:00–15:00 理学部7号館214 Room 214, School of Science Bldg. No. 7 Kenta Cho <https://www.google.com/url?q=http://www.cs.ru.nl/K.Cho/&sa=D&ust=1461640002…> (Inst. of Comp. & Info. Sci., Radboud University), Von Neumann algebras from a logical / categorical perspective Many researches at the Nijmegen group involve von Neumann algebras, which are now important not only in quantum physics but also in the context of quantum computation and information. I plan to talk about: 1) basics of von Neumann algebras and quantum theory; 2) von Neumann algebras in effectus theory (a categorical approach to quantum computation and logic); 3) von Neumann algebras as a (categorical, denotational) model of the quantum lambda calculus. -- /_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/ Dept. of Computer Science Graduate School of Information Science and Technology The University of Tokyo Akazaki Takumi mail :<ultraredrays(a)gmail.com> mobile : <090-5379-4901> /_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/

1 0

Deadline Extension: ATVA 2016 (14th Int'l Symp. on Automated Technology for Verification and Analysis)
by Takashi Kitamura 25 Apr '16

25 Apr '16

--------------------------------------------------- CALL FOR PAPERS 14th International Symposium on Automated Technology for Verification and Analysis (ATVA 2016) Chiba, Japan, October 17-19th, 2016 http://atva2016.gforge.inria.fr/ --------------------------------------------------- *** Deadline for paper submission has been extended *** Abstract due: May 7 (extended) Paper due: May 11 (extended) -------------------------------------------------- === Automated Technology for Verification and Analysis (ATVA) 2016 === --- Springer LNCS proceedings --- --- Special issue in "Formal Methods in System Design" (Springer) --- http://atva2016.gforge.inria.fr/ The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The previous events were held in Taiwan - 2003-5, Beijing - 2006, Tokyo - 2007, Seoul - 2008, Macao - 2009, Singapore - 2010, Taiwan - 2011, Thiruvananthapuram - 2012, Hanoi - 2013, Sydney - 2014, and Shanghai - 2015. Scope ATVA 2016 solicits high quality submissions in areas related to the theory and practice of automated analysis and verification of hardware and software systems. Topics of interest include, but are not limited to: * Formalisms for modeling hardware, software and embedded systems * Specification and verification of finite-state, infinite-state and parameterized system * Program analysis and software verification * Analysis and verification of hardware circuits, systems-on-chip and embedded systems * Analysis of real-time, hybrid, priced/weighted and probabilistic systems * Deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification * Analytical techniques for safety, security, and dependability * Testing and runtime analysis based on verification technology * Analysis and verification of parallel and concurrent hardware/software systems * Verification in industrial practice * Applications and case studies Theory papers should preferably be motivated by practical problems, and applications should be based on sound theory and should solve problems of practical interest. Submission ATVA invites research contributions in two categories: * Regular research papers (with 16 pages page limit, including references) * Tool papers (with 5 pages page limit, not counting references) Contributions must be written in English and in LNCS format, and must present original research that is unpublished and not submitted elsewhere (conferences or journals). The proceedings of ATVA 2016 will be published by Springer as a volume in the series of Lecture Notes in Computer Science (LNCS). For formatting instructions, see: http://www.springer.de/comp/lncs/authors.html PDF versions of the papers should be submitted to EasyChair: https://easychair.org/conferences/?conf=atva2016 Proofs and details omitted due to space constraints may be put in an appendix. Any such additional material will be read by reviewers/program committee members at their discretion. Authors are therefore urged to include details necessary for evaluation of the technical merit of their work within the prescribed page limits. Tool papers must include information about a URL from where the tool can be downloaded or accessed on-line for evaluation. The URL must also contain a set of examples, and a user's manual that describes usage of the tool through examples. In case the tool needs to be downloaded and installed, the URL must also contain a document clearly giving instructions for installation of the tool on Linux/Windows/MacOS. Accepted papers in both categories will be published by Springer as a LNCS volume. At least one author of each accepted paper must also register for the conference and present the paper. Selected papers will be invited for a publication in Formal Methods in System Design, published by Springer. Important Dates: Abstract due: May 7 (extended) Paper due: May 11 (extended) Notification: June 13 Invited Speakers for keynotes and tutorials Masahiro Fujita Javier Esparza Tevfik Bultan Programme Committee Co-Chairs Cyrille Artho Axel Legay Doron Peled Publicity Chair Takashi Kitamura (AIST, Japan) Local Chairs Mitsuharu Yamamoto (Chiba University, Japan) Yoshinori Tanabe (Tsurumi University, Japan) Programme Committee Toshiaki Aoki Cyrille Artho Christel Baier Armin Biere Tevfik Bultan Franck Cassez Krishnendu Chaterjee Allesandro Cimatti Rance Cleaveland Deepak D'Souza Allen Emerson Bernd Finkbeiner Radu Grosu Klaus Havelund Marieke Huisman Ralf Huuck Moonzoo Kim Marta Kwiatkowska Kim Larsen Axel Legay Tiziana Margaria Madhavan Mukund Anca Muscholl Doron Peled Andreas Podelski Geguang Pu Sven Schewe Oleg Sokolsky Marielle Stoelinga Bow-Yaw Wang Chao Wang Farn Wang Wang Yi Naijun Zhan Lijun Zhang Huibiao Zhu Contact atva2016-info(a)lists.gforge.inria.fr

1 0

数学基礎論若手の会2016のご案内
by Kenshi Miyabe 22 Apr '16

22 Apr '16

（重複して受け取られた場合はご容赦ください）皆様，明治大学の宮部賢志です． 2016年度の数学基礎論若手の会の幹事をさせていただきます．日程と場所だけ決めましたので，お知らせいたします． ===== 数学基礎論若手の会2016 日時：2016年10月21日(金)午後〜23日(日)午前場所：明治大学清里セミナーハウス住所：〒407-0301 山梨県北杜市高根町清里3545-1 数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．詳細は以下のウェブサイトをごらんください． http://kenshi.miyabe.name/wakate2016/ 講演および参加の募集は9月頃にもう一度案内いたします． ===== 宮部 -- Kenshi Miyabe email (research) : research(a)kenshi.miyabe.name email (other) : miyabe(a)meiji.ac.jp Senior Assistant Professor Department of Mathematics School of Science and Technology Meiji University Tel: +81-44-934-7460

1 0

第二十七回 ALGI（代数，論理，幾何と情報科学研究集会）の講演募集のお知らせ
by 西澤弘毅 21 Apr '16

21 Apr '16

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。第二十七回 ALGI（代数，論理，幾何と情報科学研究集会）の開催のお知らせと講演の募集をさせていただきます。 **************************************************************** * 第二十七回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2016年8月27日（土）午後～8月28日（日） * * 信州大学松本キャンパス人文学部・経法学部新棟1階第1講義室 * * * * 開催のお知らせと講演の募集 * **************************************************************** < 重複してお受け取りの節はご容赦願います。> ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。 ALGIの趣旨や過去の集会の情報がウェブページ http://sakura.imi.kyushu-u.ac.jp/algi/ にありますので、参考までに御覧ください。このたび、第二十七回ALGIを開催することになりました。会場の手配などは信州大学の田中康平先生にお願いしています。開催場所は下記のとおりです。信州大学松本キャンパス人文学部・経法学部新棟1階第1講義室 http://www.shinshu-u.ac.jp/guidance/maps/map05.html http://www.shinshu-u.ac.jp/general/extension-courses/pdf/map01-02.pdf 講演を希望される方は、・題目・講演者名・e-mail address ・所属・梗概・希望時間・講演に必要な道具などの情報を nishizawa(a)kanagawa-u.ac.jp までお寄せください。「講演したいと思っている」程度の不完全情報でも結構です。時間の空きがある限り、開催直前まで講演申込を受け付けるつもりですが、申込順に発表時間を割り当てていきますので、講演をお考えの方は、なるべくお早めにお知らせいただけますようにお願い致します。初日は午後から開催いたします。夕方には松本駅周辺で懇親会を計画しています。二日目には代数トポロジーのチュートリアル講演を予定しております。今回のALGIの前後には次のような集会も予定されています。併せて参加をご検討下さい。 2016年度 SLACS(記号論理と情報科学研究集会) 日時：2016年8月25日(木),26日(金) 会場：名古屋大学VBL(ベンチャービジネスラボラトリー)3階ベンチャーホール詳細：http://www.seto.nanzan-u.ac.jp/~sasaki/SLACS2016.html 「空間の代数的・幾何的モデルとその周辺」日時：2016年8月29日（月）午後〜 8月31日（水）午前会場：信州大学理学部講義棟第一講義室詳細：決まり次第アナウンス予定 ALGIは申し込み不要で自由にご参加いただけます。ただし懇親会については事前に詳細を告知し参加申し込みを受け付けます。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。西澤弘毅（神奈川大学工学部）古澤仁（鹿児島大学大学院理工学研究科） ----------------------------------------------------------- -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

1 0

数学基礎論とその応用
by Makoto Kikuchi 14 Apr '16

14 Apr '16

皆様，以下の要領で数学基礎論全体の研究集会を予定しています．名称：数学基礎論とその応用期間：2016年9月26日（午前）〜29日（木）午後場所：京都大学数理解析研究所今回の集会は全て1時間の招待講演とし，一般の講演募集はしません．午前は日本語による概論的な講演，午後は英語による最近の研究成果の紹介となる予定です．プログラムの詳細は改めてご連絡します．よろしくお願いします．神戸大学　菊池誠

1 0

AWPL-TPLC 2016 and Workshop on Williamson’s Philosoph
by 小野寛晰 13 Apr '16

13 Apr '16

　　　　　　　　　　　The Joint Conference of The 3rd Asian Workshop on Philosophical Logic (AWPL 2016) & The 3rd Taiwan Philosophical Logic Colloquium (TPLC 2016) Call for Papers 5 (Wed.) - 8 (Sat.) October, 2016 The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, Taipei, Taiwan http://www.philo.ntu.edu.tw/lmmgroup/ We are pleased to invite you to submit an abstract of contributed talk to the Joint Conference of AWPL-TPLC 2016. Deadline of the submission: 31 May, 2016. DESCRIPTION OF THE JOINT CONFERENCE This is a joint conference of the Third Asian Workshop on Philosophical Logic (AWPL-2016) and the Third Taiwan Philosophical Logic Colloquium (TPLC-2016) The aim of this conference is to strengthen the connection between logic and philosophy. In particular, we are hoping that more attention in future research will be paid to the philosophical study of logic, specifically, the study of the construction, and application, of logical framework appropriate for not only the analysis of philosophical concepts, but also the theorization of philosophical doctrines. SPECIAL SESSIONS Workshop on Williamson’s Philosophy (organized by S. C.-M. Yang) Workshop on Mereology (organized by H.-C. Tsai) SPEAKERS Plenary/Keynote lectures Robert Goldblatt (Victoria University of Wellington, New Zealand, for workshop on Mereology). Hiroakira Ono (Japan Advance Institute of Science and Technology, JAIST, Japan) Achille C. Varzi (Columbia University, USA, for Workshop on Mereology) Timothy Williamson (Oxford University, UK, for Workshop on Williamson’s philosophy) Invited speakers Katalin Farkas (Central European University, Hungary, on themes from Identity and Discrimination.) Paul Hovda (Reed College, USA, for workshop on mereology) Fenrong Liu (Tsinghua University, China) Hanti Lin (University of California at Davis, USA, on themes from Knowledge and its Limits) Greg Restall (University of Melbourne, Australia, on themes from Modal Logic as Metaphysics.) Nick Smith (University of Sydney, Australia, on themes from Vagueness) Hsing-chien Tsai (Chung-Cheng University, Taiwan, for workshop on mereology) JiJi Zhang (Lingnan University, Hong Kong) SUBMISSION OF ABSTRACTS FOR CONTRIBUTED TALKS All researchers working on various aspects of philosophical logic are cordially invited to submit their abstracts by 31 May, 2016. Please note that deadline for the submission of abstracts for talks contributed to Workshop on Williamson’s philosophy is due 30 April, 2016. Authors should submit an (extended) abstract no less than one page but no more than four pages (A4 size, single space). Abstracts must be submitted as PDF files and sent to D.-M. Deng [dmdeng(a)ntu.edu.tw] H.-C. Tsai [cccsthc(a)gmail.com] (esp. for Workshop on Mereology) S. C.-M. Yang [cmyang(a)ntu.edu.tw] (esp. for Workshop on Williamson’s philosophy) Each submission will be reviewed. The Colloquium is open to everyone, and practical info is available on the website. POST-CONFERENCE PUBLICATION: We are planning to publish a post-conference proceedings for the joint conference. It seems likely that a post-conference proceedings will be published as a volume of the LIAA-series by Springer. All authors of papers presented at the joint conference will be encouraged to submit a full length paper, and the deadline of the submission of full-length manuscripts will be around the end of December of 2016. All papers submitted will be refereed to high journal standards, and acceptance as a presentation is no guarantee that the post-conference paper will be published. Detailed information about the submission of full length papers will be announced later. TRAVEL AWARDS Free accommodation and travel awards for students and young researchers have been made available by the local organizing committee. In some cases full compensation of expenses is possible. The details, including general information about the awards and the instructions of application, will be announced later on the website. The deadline for travel award applications is June 30, 2016. However, it is strongly recommended that as long as you have the intention of submitting an abstract, please send us a note at your convenience as hotel-room preservation can be made the earlier the easier. ORGANIZATION COMMITTEE Robert Goldblatt Hanti Lin Fenrong Liu Hiroakira Ono H.-C. Tsai S. C.-M. Yang LOCAL ORGANIZATION COMMITTEE D.-M. Deng (National Taiwan University) H.-C. Fu (Chinese Cultural University) C.-J. Liau (The Institute of Information Science, Academia Sinica) H.-C. Tsai (National Chung Cheng University) K. Y. Lee (National Chung Cheng University) S. C.-M. Yang (Chair) FURTHER CONTACT: For any enquiry/information please contact: D.-M. Deng (dmdeng(a)ntu.edu.tw) S. C.-M. Yang (cmyang(a)ntu.edu.tw) =================================================================== Workshop on Williamson’s Philosophy Call for Papers 6 (Thursday) . 7(Friday) October, 2016 The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, Taiwan http://www.philo.ntu.edu.tw/lmmgroup/ You are cordially invited to submit an abstract of contributed talk to the Workshop on Williamson's Philosophy, to be held during the Joint Conference of AWPL-TPLC 2016. Deadline of the submission: 30 April, 2016. Introduction This will be a one-day plus workshop on Timothy Williamson’s philosophy, hosted by the Department of Philosophy, National Taiwan University, during the joint conference of the 3rd Asian Workshop on Philosophical Logic and the 3rd Taiwan Philosophical Logic Colloquium (AWPL-TPLC 2016). In view of the substantial contribution that Professor Timothy Williamson has made in the last few decades to contemporary philosophy, the organizing committee has set as the ultimate priority to organize a one-day plus workshop on Williamson’s philosophy during the joint conference. This project has been approved by Professor Williamson and more importantly he has accepted our invitation to come and join us on this special occasion. The Core Special attention will be paid to themes from Williamson’s five books: . Identity and Discrimination, 2nd ed. (1st ed. 1990), Oxford: Blackwell, 2013. . Vagueness, London: Routledge, 1994. . Knowledge and Its Limits, Oxford: Oxford University Press, 2000. . The Philosophy of Philosophy, Oxford: Blackwell, 2007. . Modal Logic as Metaphysics, Oxford: Oxford University Press, 2013. Keynote speaker: Timothy Williamson (Oxford University, UK) Invited speakers Katalin Farkas (Central European University, Hungary, on themes from Identity and Discrimination.) Greg Restall (University of Melbourne, Australia, Modal Logic as Metaphysics.) Nick Smith (University of Sydney, Australia, Vagueness) Some promising young philosophers from Asia-Pacific area will join us, including Max Deutsch (Hong Kong University): The Philosophy of Philosophy Hanti Lin (University of California at Davis, USA): Knowledge and its Limits Dan Marshall (Lingnan University, Hong Kong): Modal Logic as Metaphysics and more to come. The format (The workshop will contain at least 7 sessions) The workshop will start with a keynote speech by Williamson, followed by four sessions on the 6th of October, and will be continued, together with a final session for Williamson’s replies on the 7th of October. . 1st session (90 mins): (i) A brief introduction (about 5-10 minutes) of Williamson’s contribution in the last few decades (by the chair) (ii) A keynote speech (about 60 minutes plus 10-20 minutes for discussion) by Timothy Williamson . 2nd - 6th sessions: Each session (90 minutes) focuses on one of Williamson’s five books, and includes 4 parts: (i) (3-5 minutes) An introduction to the book under discussion (by the chair) (ii) (60-70 minutes) One talk by an invited speaker, followed by a contributed talk. (iii) (10-15 minutes) Williamson’s replies. (iv) (10-15 minutes) Discussion . 7th session (90 minutes): . (5-10 minutes) A summary from the chair . (30-40 minutes) a final response from Williamson (especially to the talks which are not included in the special workshop) . (20-30 minutes) discussions. Submission of Abstracts for Contributed Talks All researchers who are interested in Williamson’s philosophy are cordially invited to submit their abstracts by 30 April 2016. Authors should submit an (extended) abstract no less than one page but no more than four pages (A4 size, single space). Abstracts must be submitted as PDF files and sent to D.-M. Deng [dmdeng(a)ntu.edu.tw]; S.C.-M. Yang [cmyang(a)ntu.edu.tw] Memo: 1. Associated with each book, there is at least one session, containing two talks to address some issues on the themes of that book. 2. Extra contributed talks will be welcome. If the accepted abstracts for contributed talks on Williamson’s philosophy are more than originally scheduled, the Programme Committee will be very glad to put the extra ones in some other sessions before the conclusion session so that Williamson may have some comments/replies to those speakers as well. 3. A full length manuscript of a contributed talk on this workshop should be sent to the organizer by the 15th of September 2016 in order for Professor Williamson to read it before the workshop. 4. The chair of each session will provide a brief survey of the book (that session focuses on). 5. The organizing committee will try to find some well-known publisher to consider the possibility of publishing a post-conference proceedings, provided this proposal is approved by Williamson. The details will be announced when this proposal is also approved by the publisher. 6. A final remark: Professor Williamson has thoughtfully promised to offer young scholars in Taiwan, who contribute papers to this workshop, a one-on-one tutorial/supervision to discuss their papers before the conference. Tutorial time will be scheduled in two afternoons before the conference. [The details will be announced in due course.] For any enquiry/information please contact: D.-M. Deng (dmdeng(a)ntu.edu.tw) S. C.-M. Yang (cmyang(a)ntu.edu.tw)

1 0

SLACS2016のご案内
by Koji Nakazawa 12 Apr '16

12 Apr '16

みなさま，南山大の佐々木さんの代理で8月に名古屋大で開催される SLACSのお知らせをお送りします．中澤@名大 ======================================================================================================== みなさま 2016年度の「記号論理と情報科学研究集会（SLACS）」を次のように開催します．　日程：2016年8月25日(木),26日(金) 　場所：名古屋大学VBL(ベンチャービジネスラボラトリー)3階ベンチャーホール　招待講演：新屋良磨さんに，形式言語理論に関する，全然知らない人向けの話をお願いしています．　懇親会：25日に予算3500円程度で行う予定です．詳細は，　　　　　　http://www.seto.nanzan-u.ac.jp/~sasaki/SLACS2016.html にあります．完成された話題はもちろん，未完成の話題やこれから考えてみたい話題なども歓迎します．是非とも，参加・講演をご検討ください．講演を希望される方・懇親会参加を希望される方は，　　氏名　　所属　　 e-mail アドレス　　懇親会参加の有無　　 (講演を希望される場合)題目・希望講演時間(30～50分) 　　その他の要望（講演日など）の情報を，　　　　　　 8月16日までに，世話人宛にご連絡ください．世話人：南山大学　佐々木克巳(sasaki(a)nanzan-u.ac.jp) 佐々木克巳 ========================================================================================================

1 0

Fwd: 松山 TGSAセミナーのお知らせ（４月２８日）
by Hiroshi Fujita 12 Apr '16

12 Apr '16

こんにちは。愛媛の藤田です。以下の通り第20回松山TGSAセミナーのお知らせを転送いたします。藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> -------- Forwarded Message -------- Subject: 松山 TGSAセミナーのお知らせ（４月２８日） Date: Mon, 11 Apr 2016 15:09:45 +0000 From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> To: fujita.hiroshi.mh(a)ehime-u.ac.jp CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 皆様、「Matsuyama Seminar on Topology, Geometry, Set Theory and their Applications」（松山TGSAセミナー）のお知らせです。 ***** 第20回のセミナー日時: 2016年4月28日（木） 16:30〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者: Vesko Valov (Nipissing University, Canada) 題目: Homological selection theorems Abstract: A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem are established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically UV^n set-valued maps. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ <dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

homotopy type theory
by logic＠math.tsukuba.ac.jp 09 Apr '16

09 Apr '16

昨日差し上げたものはだいぶ誤植があったので、修正したものをお送りします。にしむら筑波大学数学追伸:オマケです。手持無沙汰な折にでもどうぞ。 https://www.youtube.com/watch?v=lVTXNa4UMHs

1 2

[CSC Journals] CFP - INTERNATIONAL JOURNAL OF ENGINEERING (IJE)
by J. Stewart 28 Mar '16

28 Mar '16

Call for Papers International Journal of Engineering (IJE) ISSN - 1985-2312 http://www.cscjournals.org/journals/IJE/description.php International Journal of Engineering (IJE) is devoted in assimilating publications that document development and research results within the broad spectrum of subfields in the engineering sciences. The journal is publishing scientific research relating to various disciplines of the engineering field from theoretical, practical and analytical research to physical implications and theoretical or quantitative discussion intended for both academic and industrial progress. IJE is a peer review open access journal and aims to provide scientific knowledge to its readers in the field of aerospace engineering, biomedical engineering, civil & structural engineering, electrical engineering, electronic engineering, fluid engineering, mechanical engineering and nuclear engineering etc. IJE intended audience is comprised of scientists, researchers, mathematicians, practicing engineers, among others working in Engineering and welcomes them to publish their research in their particular disciplines. Besides targeting different research communities, IJE mainly focuses on engineers and researchers relevant to aerospace, agriculture, manufacturing, mechanics, mining and nuclear by publishing relevant research articles that will help them to learn from real time experiences, logics and conclusions drawn by other researchers and industrial experts. ASSOCIATE EDITORS Professor Ernest Baafi - University of Wollongong (Australia) Dr. Tarek M. Sobh - University of Bridgeport (United States of America) Assistant Professor Aleksandar Vujovic - Univeristy of Montenegro (Montenegro) Dr. Jelena Jovanovic - University of Montenegro (Serbia and Montenegro) Dr. Xuefei Guan - Siemens Corporate Research (United States of America) Dr. Cheng-Xian (Charlie) Lin - Florida International University (United States of America) EDITORIAL BOARD MEMBERS Associate Professor Fichera Sergio - University of Catania (Italy) Professor Jing Zhang - University of Alaska Fairbanks (United States of America) Dr. Tao Chen - Nanyang Technological University (Singapore) Dr. Oscar Hui - University of Hong Kong (Hong Kong) Associate Professor Aidy Ali - Universiti Putra Malaysia (Malaysia) Dr. Alireza Bahadori - Curtin University (Australia) Dr. Wanquan Liu - Curtin University (Australia) Dr. Xing-Gang Yan - University of Kent (United Kingdom) Dr. Reza Shadnam - KPMG (Canada) Associate Professor Miladin Stefanovic - University of Kragujevac (Serbia and Montenegro) Associate Professor Hong-Hu Zhu - Nanjing University (China) Professor Dr Mazlina Esa - Universiti Teknologi Malaysia (Malaysia) Associate Professor Mohd Amri Lajis - Universiti Tun Hussein Onn Malaysia (Malaysia) Associate Professor Khalifa Saif Al-Jabri - Sultan Qaboos University (Oman) Professor Tarek Abdel-Salam - East Carolina University (United States of America) Dr. Mohamed Rahayem - Örebro University (Sweden) Professor Zdravko Krivokapic - University of Montenegro (Serbia and Montenegro) Dr. Rosli - Universiti Tun Hussein Onn Malaysia (Malaysia) Professor Qingling Zhang - Northeastern University (China) Dr. Guoxiang Liu - University of North Dakota (United States of America) Dr. Nam Nguyen Dang - PetroVietnam University (Vietnam) Professor Dr.-Eng. Shehata E. Abdel Raheem - Assiut University - Egypt/Taibah University - KSA (Saudi Arabia) LIST OF TOPICS Aerospace Engineering Agricultural Engineering Biomedical Engineering Chemical Engineering Civil & Structural Engineering Computer Engineering Control Systems Engineering Education Engineering Electrical Engineering Electronic Engineering Engineering Mathematics Engineering Science Environmental Engineering Fluid Engineering Geotechnical Engineering Industrial Engineering Manufacturing Engineering Materials & Technology Engineering Mechanical Engineering Mineral & Mining Engineering Nuclear Engineering Optical Engineering Petroleum Engineering Robotics & Automation Engineering Telecommunications Engineering IMPORTANT DATES Submission Deadline: April 30, 2016 Notification : May 31, 2016 Issue Publication: : June2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJE Manuscript Preparation Guidelines. For further information, please refer to the following information. IJE Website - http://www.cscjournals.org/journals/IJE/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJE/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Engineering (IJE) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJE is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJE particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJE welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJE-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJE/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Engineering (IJE) Thank you, J. Stewart Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

Talk by Nayuta Yanagisawa, Wed 30 Mar
by Toshiki Kataoka 24 Mar '16

24 Mar '16

皆様，以下のように，来週水曜日，京都大学の柳澤名由太さんをお招きして講演をしていただきます。ぜひご参加ください。 -- 片岡俊基 (Toshiki Kataoka, http://www-mmm.is.s.u-tokyo.ac.jp/~tos/) -------------------- Wed 30 Mar 2016, 16:30–18:00 Room 236, Chemistry Building East (“Kagaku-Higashikan”). Next to our building (School of Science Bldg. No. 7) Access: http://www-mmm.is.s.u-tokyo.ac.jp/access.html 1. Topological Theory of Distributed Computing 分散コンピューティングへの組合せトポロジー的なアプローチについて解説します． 2. A Topological Characterization of Wait-Free Solvability in the Infinite Arrival Model We extend the topological theory of distributed computing for systems with a fixed set of n processes to that for systems with infinitely many processes. We investigate a necessary and sufficient condition for the finitely-valued colorless tasks to be wait-free solvable in such distributed systems. A finitely-valued colorless task is a task that assumes a finite set of possible input/output values, and specifies input/output relation without referring to process IDs. Our characterization only resorts to finite combinatorial structures, called finite simplicial complexes as the topological device. By restricting our attention to finitely-valued colorless tasks, we can represent possible protocol states that are innocent of process IDs by a finite simplicial complex, even if the number of participating processes is infinite.

1 0

homotopy type theory
by logic＠math.tsukuba.ac.jp 23 Mar '16

23 Mar '16

私が筑波大学数理物質研究科数学専攻で来年度講義する講義をご案内しておきます。にしむら筑波大学数学追伸：オマケです。手持ち無沙汰な折にでもどうぞ。 https://www.youtube.com/watch?v=K_xTet06SUo

1 0

Prof. Dieter Spreen at NII Logic Seminar
by Makoto Tatsuta 16 Mar '16

16 Mar '16

Prof. Dieter Spreen at NII Logic Seminar Date: March 22, 2016, 14:00--16:00 Place: National Institute of Informatics, Room 1901 (19th floor) 場所: 国立情報学研究所 19階 1901室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Prof. Dieter Spreen (Siegen University) Ttile: Information Frames Abstract: In 1982, Dana Scott introduced information systems as a logic-based approach to domain theory. Here, a domain is a bound-complete algebraic complete partial order with least element. An information system consists of a set of tokens to be thought of as atomic statements about a computational process, a consistency predicate telling us which finite sets of such statements contain consistent information, and an entailment relation saying what atomic statements are entailed by which consistent sets of these. Theories of such a logic, also called states, i.e. finitely consistent and entailment-closed sets of atomic statements, form a bounded-complete algebraic complete partial order with respect to set inclusion, and, conversely, every such domain can be obtained in this way, up to isomorphism. This gives Scott's idea that domain elements represent information about stages of a computation a precise mathematical meaning. The role of bounded completeness becomes also clear in this context: States represent consistent information. So, any finite collection of substates must contain consistent infor- mation as well, and this fact is witnessed by any of its upper bounds. Whereas in Scott's approach the consistency witnesses are hidden, in this paper we present an approach that makes them explicit. This allows to consider the more general situation in which there is no longer a uniform global consistency predicate. Instead there a is consistency predicate for each atomic statement telling us which finite sets of atomic statements express information that is consistent with the given statement. As it turns out the theories, or states, of such a more general information system form an L-domain, and, up to isomorphism, each L-domain can be obtained in this way. Since every token in the just delineated kind of information system has its own consistency predicate, we can also think of each such system as a family of logics, or a Kripke frame. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

CCA 2016（計算理論と解析学）論文募集
by Akitoshi Kawamura 14 Mar '16

14 Mar '16

皆様東京大学の河村と申します。来年6月15～17日にポルトガルで開催される国際会議Computability and Complexity in Analysisの御案内です。どうぞ御検討下さい。 ______________________________________________________________ First Call for Papers Thirteenth International Conference on Computability and Complexity in Analysis (CCA 2016) http://cca-net.de/cca2016/ June 15-17, 2016, Faro, Portugal Submission deadline: March 14, 2016 ______________________________________________________________ Scientific Programme Committee * Matthew de Brecht (Osaka, Japan) * Fernando Ferreira (Lisbon, Portugal) * Sicun Gao (Cambridge, USA) * Mathieu Hoyrup (Nancy, France) * Akitoshi Kawamura, chair (Tokyo, Japan) * Bob Lubarsky (Boca Raton, USA) * Elvira Mayordomo (Zaragoza, Spain) * Robert Rettinger (Dortmund, Germany) * Ning Zhong (Cincinnati, USA) Organising Committee * Daniel Graça, chair (Faro, Portugal) * Rui Marreiros (Faro, Portugal) Topics * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Submissions Authors are invited to submit 1-2 pages abstracts in PDF format, including references via the following web page: https://easychair.org/conferences/?conf=cca2016 If full versions of papers are already available as technical report or arXiv version, then corresponding links should be added to the reference list. Final versions of abstracts might be distributed to participants in hardcopy and/or in electronic form. Dates * Submission deadline: March 14, 2016 * Notification of authors: April 16, 2016 * Final version: April 30, 2016 Conference Web Page http://cca-net.de/cca2016/ ______________________________________________________________ 東京大学総合文化研究科河村彰星

1 1

初めて筑波大学へ来られる方へ
by logic＠math.tsukuba.ac.jp 14 Mar '16

14 Mar '16

この３月１６日から１９日にかけて筑波大学で開催される日本数学会年会に来られるかたで筑波大学へ行くのはこれが初めてという方もかなりおられるかと思いますが、迷子にならないために次の点に注意してください。お手持ちの年会Programに非常によくできた案内図がございますが、筑波大学は二層構造になっているという点に十分ご注意ください。これはこういうことです。例えば筑波大学の附属図書館ですが、通常の利用者は２階の出入り口から出入りすることを期待されています。１階にも出入り口はござますが、これは附属図書館職員のためのもので、一般の利用者が使うことは許されておりません。こういうと不思議な感じがして筑波大学の教員や学生は空中浮揚術を習得しているのかと思われる向きもございましょうが、そういうことではありません。筑波大学Campus内の移動は初心者はかならずPedestrianに沿って行ってください。Pedestrianは１階部分を走っていることもあれば、２階部分を走っていることもあり、また１階部分から２階部分へのSlopeのこともございます。添付の地図でPedestrianをわかりやすく図示しています。２階の出入り口から入った建物を別の会場にいくために１階の出入り口からでるのはやめておかれたほうが無難です。にしむら筑波大学数学域追伸：オマケです。手持無沙汰の折にでもどうぞ。 https://www.youtube.com/watch?v=HHL0qQm-S6s

1 0

CFP: ATVA'16 (@Oct 17-19th, Chiba)
by takashi kitamura 03 Mar '16

03 Mar '16

みなさま産総研の北村です。自動検証技術に関する国際会議 ATVA'16 (10月に千葉で開催)の論文募集をお送りいたします。是非ご投稿・ご参加をご検討ください。 `````````````````````````````````````````````````````````````` === Automated Technology for Verification and Analysis (ATVA) 2016 === --- Springer LNCS proceedings --- --- Special issue in "Formal Methods in System Design" (Springer) --- http://atva2016.gforge.inria.fr/ The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The previous events were held in Taiwan - 2003-5, Beijing - 2006, Tokyo - 2007, Seoul - 2008, Macao - 2009, Singapore - 2010, Taiwan - 2011, Thiruvananthapuram - 2012, Hanoi - 2013, Sydney - 2014, and Shanghai - 2015. Scope ATVA 2016 solicits high quality submissions in areas related to the theory and practice of automated analysis and verification of hardware and software systems. Topics of interest include, but are not limited to: * Formalisms for modeling hardware, software and embedded systems * Specification and verification of finite-state, infinite-state and parameterized system * Program analysis and software verification * Analysis and verification of hardware circuits, systems-on-chip and embedded systems * Analysis of real-time, hybrid, priced/weighted and probabilistic systems * Deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification * Analytical techniques for safety, security, and dependability * Testing and runtime analysis based on verification technology * Analysis and verification of parallel and concurrent hardware/software systems * Verification in industrial practice * Applications and case studies Theory papers should preferably be motivated by practical problems, and applications should be based on sound theory and should solve problems of practical interest. Submission ATVA invites research contributions in two categories: * Regular research papers (with 16 pages page limit, including references) * Tool papers (with 5 pages page limit, not counting references) Contributions must be written in English and in LNCS format, and must present original research that is unpublished and not submitted elsewhere (conferences or journals). The proceedings of ATVA 2016 will be published by Springer as a volume in the series of Lecture Notes in Computer Science (LNCS). For formatting instructions, see: http://www.springer.de/comp/lncs/authors.html PDF versions of the papers should be submitted to EasyChair: https://easychair.org/conferences/?conf=atva2016 Proofs and details omitted due to space constraints may be put in an appendix. Any such additional material will be read by reviewers/program committee members at their discretion. Authors are therefore urged to include details necessary for evaluation of the technical merit of their work within the prescribed page limits. Tool papers must include information about a URL from where the tool can be downloaded or accessed on-line for evaluation. The URL must also contain a set of examples, and a user's manual that describes usage of the tool through examples. In case the tool needs to be downloaded and installed, the URL must also contain a document clearly giving instructions for installation of the tool on Linux/Windows/MacOS. Accepted papers in both categories will be published by Springer as a LNCS volume. At least one author of each accepted paper must also register for the conference and present the paper. Selected papers will be invited for a publication in Formal Methods in System Design, published by Springer. Important Dates: Abstract due: April 23 Paper due: April 26 Notification: June 6 Invited Speakers for keynotes and tutorials Masahiro Fujita Javier Esparza Tevfik Bultan Programme Committee Co-Chairs Cyrille Artho Axel Legay Doron Peled Publicity Chair Takashi Kitamura (AIST, Japan) Local Chairs Mitsuharu Yamamoto (Chiba University, Japan) Yoshinori Tanabe (Tsurumi University, Japan) Programme Committee Toshiaki Aoki Cyrille Artho Christel Baier Armin Biere Tevfik Bultan Franck Cassez Krishnendu Chaterjee Allesandro Cimatti Rance Cleaveland Deepak D'Souza Allen Emerson Bernd Finkbeiner Radu Grosu Klaus Havelund Marieke Huisman Ralf Huuck Moonzoo Kim Marta Kwiatkowska Kim Larsen Axel Legay Tiziana Margaria Madhavan Mukund Anca Muscholl Doron Peled Andreas Podelski Geguang Pu Sven Schewe Oleg Sokolsky Marielle Stoelinga Bow-Yaw Wang Chao Wang Farn Wang Wang Yi Naijun Zhan Lijun Zhang Huibiao Zhu Contact atva2016-info(a)lists.gforge.inria.fr -- Takashi KITAMURA t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ Tel: +81-6-6494-8054, AIST internal: *33-274-71902

1 0

PhDs in Logic VIII, Darmstadt, Germany 9-11 May 2016
by Ishihara Hajime 01 Mar '16

01 Mar '16

皆様 PhDs in Logicの案内を転送いたします。北陸先端科学技術大学院大学石原　哉 --------------------------------------------------------------------------------------------------------------------------------- Call for submissions: PhDs in Logic VIII, Darmstadt, May 9-11, 2016 "PhDs in Logic" is an annual graduate conference organised by local graduate students. This conference has an interdisciplinary character, welcoming contributions to various topics in Mathematical Logic, Philosophical Logic, and Logic in Computer Science. It involves tutorials by established researchers as well as short presentations by PhD students on their research. We are happy to announce that the next edition of "PhDs in Logic" will take place in Darmstadt, Germany, during May 9-11 2016, hosted by the Logic research group of the Department of Mathematics, TU Darmstadt. Confirmed tutorial speakers are : Mirna Dzamonja (University of East Anglia, UK) Nina Gierasimczuk (University of Amsterdam, the Netherlands) Ulrich Kohlenbach (TU Darmstadt, Germany) Piotr Kowalski (University of Wroklaw, Poland) Martin Otto (TU Darmstadt, Germany) Registration and abstract submission for interested PhD students are now open. We welcome contributions from any general field of Logic. The deadline for abstract submission is February 7, 2016. For more information please see: http://www.mathematik.tu-darmstadt.de/fbereiche/logik/phdsinlogic2016/?site… Local organisers: Julian Bitterlich, Felix Canavoi, Angeliki Koutsoukou-Argyraki, Daniel Koernlein, Florian Steinberg Technische Universität DarmstadtDepartment of MathematicsLogic GroupSchloßgartenstr. 764289 DarmstadtGermany

2 1

池上氏と横山氏の講演会(仙台)
by Tanaka Kazuyuki 01 Mar '16

01 Mar '16

皆様池上大祐氏と横山啓太氏による講演会を以下の通り行いますので、ふるってご参加下さい。 Sendai Logic Seminar 特別講演会日時：3月8日　15:00 - 17:30 場所：東北大学大学院理学研究科（青葉山）　　　合同Ａ棟２階　２０２号室＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊ Sendai Logic Seminar: Special Lectures Date: March 8 (Tuesday) Place: Room 202, Science Complex A Tohoku University (Aobayama) 15:00 - 16:00 Speaker: Daisuke Ikegami 池上大祐（東京電機大学） Title: Introduction to \Omega-logic Abstract: In this talk, we give some basic ideas on Woodin's \Omega-logic. If time permits, we discuss the connections between \Omega-logic and Boolean valued higher order logics. 16:30 - 17:30 Speaker: Keita Yokoyama 横山啓太 (JAIST, U.C. Berkeley) Title: Nonstandard models of subsystems of PA and KP Abstract: There are several similarities between nonstandard models of subsystems of PA and nonstandard models of subsystems of KP. Using nonstandard models of PRA and ISigma_1, one can prove the Parsons theorem, which states that the provably total functions of ISigma_1 are primitive recursive functions. In contrast to the Parsons theorem, Rathjen showed that the provably total functions of KP^-+Sigma_1-foundation+Pi_1-foundation are so-called primitive recursive set functions. In this talk, we will prove Rathjen's theorem by using recursively saturated models of KP^-. This is a joint work with Tin Lok Wong. 連絡先：田中一之（東北大学）

1 0

国際会議TQC2016のご案内
by Yasuhiro Takahashi 29 Feb '16

29 Feb '16

皆様，（重複して受け取られた場合はご容赦ください） NTT の高橋と申します．国際会議TQC2016の案内を転送させていただきます．よろしくお願い致します． ======================================================================= TQC2016（量子計算、通信、暗号に関する国際会議）が、 9月27日-29日にベルリンで開催されます。今年から投稿規程が変更され、Conference track, Workshop trackの2トラック制となり、 Workshop trackでは出版済みの論文でも投稿できるようになります。ご興味のある方は、ぜひ投稿をご検討ください。よろしくお願いします。 ======================================================================= CALL FOR PAPERS The 11th Conference on the Theory of Quantum Computation, Communication, and Cryptography ---- TQC 2016 ---- Freie Universität Berlin Berlin, Germany 27-29 September 2016 http://tqc2016.physik.fu-berlin.de/ ======================================================================= This is the eleventh in a series of conferences that aims to bring together the leading researchers in the areas of quantum computation, quantum communication and quantum cryptography. TQC covers all theoretical aspects of quantum information and submissions on these topics are solicited. Areas of interest include, but are not restricted to: * quantum algorithms * models of quantum computation * quantum complexity theory * simulation of quantum systems * quantum cryptography * quantum communication * quantum estimation and measurement * intersection of quantum information and condensed-matter theory * quantum coding theory * fault-tolerant quantum computing * entanglement theory Important dates: * Paper/Talk/Early-Poster submission deadline: May 16, 2016 * Decision notification: July 5, 2016 * Final manuscript deadline: July 23, 2016 * Late-Poster submission deadline: August 17, 2016 * Conference: 27-29 September, 2016 Two tracks: Conference(talk + proceedings) and Workshop(talk only). As the goal of TQC is to bring together researchers on all aspects of quantum information, submissions are solicited for two tracks: * Conference(talk + proceedings): Submissions to this track must be original papers that have not previously appeared in published form. Accepted papers will be presented orally at the conference and will appear in the conference proceedings. The proceedings will be published by the OpenAccess LIPIcs (Leibniz International Proceedings in Informatics). * Workshop(talk only): We solicit submissions for talk-only papers; accepted submissions will be presented orally at the conference but will not appear in the proceedings. This track allows authors to publish their work elsewhere and accepts already published material. Programme committee: * Gorjan Alagic * Gilles Brassard * Anne Broadbent (chair) * André Chailloux * Giulio Chiribella * Frédéric Dupuis * Joseph Fitzsimons * Steve Flammia * Sevag Gharibian * Stacey Jeffery * Elham Kashefi * Iordanis Kerenidis * Xiongfeng Ma * Laura Mancinska * Carl Miller * Mio Murao * Marco Piani * Christopher Portmann * Robert Raussendorf * Christian Schaffner * Norbert Schuch * Peter Selinger * Jamie Sikora * Barbara Terhal * Mark Wilde Local organising committee (FU Berlin): * Jens Eisert - chair * Oliver Buerschaper - co-chair * Juan Bermejo-Vega * Dominik Hangleiter * Albert Werner * Carolin Wille * and the entire QMIO group at the FU Berlin Steering committee: * Wim van Dam (UCSB) * Aram Harrow (MIT) * Yasuhito Kawano (NTT, Tokyo) * Michele Mosca (IQC, Waterloo and Perimeter Institute) * Martin Roetteler (Microsoft Research) * Simone Severini (UCL) * Vlatko Vedral (Oxford and CQT, Singapore) For further information, please see http://tqc2016.physik.fu-berlin.de/

1 0

講演会 (Andreas Abel 氏，Andrea Vezzosi 氏)
by Atsushi Igarashi 26 Feb '16

26 Feb '16

皆様，京都大学の五十嵐です．以下の要領で Chalmers 大の Andreas Abel さん，Andrea Vezzosi さんの講演会を実施いたしますので，ふるってご参加ください．どうぞよろしくお願いいたします． -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/ ====================================================================== 日時: 3/2(水) 13:30～15:30 場所: 京都大学吉田キャンパス総合研究７号館１階セミナー室１(１２７号室) 講演その１(13:30～14:30) Speaker: Andrea Vezzosi (Chalmers) Title: Open Problems with Sized Types in Agda Abstract: Sized Types let us give recursive definitions by well-founded induction on an the abstract type "Size", and so ensuring totality through types. This talk will discuss two problems that arise when using Sized Types in a dependently typed language: - Totality tells us that closed programs will not go wrong, but when typechecking a dependently typed language we also reduce terms with free variables, and go under binders, to reach a normal form. The current restrictions on definitions to guarantee every term has a normal form hurt expressivity, we propose a closer interaction of sizes and reduction instead. - When reasoning about programs defined with sizes types one often wishes to show that the size used doesn't affect the result in a significant way. We show a parallel with parametric polymorphism that could lead to more powerful reasoning principles for sizes. 講演その２(14:30～15:30) Speaker: Andreas Abel Title: Interactive Programs and Objects, Functionally --- Via Coinduction with Copatterns and Sized Types in Agda Abstract: Copattern matching is an extension of pattern matching in functional languages. It allows us to define an infinite structure (e.g. a stream) by what we can observe of it (e.g., what is its head?, what is its tail?). This has an analogue in object-oriented programming languages where an object is defined on how it responds to messages or method invocation, resp. Following Setzer, objects can be implemented coinductively in type theory; they are entities that respond to a message with some result and a new version of themselves. Similarly, following Hancock and Setzer, interactive programs can be seen as infinite processes that issue a command and continue in accordance with the response their received, potentially for all eternity. In this talk, we give an introduction to coinduction in the type-theoretic language Agda. We show how copatterns and sized types enable us to elegantly encode objects and interactive programs in type theory. The talk might close with a short demo of a rudimentary graphical program written in Agda using a foreign-function interface to Haskell. This is joint work with Stephan Adelsberger and Anton Setzer. An accompanying draft is available at http://www.cse.chalmers.se/~abela/index.html#ooAgda

1 0

Fwd: ３月２日の TGSAセミナーの追加講演
by Hiroshi Fujita 26 Feb '16

26 Feb '16

皆さまこんにちは。愛媛の藤田です。先日ご連絡いたしました第19回松山TGSAセミナーの予定が更新されましたのでご連絡いたします。藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> -------- Forwarded Message -------- Subject: ３月２日の TGSAセミナーの追加講演 Date: Fri, 26 Feb 2016 04:59:36 +0000 From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> To: fujita.hiroshi.mh(a)ehime-u.ac.jp CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 皆様、３月２日（水）に行のわれる「Matsuyama Seminar on Topology, Geometry, Set Theory and theirApplications」（松山TGSAセミナー）の講演の追加がありましたのでご連絡差し上げます。 ***** 第19回のセミナー日時: 2016年3月2日（水） 15:15〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者 1: 渕野昌（神戸大学）時間： 15:15〜16:15 題目: Reflection numbers under large continuum Abstract: The reflection number $\kappa$ of the Rado Conjecture is defined as the smallest cardinal $\kappa$ such that any non special tree $T$ has a non special subtree $T'$ of cardinality $<\kappa$ (or $\infty$ if there is no such $\kappa$). We show the consistency of the statement that the continuum is fairly large (e.g. that it is a large cardinal like supercompact in an inner model with the same cardinals as in the universe) while the reflection number of the Rado Conjecture is less than or equal to the continuum. We also consider some other reflection numbers and the relationship between them. 講演者 2: Alejandro Dorantes-Aldama (Universidad Nacional Autonoma de Mexico, Visiting Foreign Researcher of Ehime University) （メキシコ国立自治大学・愛媛大学外国人客員研究員）時間： 16:30〜17:30 題目: Almost irresolvable spaces Abstract: A topological space X is almost resolvable if X is the union of a countable collection of subsets each of them with empty interior. We prove that under the Continuum Hypothesis, the existence of a measurable cardinal is equivalent to the existence of a Baire crowded ccc almost irresolvable T_1 space. We also prove that: (1) Every crowded ccc space with cardinality less than the first weakly inaccessible cardinal is almost resolvable. (2) If 2^{\omega} is less than the first weakly inaccessible cardinal, then every T_2 crowded ccc space is almost resolvable. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ <dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

CFP: PPDP 2016
by Kazutaka Matsuda 25 Feb '16

25 Feb '16

logic-mlの皆様，東北大学の松田です．複数受け取られた場合はご容赦ください． 9月5〜7日にイギリスのエジンバラで開催される，宣言的プログラミングに関する国際会議 PPDP 2016 の論文募集のご案内をお送りいたします．どうぞ論文の投稿をご検討いただけますと幸いです． ====================================================================== Call for papers 18th International Symposium on Principles and Practice of Declarative Programming PPDP 2016 Special Issue of Science of Computer Programming (SCP) -tentative- Edinburgh, UK, September 5-7, 2016 (co-located with LOPSTR and SAS) http://ppdp16.webs.upv.es/ ====================================================================== SUBMISSION DEADLINE: 9 MAY (abstracts) / 16 MAY (papers) ---------------------------------------------------------------------- INVITED SPEAKERS Elvira Albert, Complutense University of Madrid, Spain ---------------------------------------------------------------------- PPDP 2016 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modeling in a declarative language and modeling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 26th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) and the 23rd Static Analysis Symposium (SAS 2016). The conference will be held in Edinburgh, UK. Previous symposia were held at Siena (Italy), Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). You might have a look at the contents of past PPDP symposia, http://sites.google.com/site/ppdpconf/ Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2017 (tentative). Important Dates Abstract submission: 9 May, 2016 Paper submission: 16 May, 2016 Notification: 20 June, 2016 Final version of papers: 17 July, 2016 Symposium: 5-7 September, 2016 Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted to the submission website for PPDP 2016. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist the program committee in selecting appropriate reviewers for the paper. Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Program Committee Sandra Alves, University of Porto, Portugal Zena M. Ariola, University of Oregon, USA Kenichi Asai, Ochanomizu University, Japan Dariusz Biernacki, University of Wroclaw, Poland Rafael Caballero, Complutense University of Madrid, Spain Iliano Cervesato, Carnegie Mellon University Marina De Vos, University of Bath, UK Agostino Dovier, Universita degli Studi di Udine, Italy Maribel Fernandez, King's College London, UK John Gallagher, Roskilde University, Denmark, and IMDEA Software Institute, Spain Michael Hanus, CAU Kiel, Germany Martin Hofmann, LMU Munchen, Germany Gerda Janssens, KU Leuven, Belgium Kazutaka Matsuda, Tohoku University, Japan Fred Mesnard, Universite de la Reunion, France Emilia Oikarinen, Finnish Institute of Occupational Health, Finland Alberto Pettorossi, Universita di Roma Tor Vergata, Italy Tom Schrijvers, KU Leuven, Belgium Josep Silva, Universitat Politecnica de Valencia, Spain Perdita Stevens, University of Edinburgh, UK Peter Thiemann, Universitat Freiburg, Germany Frank D. Valencia, CNRS-LIX Ecole Polytechnique de Paris, France, and Pontificia Universidad Javeriana de Cali, Colombia German Vidal, Universitat Politecnica de Valencia, Spain (Program Chair) Stephanie Weirich, University of Pennsylvania, USA Program Chair German Vidal Universitat Politecnica de Valencia Camino de Vera, S/N E-46022 Valencia, Spain Email: gvidal(a)dsic.upv.es Symposium Chair James Cheney Informatics Forum 5.29 Laboratory for Foundations of Computer Science School of Informatics 10 Crichton Street, Edinburgh EH8 9AB, Scotland, UK Email: jcheney(a)inf.ed.ac.uk ----------------------------------------------------------------------

1 0

CFP: ITRS 2016
by koba 23 Feb '16

23 Feb '16

皆様、 6月にポルトガルで開催されるintersection typesに関するワークショップITRS 2016の論文募集案内をお送りします。 RTAとTLCAが合併してできたFSCD 2016の併設ワークショップです。皆様からの論文投稿をお待ちしております小林直樹東京大学大学院情報理工学系研究科コンピュータ科学専攻〒113-0033 東京都文京区本郷7-3-1 Phone: 03-5841-4124 Fax: 03-5841-4124 email: koba(a)is.s.u-tokyo.ac.jp INTERSECTION TYPES AND RELATED SYSTEMS (ITRS 2016) http://www-kb.is.s.u-tokyo.ac.jp/ITRS2016/ Call for Papers =============== ITRS 2016 (the Eighth Workshop on Intersection Types and Related Systems) will be held on 25 June, 2016, in Porto, in affiliation with FSCD 2016 (1st International Conference on Formal Structures for Computation and Deduction, http://fscd2016.dcc.fc.up.pt/). ITRS 2016 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications to programming languages and program verification. - Applications to other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types to characterize computational properties. IMPORTANT DATES Abstract submission: 28 March, 2016 Paper submission: 31 March, 2016 Author notification: 28 April, 2016 Final version: 29 May, 2016 Workshop: 26 June, 2016 SUBMISSION AND PUBLICATION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format through EasyChair (https://easychair.org/conferences/?conf=itrs2016). Accepted papers will be presented at the workshop and included in preliminary proceedings. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be refereed for inclusion in post-proceedings (which we plan to publish in EPTCS). PROGRAM COMMITTEE Steffen van Bakel (Imperial College, UK) Giuseppe Castagna (CNRS, Paris Diderot University, France) Joshua Dunfield (University of British Columbia, Canada) Naoki Kobayashi (University of Tokyo, Japan), chair Jakob Rehof (University of Dortmund, Germany) Simona Ronchi Della Rocca (University of Tulin, Italy) Sylvain Salvati (INRIA Bordeaux, France) Pawel Urzyczyn (University of Warsaw, Poland) INFORMATION For further information, please contact Naoki Kobayashi Email: koba AT is DOT s DOT u-tokyo DOT ac DOT jp

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

JAIST国際シンポジウム「知能ロボティクス」開催のご案内
by Satoshi Tojo 22 Feb '16

22 Feb '16

重複して受け取られた方はご容赦ください．北陸先端科学技術大学院大学知能ロボティクス領域は，人工知能・ソフトウェア科学・数理論理学・ロボット工学の融合・連携をめざし新時代の情報科学のパラダイムを議論する場として，下記のように国際シンポジウムを開催します．どうぞみなさま奮ってご参加ください．場所: しいのき迎賓館，石川県金沢市広坂2丁目1番1号　TEL ： 076-261-1111 http://www.shiinoki-geihinkan.jp/about/shop.html 日時: 2016年3月24, 25日プログラム: http://www.jaist.ac.jp/logic/meeting-workshop/138 北陸先端科学技術大学院大学情報科学研究科東条敏

1 1

PPL2016最終参加募集：第18回プログラミングおよびプログラミング言語ワークショップ
by Hiroshi UNNO 22 Feb '16

22 Feb '16

皆様、（重複して受け取られた場合は御容赦ください。）筑波大学の海野です。 3月7日(月)〜9日(水)に、岡山県で開催されます、第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) の参加登録の締切が、本日2月22日(月)とせまっておりますので、ご案内を再度お届けいたします。たくさんのご参加をお待ち申し上げております。 -- PPL2016では，招待講演として， * 奥田遼介 (Preferred Networks) 「ディープラーニングフレームワークとChainerの実装」 * Julia Lawall (Inria) 「Finding the right level of abstraction: Program analysis and the Linux kernel」の2件を予定しております．カテゴリ1，2，4の採択論文・発表のリストも http://logic.cs.tsukuba.ac.jp/ppl2016/accepted.html ご参考ください。参加登録の案内ページは http://logic.cs.tsukuba.ac.jp/ppl2016/registration/ です。参加登録の締切は2月22日（月）です。どうぞお早めのご登録をお願いいたします。 -------------------------------------------------------------------------- 第18回プログラミングおよびプログラミング言語ワークショップ（PPL2016） http://logic.cs.tsukuba.ac.jp/ppl2016/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)～3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」 PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． http://logic.cs.tsukuba.ac.jp/ppl2016/registration/ 参加登録締切：2月22日(月) 問い合わせ先：ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也千葉工業大学岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] --------------------------------------------------------------------------

1 0

【参加募集】第108回プログラミング研究発表会【2/28, 29@東大駒場キャンパス】
by Kazutaka Matsuda 19 Feb '16

19 Feb '16

logic-mlの皆様，東北大学の松田です．複数受け取られた場合はご容赦ください．来たる2/28，29に開催される第108回プログラミング研究発表会の開催のご案内をさせて頂きたく存じます． 2015年度最後のプログラミング研究発表会は， 2月28日(日)・29日(月)に東京にて開催されます．最新情報は以下のWEBページに掲載しております． http://sigpro.ipsj.or.jp/pro2015-5/ 直前のご案内で恐縮ですが，皆様のご参加をお待ちしております．また，初日 2/28 (日) の18:00より米心 http://tabelog.com/tokyo/A1303/A130301/13159399/ にて懇親会を予定しております．参加費は5,000円前後を予定しております．懇親会参加をご希望の方は*2/25（木）までに上野まで*お知らせください．発表会自体は事前申込不要です． ------------------------------------ To: katsu [at] riec.tohoku.ac.jp Subject: PRO108 2月28日（日）の懇親会に参加します．御名前: 御所属: 区　別: 学生・一般（2月25日（木）までにお知らせ下さい．） ---------------------------------------- 担当: 松田一孝 (東北大学)，上野雄大（東北大学） ================================================================= 情報処理学会第108回プログラミング研究発表会プログラム ================================================================= 日程：2015年2月28日(日)・29日(月) 会場：東京大学駒場キャンパス 15号館 409号室　　　〒153-8902東京都目黒区駒場3-8-1 　　　最寄り駅: 京王井の頭線駒場東大前駅 ※　1件あたり45分 (発表25分，質疑・討論20分) 　　○印が発表者 # 2016年2月28日（日） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 10:30–11:15 関数型と組型がネストした型を持つ変数を含んだ式の自動生成手法　○新田祐児（東北大学大学院情報科学研究科）　　上野雄大（東北大学電気通信研究所）　　大堀淳（東北大学電気通信研究所） 11:15–12:00 コンパイラ実装言語で中間表現データ構造を記述するための言語機構　○田畑憲太（東北大学大学院情報科学研究科）　　上野雄大（東北大学電気通信研究所）　　大堀淳（東北大学電気通信研究所） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 12:00–13:00 休憩 −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 13:30–14:15 多重Ambient Calculus を用いた海上物流監視システムのための動的経路設定機能　○宮井亜人夢（近畿大学大学院総合理工学研究科）　　加藤暢（近畿大学大学院総合理工学研究科）　　樋口昌宏（近畿大学大学院総合理工学研究科）　　大山博史（広島商船高等専門学校） 14:15–15:00 手続き抽象化機能をもつプログラミング言語による 3D 印刷　○金田泰（Dasyn） 15:00–15:45 Declaring Constraints on Object-oriented Collections 　　Tim Felgentreff (Hasso Plattner Institute), 　○Robert Hirschfeld (Hasso Plattner Institute) 　　Maria Graber (Hasso Plattner Institute) 　　Alan Borning (University of Washington) 　　増原英彦（東京工業大学数理・計算科学専攻） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 15:45–15:55 休憩 −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 15:55–16:20 拡大運営委員会（全員参加可能） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 18:00— 懇親会@米心 # 2016年2月29日（月） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 10:00-10:45 Implementing a Putback-based Bidirectional Transformation Language for Relational Databases Using BiGUL 　○Tao Zan（総合研究大学院大学）　　Li Liu（上海交通大学）　　Hsiang-Shang Ko（国立情報学研究所）　　Zhenjiang Hu（国立情報学研究所，総合研究大学院大学） 10:45-11:30 Let High-level Graph Queries Be Parallel Efficient: An Approach Over Structural Recursion On Pregel 　　李翀（国立情報学研究所）　○Le-Duc Tung（総合研究大学院大学）　　孟晓東（上海交通大学）　　胡振江（国立情報学研究所，総合研究大学院大学） 11:30-12:15 C＃のためのコンテキスト指向プログラミングとStrategyパターンの比較　○上條弘貴（東海大学大学院情報通信学研究科）　　渡辺晴美（東海大学大学院情報通信学研究科） −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 12:15–13:30 休憩 −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 13:30–14:15 規則違反コードの構造を反映した木パタンを用いるコード検査器　○中村真也（高知工科大学）　　鵜川始陽（高知工科大学）　　馬谷誠二（京都大学大学院情報学研究科） 14:15–15:00 有効範囲を既知のコールパスに限定するRuby向けの安全なクラス拡張 Method seals 　○福室嶺（東京大学大学院情報理工学系研究科）　　千葉滋（東京大学大学院情報理工学系研究科） 15:00–15:45 A Polyhedral Framework for X10 Programs 　○堀江倫大（日本アイ・ビー・エム）　　竹内幹雄（日本アイ・ビー・エム）　　河内谷清久仁（日本アイ・ビー・エム）

1 0

CSセミナーin桐生
by Fujita Kenetsu 16 Feb '16

16 Feb '16

(* Apologies for any cross-postings. *) 皆様，講演会のご案内です． http://www.cs.gunma-u.ac.jp/~fujita/research/20160229Seminar.html どうぞお気軽にお立ち寄りください．問い合わせ先：群馬大学　藤田憲悦 **************************************************************************************************** +++ Computer Science Seminar in Kiryu +++ Programme Monday, February 29, 2016 14:00—15:30 Lecture room J3 (the building no. 6), Kiryu campus, Gunma University “Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems” Professor Aart Middeldorp (University of Innsbruck, Austria) Abstract: The first-order theory of rewriting is decidable for finite left-linear right-ground rewrite systems. We present a new tool that implements the decision procedure, which is based on tree automata techniques, for this theory. The tool offers the possibility to synthesize rewrite systems that satisfy properties that are expressible in the first-order theory of rewriting. In the talk, which is based on joint work with Franziska Rapp, we explain the decision and synthesis algorithms and demonstrate the tool. No knowledge of term rewriting is assumed. ************************************************************************************************************ Access to Kiryu campus, Gunma University: http://www.st.gunma-u.ac.jp/other/14.html Map of Kiryu campus: http://www.st.gunma-u.ac.jp/other/13.html For more information, please contact at the following \beta-normal form: (\lambda X. fujitX(a)cs.gunmX-u.Xc.jp)a (Ken-etsu Fujita, Gunma University). ----------------------------------------------------------------------------------------------------------

1 0

CFP - INTERNATIONAL JOURNAL OF COMPUTATIONAL LINGUISTICS (IJCL)
by J. Steward 15 Feb '16

15 Feb '16

CALL FOR PAPERS International Journal of Computational Linguistics (IJCL) ISSN - 2180-1266 http://www.cscjournals.org/journals/IJCL/description.php Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. Today, computational language acquisition stands as one of the most fundamental, beguiling, and surprisingly open questions for computer science. International Journal of Computational Linguistics (IJCL) is a peer review open access bi-monthly journal providing a scientific forum where computer scientists, experts in artificial intelligence, mathematicians, logicians, cognitive scientists, cognitive psychologists, psycholinguists, anthropologists and neuroscientists can present research and experimental studies. The journal publishes papers that describe state-of-the-art techniques, scientific research studies and results in computational linguistics in general but computational models, corpus linguistics, computational theories, information retrieval and extraction, linguistics modeling techniques, linguistics theories, machine translation, natural language processing, quantitative linguistics, speech analysis and speech recognition in particular. IJCL invite linguistic specialists, researchers and scientists from different domains to share their understanding and contributions towards linguistics that set scientific objectives and demonstrate the operation of new methods in the field of computational linguistics. EDITORIAL BOARD MEMBERS Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan) Dr. Pascaline Merten - HEB-ISTI (Belgium) Dr. Pawel Dybala - Otaru University of Commerce (Japan) Dr. John Hanhong LI - (China) Dr. Stephen Doherty - Dublin City University (Ireland) LIST OF TOPICS Comparative Surveys that Critique Previously Repor Computational Linguistics Computational Models Computational Theories Corpus Linguistics Formal Linguistics-Theoretic and Grammar Induction Information Retrieval and Extraction Language Generation Language Learning Linguistics Modeling Techniques Linguistics Theories Machine Translation Models of Language Change and its Effect on Lingui Models that Address the Acquisition of Word-order Models that Combine Linguistics Parsing Models that Employ Statistical/probabilistic Gramm Models that Employ Techniques from machine learnin Natural Language Processing Quantitative Linguistics Speech Analysis/Synthesis Speech Recognition/Understanding Spoken Dialog Systems Web Information Extraction/Mining IMPORTANT DATES Paper Submission - February 29, 2016 Author Notification - March 31, 2016 Issue Publication - April 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJCL Manuscript Preparation Guidelines. For further information, please refer to the following information. IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJCL/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Computational Linguistics (IJCL) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJCL is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJCL particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJCL welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJCL-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJCL/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Computational Linguistics (IJCL) Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

Fwd: 松山 TGSAセミナーのお知らせ（３月２日）
by Hiroshi Fujita 14 Feb '16

14 Feb '16

こんにちは。愛媛大学の藤田です。次回の松山TGSAセミナーの案内を転送します。重複してお受け取りの場合はご寛恕を願います。 -- 藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> 愛媛大学大学院理工学研究科数理物質科学専攻 -------- Forwarded Message -------- Subject: 松山 TGSAセミナーのお知らせ（３月２日） Date: Sat, 13 Feb 2016 11:35:12 +0000 From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> To: fujita.hiroshi.mh(a)ehime-u.ac.jp CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 皆様、「Matsuyama Seminar on Topology, Geometry, Set Theory and their Applications」（松山TGSAセミナー）のお知らせです。研究の背景、動機から講演していただきますので、お気軽にご参加ください。 ***** 第19回のセミナー日時: 2016年3月2日（水） 16:30〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者: Alejandro Dorantes-Aldama (Universidad Nacional Autonoma de Mexico, Visiting Foreign Researcher of Ehime University) （メキシコ国立自治大学・愛媛大学外国人客員研究員）題目: Almost irresolvable spaces Abstract: A topological space X is almost resolvable if X is the union of a countable collection of subsets each of them with empty interior. We prove that under the Continuum Hypothesis, the existence of a measurable cardinal is equivalent to the existence of a Baire crowded ccc almost irresolvable T_1 space. We also prove that: (1) Every crowded ccc space with cardinality less than the first weakly inaccessible cardinal is almost resolvable. (2) If 2^{\omega} is less than the first weakly inaccessible cardinal, then every T_2 crowded ccc space is almost resolvable. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ <dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

SYSMICS 2016 call for abstracts
by 小野寛晰 09 Feb '16

09 Feb '16

[Apologies for multiple copies] =================================================== SYNTAX MEETS SEMANTICS (SYSMICS 2016) =================================================== 5-9 September 2016, Barcelona (Spain) http://sysmics-16.iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=3JrhEPnWJhwDmPZQ96mbMm4AzZ8sc_ctIquEEEp-etY-za6EzjDTCAFodHRwOi8vc3lzbWljcy0xNi5paWlhLmNzaWMuZXMv> ***** (PRELIMINARY) CALL FOR ABSTRACTS ***** Scope --------- Substructural logics are formal reasoning systems that refine classical logic by weakening structural rules in a Gentzen-style sequent calculus. Intuitionistic, many-valued, linear logics, are typical examples. Traditionally, substructural logics have been investigated using proof theoretic and algebraic methods. In recent years, combined approaches have started to emerge. The programme of the SYSMICS conference will focus on interactions between syntactic and semantic methods in substructural logics. This open conference is the first of a series of meetings planned in the SYSMICS RISE project (http://logica.dmi.unisa.it/sysmics/ <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=qdlC0cxPfFZ_fCN0wUjwAcIRa-ScwOLHWRs6wFFw4f0-za6EzjDTCAFodHRwOi8vbG9naWNhLmRtaS51bmlzYS5pdC9zeXNtaWNzLw..>) during 2016-2019. Featured topics --------------------- Contributed talks can be on any topic related to substructural logic. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebraic aspects of logic * Categorical methods in logic * Gentzen systems * Lattice theory * Lattices with operators * Linear logic * Mathematical fuzzy logic * Non-classical logics * Ordered algebraic structures * Proofs and Types * Stone-type dualities * Topological semantics Programme Committee ------------------------------ Stefano Aguzzoli (University of Milano) Nick Bezhanishvili (University of Amsterdam) Agata Ciabattoni (Vienna University of Technology) Petr Cintula (Czech Academy of Sciences) Pilar Dellunde (Autonomous University of Barcelona) Brunella Gerla (University of Insubria) Lluis Godo (CSIC - IIIA Barcelona) Ramon Jansana (University of Barcelona) Jan Kühr (University of Olomouc) Antonio Ledda (University of Cagliari) George Metcalfe (University of Bern) Carles Noguera (Czech Academy of Sciences) Luca Spada (University of Salerno, chair) Organising Committee ------------------------------ Pilar Dellunde (Autonomous University of Barcelona) Joan Gispert (University of Barcelona) Ramon Jansana (University of Barcelona) Lluis Godo, (CSIC - IIIA Barcelona, Chair) Diego Valota (CSIC - IIIA Barcelona) Dates --------------------------- Deadline for submissions 30 April 2016 Notification of acceptance 30 May 2016 Conference dates 5-9 September 2016 Submissions ------------------------------ The Programme Committee accepts submissions of abstracts ranging from 2 to 4 pages. The abstracts should be formatted according to EasyChair style, instructions can be found at http://easychair.org/publications/easychair.zip <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=I3icUbodjNiO_GfCHFENkLALHlEA8BSgN_dIoQoFWlc-za6EzjDTCAFodHRwOi8vZWFzeWNoYWlyLm9yZy9wdWJsaWNhdGlvbnMvZWFzeWNoYWlyLnppcA..> . Abstracts can be submitted at the following address: https://easychair.org/conferences/?conf=sysmics2016 <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=cJ7bDbGAj3zV8a4bwPMz8F93-rTaMHzOPtpe4ELlaTc-za6EzjDTCAFodHRwczovL2Vhc3ljaGFpci5vcmcvY29uZmVyZW5jZXMvP2NvbmY9c3lzbWljczIwMTY.> A short text-only abstract will also be requested during submission. Expression of interest ------------------------------ Expressions of interests will be greatly appreciated, please fill in the simple form on the conference web site under "Express Interest". This will help the Organising Committee with their planning. You can also opt-out from receiving future announcements by following the instructions on the web site. More Information ----------------------- SYSMICS 2016 web site: http://sysmics-16.iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=3JrhEPnWJhwDmPZQ96mbMm4AzZ8sc_ctIquEEEp-etY-za6EzjDTCAFodHRwOi8vc3lzbWljcy0xNi5paWlhLmNzaWMuZXMv> Use this site for updates on the program, invited speakers and local information, including hotel accommodations, travel information and registration. Any queries regarding the conference should be sent to sysmics-oc(a)iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=tKqFlroc_eIKlpqFgMTlQ9Xf6dfQdHH2L4kOQ4Thdgk-za6EzjDTCAFtYWlsdG86c3lzbWljcy1vY0BpaWlhLmNzaWMuZXM.>.

1 0

AiML-2016: 2ND CALL FOR PAPERS
by 小野寛晰 09 Feb '16

09 Feb '16

(sorry for multiple copies) AiML-2016: 2ND CALL FOR PAPERS 11TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC BUDAPEST, 29 AUGUST -- 2 SEPTEMBER 2016 http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences. Information about the AiML series can be obtained at http://www.aiml.net <http://www.aiml.net/>. AiML-2016 is the 11th conference in the series. TOPICS We invite submission on all aspects of modal logic, including: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic (complexity and decidability of modal and temporal logics, modal and temporal logic programming, model checking, model generation, theorem proving for modal logics) - theoretical aspects of modal logic (algebraic/categorical perspectives on modal logic, coalgebraic modal logic, completeness and canonicity, correspondence and duality theory, many-dimensional modal logics, modal fixed point logics, model theory of modal logic, proof theory of modal logic) - specific instances and variations of modal logic (description logics, modal logics over non-boolean bases, dynamic logics and other process logics, epistemic and deontic logics, modal logics for agent-based systems, modal logic and game theory, modal logic and grammar formalisms, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics, computationally light fragments of all such logics) Papers on related subjects will also be considered. PAPER SUBMISSIONS There will be two types of submissions to AiML-2016: (1) Full papers for publication in the proceedings and presentation at the conference. (2) Short presentations intended for presentation at the conference but not for the published proceedings. Both types of papers should be submitted electronically using the EasyChair submission page at https://easychair.org/conferences/?conf=aiml16 <https://easychair.org/conferences/?conf=aiml16> At least one author of each accepted paper or short presentation must register for and attend the conference. (1) FULL PAPERS Authors are invited to submit, for presentation at the conference and publication in the proceedings, full papers reporting on original research and not submitted elsewhere. The proceedings of AiML-2016 will be published by College Publications http://www.collegepublications.co.uk <http://www.collegepublications.co.uk/> in a volume to be made available at the conference. The submissions should be at most 15 pages, with an optional technical appendix of up to 5 pages, together with a plain-text abstract of 100-200 words. The submissions must be typeset in LaTeX, using the style files and template that will be provided on the AiML-2016 website http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> in due time. We also ask authors of full papers to submit the abstract in plain text via EasyChair by 10 March. (2) SHORT PRESENTATIONS. These should be at most 5 pages. They may describe preliminary results, work in progress etc., and will be subject to light reviewing. The accepted submissions will be made available at the conference, and the authors will have the opportunity to give short presentations (of up to 15 minutes) on them. INVITED SPEAKERS INCLUDE: Kit Fine (New York University, USA) Sonja Smets (ILLC, Universiteit van Amsterdam) Yde Venema (ILLC, Universiteit van Amsterdam) Guram Bezhanishvili (New Mexico State University) LOCAL ORGANIZING COMMITTEE Tamas Bitai (Eotvos University, Budapest, Hungary) Reka Markovich (Eotvos University, Budapest, Hungary) Andras Mate (Eotvos University, Budapest, Hungary) Péter Mekis (Eotvos University, Budapest, Hungary) Attila Molnar (Eotvos University, Budapest, Hungary) Gergely Szekely (Alfred Rényi Institute of Mathematics, Hungarian Academy of Sciences) PROGRAMME COMMITTEE Natasha Alechina (University of Nottingham) Carlos Areces (FaMAF, Universidad Nacional de Córdoba) Philippe Balbiani (IRIT, Toulouse, France) Alexandru Baltag (FNWI ILLC) Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow) Thomas Bolander (Technical University of Denmark) Torben Brauner (Roskilde University, Denmark) Serenella Cerrito (Laboratoire IBISC, Evry France) Stéphane Demri (LSV, CNRS, ENS Cachan) Valeria de Paiva (Nuance, USA) David Fernandez-Duque (Instituto Tecnológico Autónomo de México) Melvin Fitting (Lehman College, CUNY, USA) David Gabelaia (The Free University of Tbilisi, Tbilisi, Georgia) Silvio Ghilardi (Università degli Studi di Milano, Italy) Valentin Goranko (Stockholm University) Rajeev Gore (The Australian National University) Andreas Herzig (IRIT, Toulouse, France) Rosalie Iemhoff (Utrecht University) Agi Kurucz (King's College London) Roman Kuznets (TU Wien) Martin Lange (University of Kassel, Germany) Carsten Lutz (Universität Bremen) Andras Mate (Eotvos University, Budapest, Hungary) Angelo Montanari (University of Udine) Larry Moss (Indiana University, USA) Sara Negri (University of Helsinki) Sergei Odintsov (Novosibirsk State University) Hiroakira Ono (Japan Advanced Insitute of Science and Technology) Mark Reynolds (The University of Western Australia) Ilya Shapirovsky (Institute for the Information Transmission Problems) Renate Schmidt (University of Manchester) Valentin Shehtman (Institute for the Information Transmission Problems) Viorica Sofronie-Stokkermans (Universitat Koblenz-Landau) Thomas Studer (Universität Bern) Rineke Verbrugge (Groningen, NL) Heinrich Wansing (Ruhr University Bochum) Michael Zakharyaschev (Birkbeck College London, UK) PROGRAMME COMMITTEE CO-CHAIRS Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow) Stephane Demri (LSV, CNRS, ENS Cachan) IMPORTANT DATES Abstracts of full papers submission deadline: 10 March 2016 Full papers submission deadline: 17 March 2016 Full papers acceptance notification: 14 May 2016 Short presentations submission deadline: 16 May 2016 Short presentations acceptance notification: 30 May 2016 Final version of full papers and short presentations due: 8 June 2016 Conference: 29 August -- 2 September 2016 FURTHER INFORMATION. Please see http://phil.elte.hu/aiml2016/?page=call_for_papers <http://phil.elte.hu/aiml2016/?page=call_for_papers> ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs, sent to aiml16(a)easychair.org <mailto:aiml16@easychair.org>

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

FLOPS2016 募集募集 (早期登録締切 2/10 (水))
by Yukiyoshi Kameyama 08 Feb '16

08 Feb '16

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議 FLOPS2016 -- Functional and Logic Programming -- の early registration の締切が 2/10 (水) となりましたので，参加募集を，再度お送りします。 FLOPS2016 は関数型および論理型プログラミングに関する国際会議で， PPL2016 の直前の 3/4-6 に、比較的近い場所で開催されます。今回のプログラムは，上田和紀先生と Atze Dijkstra さんによる招待講演， 3件のチュートリアル，そして一般講演から構成されていて，この分野の最新の情報を入手することができます．多くの皆様の参加をお待ちしています。 --------------------------------------------------------------------- Call for Participation --------------- FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/ Early registration deadline is Monday, Feb 10, 2016. (extended) FLOPS aims to bring together practitioners, researchers and implementers 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. In addition to the presentations of regular research papers, the FLOPS program includes tutorials, as well as the poster/demo session for demonstrating the tools and systems described during the talks and for presenting works-in-progress and getting the feedback. FLOPS has established a Best Paper award. The winner will be announced at the symposium. INVITED TALKS Kazunori Ueda The exciting time and hard-won lessons of the Fifth Generation Computer Project Atze Dijkstra UHC: Coping with Compiler Complexity TUTORIALS Andreas Abel, on Agda Atze Dijkstra, on Attribute Grammars Neng-Fa Zhou, on programming in Picat PROGRAMME Mar 4 09:45 Opening, best-paper award 10:00 Invited talk (1h10) Kazunori Ueda: The exciting time and hard-won lessons of the Fifth Generation Computer Project 11:10 Break (0h30) 11:40 Sess 1: From proofs to programs (2x0h30) Arthur Blot, Pierre-Evariste Dagand and Julia Lawall: From Sets to Bits in Coq Wouter Swierstra and Joao Alpuim: From proposition to program: embedding the refinement calculus in Coq 12:40 Lunch (1h50) 14:30 Sess 2: Systems (2x0h30) Markus Triska: The Boolean Constraint Solver of SWI-Prolog: System Description Praveen Narayanan, Jacques Carette, Wren Romano, Chung-Chieh Shan and Robert Zinkov: Probabilistic inference by program transformation in Hakaru: System description 15:30 Break (0h30) 16:00 Sess 3: Pearls (2x0h30) Ian Mackie and Shinya Sato: An interaction net encoding of Godel's System T Taus Brock-Nannestad: Space-efficient Planar Acyclicity Constraints 17:00 Break and Posters Mar 5 09:30 Invited talk (1h10 min) Atze Dijkstra: UHC: Coping with Compiler Complexity 10:40 Break (0h30) 11:10 Sess 4: Logic Programming for type systems (2x0h30) Ki Yung Ahn and Andrea Vezzosi: Executable Relational Specifications of Polymorphic Type Systems using Prolog Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond: Proof Relevant Corecursive Resolution 12:10 Lunch (1h50) 14:00 Sess 5: Reasoning about performance (2x0h30) Jay McCarthy, Burke Fetscher, Max New, Daniel Feltey, and Robert Bruce Findler: A Coq Library For Internal Verification of Running-Times Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen, John Gallagher and Manuel V. Hermenegildo: A Transformational Approach to Parametric Accumulated-cost Static Profiling 15:00 Break (0h30) 15:30 Tutorial 1 (1h30) Neng-Fa Zhou, on programming in Picat 17:00 End 18:30 Banquet Mar 6 09:30 Sess 6: Generic specifications (2x0h30) Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala: Polymorphic Types in Erlang Function Specifications Jeremy Yallop, David Sheets and Anil Madhavapeddy: Declarative foreign function binding through generic programming 10:30 Break (0h30) 11:00 Sess 7: Declarative programming with algebra (2x0h30) Akimasa Morihata: Incremental Computing with Abstract Data Structures Andre Van Delft and Anatoliy Kmetyuk: Declarative Programming with Algebra 12:00 Excursion and Lunch, 2h00 14:00 Tutorial 2 (1h30) Atze Dijkstra, on Attribute Grammars 15:30 Break (0h30) 16:00 Tutorial 3 (1h30) Andreas Abel, on Agda SPONSOR Japan Society for Software Science and Technology (JSSST), Special Interest Group on Programming and Programming Languages (SIG-PPL) IN COOPERATION WITH ACM SIGPLAN Asian Association for Foundation of Software (AAFS) Association for Logic Programming (ALP) CONTACT ADDRESS flops2016 at logic.cs.tsukuba.ac.jp ---------------------------------------------------------------------

1 0

PPL2016参加募集：第18回プログラミングおよびプログラミング言語ワークショップ
by Hiroshi UNNO 05 Feb '16

05 Feb '16

logic-ml関係者の皆様，筑波大学の海野です．複数受け取られた場合はご容赦ください． 3月7日(月)〜9日(水)に，岡山県で開催されます，第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) の参加登録を開始いたしましたので，そのご案内をお届けいたします．多くの方々のご参加をお待ちしております．参加登録の締切は2月22日(月)です．どうぞお早めのご登録をお願い致します．また，カテゴリ3(ポスター・デモ発表)の発表申込締切が2月8日(月)17:00(JST) となっております．お申し込みをぜひご検討ください． PPL2016では，招待講演として， * 奥田遼介 (Preferred Networks) 「ディープラーニングフレームワークとChainerの実装」 * Julia Lawall (Inria) 「Finding the right level of abstraction: Program analysis and the Linux kernel」の2件を予定しております．また，PPL2016の開始予定時刻は13:30，終了予定時刻は13:00です．なお，PPL 2016 は，FLOPS 2016 (3月4日〜6日，高知市で開催)との近接開催を謳っております．こちらのearly registrationも2月8日までとなっておりますので，一緒にご検討頂けますと幸いです． -------------------------------------------------------------------------- 第18回プログラミングおよびプログラミング言語ワークショップ（PPL2016） http://logic.cs.tsukuba.ac.jp/ppl2016/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)～3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」 PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． http://logic.cs.tsukuba.ac.jp/ppl2016/registration/ 参加登録締切：2月22日(月) 問い合わせ先：ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也千葉工業大学岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] --------------------------------------------------------------------------

1 0

Kusatsu Seminar 2016
by Toshihiko Kurata 02 Feb '16

02 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 30 Jan '16

30 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

Deadline Extension: FSCD'16
by hassei＠kurims.kyoto-u.ac.jp 29 Jan '16

29 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の投稿締切が延長されましたので、ご案内させていただきます。 FSCD (Formal Structures for Computation and Deduction)は、 RTA (Rewriting Techniques and Applications)と TLCA (Typed Lambda Calculi and Applications)を融合・発展させた新しい会議です。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 -- CALL FOR PAPERS - DEADLINE EXTENSION First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ *** ABSTRACT SUBMISSION DEADLINE EXTENDED TO: 8 FEBRUARY 2016 *** *** PAPER SUBMISSION DEADLINE EXTENDED TO: 12 FEBRUARY 2016 *** ========================================================================== IMPORTANT DATES Abstract Submission: 8 February 2016 Paper Submission : 12 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== 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, proof theory and new emerging models of computation such as quantum computing and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 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 (resolution, paramodulation, narrowing, focusing, etc.) * 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, resources, 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 (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. 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. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 CONFERENCE AWARDS Two awards will be selected: one for the best paper and another one for the best student paper. SPECIAL ISSUE After the conference, authors of selected papers will be invited to submit extended versions of their work to a special issue published in the open-access journal Logical Methods in Computer Science (LMCS). SATELLITE EVENTS The following meetings and workshops are colocated with FSCD 2016: CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP, LSFA, UNIF, WPTE, WWV. ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

Linearity 2016 - CFP
by hassei＠kurims.kyoto-u.ac.jp 27 Jan '16

27 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の併設ワークショップ Linearity 2016 のcall for papersです。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 ======================================================================= Call for Papers Fourth International Workshop on Linearity LINEARITY'16 Porto, Portugal, 25 June 2016 Affiliated with FSCD'16 http://www.cs.cmu.edu/~linearity16 ======================================================================= SUBMISSION DEADLINE: 8 APRIL 2016 Ever since the birth of Girard's linear logic, there has been a stream of research in Computer Science where linearity is a key issue, covering both theoretical topics and applications, such as work on proof technology, complexity classes and more recently quantum computation, program analysis, expressive operational semantics, linear programming languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include, but are not limited to: - sub-linear logics - linear term calculi - linear type systems - linear proof-theory - linear programming languages - applications to concurrency - interaction-based systems - verification of linear systems - quantum models of computation - biological and chemical models of computation Important Dates Abstract submission deadline: Friday 8 April 2016 Submission deadline: Friday 15 April 2016 Notification to authors: Friday 13 May 2016 Final versions due: Friday 27 May 2016 Workshop date: Saturday 25 June 2016 Submission Authors are invited to submit an extended abstract (8 pages max) describing original ideas and recent results not published nor submitted elsewhere, or a 5-page abstract presenting relevant work that has been or will be published elsewhere, or work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=linearity2016 Publication After the workshop, authors of the extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in an electronic journal such as EPTCS. These submissions will undergo a second round of refereeing. Furthermore, we envision publication of a special issue of a journal after the event. Programme Committee - Emmanuel Beffara (Universite d'Aix-Marseille) - Luis Caires (Universidade Nova de Lisboa) - Iliano Cervesato (Carnegie Mellon University, co-chair) - Maribel Fernandez (King's College London, co-chair) - Marco Gaboardi (University at Buffalo, SUNY) - Masahito Hasegawa (Kyoto University) - Damiano Mazza (CNRS - Universite Paris 13) - Vivek Nigam (Universidade Federal da Paraiba) - Giselle Reis (Inria) - Claudio Sacerdoti Coen (University of Bologna) - Andre Scedrov (University of Pennsylvania) Contact Iliano Cervesato: iliano(a)cmu.edu Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk =======================================================================

1 0

『第３回山陰基礎論・解析学研究集会』の御案内
by Horihata Yoshihiro 26 Jan '16

26 Jan '16

Logic-ml 各位米子高専の堀畑です．今週末，３０日（土）と３１日（日）に米子・皆生温泉で件名の研究会を開催いたします！参加自由ですので，お気軽に御参加頂ければ幸いです！招待講演者として，神戸大の薄葉季路先生をお招きいたします．詳細はホームページをご参照ください： https://sites.google.com/site/yonagonctmath/slas2016 発表１１件，参加者は下記です（敬称略）．阿部吉弘　　（神奈川大学）井上誠（愛媛大学）薄葉季路　　（神戸大学）嘉田勝　　　（大阪府立大学）蔵岡誉司　　（米子高専）倉橋太志　　（木更津高専）古清水大直（米子高専）小浪吉史　　（島根大学）小林玉青　　（米子高専）静間荘司　　（大阪府立大学）松露真末次美昭　　（信州大学）瀬戸道生　　（防衛大学）高木啓行　　（信州大学）竹内耕太　　（筑波大学）根元多佳子（JAIST）樋口幸治郎（千葉大学）堀畑佳宏　　（米子高専）南裕明（神戸大学）山辺雅司　　（信州大学）吉居啓輔　　（沖縄高専）米子高専・数学同好会学生２人以上です．よろしくお願いします．堀畑佳宏 -- 米子工業高等専門学校教養教育科・数学〒683-8502 鳥取県米子市彦名町4448 Tel: 0859-24-5075 E-mail: horihata(a)yonago-k.ac.jp

1 0

市民講演会poster
by logic＠math.tsukuba.ac.jp 23 Jan '16

23 Jan '16

筑波大学数学のにしむらです。今年３月は数学会年会は本学で開催されますが、それに付随して開かれる市民講演会のposterが決定していますので、ご案内しておきます。にしむら

1 0

FSCD'16 Final Call for Papers
by hassei＠kurims.kyoto-u.ac.jp 22 Jan '16

22 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の(final) call for papers です。 FSCD (Formal Structures for Computation and Deduction)は、 RTA (Rewriting Techniques and Applications)と TLCA (Typed Lambda Calculi and Applications)を融合・発展させた新しい会議です。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 -- FINAL CALL FOR PAPERS First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ *** ABSTRACT SUBMISSION DUE 29 JANUARY 2016 *** **** PAPER SUBMISSION DUE 5 FEBRUARY 2016 **** ========================================================================== IMPORTANT DATES Abstract Submission: 29 January 2016 Paper Submission : 5 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== 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, proof theory and new emerging models of computation such as quantum computing and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 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 (resolution, paramodulation, narrowing, focusing, etc.) * 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, resources, 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 (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. 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. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 CONFERENCE AWARDS Two awards will be selected: one for the best paper and another one for the best student paper. SPECIAL ISSUE After the conference, authors of selected papers will be invited to submit extended versions of their work to a special issue published in the open-access journal Logical Methods in Computer Science (LMCS). SATELLITE EVENTS The following meetings and workshops are colocated with FSCD 2016: CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP, LSFA, UNIF, WPTE, WWV. ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

[CSC Journals] CFP INTERNATIONAL JOURNAL OF COMPUTATIONAL LINGUISTICS (IJCL)
by J. Steward 19 Jan '16

19 Jan '16

CALL FOR PAPERS International Journal of Computational Linguistics (IJCL) ISSN - 2180-1266 http://www.cscjournals.org/journals/IJCL/description.php Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. Today, computational language acquisition stands as one of the most fundamental, beguiling, and surprisingly open questions for computer science. International Journal of Computational Linguistics (IJCL) is a peer review open access bi-monthly journal providing a scientific forum where computer scientists, experts in artificial intelligence, mathematicians, logicians, cognitive scientists, cognitive psychologists, psycholinguists, anthropologists and neuroscientists can present research and experimental studies. The journal publishes papers that describe state-of-the-art techniques, scientific research studies and results in computational linguistics in general but computational models, corpus linguistics, computational theories, information retrieval and extraction, linguistics modeling techniques, linguistics theories, machine translation, natural language processing, quantitative linguistics, speech analysis and speech recognition in particular. IJCL invite linguistic specialists, researchers and scientists from different domains to share their understanding and contributions towards linguistics that set scientific objectives and demonstrate the operation of new methods in the field of computational linguistics. EDITORIAL BOARD MEMBERS Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan) Dr. Pascaline Merten - HEB-ISTI (Belgium) Dr. Pawel Dybala - Otaru University of Commerce (Japan) Dr. John Hanhong LI - (China) Dr. Stephen Doherty - Dublin City University (Ireland) LIST OF TOPICS Comparative Surveys that Critique Previously Repor Computational Linguistics Computational Models Computational Theories Corpus Linguistics Formal Linguistics-Theoretic and Grammar Induction Information Retrieval and Extraction Language Generation Language Learning Linguistics Modeling Techniques Linguistics Theories Machine Translation Models of Language Change and its Effect on Lingui Models that Address the Acquisition of Word-order Models that Combine Linguistics Parsing Models that Employ Statistical/probabilistic Gramm Models that Employ Techniques from machine learnin Natural Language Processing Quantitative Linguistics Speech Analysis/Synthesis Speech Recognition/Understanding Spoken Dialog Systems Web Information Extraction/Mining IMPORTANT DATES Paper Submission - January 31, 2016 Author Notification - February 28, 2016 Issue Publication - March 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJCL Manuscript Preparation Guidelines. For further information, please refer to the following information. IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJCL/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Computational Linguistics (IJCL) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJCL is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJCL particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJCL welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJCL-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJCL/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Computational Linguistics (IJCL) Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

CFP: PPL 2016 カテゴリ2-4
by Takahito Aoto 18 Jan '16

18 Jan '16

PPL 2016のカテゴリ2,4の申込締切が来週の月曜に迫ってまいりましたので，再度アナウンスさせて頂きます．　カテゴリ2 (国外既発表論文) 発表申込締切: 2016年1月25日(月) 17:00 (JST) 　カテゴリ4 (サーベイ・チュートリアル発表) 発表申込締切: 2016年1月25日(月) 17:00 (JST) 申し込みはEasyChairからです．ぜひ申し込みをご検討頂ければ幸いです．--- 青戸(新潟大学) ====================================================================== 第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) http://logic.cs.tsukuba.ac.jp/ppl2016/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)〜3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」http://www.marine-hotel.co.jp/ PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布はウェブを用いる場合を含め，参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2016プログラム委員会により優れていると認められたものは，PPL2016終了後(2016年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2016推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3 (ポスター・デモ発表) ----------------------------- 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) -------------------------------------- 研究動向の紹介(発表者の研究も含む)や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2016ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．なお，PPL2015と同様，PPL2016の終了は夕刻(14:00〜16:00頃)を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://www.easychair.org/conferences/?conf=ppl2016 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2015年12月28日(月) 17:00 (JST) [締切済] 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2016年1月12日(火) 17:00 (JST) [締切済] 10ページ程度(最大15ページ)の論文(日本語もしくは英語，PDF形式． PPL2016ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．採否通知: 2016年2月2日(火) 最終原稿締切: 2016年2月15日(月) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします．ページ数制限は投稿版と同じ予定です． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります (他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2016年1月25日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知: 2016年2月5日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨を説明してください．発表申込締切: 2016年2月8日(月) 17:00 (JST) 希望する発表形態(ポスター・デモの別)を明記して，著者名，所属，発表タイトル，発表概要(200〜300字程度)，キーワード(3つ以上) を提出してください．採否通知: 2016年2月15日(月) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2016年1月25日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要 (3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知: 2016年2月5日(金) ====================================================================== ワークショップ全般に関する問い合わせ先： ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也理化学研究所岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] ======================================================================

1 0

AiML-2016: 1ST CALL FOR PAPERS
by 小野寛晰 11 Jan '16

11 Jan '16

(sorry for multiple copies) AiML-2016: 1ST CALL FOR PAPERS 11TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC BUDAPEST, 29 AUGUST -- 2 SEPTEMBER 2016 http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences. Information about the AiML series can be obtained at http://www.aiml.net <http://www.aiml.net/>. AiML-2016 is the 11th conference in the series. TOPICS We invite submission on all aspects of modal logic, including: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic (complexity and decidability of modal and temporal logics, modal and temporal logic programming, model checking, model generation, theorem proving for modal logics) - theoretical aspects of modal logic (algebraic/categorical perspectives on modal logic, coalgebraic modal logic, completeness and canonicity, correspondence and duality theory, many-dimensional modal logics, modal fixed point logics, model theory of modal logic, proof theory of modal logic) - specific instances and variations of modal logic (description logics, modal logics over non-boolean bases, dynamic logics and other process logics, epistemic and deontic logics, modal logics for agent-based systems, modal logic and game theory, modal logic and grammar formalisms, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics, computationally light fragments of all such logics) Papers on related subjects will also be considered. PAPER SUBMISSIONS There will be two types of submissions to AiML-2016: (1) Full papers for publication in the proceedings and presentation at the conference. (2) Short presentations intended for presentation at the conference but not for the published proceedings. Both types of papers should be submitted electronically using the EasyChair submission page at https://easychair.org/conferences/?conf=aiml16 <https://easychair.org/conferences/?conf=aiml16> At least one author of each accepted paper or short presentation must register for and attend the conference. (1) FULL PAPERS Authors are invited to submit, for presentation at the conference and publication in the proceedings, full papers reporting on original research and not submitted elsewhere. The proceedings of AiML-2016 will be published by College Publications http://www.collegepublications.co.uk <http://www.collegepublications.co.uk/> in a volume to be made available at the conference. The submissions should be at most 15 pages, with an optional technical appendix of up to 5 pages, together with a plain-text abstract of 100-200 words. The submissions must be typeset in LaTeX, using the style files and template that will be provided on the AiML-2016 website http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> in due time. We also ask authors of full papers to submit the abstract in plain text via EasyChair by 10 March. (2) SHORT PRESENTATIONS. These should be at most 5 pages. They may describe preliminary results, work in progress etc., and will be subject to light reviewing. The accepted submissions will be made available at the conference, and the authors will have the opportunity to give short presentations (of up to 15 minutes) on them. INVITED SPEAKERS: (to be completed) LOCAL ORGANIZING COMMITTEE Tamás Bitai (Eötvös University, Budapest, Hungary) Réka Markovich (Eötvös University, Budapest, Hungary) András Máté (Eötvös University, Budapest, Hungary) Péter Mekis (Eötvös University, Budapest, Hungary) Attila Molnár (Eötvös University, Budapest, Hungary) Gergely Székely (Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences) PROGRAMME COMMITTEE Natasha Alechina (University of Nottingham) Carlos Areces (FaMAF, Universidad Nacional de Córdoba) Philippe Balbiani (IRIT, Toulouse, France) Alexandru Baltag (FNWI ILLC) Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow) Thomas Bolander (Technical University of Denmark) Torben Braüner (Roskilde University, Denmark) Serenella Cerrito (Laboratoire IBISC, Evry France) Stéphane Demri (LSV, CNRS, ENS Cachan) David Fernández-Duque (Instituto Tecnológico Autónomo de México) Melvin Fitting (Lehman College, CUNY, USA) David Gabelaia (gabelaia at gmail dot com) (The Free University of Tbilisi, Tbilisi, Georgia) Silvio Ghilardi (Università degli Studi di Milano, Italy) Valentin Goranko (Stockholm University) Rajeev Goré (The Australian National University) Andreas Herzig (IRIT, Toulouse, France) Rosalie Iemhoff (Utrecht University) Agi Kurucz (King's College London) Roman Kuznets (TU Wien) Martin Lange (University of Kassel, Germany) Carsten Lutz (Universität Bremen) András Máté (Eötvös University, Budapest, Hungary) Angelo Montanari (University of Udine) Larry Moss (Indiana University, USA) Sergei Odintsov (Novosibirsk State University) Hiroakira Ono (Japan Advanced Insitute of Science and Technology) Mark Reynolds (The University of Western Australia) Ilya Shapirovsky (Institute for the Information Transmission Problems) Renate Schmidt (University of Manchester) Valentin Shehtman (Institute for the Information Transmission Problems) Thomas Studer (Universität Bern) Heinrich Wansing (Ruhr University Bochum) Michael Zakharyaschev (Birkbeck College London, UK) PROGRAMME COMMITTEE CO-CHAIRS Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow) Stéphane Demri (LSV, CNRS, ENS Cachan) IMPORTANT DATES Abstracts of full papers submission deadline: 10 March 2016 Full papers submission deadline: 17 March 2016 Full papers acceptance notification: 14 May 2016 Short presentations submission deadline: 16 May 2016 Short presentations acceptance notification: 30 May 2016 Final version of full papers and short presentations due: 8 June 2016 Conference: 29 August -- 2 September 2016 FURTHER INFORMATION. Please see http://phil.elte.hu/aiml2016/?page=call_for_papers <http://phil.elte.hu/aiml2016/?page=call_for_papers> ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs, sent to aiml16(a)easychair.org <mailto:aiml16@easychair.org>

1 0

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

10 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

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml