皆様、(重複して受け取られた場合は、御容赦ください。)

国際会議FLOPS2016 -- Functional and Logic Programming -- では ポスター発表と参加申込みを募集しています。

ポスター発表は、FLOPS参加者からのコメントがもらえる貴重な機会かつ学生 の方にとっては英語で話をする(練習をする)貴重な機会です。

ポスター申込み締切： 1/11 (Mon) any time zone (日本時間 1/12 (Tue) 21:00) [この時点では、ポスターそのものを投稿する必要はなく、簡単な概要 で結構です] 参加申し込み締切: 2/8 (Mon) (日本時間) なお、on-site登録も可能です。

よろしくおねがいします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam

------------------------( C U T H E R E )--------------------------- FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/

Call for Participation and Posters/Demos

Registration will be open on Monday, Dec 21, 2015. Early registration deadline is Monday, Feb 8, 2016. Poster/Demo abstract submission deadline is Monday, Jan 11, 2016.

FLOPS aims to bring together practitioners, researchers and implementers of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming.

In addition to the presentations of regular research papers, the FLOPS program includes tutorials, as well as the poster/demo session for demonstrating the tools and systems described during the talks and for presenting works-in-progress and getting the feedback.

FLOPS has established a Best Paper award. The winner will be announced at the symposium.

CALLS FOR POSTERS AND DEMONSTRATIONS

If you wish to present a poster at FLOPS, please send the plain text abstract by e-mail to [email protected] -- by January 11, 2016. The abstract should include the title, the names of the authors and their affiliation, along with enough details to judge its scope and relevance. We will announce the accepted submissions on January 25, 2016. The format of the poster will be announced at that time. Important Dates * Submission due: January 11, 2016 (Monday), any time zone * Notification: January 25, 2016 (Monday)

INVITED TALKS

Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project

Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity

TUTORIALS

Andreas Abel, on Agda Atze Dijkstra, on Attribute Grammars Neng-Fa Zhou, on programming in Picat

ACCEPTED PAPERS

Ki Yung Ahn and Andrea Vezzosi. Executable Relational Specifications of Polymorphic Type Systems using Prolog

Markus Triska. The Boolean Constraint Solver of SWI-Prolog: System Description

Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond. Proof Relevant Corecursive Resolution

Jay McCarthy, Burke Fetscher, Max New, Daniel Feltey, and Robert Bruce Findler A Coq Library For Internal Verification of Running-Times

Akimasa Morihata. Incremental Computing with Abstract Data Structures

Wouter Swierstra and Joao Alpuim.

From proposition to program: embedding the refinement calculus in Coq

Andre Van Delft and Anatoliy Kmetyuk. Declarative Programming with Algebra

Ian Mackie and Shinya Sato. An interaction net encoding of Godel's System T

Arthur Blot, Pierre-Evariste Dagand and Julia Lawall.

From Sets to Bits in Coq

Jeremy Yallop, David Sheets and Anil Madhavapeddy. Declarative foreign function binding through generic programming

Praveen Narayanan, Jacques Carette, Wren Romano, Chung-Chieh Shan and Robert Zinkov. Probabilistic inference by program transformation in Hakaru: System description

Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala. Polymorphic Types in Erlang Function Specifications

Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen, John Gallagher and Manuel V. Hermenegildo. A Transformational Approach to Parametric Accumulated-cost Static Profiling

Taus Brock-Nannestad. Space-efficient Planar Acyclicity Constraints: A Declarative Pearl ------------------------( C U T H E R E )---------------------------