(重複して受け取られた場合はご容赦ください)
今年の12月に宮崎で開催される LENLS 9 国際ワークショップのCFPをお
送り致します。多数のご投稿をお待ちしております。
戸次大介(お茶の水女子大学)
[Apologies for multiple copies]
=================================================================
FIRST CALL FOR PAPERS
Logic and Engineering of
Natural Language Semantics 9 (LENLS 9)
Workshop Site : "Amusement Zone Miyazaki (The JA-AZM Hall)"
Kirishima 1-1-1, Miyazaki, Japan.
http://www.jaazm.jp/access/english.html
Dates : December 1-3, 2012
Contact Person: Alastair Butler (PRESTO JST/Tohoku University)
Contact Email : lenls9[[at]]easychair.org
Website : http://www.is.ocha.ac.jp/‾bekki/lenls/
=================================================================
Chair: Alastair Butler (PRESTO JST/Tohoku University)
Co-chair: Daisuke Bekki (Ochanomizu University)
Eric McCready (Aoyama Gakuin University)
Invited Speaker(s):
- Hans Kamp (University of Stuttgart)
Call For Papers:
================
LENLS is an annual international workshop focusing on formal semantics
and pragmatics. It will be held as one of the workshops of
the third JSAI International Symposia on AI (isAI2012)
(http://www.ai-gakkai.or.jp/jsai-isai/2012/)
sponsored by the Japan Society for Artificial Intelligence (JSAI)
(http://www.ai-gakkai.or.jp/jsai/english.html).
We invite submissions to this year's workshop on topics in formal
semantics and pragmatics, and related fields, including but in no way
limited to the following:
- Dynamic syntax/semantics/pragmatics of natural language
- Categorical/topological/coalgebraic approaches for natural language
syntax/semantics/pragmatics
- Logic and its relation to natural language and linguistic reasoning
(especially dynamic logics)
- Type-theoretic approaches to natural language
- Formal Philosophy of language
- Formal pragmatics (especially game-theoretic and utility-theoretic
approaches)
- Substructural expansion of Lambek Lambda Calculi
- Many-valued/Fuzzy and other non-classical logics and natural language
Submissions:
============
Abstracts (up to 4 pages, including figures, bibliography, apendices)
must be submitted electronically in PDF format at:
https://www.easychair.org/conferences/?conf=lenls9
When his/her abstract is accepted, the author is expected to submit a
full paper (10-14 pages) before the workshop. The proceedings of the
workshop will be available at the conference site for registered persons.
Important dates:
================
Abstract submission deadline: September 1, 2012
Notification of acceptance: October 10, 2012
Deadline for camera-ready copy: October 31, 2012
Deadline for onsite registration: November 24, 2012
LENLS 9: December 01-02, 2012
Tutorial Lecture (by Hans Kamp): December 03, 2012
Workshop Organizers/Program Committee:
======================================
- Alastair Butler (PRESTO JST/Tohoku University)
- Daisuke Bekki (Ochanomizu University)
- Eric McCready (Aoyama Gakuin University)
- Koji Mineshima (Keio University)
- Yoshiki Mori (University of Tokyo)
- Yasuo Nakayama (Osaka University)
- Katsuhiko Sano (Japan Advanced Institute of Science and Technology)
- Katsuhiko Yabushita (Naruto University of Education)
- Tomoyuki Yamada (Hokkaido University)
- Shunsuke Yatabe (National Institute of
Advanced Industrial Science and Technology)
- Kei Yoshimoto (Tohoku University)
The deadline for submitting to CPP 2012 is June 8, 2012.
The Second International Conference on
Certified Programs and Proofs (CPP 2012)
CALL FOR PAPERS
Kyoto, Japan
December 13-15 2012
http://cpp12.kuis.kyoto-u.ac.jp/
co-located with APLAS 2012
http://aplas12.kuis.kyoto-u.ac.jp/
CPP is a new international forum on theoretical and practical topics
in all areas, including computer science, mathematics, and education,
that consider certification as an essential paradigm for their work.
Certification here means formal, mechanized verification of some sort,
preferably with production of independently checkable certificates.
We invite submissions on topics that fit under this rubric.
The first CPP conference was held in Kenting, Taiwan during December
7-9, 2011. As with the first meeting, the proceedings will be
published in Springer-Verlag's Lecture Notes in Computer Science
series.
Suggested, but not exclusive, specific topics of interest for
submissions include: certified or certifying programming, compilation,
linking, OS kernels, runtime systems, and security monitors; program
logics, type systems, and semantics for certified code; certified
decision procedures, mathematical libraries, and mathematical
theorems; proof assistants and proof theory; new languages and tools
for certified programming; program analysis, program verification, and
proof-carrying code; certified secure protocols and transactions;
certificates for decision procedures, including linear algebra,
polynomial systems, SAT, SMT, and unification in algebras of interest;
certificates for semi-decision procedures, including equality,
first-order logic, and higher-order unification; certificates for
program termination; logics for certifying concurrent and distributed
programs; higher-order logics, logical systems, separation logics, and
logics for security; teaching mathematics and computer science
with proof assistants; and "Proof Pearls" (elegant, concise, and
instructive examples).
IMPORTANT DATES:
Authors are required to submit a paper title and a short abstract
before submitting the full paper. The submission should include when
necessary a url where to find the formal development assessing the
essential aspects of the work. All submissions will be electronic.
All deadlines are at midnight (GMT).
Abstract Deadline: Friday, June 8, 2012
Paper Submission Deadline: Friday, June 15, 2012
Author Notification: Monday, August 27, 2012
Camera Ready: Monday, September 17, 2012
Conference: December 13-15, 2012
PROGRAM CO-CHAIRS:
Chris Hawblitzel (Microsoft Research Redmond)
Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique)
GENERAL CHAIR:
Jacques Garrigue (Nagoya University)
PROGRAM COMMITTEE:
Stefan Berghofer (secunet Security Networks AG)
Wei-Ngan Chin (National University of Singapore)
Adam Chlipala (MIT)
Mike Dodds (University of Cambridge)
Amy Felty (University of Ottawa)
Xinyu Feng (University of Science and Technology of China)
Herman Geuvers (Radboud University, Nijmegen)
Robert Harper (Carnegie Mellon University)
Chris Hawblitzel (Microsoft Research Redmond)
Gerwin Klein (NICTA)
Laura Kovacs (Vienna University of Technology)
Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique)
Rupak Majumdar (UCLA, Max Planck Institute for Software Systems)
Lawrence Paulson (University of Cambridge)
Frank Piessens (KU Leuven)
Randy Pollack (Harvard and Edinburgh University)
Bow-Yaw Wang (Academia Sinica)
Santiago Zanella Béguelin (IMDEA Software Institute)
ORGANIZING COMMITTEE:
Jacques Garrigue and Atsushi Igarashi
Email: cpp2012oc(a)math.nagoya-u.ac.jp
CPP STEERING COMMITTEE:
Andrew Appel (Princeton University)
Nikolaj Bjørner (Microsoft Research Redmond)
Georges Gonthier (Microsoft Research Cambridge)
John Harrison (Intel Corporation)
Jean-Pierre Jouannaud (co-Chair) (INRIA and Tsinghua University)
Gerwin Klein (NICTA)
Tobias Nipkow (Technische Universität München)
Zhong Shao (co-Chair) (Yale University)
SUBMISSION INSTRUCTIONS:
Papers should be submitted electronically online via the conference
submission web page at URL:
http://www.easychair.org/conferences/?conf=cpp2012
Acceptable formats are PostScript or PDF, viewable by Ghostview or
Acrobat Reader. Submissions should not exceed 16 pages in LNCS format,
including bibliography and figures. Submitted papers will be judged on
the basis of significance, relevance, correctness, originality, and
clarity. They should clearly identify what has been accomplished and
why it is significant. The proceedings of the symposium will be
published as a volume in Springer-Verlag’s Lecture Notes in Computer
Science series.
Each submission must be written in English and provide sufficient
detail to allow the program committee to assess the merits of the
paper. It should begin with a succinct statement of the issues, a
summary of the main results, and a brief explanation of their
significance and relevance to the conference, all phrased for the
non-specialist. Technical and formal developments directed to the
specialist should follow. Whenever appropriate, the submission should
come along with a formal development, using whatever prover, e.g.,
Agda, Coq, Elf, HOL, HOL-Light, Isabelle, Matita, Mizar, NQTHM, PVS,
Vampire, etc. References and comparisons with related work should be
included. Papers not conforming to the above requirements concerning
format and length may be rejected without further consideration.
The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other published conferences
or workshops. The PC chairs should be informed of closely related work
submitted to a conference or journal in advance of submission.
Original formal proofs of known results in mathematics or computer
science are among the targets. One author of each accepted paper is
expected to present it at the conference.
East-Asian School on Logic, Language, and Computation
(EASLLC 2012)
Southwest University, Chongqing, China, August
27-31, 2012
http://home.hib.no/prosjekter/easllc2012/
This is a school for graduate students and postdoctoral scholars,
similar
in spirit to the annual ESSLLI summer schools in Europe and also to the
Sino-European Summer School on Logic, Language, and Computation, which
took
place in Guangzhou, China in December 2010.
- The program of EASLLC 2012 will consist of nine courses in three
different tracks: logic, language, and computation.
· Logic Track: Fenrong Liu (Tsinghua University), Rohit
Parikh (Brooklyn
College of CUNY and CUNY Graduate Center), Jouko Väänänen
(University of
Helsinki and University of Amsterdam)
· Language Track: Pauline Jacobson (Brown University),
Geoffrey K.
Pullum (University of Edinburgh and Brown University), Dag Westerståhl
(Stockholm University)
· Computation Track: Krzysztof R. Apt (CWI and University of
Amsterdam), Phokion G. Kolaitis (University of California Santa Cruz and
IBM Research ? Almaden), Moshe Y. Vardi (Rice University)
- There will be student sessions in the late afternoon/early
evening of
some days of the School in which students will give short
presentations of
work in progress. Students are invited to submit an abstract of
maximum
3 pages on any topic in logic, language and computation. The abstract
should be written properly in English, and must be in PDF format
and be
submitted to our EasyChair
website<https://www.easychair.org/conferences/?conf=easllc2012stus>.
* Important Dates:*
May 28, 2012 - deadline for short abstracts of papers (at
most 3 pages)
June 10, 2012 - notification date of acceptance/rejection of
the papers
Detailed information about the student session can be found at
http://home.hib.no/prosjekter/easllc2012/stusess.asp
EASSLC 2012 is an ASL-Sponsored Meeting. ASL offers student travel
awards ?
for details, please see http://aslonline.org/studenttravelawards.html
- Prior to the School, an International Conference will take place on
August 25 and 26,
Scientific Organization:
- Program Committee Chair: Phokion G. Kolaitis
- Program Committee co-Chairs: Xiangdong He (Southwest
University), Jouko
Väänänen, Dag Westerståhl
Local Organization:
- Meiyun Guo (Southwest University), Minghui Ma (Southwest
University),
Jing Wang (Southwest University), Xiaojia Tang (Southwest University)
Student Program Organization:
- Chair: Yi Wang (Bergen University College)
- Co-Chair: Fan Yang (University of Helsinki)
みなさま,
こんにちは! 東京大学の蓮尾と申します.
来週 5/15(火)に,現在滞在中の Bart Jacobs さん (Radboud U. Nijmegen)
にご講演いただきます.
詳細は下記のとおりです.タイトルに「量子」とありますが,
量子論理等の知識がなくても,categorical logic の話として聞いて
いただけるはずです.ぜひ!
参加登録等は必要ありませんが,部屋の都合で人数の見積もりをしたいので,
- 当研究室のセミナーにはじめておいでになる方は,
- こちら http://www.doodle.com/7zsyhidh2r478xyk に参加表明をいただけると
うれしいです.(ペンネームでかまいません)
お目にかかれること,楽しみにしております.それでは!
蓮尾 一郎
東京大学大学院 情報理工学系研究科 コンピュータ科学専攻
http://www-mmm.is.s.u-tokyo.ac.jp
=======================================================================
Tue 15 May 2012, 16:40-18:10
Bart Jacobs (Radboud U. Njimegen, http://www.cs.ru.nl/~bart/)
New directions in quantum logic
場所: 東京大学 本郷キャンパス 理学部7号館1階 102教室
(アクセス: http://www-mmm.is.s.u-tokyo.ac.jp/ の一番下を見てください)
The talk will use categorical techniques to give a new way of
representing predicates that is especially suited for "quantitative"
predicate logic. The relevant structure is illustrated for classical,
probabilistic and quantum logic. These new predicates give rise to
fibred/indexed categories. In the quantum case the Born rule appears
as a form of substitution. Predicates can also be used to specify
measurements in this setting.
皆様、
今月末RTA併設の、高階書換系ワークショップHOR'12の参加ご案内です。
今年はスペシャルセッションとして、停止性自動検証ツールの最新成果
のセッションを設けました。特に応用として
- Haskell
- Isabelle
のプログラムの停止性検証ツール、および高階書換え系の停止性ツール制
作者に、実装とその理論を発表していただきます。
また論文発表の一つには、IBMでの実際のコンパイラにおける高階書換え
の応用プロジェクト(Kristoffer Rose氏)の話題などもあり、
関数型言語、定理証明系などの利用者にも有用な情報になると思いますの
で、関連研究者の皆様は、ぜひ参加をご検討ください。
レギュラーレジストレーション〆切は明日5/9ですが、直接会場での参加
費払いも可能です。ワークショップのみでも参加可能で、でしたら当日で
も参加費はほとんど変わりませんし、RTA参加者でしたら同じです。同日
併設のツリーオートマタのTTATTワークショップ登録の方は、両方参加で
きますので、部分的な参加でも歓迎です。
-- 浜名 誠/群馬大学
=====================================================================
Call for Participation
6th International Workshop on Higher-Order Rewriting
HOR 2012
June 2, 2012, Nagoya, Japan
Colocated with RTA'12
http://www.cs.gunma-u.ac.jp/events/hor/
======================================================================
Invited speaker
---------------
* Zhenjiang Hu (National Institute of Informatics, Japan)
Can Graph Transformation be Bidirectionalized?
-- Bidirectional Semantics of Structural Recursion on Graphs --
Special Session: Current Status of Higher-Order Termination Tools
-----------------------------------------------------------------
* Carsten Fuhs: Haskell termination tool
* Rene Thiemann: Isabelle termination tool
* Aoto,Yamada: Simply-typed TRS termination tool
* Cynthia Kop: WANDA, termination tool for AFS
Accepted papers
----------------
* Beniamino Accattoli and Delia Kesner: The permutative lambda-calculus
(The original paper was presented at LPAR'12, LNCS 7180, pp.381-395)
* Thibaut Balabonski: A Unified Approach to Fully Lazy Sharing
(The original paper was presented at POPL'12, pp.233-246)
* Yuki Chiba and Takahito Aoto: Pattern Matching Algorithm for Higher Order Program Transformations
* Jean-Pierre Jouannaud and Jian-Qi Li: Termination of higher-order rewriting in dependent type calculi
* Vincent van Oostrom: Confluence via Critical Valleys
* Kristoffer Rose: Higher Order Rewriting for Real Programmers
$B3'MM!"(B
$B0J2<$NFbMF$G(BChung-chieh Shan$B$5$s$N9V1i$rM=Dj$7$F$*$j$^$9!#(B
$B4X?4$r$*;}$A$NJ}$O!"@'Hs$*5$7Z$K$4;22C$/$@$5$$!#(B
$B$I$&$>$h$m$7$/$*4j$$$$$?$7$^$9!#(B
$BD9C+@n???M(B
$B5~ETBg3X?tM}2r@O8&5f=j(B
--
$BF|;~(B 2012$BG/(B5$B7n(B15$BF|!J2P!K(B11:00$B!A(B12:00
$B>l=j(B $B5~ETBg3XAm9g8&5f(B2$B9f4[!J5HED%-%c%s%Q%9K\It9=Fb!K(B4$B3,(B478$B9f<<(B
Room 478, General Research Building No.2, Kyoto University
(Access information & map:
http://www.kyoto-u.ac.jp/en/accesshttp://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg )
$B9V1i<T(B Chung-chieh Shan$B;a(B (Cornell$BBg(B/$BC^GHBg(B)
$BBj(B Functional modularity in the lambda calculus
$B%"%V%9%H%i%/%H(B
(I (B (I (BA module is a part of a _description_ of a system, not necessarily
(I (B (I (Ba physical part. (I (BFor example, a program that is stored only in
(I (B (I (Bcompiled form by the computer running it may nevertheless be better
(I (B (I (Bdescribed by source code, so the program may have source modules
(I (B (I (Bthat are hard to recover at run time. (I (BThis functional notion of
(I (B (I (Bmodularity is relevant for organisms, species, and scientists
(I (B (I (Bbecause they all need to adapt to changes in the environment without
(I (B (I (Bre-learning, re-evolving, or re-discovering each new system from
(I (B (I (Bscratch.
(I (B (I (BLambda calculi and type systems offer expressive ways to describe
(I (B (I (Bnatural language and thus carve out its modules. (I (BIn particular,
(I (B (I (Blambda calculi can express modules that operate on other modules,
(I (B (I (Band type systems can circumscribe information flow among modules
(I (B (I (Bwhose operation is tightly intertwined. (I (BI will illustrate the use
(I (B (I (Bof this expressivity with two examples: (I (BFirst, Abstract Categorial
(I (B (I (BGrammars can carve out sound and meaning as a collection of modules
(I (B (I (Bmediated by syntax. (I (BSecond, monad transformers can carve out side
(I (B (I (Beffects such as continuations and state as a collection of modules
(I (B (I (Bmediated by lexical items.
$B!JLd$$9g$o$;@h!'D9C+@n!K(B
--
$BD9C+@n???M(B <hassei(a)kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
We will hold the 3rd 「論数哲」(PhilLogMath) workshop. Our aim is to
provide opportunities of detailed discussions among philosophers,
logicians, mathematicians and linguists. We focus on theoretical and
computational linguistics this time. Everyone is welcome.
website url: http://researchmap.jp/jopmokbbr-21098/#_21098
Date : May 17 (Thu)
Place: Seiryo Kaikan (Nagata-cho, Tokyo)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Time table
10:00-13:00 "Author meets Critics" meeting on Takuro Onishi's Doctor thesis
14:30-16:00 Daisuke Bekki (Ochanomizu University) and Hiroko Ozaki
(Ochanomizu University)
"Sub-directional Combinatory Logic (SDCL) and Categorial Grammar"
16:15-17:45 Chung-chieh Shan (Cornell Unversity/ Tsukuba University)
"Interpreting generic statements in topological spaces"
Two afternoon slots consists of 60 minutes talk and 30 minutes
discussion basically.
Author meets Critics meeting is in Japanese, and two afternoon
talks are in English.
Abstracts:
*Daisuke Bekki and Hiroko Ozaki "Sub-directional Combinatory Logic
(SDCL) and Categorial Grammar"
Sub-directional Combinatory Logic (SDCL) is a class of substructural
combinatory logic that distinguishes two types of implications (/ and
¥) as in Lambek calculus, which is intended to establish a
correspondence between combinatory categorial grammar (CCG) and logic.
In this talk, we will introduce some of our recent developments
concerning SDCL, including the relation between extraction and the
deduction theorem (Ozaki and Bekki (2012)), and the application of
SDCL to normal form parsing (Ozaki(2012)).
*Chung-chieh Shan "Interpreting generic statements in topological
spaces" (joint work with Adam Bjorndahl and Will Starr at Cornell
University)
Generic statements, such as "lions have manes and give birth to live
young", are statements about kinds. But what are kinds, and what does
it take for a kind to satisfy a property that applies to members of
the kind? We claim that a kind is a topological space, a property is a
set of points in the space, and a property holds of a kind generically
iff the set of points is "large" in a topological (and qualitative)
sense. This "large" modality accounts for several inference patterns
of generic statements. However, it leaves open the issue of how the
space is constituted by cognition and updated in dialogue.
Workshop organizer (please replace [at] to @):
Yuko Murakami
Shunsuke Yatabe ( shunsuke.yatabe[at]aist.go.jp )
Takuro Onishi ( takuro.onishi[at]gmail.com )
8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University,
DENMARK
Third Announcement and Call for Papers
The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner,
Denmark, 20-21 August 2012.
After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.
As with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.
TOPICS
The scope of SLS 2012 is broad, ranging over the whole area of mathematical and philosophical logic, and logical methods in computer science. Suitable topics include (but are not limited to):
* Proof Theory and Constructivism
* Model Theory (including Finite Model Theory)
* Set Theory
* Computability Theory
* Categorical Logic
* Logic and Provability
* Logic and Computer Science
* Logic and Linguistics
* Modal, Hybrid, Temporal, and Description Logic
* Logics of Games, Dynamics and Interaction
* Philosophy of Mathematics
* Philosophy of Computation
* Philosophy of Logic
* Philosophical Logic
PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:
7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968
The proceedings of several of these meetings have been published in book form.
INVITED SPEAKERS
The Program Committee is delighted to announce the names of the four invited speakers:
* Nikolaj Bjorner<http://research.microsoft.com/en-us/people/nbjorner/>
* Rosalie Iemhoff<http://www.phil.uu.nl/%7Eiemhoff/> (sponsored by The Danish Network for the History and Philosophy of Mathematics)
* Per Martin-Löf<http://en.wikipedia.org/wiki/Per_Martin-L%C3%B6f>
* Boban Velickovic<http://www.logique.jussieu.fr/%7Eboban/>
<http://research.microsoft.com/en-us/people/nbjorner/>
SLS TUTORIALS
On August 22nd, the day after the symposium finishes, a number of tutorials for PhD-students (or anyone else who is interested) will be given. These are intended to start from a relatively elementary level and lead on to current research problems.
The following tutorial lectures have been confirmed so far:
* Lars Kristiansen<http://folk.uio.no/larsk/> - "Honest subrecursive degree theory"
* Sara Negri <http://www.helsinki.fi/%7Enegri/> - "Labelled proof systems for modal logic"
* M. H. Sørensen<http://www.formalit.dk/> - "Curry-Howard Isomorphism"
RELATED EVENTS:
Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL:http://hylocore.ruc.dk/aiml2012/
PROGRAM COMMITTEE
Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)
Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist, (Vienna)
Jouko Väänänen (Helsinki)
ORGANISING COMMITTEE
Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)
SUBMISSIONS
Abstracts of talks should be submitted by May 1, 2012** using the EasyChair system
https://www.easychair.org/conferences/?conf=sls2012
The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.
**UPDATE:
SUBMISSION DATE has been extended: 1 June
NOTIFICATION OF ACCEPTANCE: 15 June
STUDENT GRANTS
We are happy to announce that the ASL is sponsoring SLS2012. Among other things, this means that student ASL members may apply for ASL travel funds that are available for sponsored meetings.
(see http://www.aslonline.org/studenttravelawards.html).
LOCATION
Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.
ACCOMMODATION
Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.
REGISTRATION
The conference website will be found at:
http://scandinavianlogic.weebly.com/
Details concerning registration will be posted there in due course.
# 重複の場合はご容赦ください.
神戸大学の田村と申します.
メーリングリストをお借りして,5月23〜25日に神戸大学で開催されます
FLOPS 2012 の Call For Participation をお送りします.
日本で定期的に開催される(関数型と論理型を含む)宣言的プログラミング全般
の国際会議の一つです.
Early registration の〆切は 4月25日(水)となっております.皆様のご参加を
お待ちしております.
--
田村直之 (tamura(a)kobe-u.ac.jp) 神戸大学 情報基盤センター
〒657-8501 神戸市灘区六甲台町1-1
Phone: 078-803-5364, Fax: 078-803-5375
=======================================================================================
CALL FOR PARTICIPATION: FLOPS 2012
==================================
Eleventh International Symposium on Functional and Logic Programming
May 23-25, 2012
Takikawa Memorial Hall, Kobe University,
Kobe, Japan
http://www.org.kobe-u.ac.jp/flops2012/
*Early Registration: April 25 (Wed)*
FLOPS is a forum for research on all issues concerning declarative
programming, including functional programming and logic programming,
and aims to promote cross-fertilization and integration between the
two paradigms.
The 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) and satellite workshops including WFLP 2012
will be held in the week after FLOPS at Nagoya, Japan.
Invited Speakers @ FLOPS
================
- Tachio Terauchi (Graduate School of Information Science, Nagoya University).
Automated Verification of Higher-order Functional Programs
- Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev).
Programming with Boolean Satisfaction
- Stephanie Weirich (School of Engineering and Applied Science, University of Pennsylvania).
Dependently-typed programming in GHC
See the full program at http://www.org.kobe-u.ac.jp/flops2012/program.html
Register now at http://www.org.kobe-u.ac.jp/flops2012/index.html#REGISTRATION
CONFERENCE ORGANIZERS
GENERAL CHAIR
=============
- Naoyuki Tamura (Kobe University, Japan)
PROGRAM CO-CHAIRS
=================
- Tom Schrijvers (Ghent University, Belgium)
- Peter Thiemann (University of Freiburg, Germany)
CONFERENCE SPONSORS
===================
- Japan Society for Software Science and Technology (JSSST) SIGPPL
- Information Science and Technology Center, Kobe University
IN COOPERATION WITH
===================
- ACM SIGPLAN
- Asian Association for Foundation of Software (AAFS)
- Association for Logic Programming (ALP)
=======================================================================================