Logic-ml June 2011

13 participants
15 discussions

研究員の募集
by koba 03 Aug '11

03 Aug '11

皆様、＃複数受け取られましたらご容赦ください．東北大学の小林と申します．当研究室では現在，高階モデル検査（高階再帰スキームのモデル検査）とそのプログラム検証などへの応用をテーマとした研究を精力的に進めており，プロジェクトに携わるポストドクの研究員を探しております．身近にご興味のある方がいらっしゃいましたら，8月15日（必着）までに小林 (koba(a)ecei.tohoku.ac.jp) までメールでお知らせいただければ幸いです。その際、できれば略歴および論文リスト（フォーマット自由）もメールに添えるかまたは郵送でお送りください。（後日、さらに詳細な資料をお願いする可能性があります）．募集の条件は概ね以下のとおりです。 ================ 着任時期：2011年10月〜2012年4月の間（さらに数ヵ月の前後は応相談）任期：年度単位の更新で、業績により最長2016年3月まで延長可能給与：月額30〜35万円程度（大学の規定による．細かい条件は応相談）研究テーマ：高階モデル検査（高階再帰スキームのモデル検査）および、そのプログラム検証やデータ圧縮への応用。高階モデル検査については，下記のプロジェクトの概要および，小林らによる最近のPOPL 2009/2010やPLDI 2011, LICS 2009等の論文をご覧ください。条件： - 着任時に博士号を取得していること - 理論計算機科学全般に明るいこと． - 以下の中の２つ以上のトピックに詳しいか、または１つ以上のトピックに詳しくプログラミング能力が特に高いことモデル検査（特にソフトウェアモデル検査）型システムゲーム意味論プログラム解析オートマトンと形式言語理論自動定理証明 (可逆)データ圧縮技術問い合わせ先：小林直樹東北大学大学院情報科学研究科情報基礎科学専攻〒980-8579 仙台市青葉区荒巻字青葉6-3-09 TEL: 022-795-7177 FAX: 022-795-7526 Email: koba(a)ecei.tohoku.ac.jp ====================== 研究プロジェクトの概要 ====================== モデル検査はシステムが与えられた性質を満たすか否か網羅的に検証する手法であり，近年ハードウェアやソフトウェア検証の分野で大きな成功を修めている．高階モデル検査は，検証対象のシステムとして無限木を記述する高階文法を扱うものであり，従来の有限状態モデル検査やプッシュダウンモデル検査の真の拡張になっている．最近になって，我々は，高階モデル検査が高レベルプログラムの自動検証に有用であることを示すとともに，高階モデル検査問題が多重指数関数完全の計算量クラスに属するにもかかわらず，多くの入力に対して現実的な時間で動作するようなモデル検査アルゴリズムを考案し，世界初の高階モデル検査器の実現に成功した．さらに，それに基づいて関数型言語MLの小さなサブセットに対するソフトウェアモデル検査器を実現した．本研究プロジェクトでは，上記の成果をさらに発展させ，（１）高階モデル検査の理論および実装技術の発展による，より高速な高階モデル検査器の実現（２）関数型言語やオブジェクト指向言語に対するソフトウェアモデル検査器（つまり高階モデル検査に基づくプログラム自動検証器）の実現（３）データ圧縮など，高階モデル検査の新たな応用分野の開拓を目指す．

1 1

CFP: PEPM 2012
by Kohei SUENAGA 30 Jun '11

30 Jun '11

皆様、（重複して受け取られた場合はどうぞご容赦ください。）京都大学の末永幸平と申します。来年の1月23〜24日にPOPL'12と併設で開催される PEPM'12のCFPをお送りいたします。論文投稿の締切は今年の10月10日です。レギュラー論文の他にツールのデモや萌芽的な話題のためのショート論文も受け付けております。どうぞ投稿をご検討ください。末永幸平 ksuenaga(a)sato.kuis.kyoto-u.ac.jp -------------------------------------------------------------------------------------------------------------------- ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of principled program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 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, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers TBD Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Labs) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea)

1 0

please send me my name
by masahiko＠sato.kuis.kyoto-u.ac.jp 28 Jun '11

28 Jun '11

I am sorry, but your mail is being kept in a temporary space and not yet delivered to me, because your mail address is not in my Address Book. Please send me a blank mail with a header line that reads: Subject: xxxxxxxx xxxx where xxxxxxxx is my given name and xxxx is my family name. Your mail will then be delivered to me. Thank you very much for your understanding.

1 0

2011LLS
by Toshihiko Kurata 27 Jun '11

27 Jun '11

kisoron-ml，logic-mlの皆様，夏休み期間に「ラムダと論理の研究会」が計画されています．詳しい情報は http://www.i.hosei.ac.jp/~kurata/2011LLS/ にありますので気軽に参加を検討いただけますと幸いです．過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関して，成果発表の場というよりは成果をあげる場となっていまして，講演件数を抑え，残りの時間は個人やグループで柔軟に計画してもらうようになっています．（こうした形式のセミナーは主に海外で行われているらしく，それを取り入れた古森先生の研究室の下で継続的に実施されています．）特に今年の夏は節電の影響で大学では仕事がはかどりそうにないという方も多いと思われます．草津のセミナーで仕事を進め節電にも貢献する計画などされては如何でしょうか？ ---- Toshihiko Kurata, Hosei University e-mail kurata(a)hosei.ac.jp ---------------------------------------------------------------------- 日時：　2011年8月28日(金)午後5時から9月1日(火)正午まで場所：　国立大学草津セミナーハウス参加申込：　倉田（法政大学）が窓口となっています．講演や参加を希望されます方は8月15日までに以下の項目を kurata(a)hosei.ac.jp までメイル下さい．会議室確保の都合がありまして，参加のみ希望されます方も予め御連絡頂けますと幸いです． -------------------------- 参加申込 -------------------------- 氏名：所属：連絡先 (e-mail): 参加期間：講演希望：有・無題目：希望時間：その他： -------------------------------------------------------------- また，セミナーに参加される方の中でセミナーハウスでの宿泊を希望される方は7月7日までに宿泊申込を倉田（上記e-mailアドレス）までメイル下さい．宿泊定員の関係でこちらの締切は早くなっています．他の情報は後から送って頂いて構いませんので，よろしくお願いいたします． ------------------- セミナーハウス宿泊申込 ------------------- セミナーハウスの宿泊の申込をします。部屋タイプの希望（教員は選択可，学生は学生部屋となります）：　　　　教員用, 学生用, どちらでもよい宿泊・食事の希望（希望しない部分を消去して下さい）：　　　　２８日　　夕食　宿泊　　　　２９日　　朝食　夕食　宿泊　　　　３０日　　朝食　夕食　宿泊　　　　３１日　　朝食　夕食　宿泊　　　　　１日　　朝食 --------------------------------------------------------------

1 0

Prof. Sy David Friedman's talk on June 30.
by Sakae Fuchino 26 Jun '11

26 Jun '11

渕野昌＠神戸大学システム情報学研究科というものです．以下の講演を御案内いたします． ------------------------------------------------------------------------------ 2011年 6月30日（木）に開催される神戸大学統合研究拠点設置記念・システム情報学研究科1周年合同シンポジウム http://kurt.scitec.kobe-u.ac.jp/~fuchino/misc/flier-11-05-20.pdf において，ウィーン大学 Kurt Goedel Research Center 所長 Prof. Sy David Friedman が "Mathematical Logic and its Role in Computer Science and Mathematics" という題の（一般向けの）講演をされます．日時: 2011年 6月30日（木）15:10 -- 16:10 場所: 神戸ポートピアホテル南舘1階（大輪田） ------------------------------------------------------------------------------ お時間のある方はぜひいらしてください． -- best regards Saka\'e Fuchino (渕野昌) ------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 e-mail: fuchino(a)diamond.kobe-u.ac.jp web page: http://kurt.scitec.kobe-u.ac.jp/~fuchino/ My mail surver in Tokyo (to which all the emails to the address above are forwarded) does not run properly at the moment in connection with the aftermath of the earthquake on March 11, 2011. To be sure please send your email not only to the email address above but also to: sakae.fuchino(a)gmail.com -------------------------------------------------------------------------

1 0

TACL 2011 : Call for participation
by Luigi Santocanale 20 Jun '11

20 Jun '11

=============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Call for participation =============================================================================== July 26-30, 2011 Universités Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Latest informations ------------------- * Program. The complete list of talks, including a short abstract, is available at the url http://www.lif.univ-mrs.fr/tacl2011/talks * Registration site. You can register to the conference through the url http://www.lif.univ-mrs.fr/tacl2011/registration * Early registration deadline: July 1, 2011. Scope ----- 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 program of the conference TACL 2011 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 fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with 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 * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * 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 Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, UniversitÃ degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. Important dates --------------- July 1,2011: Early registration deadline July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Università degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Université Aix-Marseille II Tadeusz Litak, University of Leicester Paul-André Melliès, CNRS Paris Diderot George Metcalfe, Universitat Bern Nicola Olivetti, Université Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Université Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Université de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011(a)lif.univ-mrs.fr =============================================================================== -- Luigi Santocanale LIF/CMI Marseille Tél: 04 13 55 13 08 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 13 55 13 02

1 0

CfP: Non-classical Modal and Predicate Logics, Guangzhou, December 2011
by info＠mathfuzzlog.org 16 Jun '11

16 Jun '11

(Apologies for multiple copies) Call for papers *** Non-classical Modal and Predicate Logics *** Guangzhou (Canton), China, 5-9 December 2011 http://logic.sysu.edu.cn/ncmpl2011 Modalities and predicates have since ancient time been central notions of logic. In the 20th century, various systems of non-classical logics have emerged, with applications in many disciplines like Computer Science, Linguistics, Mathematics, and Philosophy. This gave rise to the questions of non-classical treatment of quantification and modalities and their accommodation in these non-classical logics. In response, various modal and predicate variants of non-classical logics have been introduced and studied in the past decades. Although there are many good conferences on (mainly propositional) non-classical logics, this conference is one solely dedictated to modal and predicate non-classical logics. The aim of the conference is to bring together researchers from various branches of non-classical logics, not only to present recent advances in their particular fields, but also to identify common problems and methods and foster the exchange of ideas between researchers from separate fields. Topics of interest: * The study of first- or higher-order variants of non-classical logics, including, but not limited to: - Predicate intuitionistic and superintuitionistic logics - Predicate modal logics - Predicate substructural logics - Predicate many-valued and partial logics - Predicate paraconsistent logics - Predicate non-monotonic logics, etc. * Non-classical theories of quantification over classical logic, such as: - Free logics - Branching quantifiers and IF-logic - Generalized quantifiers * Extensions by modalities of (propositional or predicate) non-classical logics, including: - Modal extensions of (super)intuitionistic, substructural, many-valued, paraconsistent, non-monotonic, etc., logics - Co-algebraic treatment of modalities We accept both purely theoretical works on the above logics coming from all branches of mathematical logic (proof-theory, model theory, game theory, computational complexity, etc.), as well as their application in the foundation of mathematics (non-classical mathematics), computer science, linguistics, philosophy, etc. Strong papers on propositional logics can also be accepted, provided they relate to the themes in the main scope of the conference (e.g., the study of completions in algebraic semantics, propositional quantification, etc.). Full versions of selected papers will be published in a special issue of an international peer-reviewed journal (to be specified). == Invited speakers == Gabriel Sandu Hiroakira Ono Mingsheng Ying Rob Goldblatt Valentin Shehtman Xuefeng Wen == Conference chairs == Shier Ju Petr Cintula == Program committee == Steve Awodey Libor Behounek Itala M.L. D'Ottaviano Rosalie Iemhoff Hu Liu Michael Rathjen Greg Restall Yde Venema == Organizing committee == Yuping Shen (chair) == Contacts == Web: http://logic.sysu.edu.cn/ncmpl2011 Email: ncmpl2011(a)easychair.org == Conference fee == Foreign participants: 150 EUR Chinese participants: 1000 RMB Chinese students: 200 RMB The conference fee covers accommodation and all meals during the conference, coffee breaks, social program, and conference materials. == Submissions == Extended abstracts of 3-5 pages should be submitted via the EasyChair web interface, see http://logic.sysu.edu.cn/ncmpl2011 == Important dates == Deadline for abstracts: 1 September 2011 Notification of acceptance: 20 September 2011 Conference: 5-9 December 2011 Shier Ju and Petr Cintula Conference chairs

1 0

FSFLA 2011: 1st announcement
by "Carlos Martín Vide" 12 Jun '11

12 Jun '11

********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 – November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische München), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School’s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu(a)urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputació de Tarragona Universitat Rovira i Virgili

1 0

The 51th ToPS [June 21]
by Kazuyuki ASADA 11 Jun '11

11 Jun '11

[Apologies for multiple copies] I am pleased to announce the 51th Tokyo Programming Seminar, which will be held at NII on June 21 (Tue). Shin-ya Katsumata from Kyoto University will give a talk about a categorical approach to attribute grammars and Kazuyuki Asada from National Institute of Informatics will give a talk about bialgebraic semantics for multi-rooted graph algebra. The programme is attached below. I'm looking forward to meeting you at ToPS. Best regards, Kazuyuki Asada ---- The 51th ToPS http://www.ipl.t.u-tokyo.ac.jp/~tops/upcoming_seminar.html Time: June 21th (Tue) 2011, 15:00--17:00 Place: Rm. 1208, 12F, National Institute of Informatics Speaker: (1) Kazuyuki Asada (National Institute of Informatics) Title: Many-sorted Bialgebraic Semantics for a Multi-rooted Graph Algebra and a CBV Calculus Abstract: In this talk, bialgebraic semantics for the graph algebra introduced by Buneman et al. is given. The graph algebra is a graph representation for some kind of multi-rooted graph, which is the same as Kripke model. First I give a bijective correspondence between graph algebras and terms in (the first-order part of) a call-by-value calculus equipped with output, non-termination, non-determinism, and iteration operator. Then I induce an equational theory for graph algebra from the standard one for the CBV calculus including (modified) uniformity for the iteration operator. Then, after reveiwing coalgebraic semantics for Kripke model, we see that those final coalgebras form a relative monad, and the graph algebra can be formulated as many-sorted algebra. Then I give many-sorted bialgebraic semantics for the graph algebra and the graph. Time permitting, I will explain three future works: Completeness of the equational theory, full-abstractness, and generalization. (2) Shin-ya Katsumata (Kyoto University) Title: A Categorical Approach to Attribute Grammars Abstract: Attribute grammars (AGs) are a mechanism to assign computations with bidirectional information flow to trees. We introduce a categorical formulation of AGs called monoidal AGs, and demonstrate that they subsume existing formulations of AGs, such as domain-theoretic, graph-theoretic, and relational ones, and also a special class of syntactic AGs called SSUR-ACs. Using this categorical formulation, we give a syntax-free account of the descriptional composition, which is a method to fuse two term transformation algorithms described by SSUR-ACs into one.

1 0

SSLST 2011: 1st announcement
by "Carlos Martín Vide" 11 Jun '11

11 Jun '11

2011 INTERNATIONAL SUMMER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES (SSLST 2011) (formerly International PhD School in Language and Speech Technologies) Tarragona, Spain, August 29 – September 2, 2011 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/sslst2011/ ****************************************** AIM: SSLST 2011 offers a broad and intensive series of lectures on language and speech technologies at different levels. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate their career in research. ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Linguistics. Other students (for instance, from Mathematics, Electrical Engineering, or Philosophy) are welcome too. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. COURSES AND PROFESSORS: Walter Daelemans (Antwerpen), Computational Stylometry [advanced, 4 hours] Robert Dale (Macquarie), Automated Writing Assistance: Grammar Checking and Beyond [intermediate, 8 hours] Christiane Fellbaum (Princeton), Computational Lexical Semantics [introductory/intermediate, 8 hours] Ralph Grishman (New York), Information Extraction [intermediate, 8 hours] Daniel Jurafsky (Stanford), Computational Extraction of Social and Interactional Meaning [introductory/advanced, 8 hours] Chin-Hui Lee (Georgia Tech), A Short Course on Digital Speech Processing and Applications [intermediate, 8 hours] Yuji Matsumoto (Nara), Syntax and Parsing: Phrase Structure and Dependency Parsing [introductory/intermediate, 8 hours] Diana Maynard (Sheffield), Text Mining [introductory/intermediate, 8 hours] Dan Roth (Urbana-Champaign), Predicting Structures in NLP: Constrained Conditional Models and Integer Linear Programming in NLP [intermediate/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/sslst2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until June 5, 2011), - 15 euros (for payments after June 5, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSLST 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation will be provided on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: April 21, 2011 Starting of the registration: April 25, 2011 Early registration deadline: June 5, 2011 Starting of the School: August 29, 2011 End of the School: September 2, 2011 QUESTIONS AND FURTHER INFORMATION: Florentina-Lilica Voicu: florentinalilica.voicu(a)urv.cat WEBSITE: http://grammars.grlmc.com/sslst2011/ POSTAL ADDRESS: SSLST 2011 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml June 2011