Logic-ml

9 participants
1781 discussions

MOL 12 Tokyo - Submission Open
by Makoto Kanazawa 07 Mar '11

07 Mar '11

*** ONLINE PAPER SUBMISSION OPEN *** Last Call for Papers (submission deadline: March 22, 2011) 12th Meeting on Mathematics of Language Tokyo, September 5–7, 2011 http://sites.google.com/site/mol12tokyo/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available atftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: March 22, 2011 • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 5-7, 2011 Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (Chair) • Ryo Yoshinaka

1 0

Talk by Yoshihiro Maruyama, Tuesday next week (8 Mar 2011)
by Ichiro Hasuo 03 Mar '11

03 Mar '11

Dear colleagues, Next week on Tuesday Yoshihiro Maruyama, a finishing master student at Department of Humanistic Informatics, Kyoto University is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Yoshihiro Maruyama (Department of Humanistic Informatics, Kyoto University) http://researchmap.jp/ymaruyama/ Title: Duality in Logic, Algebraic Geometry, and Computer Science Date: 11.00 - 12.00, Tue 8 Mar 2011 Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Categorical duality often arises between ontological and epistemological aspects of concepts.　Indeed, we can find a number of such dualities in diverse fields: duality between models and theories in logic; duality between computer systems and their properties in computer science; duality between states and observables in quantum physics; duality between varieties and rings in algebraic geometry. In this talk, we briefly attempt to clarify the relationships between these dualities (especially, dualities in logic and algebraic geometry in relation to logical completeness and Hilbert Nullstellensatz), and develop a moderately general theory of dualities between modal logics and coalgebras (representations of the above-mentioned duality in computer science), extending the theory of natural dualities (a general theory of Stone-type dualities based on universal algebra) via a new concept of modal power. For the latter part, a preprint "Natural Duality, Modality and Coalgebra" is available in: http://researchmap.jp/ymaruyama/

1 0

Fwd: NSA2011
by Tchizawa 02 Mar '11

02 Mar '11

関係各位様 2010年度超準解析シンポジウムの第4報です。今回は Guy Wallet, Imme van den Berg　教授が海外から参加されます。講演は日本語でOKですが、レジュメはできれば英語で作成されることを希望します。尚、3 月 29日（火）に懇親会を予定しています、こちらの参加の予定もお知らせください。２０１０年度超準解析シンポジウム日時：３月２8日（月）,２9日（火）,30日（水）, 2011　場所：東京都市大学　世田谷キャンパス 2号館1階　21C 　　（東急大井町線　尾山台駅　徒歩　約１５分） NSA 2011 Program ********************** 28th March Reception, 12:30-14:00 Session, 14:00-15:00 : H.Yamashita, "Brownian phase-space path integral" 15:30-17:30 : I.V.D.Berg, "External numbers and external points" ----------------------------------- 29th March 10:00-11:00 : K.Yokoyama "TBA" 11:30-12:30 : S.Sanders, "Nonstandard Analysis, the star of Reverse Mathematics" Lunch Time Session, 14:00-15:00 : S.Nagamachi, "Bosonization" 15:30-17:30 : G.Wallet, "Arithmetization and Harthong-Reeb line based on Omega-numbers" Banquet : Santo Spirito (Meguro) 19:00-21:30 -------------------------------------------- 30th March 10:00-11:00 : H.Miki, "4-dim duck solutions in a trading economic model" 11:30-12:30 : K.Tchizawa, "On a local model in a 4-dim slow-fast system" ------------------------------------- Kiyoyuki Tchizawa Directorate Ph.D Tokyo Nonlinear Analysis Research Center Institute of Administration Engineering, Ltd.

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 ================================================== Call for papers INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM‚11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 ================================================== Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this „service revolution‰ will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general „rigorous software development‰ might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks∑), service dependability, service evaluation/monitoring/testing, etc∑, a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, ∑) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We already agreed with the editor of an international journal to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra(a)imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas(a)oracle.com * Fabio Massacci, University of Trento, Italy - massacci(a)disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara(a)newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montréal, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep Küngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hernán Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

1 0

CFP: 第84回プログラミング研究会発表募集
by Takahito Aoto 28 Feb '11

28 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りて2011年度第1回情報処理学会プログラミング研究発表会の発表募集のご案内をさせて頂きたく存じます．プログラミング研究会(PRO)は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています (論文誌投稿を希望しない発表も歓迎します)．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2011年6月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切は4月14日(投稿締切は5月14日)ですので，よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．第84回プログラミング研究会(PRO-2011-1)発表募集日程: 2011年6月14日(火)・15日(水) 会場: サン・リフレ函館〒040-0034 北海道函館市大森町2-14 JR函館駅より徒歩15分発表申込締切: 2011年4月14日(木) 投稿論文原稿提出締切: 2011年5月14日(土) 申込先: 青戸等人 (東北大学電気通信研究所) E-mail: aoto [at] nue.riec.tohoku.ac.jp Tel: 022-217-5420 / Fax: 022-217-5426 (電気通信研究所) 案内ページ: http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ ・申込みに当たっての注意はプログラミング研究会のページ http://www.ipsj.or.jp/sig/pro/ を参照してください．・できるだけE-mailでお願いします．・申込み後返信がない場合はご連絡下さい． --- 青戸等人東北大学電気通信研究所 http://www.nue.riec.tohoku.ac.jp/user/aoto/

1 0

[開催案内] 情報処理学会第83回プログラミング研究発表会(3/16-17)
by Keisuke Nakano 27 Feb '11

27 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りまして，情報処理学会第83回プログラミング研究発表会開催のご案内をさせて頂きます．日程は3月16日-17日で，場所はIBM東京基礎研究所です．皆様のご参加をお待ちしております．なお，入館手続きをスムーズに行うため，参加予定の方は事前連絡をお願いします．（当日の飛び入り参加も可能ですが，入館に時間がかかる可能性があります．）また，3月16日の研究会終了後には懇親会を予定しております．参加希望者はあわせて出席予定をお知らせ下さい． -------- To: kawatiya <at> jp.ibm.com Subject: PRO83参加予定第83回PRO研究会に出席します． (↓どちらかを消して下さい) 3月16日の懇親会に参加します． 3月16日の懇親会に参加しません．御名前: 御所属: -------- 最新情報は下記ページに掲示されますのでご確認ください． http://millsmess.cs.uec.ac.jp/pro/2010-5/ 担当：中野圭介(電通大)，河内谷清久仁(日本IBM) ---------------- 第83回プログラミング研究会 (PRO-2010-5) 日程：2011年 3月 16日(水)・17日(木) 場所：日本アイ・ビー・エム（株）東京基礎研究所　　　〒242-8502 神奈川県大和市下鶴間1623-14 　　　東急田園都市線つきみ野駅から徒歩10分，または　　　小田急江ノ島線／東急田園都市線中央林間駅より徒歩12分　　　(交通ガイド http://www.trl.ibm.com/lab/trlmap.htm) ---------------- [プログラム] 2011/03/16 (水) 9:10 - 9:55 (1) Rubyの文字列処理の手軽な高速化 ○中川博貴 (東京大学) 笹田耕一 (東京大学) 9:55 - 10:40 (2) 大規模主記憶環境における GC 方式の性能評価 ○井出真広 (横浜国立大学) 養安元気 (横浜国立大学) 倉光君郎 (横浜国立大学) 10:40 - 11:25 (3) 要求駆動型部分無用コード除去 ○滝本宗宏 (東京理科大学) (昼食) 12:45 - 13:30 (4) 分散メモリアーキテクチャ向けFuceランタイムシステムとその上でのストリーム処理の評価 ○雨宮聡史 (九州大学) 雨宮真人 (大阪工業大学) 13:30 - 14:15 (5) メモ化表へのプリフェッチによるPackrat Parserの並列化 ○遠藤仁 (筑波大学) 前田敦司 (筑波大学) 山口喜教 (筑波大学) 14:15 - 15:00 (6) 正規表現マッチングの並列化とそのHadoopでの評価 ○松崎公紀 (高知工科大学) 江本健斗 (東京大学) 劉雨 (総合研究大学院大学) (休憩) 15:10 - 15:55 (7) CNFSATからHornSATへの変換手法について ○小林弘二 (フリー) 15:55 - 16:40 (8) 証明支援系Coqのプログラムに対する対話的修正機構の提案 ○森口草介 (東京工業大学) 渡部卓雄 (東京工業大学) 16:40 - 16:50 CS領域奨励賞授与式 18:30 - 21:00 懇親会 ---------------- 2011/03/17 (木) 9:10 - 9:55 (9) サーバ・クライアント処理の動的分割・再配置機能を備えた Webアプリケーション用言語 ○石橋崇 (電気通信大学) 小宮常康 (電気通信大学) 多田好克 (電気通信大学) 9:55 - 10:40 (10) Decidability of Reachability for Right-Shallow Context-Sensitive Term Rewriting Systems ○小島芳治 (名古屋大学) 酒井正彦 (名古屋大学) 西田直樹 (名古屋大学) 草刈圭一朗 (名古屋大学) 坂部俊樹 (名古屋大学) 10:40 - 11:25 (11) Determinization of Conditional Term Rewriting Systems for Program Generation ○長島正憲 (名古屋大学) 酒井正彦 (名古屋大学) 坂部俊樹 (名古屋大学) (昼食) 12:45 - 13:30 (12) Orchid: Webアプリケーションのための安全なコード生成機能を持つプログラミング言語 ○高橋宏文 (筑波大学) 亀山幸義 (筑波大学) 13:30 - 14:15 (13) グラフ書換え言語REGRELによるメタプログラミングの表現 ○東達軌 (東京理科大学) 武田正之 (東京理科大学) 14:15 - 15:00 (14) Practical Implementation of EPLAS: an Epistemic Programming Language for All Scientists ○方文琤 (埼玉大学) Isao Takahashi (埼玉大学) Yuichi Goto (埼玉大学) Jingde Cheng (埼玉大学) (休憩) 15:10 - 15:55 (15) 純粋関数型言語を用いた超コンパクト音声認識デコーダの開発 ○篠崎隆宏 (東京工業大学) 関嶋政和 (東京工業大学) 萩原茂樹 (東京工業大学) 古井貞煕 (東京工業大学) 15:55 - 16:40 (16) 日本語プログラミング言語における関数の多重定義解決の実装と評価 ○馬場祐人 (早稲田大学) 筧捷彦 (早稲田大学)

1 0

【2/25参加締切】 PPL2011 プログラム決定および参加最終案内
by Kiyokuni Kawachiya 23 Feb '11

23 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊日本IBMの河内谷と申します．この場を借りて，3/9(水)〜3/11(金)に北海道で開催される，第13回プログラミングおよびプログラミング言語ワークショップ (PPL2011) の参加最終案内をさせて頂きたく存じます．参加申込の期限が【2/25(金)】に迫っています．以下からお急ぎください． http://www.info.kochi-tech.ac.jp/ppl2011/registration.html また，プログラムが決定しましたので，お知らせいたします．論文発表が17件，既発表論文の紹介が10件，ポスター・デモ発表が54件です．招待講演として，以下のお二方にご講演いただきます．田中哲朗氏 (東京大学) 「将棋プログラムの大規模並列実行」照井一成氏 (京都大学) 「線形論理とラムダ計算の計算量」非常に充実した内容になっておりますので，ぜひご参加ください． -------------------------------------------------------------------------- 第13回プログラミングおよびプログラミング言語ワークショップ（PPL2011） http://www.info.kochi-tech.ac.jp/ppl2011/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2011年3月9日(水)〜3月11日(金) 会場: 北海道札幌市定山渓ビューホテル http://www.jozankeiview.com/ PPL2011は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表が，カテゴリ別に幅広く行われます．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） -------------------------------------------------------------------------- プログラム発表時間: C1, C2: 質疑応答も含め25分 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1日目 (3月9日(水)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 13:45 - 13:55 オープニング 13:55 - 15:10 (75分) セッション1 (C1) Java における適切な同期機構の選択システム山田佑二, 鵜川始陽, 岩崎英哉 (電気通信大学) (C1) 生存区間を変数名とする中間表現の実装と, それに基づく最適化高橋和将, 森畑明昌, 上野雄大, 大堀淳 (東北大学) (C2) A Study of Java's Non-Java Memory (出典: 25th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA 2010), pp. 191-204, 2010) Kazunori Ogata, Dai Mikurube, Kiyokuni Kawachiya, Scott Trent, Tamiya Onodera (IBM Research) 15:10 - 15:30 休憩 15:30 - 16:30 セッション2 招待講演将棋プログラムの大規模並列実行田中哲朗 (東京大学情報基盤センター) 16:30 - 16:50 休憩 16:50 - 18:30 (100分) セッション3 (C1) 条件論理 Cb とそのタブローシステム尾崎有梨, 戸次大介 (お茶の水女子大学) (C1) 先読み付き正規表現の効率の良いマッチングアルゴリズム森畑明昌 (東北大学) (C1) メタラムダ計算の圏論的意味論増子萌, 戸次大介 (お茶の水女子大学) (C2) A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (出典: 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2011), to appear) Naoki Kobayashi (Tohoku University) 18:30 - 20:30 夕食 20:30 - 22:00 セッション4 (ポスター・デモ1) (C3) ポスター型システムによる高階木変換器の逆像計算塚田武志, 松田一孝 (東北大学) (C3) デモ MoCHi: 高階関数型プログラム用モデル検査器佐藤亮介, 海野広志, 小林直樹 (東北大学) (C3) ポスターオブジェクトを移動させない，関数型言語に適したビットマップマーキングガベージコレクションの提案大友聡顕, 上野雄大, 大堀淳 (東北大学) (C3) ポスター・デモコンパイラ内部機能を利用したプログラム開発環境の構築齋藤啓太, 上野雄大, 大堀淳 (東北大学) (C3) ポスター正規表現マッチングのトランスデューサへの変換佐久間雄和*, 南出靖彦*, Andrei Voronkov** (*筑波大学, **マンチェスター大学) (C3) ポスターコントロールオペレータ control/prompt を用いた nested shift/reset のマクロ表現高島尚希 (筑波大学) (C3) ポスター証明支援系 Coq における対話的修正機構の提案森口草介, 渡部卓雄 (東京工業大学) (C3) ポスター総称型に対応した拡張型緩和織込機構の提案当山学*, 青谷知幸**, 増原英彦* (*東京大学, **北陸先端科学技術大学院大学) (C3) ポスター GPGPU プログラミングのための Ruby 言語処理系西口裕介 (東京大学) (C3) ポスター操作の一意性の推論形式からの自動判定中村宇佑 (東京大学) (C3) ポスタースキーマを持った実行可能なデータ形式大谷桂介 (東京工業大学) (C3) ポスタービジュアルプログラミング言語とプログラム変換吉永卓矢, 脇田建 (東京工業大学) (C3) ポスター構文マクロ定義を利用したプログラム整形システム甫水佳奈子 (東京工業大学) (C3) ポスター分散 JavaScript 言語による Web アプリケーションの効率的な開発加藤真人 (東京工業大学) (C3) ポスタープログラムの更新を可能とする Checkpoint/Restart 機構室井雅仁, 鵜川始陽, 岩崎英哉 (電気通信大学) (C3) ポスター仮想化支援技術を用いた純関数型言語による仮想マシンモニタの設計加藤瞬, 岩崎英哉 (電気通信大学) (C3) ポスター探索アルゴリズムのための非決定性オペレータの実装金子ちひろ, 浅井健一 (お茶の水女子大学) (C3) デモ Emacs における対話的な型デバッガの実装と改良対馬かなえ (お茶の水女子大学) (C3) ポスター部分方向性組み合わせ論理の計算論的性質尾崎博子, 戸次大介 (お茶の水女子大学) (C3) ポスター前提記述のための動的論理の証明論構築に向けて石下裕里, 戸次大介 (お茶の水女子大学) (C3) ポスター階層グラフ書換え言語 LMNtal における管理アトムの処理目黒学, 中川遼平, 上田和紀 (早稲田大学) (C3) ポスターハイブリッドシステムモデリング言語 HydLa の処理系による非決定性の扱い松本翔太*, 高田賢士郎*, 細部博史**, 上田和紀* (*早稲田大学, **国立情報学研究所) (C3) ポスター・デモ OCaml によるスマートフォン向け動的 Web ページの開発事例今井敬吾*, 今井宜洋*, 小笠原啓*, 結縁祥治** (*有限会社ITプランニング，**名古屋大学) (C3) ポスター形式手法を含む言語教育の成果と課題小川清, 斉藤直希 (名古屋市工業研究所) (C3) ポスター例外機構を持つ型付きラムダ計算におけるパラメトリシティ大里陽一, 五十嵐淳, 中澤巧爾 (京都大学) (C3) ポスター多相型と存在型に対する型検査問題の同値性加藤祐輝, 中澤巧爾 (京都大学) (C3) ポスター・デモ Safe アンビエントに基づく分散アプリケーション開発用 Lisp 環境林奉行, 馬谷誠二, 八杉昌宏, 湯淺太一 (京都大学) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2日目 (3月10日(木)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 9:00 - 10:00 セッション5 招待講演線形論理とラムダ計算の計算量照井一成 (京都大学数理解析研究所) 10:00 - 10:20 休憩 10:20 - 12:00 (100分) セッション6 (C1) 基底項書き換え系の多項式時間合流性判定法の改良村井正勝, 青戸等人, 外山芳人 (東北大学) (C1) 多項式サイズ正規形を保証する項書き換えシステムの経路順序磯部耕己, 青戸等人, 外山芳人 (東北大学) (C2) Verification of Tree-Processing Programs via Higher-Order Model Checking (出典: 8th Asian Symposium on Programming Languages and Systems (APLAS 2010), pp. 312-327, 2010) Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi (Tohoku University) (C2) General Bindings and Alpha-Equivalence in Nominal Isabelle (出典: 20th European Symposium on Programming (ESOP 2011), to appear) Christian Urban*, Cezary Kaliszyk** (*TU Munich, **University of Tsukuba) 12:00 - 13:30 昼食 13:30 - 14:45 (75分) セッション7 (C1) A Homomorphism-based Framework for Systematic Parallel Programming with MapReduce Yu Liu*, Zhenjiang Hu** (*The Graduate University for Advanced Studies, **National Institute of Informatics) (C1) 標準 Java 仮想機械上で動的にメンバーの追加を行う機構の提案早船総一郎, 千葉滋 (東京工業大学) (C2) Mostly modular compilation of crosscutting concerns by contextual predicate dispatch (出典: 25th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA 2010), pp. 539-554, 2010) Shigeru Chiba*, Atsushi Igarashi**, Salikh Zakirov* (*Tokyo Institute of Technology, **Kyoto University) 14:45 - 15:10 休憩 15:10 - 16:50 (100分) セッション8 (C1) 模倣に基づくグラフスキーマを利用したビュー更新可能性判定中野圭介*, 日高宗一郎**, 胡振江**, 稲葉一浩**, 加藤弘之** (*電気通信大学, **国立情報学研究所) (C1) An Algebraic Approach to Efficient Parallel Algorithms for Nested Reductions Kento Emoto (University of Tokyo) (C2) Bidirectionalizing Graph Transformations (出典: 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010), pp. 205-216, 2010) Soichiro Hidaka*, Zhenjiang Hu*, Kazuhiro Inaba*, Hiroyuki Kato*, Kazutaka Matsuda**, Keisuke Nakano*** (*National Institute of Informatics, **Tohoku University, ***The University of Electro-Communications) (C2) Calculating Tree Navigation with Symmetric Relational Zipper (出典: 20th ACM SIGPLAN 2011 Workshop on Partial Evaluation and Program Manipulation (PEPM 2011), pp. 101-110, 2011) Yuta Ikeda, Susumu Nishimura (Kyoto University) 16:50 - 17:15 休憩 17:15 - 18:30 (75分) セッション9 (C1) Haskellによる拡張性の高いプレゼンテーション・システム今村悠, 岩崎英哉 (電気通信大学) (C1) 宣言的記述からの関数型言語によるゲームプログラムの導出松島勇介, 上野雄大, 森畑明昌, 大堀淳 (東北大学) (C2) MikiBeta : A General GUI Library for Visualizing Proof Trees --- System Description and Demonstration --- (出典: 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), LNCS, to appear) Kanako Sakurai, Kenichi Asai (Ochanomizu University) 18:30 - 20:30 夕食 20:30 - 22:00 セッション10 (ポスター・デモ2) (C3) ポスター Java 言語のための暗黙的に型定義される構造体大久保貴司, 千葉滋 (東京工業大学) (C3) ポスター IDE を活用した言語機構に頼らないコード再利用のためのモジュール化寺本裕基, 武山文信, 千葉滋 (東京工業大学) (C3) ポスター内部ドメイン専用言語支援のための型に連動した字句・構文ルールの変更機構市川和央, 千葉滋 (東京工業大学) (C3) ポスター機能モジュールの合成コードのより良いモジュール化に向けて武山文信, 千葉滋 (東京工業大学) (C3) ポスター細かい粒度でコードの再利用を可能とするメソッド内メソッドの Java 言語への導入平松俊樹 (東京工業大学) (C3) ポスタープログラム構造に強く依存しないポイントカットの提案伊尾木将之 (東京工業大学) (C3) ポスタープログラムの織り込み関係を可視化するアウトラインビューの提案と実装大谷晃司 (東京工業大学) (C3) ポスター量子プロトコルの形式的検証のための観測同値久保田貴大, 角谷良彦 (東京大学) (C3) ポスター Coq を用いた Hadoop MapReduce アプリケーションの仕様記述とプログラム抽出小野洸亮*, 田辺良則**, 谷幹也***, 中野雄介*, 野田夏子***, 萩谷昌己*, 平井洋一*, 細野繁***, 蒔原省吾* (*東京大学, **国立情報学研究所, ***日本電気株式会社) (C3) ポスター型に場所がついた計算体系木村大輔*, 角谷良彦** (*NII, **東京大学) (C3) ポスターコレクションデータのパターンマッチ江木聡志 (東京大学) (C3) ポスター対称λ計算と古典論理 Reloaded 上田やよい (お茶の水女子大学) (C3) ポスター・デモ AlGoL: プログラミング言語の基礎を学ぶアプリケーションの提案対馬かなえ, 増子萌 (お茶の水女子大学) (C3) ポスター Automatic Parallelization via Matrix Multiplication Shigeyuki Sato, Hideya Iwasaki (The University of Electro-Communications) (C3) ポスター Haskell で記述した仮想マシンモニタの評価大山恵弘, 岩崎英哉 (電気通信大学) (C3) デモ Haskell による拡張性の高いプレゼンテーション・システム今村悠, 岩崎英哉 (電気通信大学) (C3) ポスタースクリプト言語向けスタックベース GC と Lua への実装小室直, 阿部公輝 (電気通信大学) (C3) ポスター・デモ並行処理記述のための DynAlloy の拡張岩塚卓弥, 結縁祥治 (名古屋大学) (C3) ポスター・デモ CONPASU: 記号処理に基づく並行プロセスの状態数削減ツール磯部祥尚 (産業技術総合研究所) (C3) ポスター・デモ OCaml への GADT の導入 Jacques Garrigue, Jacques Le Normand (名古屋大学) (C3) ポスター・デモ制約付き項書換え系における木準同型写像を用いた等価性証明ツール高桑一也, 西田直樹, 大場康司, 酒井正彦, 坂部俊樹, 草刈圭一朗 (名古屋大学) (C3) ポスター・デモ難解言語 Malbolge におけるプログラミング環境の構築と改良長坂哲, 安藤聡, 酒井正彦, 坂部俊樹, 草刈圭一朗, 西田直樹 (名古屋大学) (C3) ポスター・デモ難解言語 Malbolge における高級アセンブリ言語への加算命令の追加安藤聡, 長坂哲, 酒井正彦, 坂部俊樹, 草刈圭一朗, 西田直樹 (名古屋大学) (C3) ポスターモナド的意味論の比較問題について勝股審也 (京都大学) (C3) ポスター確率的オートマトンにおける決定的スケジューラのための非決定的確率的モナド佐藤哲也 (京都大学) (C3) ポスター分離論理を用いた，C 言語プログラムの機械的検証アフェルトレナルド*, 山田聖** (*産業技術総合研究所, **株式会社レピダム) (C3) ポスター Java 経験者を対象とした関数型プログラム学習支援環境の開発佐藤功二, 高田喜朗 (高知工科大学) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 3日目 (3月11日(金)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 9:00 - 10:15 (75分) セッション11 (C1) 暗に型付けられた関数型言語に対する変数名補完方式の提案後藤拓実, 篠埜功 (芝浦工業大学) (C1) Kide: 開発環境によるオブジェクト指向言語でのアスペクト指向開発の支援金澤圭, 堀江倫大, 千葉滋 (東京工業大学) (C2) EventCJ: A Context-Oriented Programming Language with Declarative Event-based Context Transition (出典: 10th Annual Aspect-Oriented Software Development Conference (AOSD 2011), to appear) Tetsuo Kamina*, Tomoyuki Aotani**, Hidehiko Masuhara* (*University of Tokyo, **Japan Advanced Institute of Science and Technology) 10:15 - 10:40 休憩 10:40 - 11:55 (75分) セッション12 (C1) 名前渡しプロセス計算における優先度ガード結縁祥治, 太田正悟 (名古屋大学) (C1) エフェクトを持つマルチステージ計算体系の型推論小鍛治雄一郎, 亀山幸義 (筑波大学) (C2) Polymorphic Contracts (出典: 20th European Symposium on Programming (ESOP 2011), to appear) Joao Filipe Belo*, Michael Greenberg*, Atsushi Igarashi**, Benjamin C. Pierce* (*University of Pennsylvania, **Kyoto University) 11:55 - 12:20 休憩 12:20 - 13:00 クロージング --------------------------------------------------------------------------

1 0

Registration open: 23rd European Summer School in Logic, Language and Information
by Esslli Ljubljana 23 Feb '11

23 Feb '11

Apologies if you receive multiple copies of this message. Please distribute it to colleagues and students. ****************************************************************************************** CALL FOR PARTICIPATION AT ESSLLI 2011 Meeting: 23rd European Summer School in Logic, Language and Information (ESSLLI) Date: 01-Aug-2011 - 12-Aug-2011 Location: Ljubljana, Slovenia Contact Email: esslli2011(a)gmail.com Meeting URL: http://esslli2011.ijs.si/ Early registration deadline: 31-05-2011 ****************************************************************************************** *Meeting Description* For the past 23 years, the European Summer School in Logic, Language and Information (ESSLLI) has been organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1.5 hours per day during a five days week, with up to seven parallel sessions. ESSLLI also includes a student session (papers and posters by students only, 1.5 hour per day during the two weeks) and four evening lectures by senior scientists in the covered areas. In 2011, ESSLLI will held in Ljubljana, Slovenia and will be organized by the Slovenian Language Technologies Society (SDJT), the Jožef Stefan Institute (IJS) and The Faculty of Mathematics and Physics (FMF) in Ljubljana, Slovenia. Chair of the Program Committee is Makoto Kanazawa (National Institute of Informatics, Japan), and Chair of the Organizing Committee is Darja Fišer (The University of Ljubljana, Slovenia). To contact the ESSLLI 2011 Organizing Committee, write to: esslli2011(a)gmail.com. *Summer School Programme* http://esslli2011.ijs.si/?page_id=897 *Online Registration Form* https://www.kompas-online.net/Pages/MeetingsConferences/Register/RegisterV2… *Programme Committee* Chair: Makoto Kanazawa (National Institute of Informatics, Tokyo) Local Co-chair: Andrej Bauer (University of Ljubljana) Area Specialists: Language and Computation: - Markus Egg (Humboldt-Universität zu Berlin) - Aline Villavicencio (Federal University of Rio Grande do Sul, Brazil) Language and Logic: - Hans-Christian Schmitz (Fraunhofer FIT, Sankt Augustin) - Louise McNally (UPF, Barcelona) Logic and Computation: - Ralph Matthes (IRIT, CNRS and University of Toulouse) - Eric Pacuit (Center for Logic and Philosophy of Science, Tilburg *Organizing Committee* Chair: Darja Fišer (University of Ljubljana) Committee Members: - Špela Vintar (University of Ljubljana) - Andrej Bauer (University of Ljubljana) - Monika Kropej (Jožef Stefan Institute) - Špela Sitar (Jožef Stefan Institute) - Boštjan Bajec (University of Ljubljana) - Senja Pollak (University of Ljubljana) - Mihael Arčan

1 0

CFP: Two Workshops on Continuations
by Yukiyoshi Kameyama 22 Feb '11

22 Feb '11

logic-ml および sonoteno 皆様、 (重複して受け取りの節は御容赦ください) Continuation (継続) に関する2つのワークショップが、5月末および9月下旬に開催されます。 1. RDP (RTA + TLCA) に併設 TPDC 2011: Theory and Practice of Delimited Continuations May 29, 2011, Novi Sad, Serbia http://www.pps.jussieu.fr/~saurin/tpdc2011/ 2. ICFP に併設 CW 2011: ACM SIGPLAN Continuation Workshop 2011 September 24, 2011, Tokyo, Japan http://logic.cs.tsukuba.ac.jp/cw2011/ どちらも、基礎理論(classical logic, type theory)から、プログラム言語の理論/実装、継続の様々な応用(web programming, linguistics etc.)までをカバーするワークショップです。「2」の方は、システムのデモンストレーションの発表も歓迎します。 RDP に行かれる方、あるいは、ICFP に行かれる方は、是非投稿をご検討ください。 CFP は添付ファイルにします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam Call for Papers TPDC 2011 1st International Workshop on Theory and Practice of Delimited Continuations http://www.pps.jussieu.fr/~saurin/tpdc2011/ 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop - Federated Conference on Rewriting, Deduction, and Programming SCOPE AND TOPIC: Since their introduction in the late 1980s, delimited control operators have triggered increasing interest among programmers and the programming language community, found unexpected applications in conceptual domains such as linguistics and constructive mathematics, and shown themselves to be the natural development of classical control operators. The first workshop on the Theory and Practice of Delimited Continuations aims to bring together people working with the many different (practical, theoretical, or foundational) aspects of delimited continuations, in the hope of fostering some unity and progress. Contributions on all topics related to delimited continuations are welcome, as either short abstracts or full papers (see SUBMISSION PROCEDURE below). INVITED SPEAKERS: To be announced IMPORTANT DATES: # Submission of full papers: 25 February 2011 # Submission of short abstracts: 18 March 2011 # Notification of acceptance: 25 March 2011 # Final version due: 8 April 2011 # Workshop: 29-30 May 2011 SUBMISSION PROCEDURE: We accept submissions of two kinds: * short abstracts (1 to 2 pages) * full papers up to 12 pages Short abstracts are proposals for talks within a wide rubric: reports on work-in-progress or recently published papers, surveys or short tutorials, system demonstrations, etc. Full papers must describe new work not under consideration for publication elsewhere. Accepted papers and abstracts will be presented at the workshop and included in the proceedings, published as a technical report. Papers and abstracts should be formatted using the easychair.cls LaTeX class (see http://easychair.org/coolnews.cgi), and may be submitted electronically as pdf files via the easychair website: https://www.easychair.org/login.cgi?conf=tpdc2011 PROGRAM COMMITTEE: Zena Ariola, University of Oregon, USA Dariusz Biernacki, University of Wroclaw, Poland Hugo Herbelin, INRIA, Paris, France Yukiyoshi Kameyama, University of Tsukuba, Japan Alexis Saurin, CNRS, Paris, France Hayo Thielecke, University of Birmingham, UK Noam Zeilberger, Université Paris Diderot, Paris, France WORKSHOP ORGANIZERS: Hugo Herbelin, INRIA, Paris, France Alexis Saurin, CNRS, Paris, France Noam Zeilberger, Université Paris Diderot, Paris, France For more information, please contact Alexis Saurin <saurin(a)pps.jussieu.fr> or Noam Zeilberger <noam(a)pps.jussieu.fr> CW 2011 ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Contributions Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc). Continuation Workshop 2011 will be informal. We aim at accessible presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. The workshop will have no published proceedings; submissions of short abstracts are preferred. We intend to organize a tutorial session on delimited continuations and their main applications, in the evening before the workshop, on Friday, September 23, 2011. Invited speakers ---------------- TBD Important dates --------------- Submission: June 25, 2011 Notification: August 8, 2011 Tutorials: September 23, 2011 Workshop: September 24, 2011 Format ------ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ----- We seek several types of presentations on topics related to continuations. We especially encourage presentations that describe work in progress, outline a future research agenda, or encourage lively discussion. Research presentations on: - implementations of continuations - semantics - type systems and logics - meta-theory and its mechanization - code generation with continuations or effects - distributed programming - systems programming and security - pearls Research presentations must be broadly accessible and should describe new ideas, experimental results, significant advances in the theory or application of continuations, or informed positions regarding new control operators. Application presentations, or status reports These broadly accessible presentations should describe interesting applications of continuations in research, industry or open source. We encourage presentations of applications from areas outside of programming language research -- such as linguistics, logics, AI, computer graphics, operating systems, etc. These presentations need not present original research, but should deliver information that is new or that is unfamiliar to the general ICFP audience. (A broadly accessible version of research presented elsewhere, with the most recent results and more discussion of future work may be acceptable as a CW 2011 status report.) The abstract submission should justify, to a general reader, why an application is interesting. Demos and work-in-progress reports Live demonstrations or presentations of preliminary results are intended to show new developments, interesting prototypes, or work in progress. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes, and a work-in-progress report should take about 5 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Presenters will have to bring all the software and hardware for their demonstration; the workshop organizers are only able to provide a projector.) Submission Guidelines and Instructions -------------------------------------- Unlike the previous Continuation Workshops, we do not require the submission of complete research papers. We will select presentations based on submitted abstracts, up to 2 (A4 or US letter) pages long in the PDF format (with the optional supplementary material, up to 8 PDF pages). Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Email submissions to cw2011-submit(a)logic.cs.tsukuba.ac.jp Organizers ---------- Yukiyoshi Kameyama, University of Tsukuba http://logic.cs.tsukuba.ac.jp/~kam/ Chung-chieh Shan, Rutgers University http://www.cs.rutgers.edu/~ccshan/ Oleg Kiselyov http://okmij.org/ftp/ Program Committee ----------------- Kenichi Asai, Ochanomizu University, Japan http://pllab.is.ocha.ac.jp/~asai/ Malgorzata Biernacka, University of Wroclaw, Poland http://www.ii.uni.wroc.pl/~mabi/ Hugo Herbelin, PPS - pi.r2, INRIA, France http://pauillac.inria.fr/~herbelin/index-eng.html Oleg Kiselyov http://okmij.org/ftp/ Julia Lawall, University of Copenhagen, Denmark http://www.diku.dk/~julia Tiark Rompf, EPFL, Switzerland Chung-chieh Shan, Rutgers University (Chair) http://www.cs.rutgers.edu/~ccshan/ Hayo Thielecke, University of Birmingham, UK http://www.cs.bham.ac.uk/~hxt Previous Workshops ------------------ ACM SIGPLAN Continuation Workshop (CW'04) http://www.cs.bham.ac.uk/~hxt/cw04/index.html ACM SIGPLAN Workshop on Continuations (CW'01) http://www.cs.indiana.edu/~sabry/cw01/ ACM SIGPLAN Workshop on Continuations (CW'97) http://www.brics.dk/~cw97/ Continuation Fest 2008 http://logic.cs.tsukuba.ac.jp/~kam/Continuation2008/

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml