数理解析研究所 特定研究員の宮部です。
重複して受け取られた場合はご容赦ください.
RIMSでは、2週間に1度、GCOE tea timeを行っています。
http://www.kurims.kyoto-u.ac.jp/~kenkyubu/gcoe/2008teatime.html
来週、2011年11月1日(火)、第48回 GCOE tea timeでは、
Micheleが話をします。
時間のご都合がよろしければ是非ご参加ください.
講演者:
Michele BASALDELLA (数理解析研究所 研究員)
タイトル:
Dilators: a gentle introduction
講演の概要:
We aim to recall some basic aspects of the concept of dilator, a
notion which has been introduced in proof-theory (a branch of
mathematical logic) by J.-Y. Girard about 30 years ago.
Essentially, a dilator is a certain kind of endofunctor of the category
of the ordinal numbers, which can be thought as an abstract counterpart
of the more concrete system of ordinal notation which are abundant in
proof-theory.
In this introductory talk, we recall the notion of denotation system (a
kind of generalization of the Cantor normal form representation of the
ordinal numbers), the notion of dilator, and show a correspondence
between them.
なお、この講演は英語で行われます。
時間(Time):15:00-16:00
場所(Place):数理解析研究所402号室(RIMS, Room 402)
--
Kenshi Miyabe
email: kmiyabe(a)kurims.kyoto-u.ac.jp
Researcher
Research Institute for Mathematical Sciences, Kyoto University
Kyoto 606-8502 Japan
Tel: +81-75-753-7202 / Fax: +81-75-753-7272
皆様
線型論理関連ワークショップ(11月7日−11日、京都大学)について、
暫定プログラムができましたのでご案内させていただきます。人数把握のため、
参加ご希望の方は添付の参加フォームをお送りいただけると助かります
(当日参加も可)。
※北白川学舎(RIMS宿泊施設)に1室空きがあります(バス・トイレ共用)。
ご希望の方はご連絡ください。
--------------------
Workshop on Linear Logic
(Geometry of Interaction, Traced Monoidal Categories and Implicit Complexity)
* Date: 7th - 11th, November
(11th reserved for free discussion)
* Location: Room 110, Faculty of Science Building No.3, Kyoto University
京都大学理学部3号館110号室
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_n.htm
※数理解析研究所ではありませんのでご注意ください。
* Workshop Dinner
18:00-, 9th November.
(cost: around 4,000 - 5,000yen)
※参加ご希望の方はなるべく事前に下記フォームにてお知らせください。
* Organizers
Michele Basaldella: mbasalde(a)kurims.kyoto-u.ac.jp
Kazushige Terui: terui(a)kurims.kyoto-u.ac.jp
Claudia Faggian
* Program (tentative)
7th November (Monday)
10:00-10:15 Opening
10:15-11:00 Masahito Hasegawa (Kyoto Univ.)
TBA
11:00-11:30 Shin'ya Katsumata (Kyoto Univ.)
Relating Computational Effects by TT-Lifting
13:00-14:30 Jean-Yves Girard (IML, Marseille)
Lecture I
14:45-15:30 Masahiro Hamano (PRESTO, JST)
A Geometry of Interaction for Polarized Linear Logic
15:45-16:30 Thomas Seiller (IML, Marseille)
Graphs of Interaction
16:30-17:15 Jonas Frey (PPS, Paris)
Characterizing Realizability Toposes
8th (Tuesday)
9:30-11:00 Jean-Yves Girard
Lecture II
11:15-12:00 Claudia Faggian (PPS, Paris)
Geometry of Interaction and Quantum Circuits
(joint work with Ugo Dal Lago)
12:00-12:30 Kazuyuki Asada (National Institute of Informatics)
Bidirectional Transformation and Int Construction
14:00-15:00 Stefano Guerrini (invited: LIPN, Paris)
Jumps and Boxes
15:15-16:00 Michele Basaldella (Kyoto Univ.)
Dilators: a Gentle Introduction
16:00-16:45 Etienne Duchesne (LIPN, Paris)
TBA
9th (Wednesday)
9:30-11:00 Jean-Yves Girard
Lecture III
11:15-12:00 Nao Hirokawa (JAIST)
Runtime Complexity Analysis and Rewriting Techniques
12:00-12:30 Naohi Eguchi (Tohoku Univ.)
Term-rewriting Approaches to Implicit Computational Complexity
14:00-15:00 Ugo Dal Lago (invited: Univ. Bologna)
Measuring, Computing and Constraining:
Three Ways to Exploit GoI in Implicit Complexity.
15:15-16:00 Michele Pagani (LIPN, Paris)
The Computational Meaning of Probabilistic Coherence Spaces
(joint work with Thomas Ehrhard and Christine Tasson)
16:00-16:45 Rene Vestergaard (JAIST)
Towards a Geometry of Regulation
18:00- Workshop Dinner
10th (Thursday)
9:30-11:00 Jean-Yves Girard
Lecture IV
11:15-12:15 Marco Gaboardi (invited: Univ. Pennsylvania)
Linear Types for Function Sensitivity
13:45-14:30 Damiano Mazza (LIPN, Paris)
Metrics on lambda-terms
14:30-15:00 Marc Bagnol (IML, Marseille)
Cycles and Traces: On the Meaning of Syntaxe Transcendantale's Duality
15:15-15:45 Guillaume Munch-Maccagnoni (PPS, Paris)
What can polarisation do for the proofs-as-programs correspondence?
15:45- Free Slots
11th (Friday)
9:30- Open Discussion
-------------------------------------
参加申し込みフォーム
1.お名前・所属・身分
2.参加日程:11月?日から〜11月?日まで
3.9日の懇親会に参加する・しない
--------------------------------------
------------------------------------------
Kazushige TERUI
Research Institute for Mathematical Sciences,
Kyoto University.
Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN.
Phone: +81-75-753-7235
Fax: +81-75-753-7276
terui(a)kurims.kyoto-u.ac.jp
http://www.kurims.kyoto-u.ac.jp/~terui/
来年、名古屋で行われます RTA 2012 において、合流性 (チャーチ・ロッサ性) に関する
第1回国際ワークショップ IWC 2012 と合流性自動証明のコンペティション CoCo 2012
が開催されます。最近は型安全が合流性により証明されるなど、興味深い応用が登場し始め
ています。投稿・参加を検討して頂けましたら幸いです。
廣川 直(北陸先端科学技術大学院大学)
This is a joint call for papers and provers for IWC 2012 and CoCo 2012.
======================================================================
First Call for Papers
IWC 2012
1st International Workshop on Confluence
29 May 2012, Nagoya, Japan, collocated with RTA 2012
http://cl-informatik.uibk.ac.at/events/iwc-2012/
======================================================================
Recently there is a renewed interest in confluence research, resulting
in new techniques, tool support as well as new applications. The
workshop aims at promoting further research in confluence and related
properties. The workshop is collocated with the 23rd International
Conference on Rewriting Techniques and Applications (RTA 2012). During
the workshop the 1st Confluence Competition (CoCo 2012) takes place.
IMPORTANT DATES:
* submission March 6, 2012
* notification March 20, 2012
* final version April 3, 2012
* workshop May 29, 2012
TOPICS:
The workshop solicits short papers/extended abstracts on the following
topics:
* confluence and related properties (unique normal forms, commutation,
ground confluence)
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence
ORGANISING COMMITTEE:
* Nao Hirokawa JAIST
* Aart Middeldorp University of Innsbruck
* Naoki Nishida Nagoya University
PROGRAM COMMITTEE:
* Takahito Aoto Tohoku University
* Nao Hirokawa JAIST (co-chair)
* Aart Middeldorp University of Innsbruck (co-chair)
* Femke van Raamsdonk VU University Amsterdam
* Aaron Stump The University of Iowa
* Rakesh M. Verma University of Houston
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. In addition, we plan to distribute a printed
version of the proceedings at the workshop.
The page limit for papers is 5 pages in LIPIcs style. Submission
will be via EasyChair at
https://www.easychair.org/account/signin.cgi?conf=iwc2012
======================================================================
First Call for Provers
CoCo 2012
1st Confluence Competition
http://coco.nue.riec.tohoku.ac.jp/2012/
======================================================================
Recently, several new implementations of confluence proving/disproving
tools are reported and interest for proving/disproving confluence
"automatically" has been grown. CoCo aims to foster the development of
techniques for proving/disproving confluence automatically by setting
up a dedicated and fair confluence competition among confluence
proving/disproving tools.
The 1st Confluence Competition (CoCo 2012) runs during the 1st
International Workshop on Confluence (IWC 2012), which is collocated
with the 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) at Nagoya University, Japan. In this
competition a category for first-order term rewrite systems will be
run. Other categories (e.g., higher-order) will be considered if there
are tools and problems.
IMPORTANT DATES:
* registration April 1 - May 15, 2012
* tool submission May 1 - May 15, 2012
* competition May 29, 2012
REGISTRATION/SUBMISSION:
Registration and tool submission will be via the email address:
coco-sc [AT] jaist.ac.jp
Tools must be able to read input files written in the old TPDB format.
The output of the tools must contain an answer in the first line
followed by some proof argument understandable for human experts.
Valid answers are YES (the input is confluent) and NO (the input is
not confluent). Every other answer is interpreted as the tool could
not determine the status of the input. For more information including
competition rules, see
http://coco.nue.riec.tohoku.ac.jp/
ORGANISING COMMITTEE:
* Takahito Aoto Tohoku University (chair)
* Nao Hirokawa JAIST
* Harald Zankl University of Innsbruck
皆様
渕野 昌@神戸大学システム情報学研究科です.
2011年10月18日(火)の 15:30 から以下ように Barcelona 大学の Joan Bagaria 教授による
Omega-logic, the Omega-conjecture, and the Continuum Hypothesis に関する
神戸情報数理コロキウムの講演を予定しております.講演者の Joan Bagaria 氏には,
集合論の専門の方だけでなくロジック全般の general audience 向けの
講演になるよう,お願いしてあります.興味のある方は御参加ください.
o なお,同日の 14:00 からは Sam Sanders 氏(東北大学) の同コロキウムでの講演も
予定されています.
o また,この講演会の前日の 10月17日 (月) の午後には,Slawomir Solecki,
S.M. Srivastava, Tamas Matrai 三氏の講演が同じ場所で予定されています
(Fri, 7 Oct 2011 10:11:28 +0900 の logic mailing list の Joerg Brendle
氏による案内を参照) .
- ----------------------------------------------------------------------------------
神戸情報数理コロキウム
日時:2011年10月18日(火)15:30 ~ 17:00
場所:神戸大学自然科学総合研究棟3号館4階421室(渕野グループ内プレゼンテーション室)
講演者: Joan Bagaria (バルセロナ大学)
題目: Omega-logic, the Omega-conjecture, and the Continuum Hypothesis
アブストラクト:
Abstract: In 1990, W. Hugh Woodin introduced Omega-logic as an
approach to truth in the universe of all sets inspired by recent work
on large cardinals and determinacy. In Omega-logic statements are
valid if, roughly, they hold in every forcing extension of the
universe, or its sufficiently rich initial segments. Thus, Omega-logic
is the logic of generic absoluteness. In these talks we will describe
the basic features of Omega-logic, leading to the formulation of the
Omega-conjecture and a discussion of its relevance in current set-
theoretic research. In particular I shall focus on Woodin's arguments
against the vagueness of the Continuum Hypothesis.
- --
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/
- -------------------------------------------------------------------------
RTA 2012 の論文募集をご案内致します。
今回の RTA は名古屋で開催されます。ぜひ投稿をご検討下さい。
廣川 直(北陸先端科学技術大学院大学)
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
********************************************************
* First Call For Papers *
* RTA 2012 *
* Rewriting Techniques and Applications *
* 23rd International Conference *
* *
* May 28 - Jun 2, 2012, Nagoya, Japan *
* http://rta2012.trs.cm.is.nagoya-u.ac.jp/ *
* *
********************************************************
The 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) is the major forum for the presentation
of research on rewriting.
IMPORTANT DATES:
Abstract: Jan 04, 2012
Paper Submission: Jan 09, 2012
Notification: Mar 02, 2012
Final version: Mar 26, 2012
RTA 2012 seeks original submissions on all aspects of rewriting.
Typical areas of interest include (but are not limited to):
* Applications: case studies; analysis of cryptographic protocols;
rule-based (functional and logic) programming; symbolic and
algebraic computation; SMT solving; theorem proving; system
synthesis and verification; proof checking; reasoning about
programming languages and logics; program transformation;
XML queries and transformations; systems biology;
* Foundations: equational logic; rewriting logic; rewriting models
of programs; matching and unification; narrowing; completion
techniques; strategies; rewriting calculi; constraint solving;
tree automata; termination; complexity; combination;
* Frameworks: string, term, and graph rewriting; lambda-calculus
and higher-order rewriting; constrained rewriting/deduction;
categorical and infinitary rewriting; stochastic rewriting;
net rewriting; binding techniques; Petri nets;
* Implementation: implementation techniques; parallel execution;
rewrite and completion tools; confluence and termination checking;
certification of rewriting properties; abstract machines; explicit
substitutions;
BEST PAPER AWARD:
An award is given to the best paper or papers as decided by the
program committee.
STUDENT SUPPORT:
Limited student support will be available and announced in future
versions of this call.
PROGRAMME COMMITTEE CHAIR:
* Ashish Tiwari SRI International, Menlo Park, CA
http://www.csl.sri.com/users/tiwari
PROGRAMME COMMITTEE:
* Andreas Abel Ludwig-Maximilians-University Munich
* Zena Ariola University of Oregon
* Paolo Baldan Università degli Studi di Padova
* Ahmed Bouajjani University of Paris 7
* Evelyne Contejean LRI Université Paris-Sud-CNRS
* Irène Anne Durand LaBRI Université of Bordeaux
* Jörg Endrullis Vrije Universiteit Amsterdam
* Silvio Ghilardi Università degli Studi di Milano
* Guillem Godoy Universidad Politécnica de Cataluña
* Nao Hirokawa Japan Advanced Institute of Science and Technology
* Deepak Kapur University of New Mexico, Albuquerque, NM
* Jordi Levy IIIA - CSIC
* Paul-Andre Mellies University of Paris 7
* Pierre-Etienne Moreau Ecole des Mines de Nancy
* Joachim Niehren INRIA Lille
* Grigore Rosu University of Illinois at Urbana-Champaign
* Albert Rubio Universidad Politécnica de Cataluña
* Masahiko Sakai Nagoya University
* Carolyn Talcott SRI International
* René Thiemann University of Innsbruck
CONFERENCE CHAIR:
* Masahiko Sakai Nagoya University
PUBLICATION:
RTA proceedings will be published by LIPIcs (Leibniz International
Proceedings in Informatics). LIPIcs is open access, meaning that
publications will be available online and free of charge, and authors
keep the copyright for their papers. LIPIcs publications are indexed
in DBLP. STACS, FSTTCS and ICLP proceedings also appear in LIPIcs. See
http://www.dagstuhl.de/lipics for more information about LIPIcs.
Accepted papers will be considered for publication in a special issue
of the journal Logical Methods in Computer Science (LMCS).
SUBMISSIONS:
Submissions must be original and not submitted for publication
elsewhere. Submission categories include regular research papers,
applications of rewriting techniques, problem sets, and system
descriptions.
The page limit for submissions is 10 proceedings pages for system
descriptions and 15 proceedings pages for all other categories.
Additional material may be provided in an appendix which is not
subject to the page limit. However, submissions must be self-contained
within the respective page limit; reading the appendix should not be
necessary to assess the merits of a submission.
Submissions are accepted in either Postscript or PDF format.
LaTeX template for LIPIcs is available at:
http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz
Abstracts and papers must be submitted electronically through the
EasyChair system at:
http://www.easychair.org/conferences/?conf=RTA2012
Questions concerning submissions may be addressed to the PC chair,
Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com
logic-ml の皆様、
# 複数受け取られた場合はどうぞご容赦ください。
京都大学の末永と申します。
PEPM 2012 の締切が延長されました。
新しい締切は10月16日の23:59 GMTで、
日本時間で10月17日(月)の08:59です。
先日お知らせしました通り、ショートペーパーや
ツールペーパーも絶賛募集中です。
また、Journal Special Issue も出る予定です。
どうぞ投稿をご検討下さい
末永幸平
京都大学大学院情報学研究科
ksuenaga(a)sato.kuis.kyoto-u.ac.jp
--
PEPM'12 - DEADLINE EXTENSION
Due to a number of requests for extensions, the deadline for
submission to PEPM'12 has been extended
until 23:59 GMT on Sunday 16 October. We would like to remind you
about three aspects of PEPM.
Journal Special Issue
There will be a journal special issue for PEPM'12. PEPM'09 has already
appeared in Higher-order and
Symbolic Computation (HOSC, online-first edition this year), and the
special issue based on PEPM'10
papers has just been delivered to the HOSC editorial team.
Short papers
We're looking for short papers (up to 4pp) and tool papers as well as
full research papers. All categories of
papers will appear in the formal ACM proceedings.
Tool papers
The main purpose of a tool paper is to display other researchers in
the PEPM community a completed,
robust and well-documented tool; more guidance on the format and
expected contact is given on the
PEPM 2012 web site.
In contrast with regular PEPM submissions, PEPM tool demo papers may
include work that has been
published elsewhere. In the ideal case, the technical foundations of
the tool will have been published
previously, and the submitted PEPM tool paper will report on follow-on
work that has produced a robust
tool that has been applied to interesting examples. The PEPM program
committee will consider accepting
tool demo papers that describe tools that have been presented at other
conferences/ workshops if these
conferences/ workshops belong to a different community (the authors
should acknowledge the previous
demos and justify the benefits of presenting the tool again for the
PEPM audience).
Call For Papers
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation
January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12)
http://www.program-transformation.org/PEPM12
Paper submission deadline: Sunday, October 16, 2011, 23:59, GMT
The PEPM Symposium/Workshop series aims to bring together researchers
and practitioners working in the broad area of 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 and will be included in the ACM Digital
Library. Selected papers may later on be invited for a journal special
issue dedicated to PEPM'12.
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: Sunday, October 16, 2011, 23:59, GMT
- Author notification: Tue, November 8, 2011
- Workshop: Mon-Tue, January 23-24, 2012
Invited Speakers
- Markus Pueschel (ETH Zurich, Switzerland)
- Martin Berger (University of Sussex, UK)
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 Research, USA)
- 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)