Logic-ml February 2016

12 participants
20 discussions

CCA 2016（計算理論と解析学）論文募集
by Akitoshi Kawamura 15 Mar '16

15 Mar '16

皆様東京大学の河村と申します。来年6月15～17日にポルトガルで開催される国際会議Computability and Complexity in Analysisの御案内です。どうぞ御検討下さい。 ______________________________________________________________ First Call for Papers Thirteenth International Conference on Computability and Complexity in Analysis (CCA 2016) http://cca-net.de/cca2016/ June 15-17, 2016, Faro, Portugal Submission deadline: March 14, 2016 ______________________________________________________________ Scientific Programme Committee * Matthew de Brecht (Osaka, Japan) * Fernando Ferreira (Lisbon, Portugal) * Sicun Gao (Cambridge, USA) * Mathieu Hoyrup (Nancy, France) * Akitoshi Kawamura, chair (Tokyo, Japan) * Bob Lubarsky (Boca Raton, USA) * Elvira Mayordomo (Zaragoza, Spain) * Robert Rettinger (Dortmund, Germany) * Ning Zhong (Cincinnati, USA) Organising Committee * Daniel Graça, chair (Faro, Portugal) * Rui Marreiros (Faro, Portugal) Topics * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Submissions Authors are invited to submit 1-2 pages abstracts in PDF format, including references via the following web page: https://easychair.org/conferences/?conf=cca2016 If full versions of papers are already available as technical report or arXiv version, then corresponding links should be added to the reference list. Final versions of abstracts might be distributed to participants in hardcopy and/or in electronic form. Dates * Submission deadline: March 14, 2016 * Notification of authors: April 16, 2016 * Final version: April 30, 2016 Conference Web Page http://cca-net.de/cca2016/ ______________________________________________________________ 東京大学総合文化研究科河村彰星

1 1

PhDs in Logic VIII, Darmstadt, Germany 9-11 May 2016
by Ishihara Hajime 01 Mar '16

01 Mar '16

皆様 PhDs in Logicの案内を転送いたします。北陸先端科学技術大学院大学石原　哉 --------------------------------------------------------------------------------------------------------------------------------- Call for submissions: PhDs in Logic VIII, Darmstadt, May 9-11, 2016 "PhDs in Logic" is an annual graduate conference organised by local graduate students. This conference has an interdisciplinary character, welcoming contributions to various topics in Mathematical Logic, Philosophical Logic, and Logic in Computer Science. It involves tutorials by established researchers as well as short presentations by PhD students on their research. We are happy to announce that the next edition of "PhDs in Logic" will take place in Darmstadt, Germany, during May 9-11 2016, hosted by the Logic research group of the Department of Mathematics, TU Darmstadt. Confirmed tutorial speakers are : Mirna Dzamonja (University of East Anglia, UK) Nina Gierasimczuk (University of Amsterdam, the Netherlands) Ulrich Kohlenbach (TU Darmstadt, Germany) Piotr Kowalski (University of Wroklaw, Poland) Martin Otto (TU Darmstadt, Germany) Registration and abstract submission for interested PhD students are now open. We welcome contributions from any general field of Logic. The deadline for abstract submission is February 7, 2016. For more information please see: http://www.mathematik.tu-darmstadt.de/fbereiche/logik/phdsinlogic2016/?site… Local organisers: Julian Bitterlich, Felix Canavoi, Angeliki Koutsoukou-Argyraki, Daniel Koernlein, Florian Steinberg Technische Universität DarmstadtDepartment of MathematicsLogic GroupSchloßgartenstr. 764289 DarmstadtGermany

2 1

国際会議TQC2016のご案内
by Yasuhiro Takahashi 01 Mar '16

01 Mar '16

皆様，（重複して受け取られた場合はご容赦ください） NTT の高橋と申します．国際会議TQC2016の案内を転送させていただきます．よろしくお願い致します． ======================================================================= TQC2016（量子計算、通信、暗号に関する国際会議）が、 9月27日-29日にベルリンで開催されます。今年から投稿規程が変更され、Conference track, Workshop trackの2トラック制となり、 Workshop trackでは出版済みの論文でも投稿できるようになります。ご興味のある方は、ぜひ投稿をご検討ください。よろしくお願いします。 ======================================================================= CALL FOR PAPERS The 11th Conference on the Theory of Quantum Computation, Communication, and Cryptography ---- TQC 2016 ---- Freie Universität Berlin Berlin, Germany 27-29 September 2016 http://tqc2016.physik.fu-berlin.de/ ======================================================================= This is the eleventh in a series of conferences that aims to bring together the leading researchers in the areas of quantum computation, quantum communication and quantum cryptography. TQC covers all theoretical aspects of quantum information and submissions on these topics are solicited. Areas of interest include, but are not restricted to: * quantum algorithms * models of quantum computation * quantum complexity theory * simulation of quantum systems * quantum cryptography * quantum communication * quantum estimation and measurement * intersection of quantum information and condensed-matter theory * quantum coding theory * fault-tolerant quantum computing * entanglement theory Important dates: * Paper/Talk/Early-Poster submission deadline: May 16, 2016 * Decision notification: July 5, 2016 * Final manuscript deadline: July 23, 2016 * Late-Poster submission deadline: August 17, 2016 * Conference: 27-29 September, 2016 Two tracks: Conference(talk + proceedings) and Workshop(talk only). As the goal of TQC is to bring together researchers on all aspects of quantum information, submissions are solicited for two tracks: * Conference(talk + proceedings): Submissions to this track must be original papers that have not previously appeared in published form. Accepted papers will be presented orally at the conference and will appear in the conference proceedings. The proceedings will be published by the OpenAccess LIPIcs (Leibniz International Proceedings in Informatics). * Workshop(talk only): We solicit submissions for talk-only papers; accepted submissions will be presented orally at the conference but will not appear in the proceedings. This track allows authors to publish their work elsewhere and accepts already published material. Programme committee: * Gorjan Alagic * Gilles Brassard * Anne Broadbent (chair) * André Chailloux * Giulio Chiribella * Frédéric Dupuis * Joseph Fitzsimons * Steve Flammia * Sevag Gharibian * Stacey Jeffery * Elham Kashefi * Iordanis Kerenidis * Xiongfeng Ma * Laura Mancinska * Carl Miller * Mio Murao * Marco Piani * Christopher Portmann * Robert Raussendorf * Christian Schaffner * Norbert Schuch * Peter Selinger * Jamie Sikora * Barbara Terhal * Mark Wilde Local organising committee (FU Berlin): * Jens Eisert - chair * Oliver Buerschaper - co-chair * Juan Bermejo-Vega * Dominik Hangleiter * Albert Werner * Carolin Wille * and the entire QMIO group at the FU Berlin Steering committee: * Wim van Dam (UCSB) * Aram Harrow (MIT) * Yasuhito Kawano (NTT, Tokyo) * Michele Mosca (IQC, Waterloo and Perimeter Institute) * Martin Roetteler (Microsoft Research) * Simone Severini (UCL) * Vlatko Vedral (Oxford and CQT, Singapore) For further information, please see http://tqc2016.physik.fu-berlin.de/

1 0

講演会 (Andreas Abel 氏，Andrea Vezzosi 氏)
by Atsushi Igarashi 26 Feb '16

26 Feb '16

皆様，京都大学の五十嵐です．以下の要領で Chalmers 大の Andreas Abel さん，Andrea Vezzosi さんの講演会を実施いたしますので，ふるってご参加ください．どうぞよろしくお願いいたします． -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/ ====================================================================== 日時: 3/2(水) 13:30～15:30 場所: 京都大学吉田キャンパス総合研究７号館１階セミナー室１(１２７号室) 講演その１(13:30～14:30) Speaker: Andrea Vezzosi (Chalmers) Title: Open Problems with Sized Types in Agda Abstract: Sized Types let us give recursive definitions by well-founded induction on an the abstract type "Size", and so ensuring totality through types. This talk will discuss two problems that arise when using Sized Types in a dependently typed language: - Totality tells us that closed programs will not go wrong, but when typechecking a dependently typed language we also reduce terms with free variables, and go under binders, to reach a normal form. The current restrictions on definitions to guarantee every term has a normal form hurt expressivity, we propose a closer interaction of sizes and reduction instead. - When reasoning about programs defined with sizes types one often wishes to show that the size used doesn't affect the result in a significant way. We show a parallel with parametric polymorphism that could lead to more powerful reasoning principles for sizes. 講演その２(14:30～15:30) Speaker: Andreas Abel Title: Interactive Programs and Objects, Functionally --- Via Coinduction with Copatterns and Sized Types in Agda Abstract: Copattern matching is an extension of pattern matching in functional languages. It allows us to define an infinite structure (e.g. a stream) by what we can observe of it (e.g., what is its head?, what is its tail?). This has an analogue in object-oriented programming languages where an object is defined on how it responds to messages or method invocation, resp. Following Setzer, objects can be implemented coinductively in type theory; they are entities that respond to a message with some result and a new version of themselves. Similarly, following Hancock and Setzer, interactive programs can be seen as infinite processes that issue a command and continue in accordance with the response their received, potentially for all eternity. In this talk, we give an introduction to coinduction in the type-theoretic language Agda. We show how copatterns and sized types enable us to elegantly encode objects and interactive programs in type theory. The talk might close with a short demo of a rudimentary graphical program written in Agda using a foreign-function interface to Haskell. This is joint work with Stephan Adelsberger and Anton Setzer. An accompanying draft is available at http://www.cse.chalmers.se/~abela/index.html#ooAgda

1 0

Fwd: ３月２日の TGSAセミナーの追加講演
by Hiroshi Fujita 26 Feb '16

26 Feb '16

皆さまこんにちは。愛媛の藤田です。先日ご連絡いたしました第19回松山TGSAセミナーの予定が更新されましたのでご連絡いたします。藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> -------- Forwarded Message -------- Subject: ３月２日の TGSAセミナーの追加講演 Date: Fri, 26 Feb 2016 04:59:36 +0000 From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> To: fujita.hiroshi.mh(a)ehime-u.ac.jp CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 皆様、３月２日（水）に行のわれる「Matsuyama Seminar on Topology, Geometry, Set Theory and theirApplications」（松山TGSAセミナー）の講演の追加がありましたのでご連絡差し上げます。 ***** 第19回のセミナー日時: 2016年3月2日（水） 15:15〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者 1: 渕野昌（神戸大学）時間： 15:15〜16:15 題目: Reflection numbers under large continuum Abstract: The reflection number $\kappa$ of the Rado Conjecture is defined as the smallest cardinal $\kappa$ such that any non special tree $T$ has a non special subtree $T'$ of cardinality $<\kappa$ (or $\infty$ if there is no such $\kappa$). We show the consistency of the statement that the continuum is fairly large (e.g. that it is a large cardinal like supercompact in an inner model with the same cardinals as in the universe) while the reflection number of the Rado Conjecture is less than or equal to the continuum. We also consider some other reflection numbers and the relationship between them. 講演者 2: Alejandro Dorantes-Aldama (Universidad Nacional Autonoma de Mexico, Visiting Foreign Researcher of Ehime University) （メキシコ国立自治大学・愛媛大学外国人客員研究員）時間： 16:30〜17:30 題目: Almost irresolvable spaces Abstract: A topological space X is almost resolvable if X is the union of a countable collection of subsets each of them with empty interior. We prove that under the Continuum Hypothesis, the existence of a measurable cardinal is equivalent to the existence of a Baire crowded ccc almost irresolvable T_1 space. We also prove that: (1) Every crowded ccc space with cardinality less than the first weakly inaccessible cardinal is almost resolvable. (2) If 2^{\omega} is less than the first weakly inaccessible cardinal, then every T_2 crowded ccc space is almost resolvable. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ <dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

CFP: PPDP 2016
by Kazutaka Matsuda 25 Feb '16

25 Feb '16

logic-mlの皆様，東北大学の松田です．複数受け取られた場合はご容赦ください． 9月5〜7日にイギリスのエジンバラで開催される，宣言的プログラミングに関する国際会議 PPDP 2016 の論文募集のご案内をお送りいたします．どうぞ論文の投稿をご検討いただけますと幸いです． ====================================================================== Call for papers 18th International Symposium on Principles and Practice of Declarative Programming PPDP 2016 Special Issue of Science of Computer Programming (SCP) -tentative- Edinburgh, UK, September 5-7, 2016 (co-located with LOPSTR and SAS) http://ppdp16.webs.upv.es/ ====================================================================== SUBMISSION DEADLINE: 9 MAY (abstracts) / 16 MAY (papers) ---------------------------------------------------------------------- INVITED SPEAKERS Elvira Albert, Complutense University of Madrid, Spain ---------------------------------------------------------------------- PPDP 2016 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modeling in a declarative language and modeling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 26th Int'l Symp. on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) and the 23rd Static Analysis Symposium (SAS 2016). The conference will be held in Edinburgh, UK. Previous symposia were held at Siena (Italy), Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). You might have a look at the contents of past PPDP symposia, http://sites.google.com/site/ppdpconf/ Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2017 (tentative). Important Dates Abstract submission: 9 May, 2016 Paper submission: 16 May, 2016 Notification: 20 June, 2016 Final version of papers: 17 July, 2016 Symposium: 5-7 September, 2016 Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted to the submission website for PPDP 2016. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist the program committee in selecting appropriate reviewers for the paper. Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Program Committee Sandra Alves, University of Porto, Portugal Zena M. Ariola, University of Oregon, USA Kenichi Asai, Ochanomizu University, Japan Dariusz Biernacki, University of Wroclaw, Poland Rafael Caballero, Complutense University of Madrid, Spain Iliano Cervesato, Carnegie Mellon University Marina De Vos, University of Bath, UK Agostino Dovier, Universita degli Studi di Udine, Italy Maribel Fernandez, King's College London, UK John Gallagher, Roskilde University, Denmark, and IMDEA Software Institute, Spain Michael Hanus, CAU Kiel, Germany Martin Hofmann, LMU Munchen, Germany Gerda Janssens, KU Leuven, Belgium Kazutaka Matsuda, Tohoku University, Japan Fred Mesnard, Universite de la Reunion, France Emilia Oikarinen, Finnish Institute of Occupational Health, Finland Alberto Pettorossi, Universita di Roma Tor Vergata, Italy Tom Schrijvers, KU Leuven, Belgium Josep Silva, Universitat Politecnica de Valencia, Spain Perdita Stevens, University of Edinburgh, UK Peter Thiemann, Universitat Freiburg, Germany Frank D. Valencia, CNRS-LIX Ecole Polytechnique de Paris, France, and Pontificia Universidad Javeriana de Cali, Colombia German Vidal, Universitat Politecnica de Valencia, Spain (Program Chair) Stephanie Weirich, University of Pennsylvania, USA Program Chair German Vidal Universitat Politecnica de Valencia Camino de Vera, S/N E-46022 Valencia, Spain Email: gvidal(a)dsic.upv.es Symposium Chair James Cheney Informatics Forum 5.29 Laboratory for Foundations of Computer Science School of Informatics 10 Crichton Street, Edinburgh EH8 9AB, Scotland, UK Email: jcheney(a)inf.ed.ac.uk ----------------------------------------------------------------------

1 0

CFP: ITRS 2016
by koba 23 Feb '16

23 Feb '16

皆様、 6月にポルトガルで開催されるintersection typesに関するワークショップITRS 2016の論文募集案内をお送りします。 RTAとTLCAが合併してできたFSCD 2016の併設ワークショップです。皆様からの論文投稿をお待ちしております小林直樹東京大学大学院情報理工学系研究科コンピュータ科学専攻〒113-0033 東京都文京区本郷7-3-1 Phone: 03-5841-4124 Fax: 03-5841-4124 email: koba(a)is.s.u-tokyo.ac.jp INTERSECTION TYPES AND RELATED SYSTEMS (ITRS 2016) http://www-kb.is.s.u-tokyo.ac.jp/ITRS2016/ Call for Papers =============== ITRS 2016 (the Eighth Workshop on Intersection Types and Related Systems) will be held on 25 June, 2016, in Porto, in affiliation with FSCD 2016 (1st International Conference on Formal Structures for Computation and Deduction, http://fscd2016.dcc.fc.up.pt/). ITRS 2016 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications to programming languages and program verification. - Applications to other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types to characterize computational properties. IMPORTANT DATES Abstract submission: 28 March, 2016 Paper submission: 31 March, 2016 Author notification: 28 April, 2016 Final version: 29 May, 2016 Workshop: 26 June, 2016 SUBMISSION AND PUBLICATION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format through EasyChair (https://easychair.org/conferences/?conf=itrs2016). Accepted papers will be presented at the workshop and included in preliminary proceedings. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be refereed for inclusion in post-proceedings (which we plan to publish in EPTCS). PROGRAM COMMITTEE Steffen van Bakel (Imperial College, UK) Giuseppe Castagna (CNRS, Paris Diderot University, France) Joshua Dunfield (University of British Columbia, Canada) Naoki Kobayashi (University of Tokyo, Japan), chair Jakob Rehof (University of Dortmund, Germany) Simona Ronchi Della Rocca (University of Tulin, Italy) Sylvain Salvati (INRIA Bordeaux, France) Pawel Urzyczyn (University of Warsaw, Poland) INFORMATION For further information, please contact Naoki Kobayashi Email: koba AT is DOT s DOT u-tokyo DOT ac DOT jp

1 0

TYPES 2016 extended deadline
by Fujita Kenetsu 23 Feb '16

23 Feb '16

(* Apologies for any cross-postings. *) [New deadline 29 February 2016, submission deadline extended by a week. Consider contributing.] ================================================================== CALL FOR CONTRIBUTIONS 22nd International Conference on Types for Proofs and Programs, TYPES 2016 23-26 May 2016 Novi Sad, Serbia http://www.types2016.uns.ac.rs <http://www.types2016.uns.ac.rs/> BACKGROUND The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Homotopy type theory; * Applications of type theory; * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. INVITED SPEAKERS (NEW) Simon Gay (University of Glasgow) Dale Miller (INRIA Saclay & LIX École Polytechnique) Simona Ronchi della Rocca (Università di Torino) CONTRIBUTED TALKS We solicit contributed talks based on extended abstracts/short papers of 2 pages prepared in LaTeX and formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2016. Important Dates: * submission of abstracts: 29 February 2016 (extended) * notification of acceptance: 21 March 2016 * camera-ready version of abstracts: 11 April 2016 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS Similarly to earlier TYPES conferences, we intend to publish a post-proceedings volume in the Leibniz International Proceedings in Informatics (LIPiCS) series. Submission to that volume would be open for everyone. Tentative submission deadline: October 2016. VENUE The conference will be held at the University of Novi Sad, University Central Building. SATELLITE EVENT: The 9th Workshop Computational Logic and Applications - CLA 2016 will be held on May 27-28, 2016. PROGRAMME COMMITTEE Thorsten Altenkirch (University of Nottingham) Zena Ariola (University of Oregon) Andrej Bauer (University of Ljubljana) Marc Bezem (University of Bergen) Malgorzata Biernacka (University of Wroclaw) Edwin Brady (University of St Andrews) Thierry Coquand (University of Gothenburg) Jose Espirito Santo (University of Minho) Ken-etsu Fujita (Gunma University) Silvia Ghilezan (University of Novi Sad) (co-chair) Hugo Herbelin (INRIA Paris-Rocquencourt) Jelena Ivetic (University of Novi Sad) (co-chair) Marina Lenisa (University of Udine) Elaine Pimentel (Federal University of Rio Grande do Norte) Andrew Polonsky (University Paris Diderot) Jakob Rehof (Technical University of Dortmund) Claudio Sacerdoti Coen (University of Bologna) Carsten Schürmann (IT University of Copenhagen) Dieter Spreen (University of Siegen) Wouter Swierstra (Utrecht University) Nicolas Tabareau (INRIA) Tarmo Uustalu (Tallinn University of Technology) TYPES STEERING COMMITTEE Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph Matthes, Bengt Nordström, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu. ABOUT TYPES The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993), Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015). ORGANIZERS University of Novi Sad Faculty of Technical Sciences Mathematical Institute SASA CONTACT: types2016(a)uns.ac.rs <mailto:[email protected]> =================================================

1 0

JAIST国際シンポジウム「知能ロボティクス」開催のご案内
by Satoshi Tojo 22 Feb '16

22 Feb '16

重複して受け取られた方はご容赦ください．北陸先端科学技術大学院大学知能ロボティクス領域は，人工知能・ソフトウェア科学・数理論理学・ロボット工学の融合・連携をめざし新時代の情報科学のパラダイムを議論する場として，下記のように国際シンポジウムを開催します．どうぞみなさま奮ってご参加ください．場所: しいのき迎賓館，石川県金沢市広坂2丁目1番1号　TEL ： 076-261-1111 http://www.shiinoki-geihinkan.jp/about/shop.html 日時: 2016年3月24, 25日プログラム: http://www.jaist.ac.jp/logic/meeting-workshop/138 北陸先端科学技術大学院大学情報科学研究科東条敏

1 1

PPL2016最終参加募集：第18回プログラミングおよびプログラミング言語ワークショップ
by Hiroshi UNNO 22 Feb '16

22 Feb '16

皆様、（重複して受け取られた場合は御容赦ください。）筑波大学の海野です。 3月7日(月)〜9日(水)に、岡山県で開催されます、第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) の参加登録の締切が、本日2月22日(月)とせまっておりますので、ご案内を再度お届けいたします。たくさんのご参加をお待ち申し上げております。 -- PPL2016では，招待講演として， * 奥田遼介 (Preferred Networks) 「ディープラーニングフレームワークとChainerの実装」 * Julia Lawall (Inria) 「Finding the right level of abstraction: Program analysis and the Linux kernel」の2件を予定しております．カテゴリ1，2，4の採択論文・発表のリストも http://logic.cs.tsukuba.ac.jp/ppl2016/accepted.html ご参考ください。参加登録の案内ページは http://logic.cs.tsukuba.ac.jp/ppl2016/registration/ です。参加登録の締切は2月22日（月）です。どうぞお早めのご登録をお願いいたします。 -------------------------------------------------------------------------- 第18回プログラミングおよびプログラミング言語ワークショップ（PPL2016） http://logic.cs.tsukuba.ac.jp/ppl2016/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)～3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」 PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． http://logic.cs.tsukuba.ac.jp/ppl2016/registration/ 参加登録締切：2月22日(月) 問い合わせ先：ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也千葉工業大学岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] --------------------------------------------------------------------------

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml February 2016