メーリングリストの皆様
東京理科大学では下記の要領でオープンセミナーを開催致しますので、奮ってご参加ください。
講演者: Professor Dick de Jongh (ILLC, University of Amsterdam)
題: Logic and Learning
日時: 2013年10月25日(金) 4:30pm-
Date: Oct 25, 2013, 4:30pm-
場所: 東京理科大学神楽坂キャンパス 森戸記念館第2フォーラム <http://www.tus.ac.jp/facility/morito/> (
アクセス <http://www.tus.ac.jp/info/access/kagcamp.html>)
Location: 2nd Forum, Morito Memorial Hall, Kagurazaka Campus, Tokyo
University of Science
(directions<http://www.tus.ac.jp/en/campus/kagurazaka.html>
)
参加無料
事前申し込み不要
Abstract:
Learning and learnability have been long standing topics of interests
within the linguistic, computational, and epistemological accounts of
inductive inference. This proximity relation between logic and learning is
examined with respect to learning and belief revision, knowledge updating
and efficiency, concentrating on knowledge updating. See Nina Gierasimczuk,
Vincent Hendricks and Dick de Jongh, Logic and Learning, to appear in:
Outstanding Contributions: Johan van Benthem. Trends in Logic Book Series,
Springer 2013, and Nina Gierasimczuk and Dick de Jongh, On the complexity
of Conclusive Update, The Computer Journal (2013) 56(3): 365-377.
問合わせ先:
西口純代 東京理科大学経営学部 email: nishiguchi(a)rs.tus.ac.jp
--
Sumiyo Nishiguchi, PhD
Junior Associate Professor of Linguistics
School of Management
Tokyo University of Science
nishiguchi(a)rs.tus.ac.jp
http://www.rs.tus.ac.jp/nishiguchi/
Dr. Andreas Abel at NII Logic Seminar
Date: October 11, 2013, 14:00--16:00
Place: National Institute of Informatics, Room 1210 (12th floor)
場所: 国立情報学研究所 12階 1210室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/about/access/)
Speaker: Dr. Andreas Abel (Chalmers and Gothenburg University)
Title: Copatterns: Programming Infinite Structures by Observations
Abstract:
Inductive datatypes provide mechanisms to define finite data such as
finite lists and trees via constructors and allow programmers to
analyze and manipulate finite data via pattern matching. In this
paper, we develop a dual approach for working with infinite data
structures such as streams. Infinite data inhabits coinductive
datatypes which denote greatest fixpoints. Unlike finite data which
is defined by constructors we define infinite data by observations.
Dual to pattern matching, a tool for analyzing finite data, we develop
the concept of copattern matching, which allows us to synthesize
infinite data. This leads to a symmetric language design where
pattern matching on finite and infinite data can be mixed.
We present a core language for programming with infinite structures by
observations together with its operational semantics based on
(co)pattern matching and describe coverage of copatterns. Our
language naturally supports both call-by-name and call-by-value
interpretations and can be seamlessly integrated into existing
languages like Haskell and ML.
We prove type soundness for our language and sketch
how copatterns open new directions for solving problems in the
interaction of coinductive and dependent types.
This is joint work with Brigitte Pientka, McGill University, Montreal.
問合せ先:
龍田 真 (国立情報学研究所)
e-mail: tatsuta(a)nii.ac.jp
http://research.nii.ac.jp/~tatsuta
Dear all,
Friday this week we have Tarmo Uustalu from Institute of Cybernetics,
Tallinn, Estonia visiting us in U Tokyo and making a talk.
No registration needed. See you there!
Best regards,
Ichiro Hasuo
http://www-mmm.is.s.u-tokyo.ac.jp/
________________________________
Fri 4 October 2013, 17:00-18:00
Tarmo Uustalu (Institute of Cybernetics, Tallinn),
Update Monads: Cointerpreting Directed Containers
理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html
Access: http://www-mmm.is.s.u-tokyo.ac.jp/
We introduce update monads as a generalization of state monads. Update
monads are compatible compositions of reader and writer monads given
by a set and a monoid. Distributive laws between such monads are given
by monoid actions.
We also discuss a dependently typed generalization of update monads.
Unlike simple update monads, those cannot be factored into a reader
and writer monad.
Dependently typed update monads arise from cointerpreting directed
containers, by which we mean interpreting the opposite of the category
directed containers into the category of set functors.
(Joint work with Danel Ahman, University of Edinburgh.)