ゲーム論的確率論と関連する話題に関する以下のような国際研究集会を開催いたします:
http://kenshi.miyabe.name/gtp2012/
集会名: Fourth Workshop on Game-Theoretic Probability and Related Topics (GTP2012)
日時: 2012年11月12日(月)〜14日(水)
場所: 東京大学本郷工学部6号館セミナー室A,D
招待講演者:
Laurent Bienvenu, Gert de Cooman, Bjorn Kjos-Hanssen, Alexander Outkin,
Glenn Shafer, Kazuyuki Tanaka, Vladimir Vovk, Vladimir V'yugin
集会の狙い: ゲーム論的確率論を一つの接点として,ランダムネス,(測度論的)確率論,数理統計
などの幅広い分野の基礎を統一的に議論する.今回は特にランダムネスに関する最近の研究成果も紹介します.
プログラムおよびアブストラクトが以下で見ることができます.
http://kenshi.miyabe.name/gtp2012/programme.php
皆様のご参加お待ちしております。
なお,本集会は FIRST 合原最先端数理モデルプロジェクト及び
科学研究費基盤(A) 22240029 の支援を受けております.
東京大学情報理工学系研究科 竹村彰通 takemura(a)stat.t.u-tokyo.ac.jp
京都大学数理解析研究所 宮部賢志 kmiyabe(a)kurims.kyoto-u.ac.jp
--
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
Dr. Sylvain Salvati Lecture at NII Logic Seminar
Date: October 31, 2012, 13:30--15:30
Place: National Institute of Informatics, Lecture Room 1208 (12th floor)
場所: 国立情報学研究所 12階 1208室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Speaker: Dr. Sylvain Salvati (INRIA Bordeaux Sud-Ouest)
Title: Myhill-Nerode, Loader, Urzyczyn and logical relations
Abstract:
When trying to define a notion of recognizability on languages over a
particular class of structures, it is customary to prove an
equivalence between a class of machines and congruences of finite
index on those structures. Such equivalences can be coined as
"Myhill-Nerode theorems". This talk is going to be centered on such an
equivalence concerning languages of simply typed lambda-terms. Here
machines are type-checkers based on "uniform intersection types" and
finite index congruences are "extensional finite models" of the
lambda-calculus. The use of logical relations give a nice way of
proving that uniform intersection types and extensional finite models
allow to define exactly the same sets of lambda-terms. This result
relates two important results of the literature on lambda-calculus:
the undecidability of lambda-definability in finite standard models by
Loader (2001) and the undecidability of the inhabitation problem for
intersection types by Urzyczyn (1999). It shows in particular that
these two problems are turing-equivalent, and provides a refinement of
Urzyczyn's result. (Joint work with Giulio Mazonetto, Mai Gehrke and
Henk Barendregt)
問合せ先:
金沢 誠 (国立情報学研究所)
e-mail: kanazawa(a)nii.ac.jp
Logic-ml の皆様,
東北大学の江口と申します.
以下の要領で東北大学ロジックセミナー(田中・山崎研究室)
を開催いたします.
ご興味のある方は是非参加をご検討ください.
日時 平成24年9月2日(金)16時から.
場所 東北大学北青葉山キャンパス理学総合棟1201号室.
講演者 新井敏康 (千葉大学大学院理学研究科)
タイトル Proof theory of indescribable cardinals
アブストラクト
I will explain how to lift up the ordinal analyses to set theories
of indescribable cardinals.
This yields a proof-theoretic reduction of the existence of
a $\Pi^{1}_{n+1}$-indescribable cardinal to iterations of
$\Pi^{1}_{n}$-indescribabilities over ZF+V=L.
東北大学ロジックセミナーの情報は東北大学ロジックグループ
のホームページからもご覧いただけます.
https://sites.google.com/site/sendailogichomepage/
江口直日
--
江口 直日
東北大学 大学院理学研究科 数学専攻
産学官連携研究員
980-8578 宮城県仙台市青葉区荒巻字青葉6ー3
E-mail: eguchi(a)math.tohoku.ac.jp
皆様
RTA 2013 の論文募集をご案内致します。今回の RTA はオランダ Eindhoven で
行われ、TLCA 2013 との共催となっています。ぜひ投稿をご検討下さい。
廣川 直 (JAIST)
*************************************************************************
RTA 2013: FIRST CALL FOR PAPERS
24th International Conference on Rewriting Techniques and Applications
June 24 - 26, 2013
Eindhoven, The Netherlands
collocated with TLCA 2013 as part of RDP 2013
http://www.win.tue.nl/rdp2013/
*************************************************************************
abstract submission February 1 2013
paper submission February 5 2013
rebuttal period March 18-21 2013
notification April 4 2013
final version April 26 2013
*************************************************************************
The 24th International Conference on Rewriting Techniques and Applications
(RTA 2013) is organized as part of the Federated Conference on Rewriting,
Deduction, and Programming (RDP 2013), together with the 11th International
Conference on Typed Lambda Calculi and Applications (TLCA 2013), and
several
workshops. RDP 2013 will be held at the Eindhoven University of Technology
in the Netherlands.
*** TOPICS OF INTEREST ***
RTA is the major forum for the presentation of research 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;
homotopy theory; implicit computational complexity;
Foundations: equational logic; universal algebra; rewriting logic;
rewriting models of programs; matching and unification; narrowing;
completion techniques; strategies; rewriting calculi; constraint solving;
tree automata; termination; complexity; modularity;
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; higher-dimensional rewriting;
Implementation: implementation techniques; parallel execution; rewrite and
completion tools; certification of rewriting properties; abstract
machines; explicit substitutions; automated (non)termination and
confluence provers; automated complexity analysis.
*** PUBLICATION ***
The proceedings of RTA 2013 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.
For more information about LIPIcs please consult:
<http://www.dagstuhl.de/en/publications/lipics>
*** SUBMISSION GUIDELINES ***
Submissions must be
- original and not submitted for publication elsewhere,
- written in English,
- a research paper, or a problem set, or a system description,
- in pdf prepared with pdflatex using the LIPIcs stylefile:
<http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>,
- at most 10 pages for system description,
at most 15 pages for the other two types of submissions
- submitted electronically through the EasyChair system at:
<https://www.easychair.org/conferences/?conf=rta2013>.
The page limit and the deadline for submission are strict.
Additional material for instance proof details, may be given 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.
*** PROGRAMME COMMITTEE CHAIR ***
Femke van Raamsdonk (VU University Amsterdam, The Netherlands)
*** PROGRAMME COMMITTEE ***
Eduardo Bonelli, National University of Quilmes
Byron Cook, Microsoft Research Cambridge
Stephanie Delaune, ENS Cachan
Gilles Dowek, Inria Paris-Rocquencourt
Maribel Fernandez, King's College London
Nao Hirokawa, JAIST Ishikawa
Delia Kesner, University Paris-Diderot
Helene Kirchner, Inria Paris-Rocquencourt
Barbara Koenig, University Duisburg Essen
Temur Kutsia, Johannes Kepler University Linz
Aart Middeldorp, University of Innsbruck
Vincent van Oostrom, Utrecht University
Femke van Raamsdonk, VU University Amsterdam
Kristoffer Rose, IBM Research New York
Manfred Schmidt-Schauss, Goethe University Frankfurt
Peter Selinger, Dalhousie University
Paula Severi, University of Leicester
Aaron Stump, The University of Iowa
Tarmo Uustalu, Institute of Cybernetics Tallinn
Roel de Vrijer, VU University Amsterdam
Johannes Waldmann, HTWK Leipzig
Hans Zantema, Eindhoven University of Technology
*** CONFERENCE CHAIR ***
Hans Zantema (Eindhoven University of Technology, The Netherlands)
*** STEERING COMMITTEE ***
Mauricio Ayala-Rincon, Brasilia University
Frederic Blanqui, INRIA Tsinghua University Beijing
Salvador Lucas, Technical University of Valencia
Georg Moser, University of Innsbruck
Masahiko Sakai, Nagoya University
Sophie Tison, University of Lille
*** FURTHER INFORMATION ***
Questions related to submission, reviewing, and programme should be sent to
the programme committee chair Femke van Raamsdonk, email femke at
few.vu.nl.
logic-ml の皆様,
12月に京都で開催される APLAS と CPP という国際会議の参加募集案内を送ら
せて頂きます。沢山のご参加をお待ちしております。
五十嵐淳 & Jacques Garrigue
======================================================================
CALL FOR PARTICIPATION
The 10th Asian Symposium on Programming Languages and Systems
(APLAS2012)
and
The 2nd International Conference on Certified Programs and Proofs
(CPP2012)
Kyoto, Japan
December 11-15, 2012
http://aplas12.kuis.kyoto-u.ac.jp/ (APLAS)
http://cpp12.kuis.kyoto-u.ac.jp/ (CPP)
APLAS aims at stimulating programming language research by providing a
forum for the presentation of latest results and the exchange of ideas
in topics concerned with programming languages and systems. APLAS is
based in Asia, but is an international forum that serves the worldwide
programming language community.
CPP is a new international forum on theoretical and practical topics
in all areas, including computer science, mathematics and education,
that consider certification as a essential paradigm for their work.
The 10th APLAS and 2nd CPP will be held together in Kyoto, Japan from
December 11 to 15, 2012. The five-day event includes, five invited
talks, and two conferences. The common registration site for both
conferences is now open at:
https://v3.apollon.nta.co.jp/aplas12_cpp12/
Early Registration (until November 10, 2012)
Regular | Student
-----------------------+-----------
APLAS+CPP: JPY 54000 | JPY 36000
APLAS only: JPY 31000 | JPY 22000
CPP only: JPY 31000 | JPY 22000
Venue
APLAS and CPP will take place at the Kyoto International Community
House, nearby the touristic area of Okazaki, inside Kyoto.
Kyoto International Community House
2-1 Torii-cho, Awataguchi, Sakyo-ku, Kyoto 606-8536
Invited Speakers
o Jan Vitek (Purdue University)
"Planet Dynamic or: How I Learned to Stop Worrying and Love Reflection"
o Greg Morrisett (Harvard University)
“Scalable Formal Machine Models”
o Xavier Leroy (INRIA)
“Mechanized Semantics for Compiler Verification”
o Gilles Barthe (IMDEA)
"Automation in computer-aided cryptography: proofs, attacks and designs"
o Naoki Kobayashi (University of Tokyo)
"Program Certification by Higher-Order Model Checking"
For detailed conference programs, see
- http://aplas12.kuis.kyoto-u.ac.jp/program.html
- http://cpp12.kuis.kyoto-u.ac.jp/program.html
logic-mlの皆様,
名古屋大学の西村と申します.
東京大学の村尾先生のご依頼により,
量子情報科学の国際会議TQC2013の告知を
投稿させていただきます.
よろしくお願いいたします.
名古屋大学大学院情報科学研究科
西村治道
--以下告知--
-------
Dear Friends,
The 8th Conference on the Theory of Quantum Computation, Communication
and Cryptography will be held at the University of Guelph, 21st--23rd
May 2013.
http://www.uoguelph.ca/quigs/tqc2013/index.html
There are some interesting news about TQC! The proceedings consisting of
accepted papers and a selection of posters will be published
electronically in the LIPIcs (Leibniz International Proceedings in
Informatics) series. The LIPIcs series guarantees perennial, free and
easy electronic access, while the authors will retain the rights over
their work (Attribution 3.0 Unported (CC BY 3.0)). Notice that abstract
material can be published elsewhere after TQC. For further information
please visit
http://www.uoguelph.ca/quigs/tqc2013/en/submissions.html
Here are the important dates:
Submission deadline: *** February 05, 2013 (23:59h in any time zone) ***
Notification of acceptance/rejection: March 15, 2013
Registration deadline: April 20, 2013
Short abstracts submission: May 5, 2013
Conference: May 21-23, 2013
Proceedings submission (final version of accepted papers): July 03, 2013
It would be great if you could forward this email to your
students/colleagues at your home institution.
Please accept our apologies if you receive multiple copies of this message.
Best wishes,
The TQC2013 Committees
tqc2013(a)gmail.com