Call for Participation
Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012)
May 23-25, 2012 Kobe, Japan
[http://www.org.kobe-u.ac.jp/flops2012/]
Early Registration Payment Due: April 25 (Wed)
FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), Ise (2008), and Sendai (2010).
Topics
FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to):
- Declarative Pearls: new and excellent declarative programs with illustrative applications.
- Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing.
- Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems.
- Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism.
- Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking.
The proceedings will be published as LNCS 7294.
Venue
Conference venue (Takikawa Memorial Hall) is located in the Rokkodai Campus of Kobe University.
Takikawa Memorial Hall, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 Japan.
Free shuttle bus will be available for symposium attendees between the FLOPS 2012 main hotel located in Sannomiya area and the conference venue.
Registration
The registration should be made from the FLOPS 2012 web site.
Category Early Regular On-site
Standard 30,000 JPY 40,000 JPY 50,000 JPY
Student 20,000 JPY 30,000 JPY 40,000 JPY
- JPY stands for Japanese Yen (100 JPY is roughly equal to 1.23 USD and 0.93 EUR on March 6th).
- Early Registration Payment Due: April 25 (Wed), 2012 24:00 JST (GMT+9). Payment of the registration should be completed before the due date.
- Regular Registration Payment Due: May 9 (Wed), 2012 24:00 JST (GMT+9). Payment of the registration should be completed before the due date.
- On-site registration: After May 9, please make a payment of the registration fee at the reception of the conference. We accept cash only.
- NO REFUND will be made for cancellation after May 10, 2012 00:00 JST (GMT+9).
- The followings are included in the registration fee.
- One copy of the FLOPS 2012 proceedings
- Excursion fee for one person
- Banquette fee for one person
Accommodation
Several hotels in Sannomiya area will be offered at the FLOPS 2012 registration site.
The price ranges between 7,500 JPY to 11,025 JPY per night for single room.
Transportation
Kansai International Airport (KIX) is the most convenient airport getting to Kobe from abroad.
There is a limousine bus from KIX to Kobe Sannomiya departing every 20 minutes.
It takes about 75 minutes and costs 3,000 JPY for a round trip.
Schedule
The following is a tentative schedule of the symposium.
Date Time Program
————–+————–+————————-
May 23 (Wed) 09:00–10:00 Registration
10:00–11:30 Technical sessions
11:30–13:00 Lunch
13:00–17:30 Technical sessions
————–+————–+————————-
May 24 (Thu) 09:00–11:30 Technical sessions
11:30–13:00 Lunch
13:00–14:00 Technical sessions
14:00–20:30 Excursion and Banquette
————–+————–+————————-
May 25 (Fri) 09:00–11:30 Technical sessions
11:30–13:00 Lunch
13:00–17:00 Technical sessions
The 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) and satellite workshops including WFLP 2012
will be held in the week after FLOPS at Nagoya, Japan.
Invited Speakers
– Tachio Terauchi (Graduate School of Information Science, Nagoya University).
Automated Verification of Higher-order Functional Programs
– Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev).
Programming with Boolean Satisfaction
– Stephanie Weirich (School of Engineering and Applied Science, University of Pennsylvania).
Dependently-typed programming in GHC
Accepted Papers
– Akimasa Morihata.
Calculational Developements of New Parallel Algorithms for Size-constrained Maximum-Sum Segment Problems
– Rafael Caballero, Yolanda GarcÃa-Ruiz and Fernando Saenz-Perez.
Declarative Debugging of Wrong and Missing Answers for SQL Views
– Gerlof Bouma.
Real-time Persistent Queues and Deques with Logic Variables
– Kristoffer Rose, Lionel Villard and Naoto Sato.
A Data Flow Calculus for Hybrid Query and Programming Languages
– Makoto Hamana.
Constructing Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell
– Sergio Antoy and Arthur Peters.
Compiling a Functional Logic Language
– Yoshihiro Tobita, Takeshi Tsukada and Naoki Kobayashi.
Exact Flow Analysis by Higher-Order Model Checking
– Yoichi Hirai.
A Lambda Calculus for Goedel-Dummett Logic Capturing Waitfreedom
– Dariusz Biernacki and Sergueï Lenglet.
Normal Form Bisimulations for Delimited-Control Operators
– Sonia Estévez-Martín, Jesus Correas Fernandez and Fernando Saenz-Perez.
Extending the TOY System with the ECLIPSE Solver over Sets of Integers
– Pablo Chico De Guzmán, Manuel Carro, Manuel Hermenegildo and Peter Stuckey.
A General Implementation Framework for TCLP
– Asami Tanaka and Yukiyoshi Kameyama.
A Call-by-Name CPS Hierarchy
– Jael Kriener and Andy King.
Mutual Exclusion by Interpolation
– Beniamino Accattoli and Luca Paolini.
Call-by-value solvability, revisited
– Neda Saeedloei and Gopal Gupta.
Coinductive Constraint Logic Programming
– Zena Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata and Alexis Saurin.
Classical call-by-need sequent calculi: The unity of semantic artifacts
– Tarmo Uustalu.
Explicit binds: effortless efficiency with and without trees
– Neil Toronto and Jay McCarthy.
Computing in Cantor’s Paradise With Lambda-ZFC
– Oleg Lobachev.
Parallel Computation Skeletons with Premature Termination Property
– Markus Triska.
The Finite Domain Constraint Solver of SWI-Prolog
– Ignacio Castiñeiras and Fernando Sáenz-Pérez
Improving the Performance of FD Constraint Solving in a CFLP System
– Oleg Kiselyov.
Iteratees: System Description
PC co-Chairs
– Tom Schrijvers (Ghent University, Belgium)
– Peter Thiemann (University of Freiburg, Germany)
PC Members
– Salvador Abreu (University of Evora, Portugal)
– Thorsten Altenkirch (University of Nottingham, UK)
– Sebastian Brand (NICTA, Australia)
– Giuseppe Castagna (CNRS Univ Paris 7, France)
– Sebastian Fischer (Germany)
– Marco Gavanelli (University of Ferrara, Italy)
– Joxan Jaffar (National University of Singapore, Singapore)
– Barry Jay (University of Sydney, Australia)
– Andy King (University of Kent, UK)
– Claude Kirchner (INRIA, France)
– Neelakantan R. Krishnaswami (Microsoft Cambridge, UK)
– Yulya Lierler (University of Kentucky, USA)
– Keiko Nakata (Tallinn University of Technology, Estonia)
– Peter Schneider-Kamp (University of Southern Denmark, Denmark)
– Olin Shivers (Northeastern University, USA)
– Paul Tarau (University of Northern Texas, USA)
– Kazunori Ueda (Waseda University, Japan)
– Meng Wang (Chalmers Technical University, Sweden)
General Chair and Local co-Chairs
– Naoyuki Tamura (Kobe University, Japan)
– Mutsunori Banbara (Kobe University, Japan)
– Katsutoshi Hirayama (Kobe University, Japan)
Sponsors
– Japan Society for Software Science and Technology (JSSST) SIGPPL
– Information Science and Technology Center, Kobe University
In Cooperation with
– ACM SIGPLAN
– Asian Association for Foundation of Software (AAFS)
– Association for Logic Programming (ALP)