みなさま、9月に奈良で開催される ICFP 2016 の案内を転送します。
早期参加申し込みの〆切は8月17日になっております。
5年ぶりの日本開催で、ご参加をお待ちしています。
=====================================================================
Call for Participation
ICFP 2016
21st ACM SIGPLAN International Conference on Functional Programming
and affiliated events
September 18 - September 24, 2016
Nara, Japan
http://conf.researchr.org/home/icfp-2016
=====================================================================
ICFP provides a forum for researchers and developers to hear
about the latest work on the design, implementations, principles, and
uses of functional programming. The conference covers the entire
spectrum of work, from practice to theory, including its peripheries.
A full week dedicated to functional programming:
1 conference, 1 symposium, 10 workshops, tutorials,
programming contest results, student research competition,
and mentoring workshop
* Overview and affiliated events:
http://conf.researchr.org/home/icfp-2016
* Program:
http://conf.researchr.org/program/icfp-2016/program-icfp-2016
* Accepted Papers:
http://conf.researchr.org/track/icfp-2016/icfp-2016-papers#event-overview
* Registration is available via:
https://regmaster4.com/2016conf/ICFP16/register.php
Early registration is due 17 August, 2016.
* Programming contest, 5-8 August, 2016:
http://2016.icfpcontest.org/
* Student Research Competition (deadline: 3 August, 2016):
http://conf.researchr.org/info/icfp-2016/student-research-competition
* Follow @icfp_conference on twitter for the latest news:
http://twitter.com/icfp_conference
There are several events affiliated with ICFP:
Sunday, September 18
Workshop on Higher-order Programming with Effects
Workshop on Type-Driven Development
Scheme and Functional Programming Workshop
Programming Languages Mentoring Workshop
Monday, September 19 – Wednesday, September 21
ICFP
Thursday, September 22
Haskell Symposium – Day 1
ML Family Workshop
Workshop on Functional High-Performance Computing
Commercial Users of Functional Programming – Day 1
Friday, September 23
Haskell Symposium – Day 2
OCaml Workshop
Erlang Workshop
Commercial Users of Functional Programming – Day 2
Saturday, September 5
Commercial Users of Functional Programming – Day 3
Haskell Implementors Workshop
Functional Art, Music, Modeling and Design
Conference Organizers
General Co-Chairs:
Jacques Garrigue, Nagoya University
Gabriele Keller, University of New South Wales
Program Chair:
Eijiro Sumii, Tohoku University
Local Arrangements Co-Chairs:
Shinya Katsumata, Kyoto University
Susumu Nishimura, Kyoto University
Industrial Relations Chair:
Rian Trinkle, Obsidian Systems LLC
Workshop Co-Chairs:
Nicolas Wu, University of Bristol
Andres Loeh, Well-Typed LLP
Programming Contest Chair:
Keisuke Nakano, The University of Electro-Communications
Student Research Competition Chair:
David Van Horn, University of Maryland, College Park
Mentoring Workshop Co-Chairs:
Amal Ahmed, Northeastern University
Robby Findler, Northwestern University
Atsushi Igarashi, Kyoto Universty
Publicity Chair:
Lindsey Kuper, Intel Labs
Video Chair:
Iavor Diatchki, Galois
Jose Calderon, Galois
Student Volunteer Co-Chairs:
Yosuke Fukuda, Kyoto University
Yuki Nishida, Kyoto University
Gabriel Scherer, INRIA
Industrial partners:
Platinum partners
Jane Street Capital
Ahrefs
Gold partners
Mozilla Research
Silver partners
Ambiata
Tsuru Capital
Bronze partners
Awake Networks
Microsoft Research
=====================================================================
皆様
ルートヴィヒ・マクシミリアン大学ミュンヘンの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.
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
皆様
インスブリア大学の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.
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>
/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
名古屋集合論セミナーのご案内:
日時: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.
多数のご参加をお待ちしております。
名古屋大学大学院情報科学研究科
吉信康夫