Logic-ml January 2016

13 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

Tenth NII Type Theory Workshop
by Makoto Tatsuta 30 Jan '16

30 Jan '16

Tenth NII Type Theory Workshop Date: February 3, 2016, 13:30--17:00 Place: National Institute of Informatics, Room 2006 (20th floor) 場所: 国立情報学研究所 20階 2006室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Program: 13:30--14:10 Mahmudul faisal Al Ameen (National Institute of Informatics) Title: Completeness for Recursive Procedures in Separation Logic 14:10--14:50 Daisuke Kimura (National Institute of Informatics) Title: An Implementation of Cyclic Proof-Search in Separation Logic with Inductive Definitions 14:50--15:00 Break 15:00--15:50 Makoto Tatsuta (National Institute of Informatics) Title: Completeness of Cyclic Proofs for Symbolic Heaps 15:50--16:00 Break 16:00--17:00 Stefano Berardi (Torino University) Title: Game Semantics and the Complexity of Interaction Abstracts: ---------------------------------------------------------------------- Mahmudul faisal Al Ameen (National Institute of Informatics) Title: Completeness for Recursive Procedures in Separation Logic Abstract: This talk proves the completeness of an extension of Hoare's logic and separation logic for pointer programs with mutual recursive procedures. A new system will be discussed by introducing two new inference rules, and removes an axiom that is unsound in separation logic and other redundant inference rules for showing completeness. It introduces a novel expression that is used to describe complete information of a given state in a precondition. It also uses the necessary and sufficient precondition of a program for the abort-free execution, which enables us to utilize strongest postconditions. Admissibility of the frame rules in the system will also be discussed. ---------------------------------------------------------------------- Daisuke Kimura (National Institute of Informatics) Title: An Implementation of Cyclic Proof-Search in Separation Logic with Inductive Definitions Abstract: The entailment problem in separation logic is important for program verification. This talk presents a proof system for a fragment of separation logic with inductive definitions, whose proofs have cyclic graph structures. The system is sound for validity of entailments, and provides a decision procedure of entailment problem based on proof-search of its cyclic proofs. We implement this decision procedure, and report the results evaluating our decision procedure with benchmark files of SLCOMP14. ---------------------------------------------------------------------- Makoto Tatsuta (National Institute of Informatics) Title: Completeness of Cyclic Proofs for Symbolic Heaps Abstract: Separation logic is successful for software verification in both theory and practice. Decision procedure for symbolic heaps is one of key issues. This talk proposes a cyclic proof system for symbolic heaps with general form of inductive definitions, and discusses its soundness, completeness, and decidability. The decision procedure of entailments of symbolic heaps with inductive definitions is also discussed. Decidability of entailments of symbolic heaps with inductive definitions is an important question. Completeness of cyclic proof systems is also an important question. The results of this talk tries to answer both questions. The system is based on cyclic proof systems by Brotherston et al, and the bounded-treewidth inductive definitions by Iosif et al. In order for obtaining the completeness, some restrictions are added to inductive definitions, an entailment is extended to a multiple entailment which allows disjunction in the succeedent, and it introduces new predicates for describing whether a given address is in the heap or not. The inductive definitions under the restrictions are quite general, since they covers doubly-linked lists, nested lists, and skip lists. The main techniques are grouping for showing the local completeness of the rule of splitting separating conjunction, and normal form of multiple entailments, which has some upper bounds for both the number of disjuncts and the length of spatial parts. ---------------------------------------------------------------------- Stefano Berardi (Torino University) Title: Game Semantics and the Complexity of Interaction (about a result of Federico Aschieri) Abstract: We present a new abstract complexity result obtained by F. Aschieri about Coquand and Hyland-Ong game semantics, that will lead to new bounds on the length of first-order cut-elimination, normalization, interaction between expansion trees and any other dialogical process game semantics can model and apply to. In particular, Aschieri provides a novel method to bound the length of interactions between visible strategies and to measure precisely the tower of exponentials defining the worst-case complexity. This study improves the old estimates by possibly several exponentials and is based on Berardi-de'Liguoro notion of level of backtracking. ---------------------------------------------------------------------- 問合せ先　龍田 (tatsuta(a)nii.ac.jp)

1 0

Deadline Extension: FSCD'16
by hassei＠kurims.kyoto-u.ac.jp 29 Jan '16

29 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の投稿締切が延長されましたので、ご案内させていただきます。 FSCD (Formal Structures for Computation and Deduction)は、 RTA (Rewriting Techniques and Applications)と TLCA (Typed Lambda Calculi and Applications)を融合・発展させた新しい会議です。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 -- CALL FOR PAPERS - DEADLINE EXTENSION First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ *** ABSTRACT SUBMISSION DEADLINE EXTENDED TO: 8 FEBRUARY 2016 *** *** PAPER SUBMISSION DEADLINE EXTENDED TO: 12 FEBRUARY 2016 *** ========================================================================== IMPORTANT DATES Abstract Submission: 8 February 2016 Paper Submission : 12 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 2. Methods in Computation and Deduction * Type systems (polymorphism, dependent, recursive, intersection, session, etc.) * Induction, coinduction * Matching, unification, completion, orderings * Strategies (normalization, completeness, etc.) * Tree automata * Model building and model checking * Proof search (resolution, paramodulation, narrowing, focusing, etc.) * Constraint solving and decision procedures 3. Semantics * Operational semantics and abstract machines * Game Semantics and applications * Domain theory and categorical models * Quantitative models (timing, probabilities, resources, etc.) * Quantum computation and emerging models in computation 4. Algorithmic Analysis and Transformations of Formal Systems * Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications * Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 CONFERENCE AWARDS Two awards will be selected: one for the best paper and another one for the best student paper. SPECIAL ISSUE After the conference, authors of selected papers will be invited to submit extended versions of their work to a special issue published in the open-access journal Logical Methods in Computer Science (LMCS). SATELLITE EVENTS The following meetings and workshops are colocated with FSCD 2016: CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP, LSFA, UNIF, WPTE, WWV. ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

Linearity 2016 - CFP
by hassei＠kurims.kyoto-u.ac.jp 27 Jan '16

27 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の併設ワークショップ Linearity 2016 のcall for papersです。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 ======================================================================= Call for Papers Fourth International Workshop on Linearity LINEARITY'16 Porto, Portugal, 25 June 2016 Affiliated with FSCD'16 http://www.cs.cmu.edu/~linearity16 ======================================================================= SUBMISSION DEADLINE: 8 APRIL 2016 Ever since the birth of Girard's linear logic, there has been a stream of research in Computer Science where linearity is a key issue, covering both theoretical topics and applications, such as work on proof technology, complexity classes and more recently quantum computation, program analysis, expressive operational semantics, linear programming languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include, but are not limited to: - sub-linear logics - linear term calculi - linear type systems - linear proof-theory - linear programming languages - applications to concurrency - interaction-based systems - verification of linear systems - quantum models of computation - biological and chemical models of computation Important Dates Abstract submission deadline: Friday 8 April 2016 Submission deadline: Friday 15 April 2016 Notification to authors: Friday 13 May 2016 Final versions due: Friday 27 May 2016 Workshop date: Saturday 25 June 2016 Submission Authors are invited to submit an extended abstract (8 pages max) describing original ideas and recent results not published nor submitted elsewhere, or a 5-page abstract presenting relevant work that has been or will be published elsewhere, or work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=linearity2016 Publication After the workshop, authors of the extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in an electronic journal such as EPTCS. These submissions will undergo a second round of refereeing. Furthermore, we envision publication of a special issue of a journal after the event. Programme Committee - Emmanuel Beffara (Universite d'Aix-Marseille) - Luis Caires (Universidade Nova de Lisboa) - Iliano Cervesato (Carnegie Mellon University, co-chair) - Maribel Fernandez (King's College London, co-chair) - Marco Gaboardi (University at Buffalo, SUNY) - Masahito Hasegawa (Kyoto University) - Damiano Mazza (CNRS - Universite Paris 13) - Vivek Nigam (Universidade Federal da Paraiba) - Giselle Reis (Inria) - Claudio Sacerdoti Coen (University of Bologna) - Andre Scedrov (University of Pennsylvania) Contact Iliano Cervesato: iliano(a)cmu.edu Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk =======================================================================

1 0

『第３回山陰基礎論・解析学研究集会』の御案内
by Horihata Yoshihiro 26 Jan '16

26 Jan '16

Logic-ml 各位米子高専の堀畑です．今週末，３０日（土）と３１日（日）に米子・皆生温泉で件名の研究会を開催いたします！参加自由ですので，お気軽に御参加頂ければ幸いです！招待講演者として，神戸大の薄葉季路先生をお招きいたします．詳細はホームページをご参照ください： https://sites.google.com/site/yonagonctmath/slas2016 発表１１件，参加者は下記です（敬称略）．阿部吉弘　　（神奈川大学）井上誠（愛媛大学）薄葉季路　　（神戸大学）嘉田勝　　　（大阪府立大学）蔵岡誉司　　（米子高専）倉橋太志　　（木更津高専）古清水大直（米子高専）小浪吉史　　（島根大学）小林玉青　　（米子高専）静間荘司　　（大阪府立大学）松露真末次美昭　　（信州大学）瀬戸道生　　（防衛大学）高木啓行　　（信州大学）竹内耕太　　（筑波大学）根元多佳子（JAIST）樋口幸治郎（千葉大学）堀畑佳宏　　（米子高専）南裕明（神戸大学）山辺雅司　　（信州大学）吉居啓輔　　（沖縄高専）米子高専・数学同好会学生２人以上です．よろしくお願いします．堀畑佳宏 -- 米子工業高等専門学校教養教育科・数学〒683-8502 鳥取県米子市彦名町4448 Tel: 0859-24-5075 E-mail: horihata(a)yonago-k.ac.jp

1 0

市民講演会poster
by logic＠math.tsukuba.ac.jp 23 Jan '16

23 Jan '16

筑波大学数学のにしむらです。今年３月は数学会年会は本学で開催されますが、それに付随して開かれる市民講演会のposterが決定していますので、ご案内しておきます。にしむら

1 0

FSCD'16 Final Call for Papers
by hassei＠kurims.kyoto-u.ac.jp 22 Jan '16

22 Jan '16

皆様、来年６月に開催される国際会議FSCD 2016の(final) call for papers です。 FSCD (Formal Structures for Computation and Deduction)は、 RTA (Rewriting Techniques and Applications)と TLCA (Typed Lambda Calculi and Applications)を融合・発展させた新しい会議です。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 -- FINAL CALL FOR PAPERS First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ *** ABSTRACT SUBMISSION DUE 29 JANUARY 2016 *** **** PAPER SUBMISSION DUE 5 FEBRUARY 2016 **** ========================================================================== IMPORTANT DATES Abstract Submission: 29 January 2016 Paper Submission : 5 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 2. Methods in Computation and Deduction * Type systems (polymorphism, dependent, recursive, intersection, session, etc.) * Induction, coinduction * Matching, unification, completion, orderings * Strategies (normalization, completeness, etc.) * Tree automata * Model building and model checking * Proof search (resolution, paramodulation, narrowing, focusing, etc.) * Constraint solving and decision procedures 3. Semantics * Operational semantics and abstract machines * Game Semantics and applications * Domain theory and categorical models * Quantitative models (timing, probabilities, resources, etc.) * Quantum computation and emerging models in computation 4. Algorithmic Analysis and Transformations of Formal Systems * Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications * Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 CONFERENCE AWARDS Two awards will be selected: one for the best paper and another one for the best student paper. SPECIAL ISSUE After the conference, authors of selected papers will be invited to submit extended versions of their work to a special issue published in the open-access journal Logical Methods in Computer Science (LMCS). SATELLITE EVENTS The following meetings and workshops are colocated with FSCD 2016: CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP, LSFA, UNIF, WPTE, WWV. ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

[CSC Journals] CFP INTERNATIONAL JOURNAL OF COMPUTATIONAL LINGUISTICS (IJCL)
by J. Steward 19 Jan '16

19 Jan '16

CALL FOR PAPERS International Journal of Computational Linguistics (IJCL) ISSN - 2180-1266 http://www.cscjournals.org/journals/IJCL/description.php Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. Today, computational language acquisition stands as one of the most fundamental, beguiling, and surprisingly open questions for computer science. International Journal of Computational Linguistics (IJCL) is a peer review open access bi-monthly journal providing a scientific forum where computer scientists, experts in artificial intelligence, mathematicians, logicians, cognitive scientists, cognitive psychologists, psycholinguists, anthropologists and neuroscientists can present research and experimental studies. The journal publishes papers that describe state-of-the-art techniques, scientific research studies and results in computational linguistics in general but computational models, corpus linguistics, computational theories, information retrieval and extraction, linguistics modeling techniques, linguistics theories, machine translation, natural language processing, quantitative linguistics, speech analysis and speech recognition in particular. IJCL invite linguistic specialists, researchers and scientists from different domains to share their understanding and contributions towards linguistics that set scientific objectives and demonstrate the operation of new methods in the field of computational linguistics. EDITORIAL BOARD MEMBERS Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan) Dr. Pascaline Merten - HEB-ISTI (Belgium) Dr. Pawel Dybala - Otaru University of Commerce (Japan) Dr. John Hanhong LI - (China) Dr. Stephen Doherty - Dublin City University (Ireland) LIST OF TOPICS Comparative Surveys that Critique Previously Repor Computational Linguistics Computational Models Computational Theories Corpus Linguistics Formal Linguistics-Theoretic and Grammar Induction Information Retrieval and Extraction Language Generation Language Learning Linguistics Modeling Techniques Linguistics Theories Machine Translation Models of Language Change and its Effect on Lingui Models that Address the Acquisition of Word-order Models that Combine Linguistics Parsing Models that Employ Statistical/probabilistic Gramm Models that Employ Techniques from machine learnin Natural Language Processing Quantitative Linguistics Speech Analysis/Synthesis Speech Recognition/Understanding Spoken Dialog Systems Web Information Extraction/Mining IMPORTANT DATES Paper Submission - January 31, 2016 Author Notification - February 28, 2016 Issue Publication - March 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJCL Manuscript Preparation Guidelines. For further information, please refer to the following information. IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJCL/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Computational Linguistics (IJCL) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJCL is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJCL particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJCL welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJCL-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJCL/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Computational Linguistics (IJCL) Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

CFP: PPL 2016 カテゴリ2-4
by Takahito Aoto 18 Jan '16

18 Jan '16

PPL 2016のカテゴリ2,4の申込締切が来週の月曜に迫ってまいりましたので，再度アナウンスさせて頂きます．　カテゴリ2 (国外既発表論文) 発表申込締切: 2016年1月25日(月) 17:00 (JST) 　カテゴリ4 (サーベイ・チュートリアル発表) 発表申込締切: 2016年1月25日(月) 17:00 (JST) 申し込みはEasyChairからです．ぜひ申し込みをご検討頂ければ幸いです．--- 青戸(新潟大学) ====================================================================== 第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) http://logic.cs.tsukuba.ac.jp/ppl2016/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)〜3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」http://www.marine-hotel.co.jp/ PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布はウェブを用いる場合を含め，参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2016プログラム委員会により優れていると認められたものは，PPL2016終了後(2016年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2016推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3 (ポスター・デモ発表) ----------------------------- 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) -------------------------------------- 研究動向の紹介(発表者の研究も含む)や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2016ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．なお，PPL2015と同様，PPL2016の終了は夕刻(14:00〜16:00頃)を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://www.easychair.org/conferences/?conf=ppl2016 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2015年12月28日(月) 17:00 (JST) [締切済] 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2016年1月12日(火) 17:00 (JST) [締切済] 10ページ程度(最大15ページ)の論文(日本語もしくは英語，PDF形式． PPL2016ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．採否通知: 2016年2月2日(火) 最終原稿締切: 2016年2月15日(月) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします．ページ数制限は投稿版と同じ予定です． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります (他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2016年1月25日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知: 2016年2月5日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨を説明してください．発表申込締切: 2016年2月8日(月) 17:00 (JST) 希望する発表形態(ポスター・デモの別)を明記して，著者名，所属，発表タイトル，発表概要(200〜300字程度)，キーワード(3つ以上) を提出してください．採否通知: 2016年2月15日(月) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2016年1月25日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要 (3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知: 2016年2月5日(金) ====================================================================== ワークショップ全般に関する問い合わせ先： 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 January 2016