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 <[hidden email]> -- 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.
* Submission due: January 11, 2016 (Monday), any time zone
* Notification: January 25, 2016 (Monday)
Kazunori UEDA (Waseda University)
The exciting time and hard-won lessons of the Fifth Generation
Atze Dijkstra (Utrecht University)
UHC: Coping with Compiler Complexity
Andreas Abel, on Agda
Atze Dijkstra, on Attribute Grammars
Neng-Fa Zhou, on programming in Picat
Ki Yung Ahn and Andrea Vezzosi.
Executable Relational Specifications of Polymorphic Type Systems using Prolog
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 and Robert Bruce Findler.
A Coq Library For Internal Verification of Running-Times
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