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

JAIST Logic Seminar Series
by Hajime Ishihara 20 Jul '16

20 Jul '16

皆様ルートヴィヒ・マクシミリアン大学ミュンヘンのHelmut Schwichtenberg先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/) Date: Thursday 25 August, 2016, 13:30-15:10 Place: JAIST, Lecture room I2 (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Helmut Schwichtenberg (Ludwig-Maximilians-Universität München) Title: Invariance axioms for realizability Abstract: Kolmogorov (1932) proposed to consider mathematical formulas as problems asking for solutions. Following this idea it seems reasonable to extend arithmetical theories by adding invariance axioms, which state that every formula is equivalent to the (internal) formula stating that it has a realizer. We sketch such a theory, which in addition allows to fine-tune the computational content of proofs by decorations of the logical connectives. A soundness theorem holds.

1 0

Kobe Colloquium: July 26, 2016, Bakhadyr Khoussainov
by Makoto Kikuchi 20 Jul '16

20 Jul '16

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。 Date: 2016/7/26 (Tue) 3.00pm - 4.30pm Place: Room 421 Speaker: Bakhadyr Khoussainov (Auckland/Kyoto) Title: Algorithmically random infinite structures Abstract: Over the last two decades a significant progress has been made in the study of algorithmic random infinite strings. The main concepts of algorithmic randomness on infinite strings are based on the natural measure on the Cantor space. In spite of much work, research on algorithmic randomness has excluded the investigation of randomness for infinite structures such as graph, trees, algebras. The reason is that it was unclear how one introduces a meaningful measures into these classes of structures that would be pivotal in defining algorithmic randomness. We provide a solution to this problem. We present an axiomatic approach that introduces measure, and hence algorithmic randomness into various classes of structures. We prove the existence of algorithmically random structures with various computability-theoretic properties. We show that any nontrivial variety of algebras has an effective measure 0. This, for instance, implies that no finitely presented algebra in a variety is algorithmically random. We also prove a counter-intuitive result that there are algorithmically random yet computable structures. This establishes a connection between algorithmic randomness and computable model theory. 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 19 Jul '16

19 Jul '16

皆様インスブリア大学のMarco Benini先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/) Date: Monday 8 August, 2016, 13:30-15:10 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Marco Benini (University of Insubria) Title: Variations on the Higman's Lemma Abstract: The Higman's Lemma says that if A is a well-quasi-order, so is the set of finite sequences over A with the order induced by embedding. By considering the structure of the categories of well-founded quasi-orders and well-quasi-orders, another proof of the Lemma will be derived, along with a number of variants, which may be of some interest.

1 0

Talk by Liang-ting Chen, 19 Tue Jul
by Takumi Akazaki 16 Jul '16

16 Jul '16

Dear colleagues, Dr. Liang-Ting Chen, postdoc. in University of Hawaii at Manoa will visit us next Tuesday. He is working mainly on categorical-algebraic automata theory, and the topic of the talk is Schutzenberger Products. His talk is scheduled on 19 Jul (Tuesday). You're all invited. Thanks, and see you, Takumi Akazaki http://www-mmm.is.s.u-tokyo.ac.jp/seminars.html ----------- Tue 19 July 2016, 13:00–15:00 理学部7号館102 Room 102, School of Science Bldg. No. 7 Liang-Ting Chen <https://de.linkedin.com/in/liang-ting-chen-b5a74988> (Dept. of Info. and Comp. Sci., University of Hawaii), Schutzenberger Products in a Category The Sch\"utzenberger product of monoids is a key tool for the algebraic treatment of language concatenation. In this paper we generalize the Sch\"utzenberger product to the level of monoids in an algebraic category 𝒟, leading to a uniform view of the corresponding constructions for monoids (Sch\"utzenberger), ordered monoids (Pin), idempotent semirings (Kl\'ima and Pol\'ak) and algebras over a field (Reutenauer). In addition, assuming that 𝒟 is part of a Stone-type duality, we derive a characterization of the languages recognized by Sch\"utzenberger products. -- /_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/ 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

Nagoya Set Theory Seminar
by 吉信康夫 12 Jul '16

12 Jul '16

名古屋集合論セミナーのご案内：日時：2016年7月15日(金) 午後3時30分より場所：名古屋大学大学院情報科学研究科2階206号室講演者：渕野昌(神戸大学) 題目：Pre-Hilbert spaces without orthonormal bases 概要：Halmos proved in 1970's that there are pre-Hilbert spaces without orthonormal bases. His example of such pre-Hilbert space was so that its dimension (size of maximal orthonormal system in the space) is strictly less than the density of the space. We show that there are also pre-Hilbert spaces X without orthonormal bases such that dim(X)=d(X). We also show that Shelah Singular Compactness Theorem holds for non-existence of orthonormal bases holds and a natural reflection statement of non-existence of orthonormal bases is equivalent to the Fodor-type Reflection Principle. 多数のご参加をお待ちしております。名古屋大学大学院情報科学研究科吉信康夫

1 0

JAIST Logic Seminar Series (Thursday, 7th July 2016, 15:30-17:00, Ren-June Wang)
by Katsuhiko Sano 05 Jul '16

05 Jul '16

皆様台湾 National Chung Cheng University のRen-June Wangさんの講演会のお知らせです。どうぞふるってご参加ください。問合せ先：佐野勝彦北陸先端科学技術大学院大学情報科学系 e-mail: v-sano(a)jaist.ac.jp ----------------------------------------------------------------- * JAIST Logic Seminar Series * Date: Thursday, 7th July 2016, 15:30-17:00 Place: JAIST, IS school collaboration room 7, 5F (Access: http://www.jaist.ac.jp/english/top/access/index.html) Speaker: Ren-June Wang (Department of Philosophy, National Chung Cheng University) Title: Logical Omniscience and Deductive Rationality Abstract: Epistemic logic as an important tool for reasoning about an intellectual agent’s epistemic states has long suffered from the so-called logical omniscience problem since the beginning of its introduction. The problem indicates an idealized assumption on the part of the agent presented by a formalism of such kind. Although alternative epistemic formalisms have been proposed for dealing with the problem, there is no sight of that the problem is settled. Thus in this talk I will try my hand firstly to give an analysis of the problem, hopefully to pin down the source of the problem, and accordingly provide an advice as to what is the right direction of solving the problem. At the end of the talk I will suggest that what we need is not a formalism with a machinery that can limit what is known by the agent, but one with more powerful expressivity such that the resource that an agent will consume in the course of his/her reasoning, such as the temporal duration, can be explicitly stated. -- Katsuhiko Sano School of Information Science Japan Advanced Institute of Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

2 1

[TACL 2017] First announcement
by 小野寛晰 04 Jul '16

04 Jul '16

[Apologies for multiple copies] ======================================================= TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2017) ======================================================= Conference: June 26 -- 30, 2017 (Prague) School: June 20 -- 24, 2017 (Olomouc) http://www.cs.cas.cz/tacl2017 <http://www.cs.cas.cz/tacl2017> The Eighth International Conference on Topology, Algebra and Categories in Logic organized by Institute of Computer Science, Czech Academy of Sciences Faculty of Arts, Charles University in Prague & & & & & & & & & & & & & & & & & & & & & & & The Third Summer School organized by Faculty of Science, Palacký University Olomouc Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The programme of the conference TACL 2017 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the eighth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier instalments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseille (2011), Nashville (2013) and Ischia (2015). Starting from 2013, the conference is preceded by a summer school. Featured topics ------------------ Contributed talks can be on with any topic involving the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Venues ------ The conference will be held at the campus of the Faculty of Arts, Charles University in Prague. The school will be held at the campus of the Faculty of Science, Palacký University Olomouc. (The two cities are two hours train trip apart.) Important dates ----------------- June 20 - June 24, 2017: School (Olomouc) June 26 - June 30, 2017: Conference (Prague) Programme Committee Chairs -------------------------- John Harding, New Mexico State University Rosalie Iemhoff, Utrecht University Steering Committee -------------------- Guram Bezhanishvili, New Mexico State University Mai Gehrke, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington Ramón Jansana, University of Barcelona Achim Jung, University of Birmingham Hiroakira Ono, Japan Advanced Institute of Science and Technology Yde Venema, University of Amsterdam Michael Zakharyaschev, University of London Organizing Committees --------------------- Conference: Marta Bílková (chair), Faculty of Arts, Charles University in Prague Petr Cintula (chair), Institute of Computer Science, CAS Zuzana Haniková Rostislav Horčík Tomáš Lávička Ondrej Majer Tommaso Moraschini Carles Noguera Adam Přenosil Igor Sedlár Amanda Vidal Wandelmer School: Radomír Halaš (chair), Faculty of Science, Palacký University Olomouc Martin Broušek Jan Kuhr More Information ---------------- TACL 2017 web site: http://www.cs.cas.cz/tacl2017 <http://www.cs.cas.cz/tacl2017> Conference email: tacl2017(a)cs.cas.cz <mailto:tacl2017@cs.cas.cz> School email: school2017(a)upol.cz <mailto:school2017@upol.cz>

1 0

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

01 Jul '16

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

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 28 Jun '16

28 Jun '16

皆様ジェノヴァ大学のEugenio Moggi先生の特別集中講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * This series of lectures is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/) Dates: Tuesday 2 August, 2016, 13:30-15:10 Thursday 4 August, 2016, 13:30-15:10 Friday 5 August, 2016, 10:50-12:30 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Eugenio Moggi (University of Genova) *Tuesday 2 August, 2016, 13:30-15:10* LECTURE 1: Categories of Classes for Collection Types ABSTRACT. Collection types have been proposed by Buneman and others (in the '90) as a way to capture database query languages in a typed setting. In 1998 Manes introduced the notion of collection monad on the category S of sets as a suitable semantics for collection types. The canonical example of collection monad is the finite powerset monad Pf. In order to account for the algorithmic aspects of database languages, the category S is unsuitable, and should be replaced with other categories, whose arrows are maps computable by "low complexity" algorithms. We propose "realizability for DSL" (Domain Specific Languages), where the starting point is a monoid C of endomaps on a set D, instead of a combinatory algebra on D, as a way to get such categories by constructions like the category A[C] of "assemblies". To get Pf in a systematic way we borrow ideas from AST (Algebraic Set Theory, started by Joyal and Moerdijk in the '90), where they fix a notion of "small" map in a category of "classes", and read "small" as "finite". *Thursday 4 August, 2016, 13:30-15:10* LECTURE 2: Hybrid System Trajectories as Partial Continuous Maps ABSTRACT. Hybrid systems (HS) are dynamic systems that exhibit both continuous and discrete dynamic behavior: they can flow (according to a differential equation) and jump (according to a transition relation). HS can be used for modeling rigid body dynamics with impacts, and more generally Cyber-Physical Systems. HS can exhibit Zeno behaviors, that arise naturally in rigid body dynamics with impacts, but are absent from purely discrete or purely continuous systems. Dealing properly with these behaviors is a prerequisite to give sound definitions of concepts such as reachability. We propose the use of partial continuous maps (PCM) as trajectories that describe how a HS evolves over time. PCMs enable a notion of trajectory that can go beyond Zeno points. *Friday 5 August, 2016, 10:50-12:30* LECTURE 3: Models, Over-approximations and Robustness ABSTRACT. Hybrid systems, and related formalisms, have been successfully used to model Cyber- Physical Systems. The usual definition of "reachability", in terms of the reflexive and transitive closure of a transition relation, is unsound for Zeno systems. We propose "safe reachability", which gives an over-approximation of the set of states that are "reachable in finite time" from a set of initial states. Moreover, mathematical models are always a simplification of the system they are meant to describe, and one must be aware of this mismatch, when using these models for system analyses. In safety analysis it is acceptable to use over-approximations of the system behavior, indeed they are the bread and butter of counterexample guided abstraction refinement (CEGAR). We propose a notion of safe (time-bounded) reachability, which is also robust wrt arbitrary small overapproximations, and argue that it is particularly appropriate for safety analysis.

1 0

CFP: PEPM 2017
by Ryosuke SATO 28 Jun '16

28 Jun '16

皆様、（複数受け取られた場合はご容赦ください。）東京大学の佐藤亮介です。来年1月に POPL 併設で開催される PEPM 2017 の CFP をお送りいたします。日程は次の通りです。 * Abstract submission: Tue, 13 Sep, 2016 * Paper submission: Fri, 16 Sep, 2016 * Author notification: Mon, 24 Oct, 2016 * Camera ready: Mon, 28 Nov, 2016 レギュラー論文の他に、ショート論文、ポスターも受け付けております。是非，投稿をご検討ください。 -- 東京大学大学院情報理工学系研究科佐藤亮介 ryosuke(a)kb.is.s.u-tokyo.ac.jp ------------------------------------------------------------------- CALL FOR PAPERS Workshop on Partial Evaluation and Program Manipulation (PEPM 2017) Paris, France, January 16th – 17th, 2017 http://conf.researchr.org/home/PEPM-2017 PEPM 2017 in Paris, co-located with POPL 2017. The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. PEPM 2017 will be based on a broad interpretation of semantics-based program manipulation, reflecting the expanded scope of PEPM in recent years beyond the traditionally covered areas of partial evaluation and specialization. Specifically, PEPM 2017 will include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to maintain the dynamic and interactive nature of PEPM and to encourage participation by practitioners, we also solicit submissions of short papers, including tool demonstrations, and of posters. SCOPE Topics of interest for PEPM 2017 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing applications of semantics-based program manipulation techniques in new domains. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme chairs. SUBMISSION CATEGORIES AND GUIDELINES Three kinds of submissions will be accepted: Regular Research Papers, Short Papers and Posters. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance and clarity. Regular research papers must not exceed 12 pages in ACM Proceedings style (including appendix). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages in ACM Proceedings style (including appendix). * Posters should describe work relevant to the PEPM community, and must not exceed 2 pages in ACM Proceedings style. We invite poster submissions that present early work not yet ready for submission to a conference or journal, identify new research problems, showcase tools and technologies developed by the author(s), or describe student research projects. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM 2017 web site. Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. PUBLICATION AND SPECIAL ISSUE All accepted papers, short papers and posters included, will appear in formal proceedings published by ACM Press. Accepted papers will be included in the ACM Digital Library. Authors of selected papers from PEPM 2016 and PEPM 2017 will also be invited to expand their papers for publication in a special issue of the journal Computer Languages, Systems and Structures (COMLAN, Elsevier). BEST PAPER AWARD PEPM 2017 continues the tradition of a Best Paper award. The winner will be announced at the workshop. IMPORTANT DATES Abstract submission: Tue, 13 Sep, 2016 Paper submission: Fri, 16 Sep, 2016 Author notification: Mon, 24 Oct, 2016 Camera ready: Mon, 28 Nov, 2016 INVITED SPEAKERS to be announced PROGRAM CHAIRS Jeremy Yallop (University of Cambridge) Ulrik Pagh Schultz (Unversity of Southern Denmark) PROGRAM COMMITTEE to be announced

1 0

第二十七回 ALGI（代数，論理，幾何と情報科学研究集会）の講演募集の再アナウンス
by 西澤弘毅 23 Jun '16

23 Jun '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

IWC 2016 - 2nd Call for Papers
by Nao Hirokawa 14 Jun '16

14 Jun '16

皆様 9月にオーストリアで開催されます「合流性に関するワークショップ IWC 2016」の二回目の論文募集をご案内致します。 - 開催日が 9月8日〜9日に決定致しました。 - 招待講演者は Florent Jacquemard 氏 (INRIA) と Paul-Andre Mellies 氏です。ぜひ投稿・参加をご検討下さい。廣川 (JAIST) ============================================================== Second Call for Papers IWC 2016 5th International Workshop on Confluence Sep 8-9, 2016, Obergurgl, Austria, Part of Computational Logic in the Alps CLA 2016 http://www.csl.sri.com/~tiwari/iwc2016/ ============================================================== Confluence provides a general notion of determinism and is widely viewed as one of the central properties of rewriting. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and had been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The International Workshop on Confluence (IWC) aims at promoting further research in confluence and related properties. IWC 2016 is part of the Computational Logic in the Alpsevent to be held in Obergurgl, Austria, during the week Sep 4-10, 2016. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), and Berlin (2015). During the workshop, the 5th Confluence Competition (CoCo 2016) takes place. IMPORTANT DATES: * submission June 22, 2016 * notification July 12, 2016 * final version Aug 03, 2016 * workshop Sep 4-10, 2016 TOPICS: Specific topics of interest include: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Florent Jacquemard (INRIA) * Paul-Andre Mellies (CNRS & Paris Diderot University) PROGRAM COMMITTEE: * Beniamino Accattoli (INRIA) * Bertram Felgenhauer (University of Innsbruck) * Yves Guiraud (INRIA & Paris Diderot University) * Nao Hirokawa (JAIST) * Koji Nakazawa (Nagoya) * Ashish Tiwari (Menlo Park) SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=iwc2016

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 08 Jun '16

08 Jun '16

皆様オークランド大学のBakhadyr Khoussainov先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * Date: Monday 20 June, 2016, 15:20-17:00 Place:JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Bakhadyr Khoussainov (University of Auckland) Title: Computably Enumerable Structures: Domain dependency Abstract: Computably enumerable structures arise naturally in algebra and computer science. In algebra examples include finitely presented universal algebras such as finitely presented groups. In computer science, these are abstract data types defined by equational or quasi-equational specifications. The domains of these algebraic structures are quotient sets of the form $\omega/E$, where $\omega$ is the set of natural numbers and $E$ is a computably enumerable (c.e.) equivalence relations. We consider c.e. structures whose domains are of the form $\omega/E$ and study various properties of these structures and their dependence on the domain $\omega/E$

1 0

Talk by Sato Tetsuya, 14 Tue Jun
by Takumi Akazaki 08 Jun '16

08 Jun '16

皆様、(重複して受け取られた方はご容赦ください) 東京大学蓮尾研の赤崎と申します。以下の要領で、来週の火曜日に、京大数理研の佐藤哲也さんをお招きして講演をしていただきます。ぜひご参加くださいませ。日時: 6月14日 13:00-15:00 場所: 東京大学理学部7号館102教室 --------- Tue 14 June 2016, 13:00–15:00 理学部7号館102 Room 102, School of Science Bldg. No. 7 Tetsuya Sato <http://www.kurims.kyoto-u.ac.jp/~satoutet/> (RIMS, Kyoto University), 差分プライバシーの圏論的特徴づけと、その検証差分プライバシー[Dwork, ICALP 2006]は、確率的プログラムで与えられたデータベース・クエリーに関するプライバシー保護の定義／基準で、背景知識攻撃に対する安全性を数学的に保証するという特長を持ち、近年でも盛んに研究されている。 Bartheによる Approximate Relational Hoare Logic (apRHL) [Barthe et al., POPL 2012]は、クエリーの差分プライバシーを形式的に検証するための枠組みで、差分プライバシーの概念を、圏Set上の確率分布モナドのパラメトリックな二項関係持ち上げによって与えるというアイデアに基づいて構成されている。本講演で紹介する Continuous apRHL はapRHLの測度論的拡張と呼ぶべきもので、連続分布型の確率的プログラムであるクエリーの差分プライバシーの検証を可能とする。構成はまず、クエリーの差分プライバシーを、Giryモナドのgradedな二項関係持ち上げによって特徴づけ、それらでjudgementの解釈を与え直すことでapRHLを拡張するという流れである。[Sato, MFPS 2016] 可能であれば、これからの発展などについてもお話ししたい。 -- /_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/ 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

Talk by Bakhadyr Khoussainov (* 7 Jun 11:00- *)
by Tetsuya Sato 03 Jun '16

03 Jun '16

京都大学数理解析研究所の佐藤です。来週の *火曜日*、6月7日11:00から、オークランド大学のBakhadyr Khoussainov先生に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 7 Jun, 2016 Place: Rm 478, Research Building 2, Main Campus, Kyoto University 京都大学本部構内総合研究2号館 4階478号室 http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Bakhadyr Khoussainov (University of Auckland) Title: Open questions in the theory of automatic structures. Abstract: In this talk, we introduce the notion of automatic structure (defined by the speaker and Nerode). Informally, these are infinite algebraic structures (such as graphs, trees, groups, linear orders) that can be presented by automata. We present many examples, several basic results, formulate and discuss some open questions in the area.

1 0

高等研究所セミナー「可換環論における逆数学」
by 秋吉亮太 28 May '16

28 May '16

早稲田大学高等研究所の秋吉と申します．以下の要領で，高等研究所セミナー「可換環論における逆数学」を開催いたします．ご都合よろしければぜひご参加ください。 ———————————————————————————————————————————————————————————— 次のようなセミナーを予定しております．参加自由です． ------------------------------------------------------------------------------ 高等研究所主催セミナー講演者：佐藤隆（東北大学理学研究科）日時：6月7日（火）16:00—18:00 場所：早稲田大学早稲田キャンパス9号館5階　第2会議室 (URL: http://www.waseda.jp/wias/) タイトル：可換環論における逆数学アブストラクト：　本研究は「逆数学」の手法を用いて，数学史の観点も加味しながら，可換環論をメタ分析する，というものです．可換環論の歴史を大雑把に辿れば，十九世紀中盤の代数的整数論が動機となり，イデアル論を経て，二十世紀前半の抽象代数学の勃興という道筋が見えてきます．この抽象化にあたって，D. Hilbert, Van der Waerden, E. Noetherらの貢献が指摘できます．その一連の抽象化の中で，本質的に必要とされる公理はどのように変わっていったのでしょうか？これまでに得られた結果から，可算な一般の可換環のクラスについて，その理論を展開するには，算術的集合存在公理（体系ACA）が必要かつ十分であることが示唆されます．一方，より狭いアルティン環のクラスの理論については，より弱い公理である弱ケーニッヒの補題（体系WKL）が必要かつ十分であることがC. Conidisにより示されています．それでは，整数環の素イデアル分解，ネータ環の準素イデアル分解，PIDの単因子論など，各クラスの理論を特徴付ける公理はどのようなものになるのでしょうか？本講演では，以上の結果を紹介するとともに，これからの研究を進めるにあたっての困難な点や，解決のアイディアについてお話しします．問い合わせ先：早稲田大学高等研究所　秋吉亮太 (georg.logic(a)aoni.waseda.jp)

1 0

[CFP] Workshop on Termination - part of Alps Workshops
by Yukiyoshi Kameyama 27 May '16

27 May '16

皆様 > ９月にオーストリアで開催される「合流性に関するワークショップ IWC 2016」の > 論文募集をご案内致します。今回は TRS Meeting, WST, LC&A との合同開催と > なっております。関連する話題をお持ちの方は、ぜひ投稿をご検討下さい。 > 廣川 (JAIST) WST というワークショップの Call for Papers をお送りします。 WST の方は、termination / normalization に関するワークショップです。これらのワークショップは、Innsbruck大学の Aart Middeldorp さんらが全体を企画している Computational Logic in the Alps (CLA2016) http://cl-informatik.uibk.ac.at/events/cla-2016/ というワークショップ集合体の1つとして、 9月上旬の気候の良い頃に、ヨーロッパアルプスのオーストリア側の山あいの施設で開催されます。奮って御投稿ください。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam ========================================================================== WST 2016 - 1st Call for Papers 15th International Workshop on Termination September 5-7, 2016, Obergurgl, Austria http://cl-informatik.uibk.ac.at/events/wst-2016/ ========================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from term rewriting and from the different programming language communities. The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. The event is held as part of CLA 2016 http://cl-informatik.uibk.ac.at/events/cla-2016/ IMPORTANT DATES: * submission June 22, 2016 * notification July 12, 2016 * final version August 3, 2016 * workshop September 5-7, 2016 TOPICS: The 15th International Workshop on Termination welcomes contributions on all aspects of termination and termination analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) are particularly welcome. Topics of interest include all aspects of termination. This includes (but is not limited to): * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination and complexity methods * implicit computational complexity * infinitary normalization * non-termination analysis and loop detection * normalization in lambda calculi * operational termination of conditional rewrite systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain * well-founded relations and well-quasi-orders COMPETITION: There will be a live complexity and termination competition during the workshop, including time to present both the results and the tools of the participants. More details will be provided in a dedicated announcement on the competition. PROGRAM COMMITTEE: * Ugo Dal Lago Bologna University * J旦rg Endrullis VU University Amsterdam * Yukiyoshi Kameyama University of Tsukuba * Salvador Lucas Universidad Polit辿cnica de Valencia * Aart Middeldorp University of Innsbruck, co-chair * Andrey Rybalchenko Microsoft Research * Thomas Str旦der RWTH Aachen * Ren辿 Thiemann University of Innsbruck, co-chair * Andreas Weiermann Ghent University INVITED SPEAKERS: * Rainer H辰hnle TU Darmstadt SUBMISSION: Submissions are short papers/extended abstract which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: http://www.easychair.org/conferences/?conf=wst2016 Final versions should be created using LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz

1 0

CFP: ESSS 2016
by Yoriyuki Yamagata 18 May '16

18 May '16

皆様、産総研の山形と申します。下記の通り、FM2016併催のワークショップESSS2016の発表を募集いたします。どうぞ宜しくお願い致します。 > 転送されたメッセージ： > > ================================================== > 5th International Workshop on > Engineering Safety and Security Systems > November 7th or 8th, 2015, Limassol, Cyprus > Co-located with FM 2016 in Limassol, Cyprus, November 7-11, 2016 > > More information: > http://pat.scse.ntu.edu.sg/esss16/index.html > =================================================== > > Important dates > ----------------- > * August 12th, 2016: Submission deadline > * September 23rd, 2016: Notification of acceptance/rejection > * November 7th or 8th, 2016: Workshop date > > > Introduction of the Workshop > ----------------- > The International Workshop on Engineering Safety and Security Systems > (ESSS) aims at contributing to the challenge of constructing reliable > and secure systems. The workshop covers areas such as formal > specification, (extended) type checking, model checking, program > analysis/transformation, model-based testing and model-driven software > construction. The workshop will bring together researchers and > industry R&D expertise together to exchange their knowledge, discuss > their research findings, and explore potential collaborations. > > > Theme of the Workshop > ----------------- > The main theme of the workshop is methods and techniques for > constructing large reliable and secure systems. The goal of the > workshop is to establish a platform for the exchange of ideas, > discussion, cross-fertilization, inspiration, co-operation, and > dissemination. The topics of the workshop include, but are not > limited to: > > -- methods, techniques and tools for system safety and security > -- methods, techniques and tools for analysis, certification, and > debugging of complex safety and security systems > -- model-based and verification-based testing > -- emerging application domains such as cloud computing and > cyber-physical systems > -- case studies and experience reports on the use of formal methods > for analyzing safety and security systems > > > Submissions guidelines > ----------------- > Paper submissions must be original, unpublished work. Submissions > should be in made via the Easychair site: > https://www.easychair.org/conferences/?conf=esss2016. > > We invite two types of submissions: > > --Regular papers (up to 15 pages) describing original and unpublished > work within the scope of the workshop. > --Short papers (up to 6 pages) describing work in progress or less > mature results. > > Case studies and tool papers are welcome as well. All submissions must > be prepared in LATEX using the EPTCS macro package. > > The final versions of accepted regular and short papers will be > published as a volume of Electronic Proceedings in Theoretical > Computer Science (EPTCS). Furthermore, authors of a selection of the > accepted papers will be invited to submit an extended version of their > articles to a special issue of a high-quality journal, after the > workshop. Publication of accepted articles requires the commitment of > one of the authors to register for the workshop and present the paper. > > > Workshop chairs > ----------------- > Yang Liu, Nanyang Technological University, Singapore > Sjouke Mauw, University of Luxembourg, Luxembourg > Jun Pang, University of Luxembourg, Luxembourg > > > Program committee > ----------------- > Etienne Andre, Universite Paris 13, France > Guandong Bai, National University of Singapore, Singapore > Weiqiang Kong, Dalian University of Technology, China > Keqin Li, Huawei European Research Center, Germany > Wojciech Mostowski, Halmstad University, Sweden > Volker Stolz, University of Oslo, Norway > Cong Tian, Xidian University, China > Anton Wijs, Eindhoven University of Technology > Yoriyuki Yamagata, AIST, Japan > Tian Zhang, Nanjing University, China — 山形賴之国立研究開発法人産業技術総合研究所主任研究員 http:://staff.aist.go.jp/yoriyuki.yamagata/

1 0

FSCD 2016: Call for participation (early registration: May 22)
by Nao Hirokawa 18 May '16

18 May '16

皆様 6月にポルトガル・ポルトで行われます FSCD の参加者募集の案内をお送り致します。早期登録の締切は5月22日になっております。廣川　(JAIST) ================================================================== CALL FOR PARTICIPATION 1st International Conference on Formal Structures for Computation and Deduction FSCD 2016 22-26 June 2016 Porto, Portugal http://fscd2016.dcc.fc.up.pt/ <http://fscd2016.dcc.fc.up.pt/> 　　 "It is our thesis that formal elegance is 　　 a prerequisite to efficient implementation." -- Gérard Huet FSCD is a new conference covering 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. INVITED SPEAKERS Amal Ahmed (Northeastern University, USA) Ichiro Hasuo (University of Tokyo, Japan) Gérard Huet (INRIA Paris Center, France) Tobias Nipkow (Technical University Munich, Germany) SATELLITE EVENTS - 6th Workshop on Classical Logic and Computation (CL&C) - Concurrent, Resourceful and Effectful COmputation, by Geometry of Interaction: Project Meeting (CRECOGI) - 2nd Workshop on Higher-Dimensional Rewriting and Applications (HDRA) - 8th Workshop on Higher-Order Rewriting (HOR) - IFIP Working Group on Term Rewriting (IFIP-WG 1.6) - 2nd Workshop on Homototy Theory/Univalent Foundations (HOTT/UF) - 8th Workshop on Intersection Types and Related Systems (ITRS) - 4th Workshop on Linearity (LINEARITY) - 18th Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP) - 11th Logical and Semantic Frameworks with Applications (LSFA) - 30th Workshop on Unification (UNIF) - 3rd Workshop on Rewriting Techniques for Program Transformation and Evaluation (WPTE) - 12th Workshop on Automated Specification of Web Systems (WWV) ACCEPTED PAPERS * Dmitriy Traytel. Formal Languages, Formally and Coinductively * Olivier Laurent. Focusing in Orthologic * Stefan Kahrs and Connor Smith. Non-omega-overlapping TRSs are UN * Tomer Libal and Dale Miller. Functions-as-constructors Higher-order Unification * Franziska Rapp and Aart Middeldorp. Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground TRSs * Martin Avanzini and Georg Moser. Complexity of Term Graph Rewriting * Ofer Arieli and Arnon Avron. Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency * Thorsten Altenkirch and Ambrus Kaposi. Normalisation by Evaluation for Dependent Types * Ryota Akiyoshi and Kazushige Terui. Strong normalization for the parameter-free polymorphic lambda calculus based on the Omega-rule * Takahito Aoto and Yoshihito Toyama. Ground Confluence Prover based on Rewriting Induction * Thierry Coquand and Bassel Mannaa. The Independence of Markov’s Principle in Type Theory * Andrej Dudenhefner, Jakob Rehof and Moritz Martens. The Intersection Type Unification Problem * Cynthia Kop and Jakob Grue Simonsen. Complexity Hierarchies and Higher-Order Cons-Free Rewriting * Marcin Benke, Aleksy Schubert and Daria Walukiewicz-Chrząszcz. Synthesis of Functional Programs with Help of First-order Intuitionistic Logic * Kaustuv Chaudhuri, Sonia Marin and Lutz Strassburger. Modular Focused Proof Systems for Intuitionistic Modal Logics * Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet and Piotr Polesiuk. Environmental bisimulations for delimited-control operators with dynamic prompt generation * Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky and Domenico Ruoppolo. New Results on Morris's Observational Theory: the benefits of separating the inseparable * Fer-Jan de Vries. On Undefined and Meaningless in Lambda Definability * Stéphane Gimenez and David Obwaller. Interaction Automata and the ia2d Interpreter * Giulio Guerrieri, Luc Pellissier and Lorenzo Tortora De Falco. Computing connected proof(-structure)s from their Taylor expansion * Vincent van Oostrom and Yoshihito Toyama. Normalisation by Random Descent * Naoki Nishida, Adrian Palacios and German Vidal. Reversible Term Rewriting * Amin Timany and Bart Jacobs. Category Theory in Coq 8.5 * Philippe Malbos and Samuel Mimram. Homological Computations for Term Rewriting Systems * Jon Hael Brenas, Rachid Echahed and Martin Strecker. Proving Correctness of Graph Rewriting Systems using C2PDL * Christian Sternagel and Thomas Sternagel. Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion * Valentin Blot. Classical extraction in continuation models * James Laird. Weighted Relational Models for Mobile Names * Krzysztof Bar, Aleks Kissinger and Jamie Vicary. Globular: a proof assistant for higher rewriting * Daniele Nantes-Sobrinho, Mauricio Ayala-Rincon and Maribel Fernandez. Nominal Narrowing * Makoto Hamana. Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theory * Ryuta Arisaka. Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus REGISTRATION The registration page and the hotel reservation page are already open. The early registration deadline is May 15 (local time). For more details please visit our conference webpage: http://fscd2016.dcc.fc.up.pt/registration/ <http://fscd2016.dcc.fc.up.pt/registration/> VENUE The conference will be held at the Department of Computer Science, from the Faculty of Science of the University of Porto. The beautiful city of Porto is the second largest city in Portugal, dating back to the IV century, and classified as world heritage patrimony by UNESCO. The city gives its name to the worldwide renowned Port Wine. PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) 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) WORKSHOPS CHAIR Sabine Broda (University of Porto) CONTACT: fscd2016(a)dcc.fc.up.pt <mailto:fscd2016@dcc.fc.up.pt> Looking forward to seeing you in Porto! ==================================================================

1 0

RIMS研究集会「無限組合せ論と強制法理論」のお知らせ
by Teruyuki YORIOKA 17 May '16

17 May '16

みなさま静岡大学の依岡です。以下の研究集会の講演を募集しております。 RIMS研究集会「無限組合せ論と強制法理論」 2016年11月28日から12月1日 http://www.ipc.shizuoka.ac.jp/~styorio/rims16/ 募集締め切りはまだ決まっていません。決まり次第 website でお知らせします。多数の方々にご講演いただきたいと考えております。講演をご希望の方はぜひお気軽に依岡にお知らせください。依岡輝幸静岡大学 styorio(a)ipc.shizuoka.ac.jp

1 0

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

16 May '16

みなさま、愛媛の藤田です。第21回松山TGSAセミナーのお知らせを転送いたします。藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> -------- Forwarded Message -------- Subject: 松山 TGSAセミナーのお知らせ（６月２日） Date: Sat, 14 May 2016 09:02:35 +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セミナー）のお知らせです。 ***** 第21回のセミナー日時: 2016年6月2日（木） 16:30〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者: 江田勝哉 (早稲田大学) 題目: Infinite sheeted covering map on solenoids Abstract: http://www.math.sci.ehime-u.ac.jp/TGSAsem21-eda-abstract.pdf ***** 講演終了後に交流会（wine party）を以下の要領で行います。日時：2016年6月2日（木）18:30〜場所：Amitie アミティエ住所：愛媛県松山市南堀端町 6-23 TEL：089-998-2811 予算：4,500円〜5,000円程度交流会にご参加いただける方は5月31日（火）までにシャクマトフ <dmitri.shakhmatov(a)ehime-u.ac.jp>まで電子メイルでご連絡下さい。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

IWC 2016 - Call for Papers
by Nao Hirokawa 15 May '16

15 May '16

皆様９月にオーストリアで開催される「合流性に関するワークショップ IWC 2016」の論文募集をご案内致します。今回は TRS Meeting, WST, LC&A との合同開催となっております。関連する話題をお持ちの方は、ぜひ投稿をご検討下さい。廣川 (JAIST) ===================================================================== Call for Papers IWC 2016 5th International Workshop on Confluence Sep 8-9, 2016, Obergurgl, Austria, Part of Computational Logic in the Alps, CLA 2016 http://www.csl.sri.com/~tiwari/iwc2016/ ===================================================================== Confluence provides a general notion of determinism and is widely viewed as one of the central properties of rewriting. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and had been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The International Workshop on Confluence (IWC) aims at promoting further research in confluence and related properties. IWC 2016 is part of the Computational Logic in the Alps event to be held in Obergurgl, Austria, during the week Sep 4-10, 2016. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), and Berlin (2015). During the workshop, the 5th Confluence Competition (CoCo 2016) takes place. IMPORTANT DATES: * submission June 22, 2016 * notification July 12, 2016 * final version Aug 03, 2016 * workshop Sep 8-9, 2016 TOPICS: Specific topics of interest include: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * TBD PROGRAM COMMITTEE: * Beniamino Accattoli (INRIA) * Bertram Felgenhauer (University of Innsbruck) * Yves Guiraud (University of Paris 7) * Nao Hirokawa (JAIST) * Koji Nakazawa (Nagoya) * Ashish Tiwari (Menlo Park) SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=iwc2016

2 3

AiML-2016: CALL FOR SHORT PRESENTATIONS
by 小野寛晰 10 May '16

10 May '16

(sorry for multiple copies) AiML-2016: CALL FOR SHORT PRESENTATIONS Short presentations submission deadline: 20 May 2016 Short presentations acceptance notification: 3 June 2016 11TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC BUDAPEST, 30 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. (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: 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 Full papers acceptance notification: 18 May 2016 Short presentations submission deadline: 20 May 2016 Short presentations acceptance notification: 3 June 2016 Final version of full papers and short presentations due: 12 June 2016 Conference: 30 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

(Reminder) Talk by Cho Kenta (Nijmegen), Tue 10 May
by Takumi Akazaki 09 May '16

09 May '16

みなさま、東京大学蓮尾研の赤崎と申します。先日お伝えした通リ、明日13:00より、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

4th AJSW = 45th TRS Meeting
by Nao Hirokawa 04 May '16

04 May '16

皆様今年９月に開催される「第45回 TRS Meeting」参加者募集をご案内致します。通常、国内で開催しておりますが、今回は項書換えに関する日墺のサマーワークショップとして、オーストリアのオーバーグルグルで開催されます。皆様、ぜひ参加をご検討下さい。廣川直 (JAIST) ====================================================================== 4th Austria-Japan Summer Workshop on Term Rewriting 45th TRS Meeting Obergurgl http://cl-informatik.uibk.ac.at/events/ajsw-2016/ AJSW is an informal workshop for researchers in Austria and Japan and aims to facilitate and share new developments and ideas in term rewriting. Not only presentations about published results but also work-in-progress talks are welcome. The event is held as part of CLA 2016 http://cl-informatik.uibk.ac.at/events/cla-2016/ and synonymous with the 45th TRS Meeting. The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are expected to give a talk of approximately 15 to 60 minutes in English on their research activities. The subject of the talk is not required to be one's original result; for example, explaining an interesting paper is perfectly acceptable. (For information on TRS meetings in general, see: http://www.jaist.ac.jp/~hirokawa/trs-meeting/) Date: September 7 (Wed) -- 9 (Fr), 2013 Venue: Obergurgl University Center http://www.uz-obergurgl.at/english/ Gaisbergweg 5, 6456 Obergurgl, Austria Program September 7 (Wed) CLA excursion September 8 (Thu) first day of workshop September 9 (Fri) second day of workshop Preliminary Registration Please indicate whether you would like to join by sending the registration form below to Christian Sternagel (christian.sternagel(a)uibk.ac.at) as soon as possible. This is just in order to get a rough estimate of the number of participants. The official registration and arrangements for accommodation will be handled through the main CLA 2016 event. ---------------------------------------------------------------------- Registration Form of the 45th TRS Meeting name: affiliation: number of accompanying persons: attendance: CLA / AJSW + excursion / AJSW only ---------------------------------------------------------------------- * number of accompanying persons: in case you want to bring family and/or significant others (which is encouraged), please indicate the number of additional persons here * CLA: full week, arrival on September 4 (Sun) and departure on September 10 (Sat); this is the preferred option * AJSW + excursion: arrival on September 6 (Tue) and departure on September 10 (Sat) * AJSW only: arrival on September 7 (Wed) and departure on September 10 (Sat)

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml