<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><span class="Apple-style-span" style="font-family: monospace; "> 2nd Call For Participation<br><br> Tenth International Symposium on Functional and Logic Programming<br> FLOPS 2010<br><br> April 19-21, 2010<br><span class="Apple-tab-span" style="white-space: pre; "> </span><span class="Apple-tab-span" style="white-space: pre; "> </span><span class="Apple-tab-span" style="white-space: pre; "> </span> Sendai, JAPAN<br><br> <a href="http://www.kb.ecei.tohoku.ac.jp/flops2010/">http://www.kb.ecei.tohoku.ac.jp/flops2010/</a><br><br><br> ** Early registration ends on April 2, 2010 **<br><br><br>FLOPS is a forum for research on all issues concerning declarative<br>programming, including functional programming and logic programming,<br>and aims to promote cross-fertilization between the two paradigms.<br>Previous FLOPS meetings were held in Fuji Susono (1995), Shonan<br>Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu<br>(2002), Nara (2004), Fuji Susono (2006), and Ise (2008).<br><br>VENUE<br><br>The meeting will be held at the Aoba Memorial Hall, in the Aoba-yama<br>Campus of the Tohoku University.<br><br>REGISTRATION<br><br>The registration is now open at the Symposium home page:<br><a href="http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration">http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration</a><br><br>PROCEEDINGS<br><br>The proceedings will be published as volume 6009 of Lecture Notes in<br>Computer Science, Springer, and distributed at the Symposium.<br><br>INVITED SPEAKERS<br><br>Brigitte Pientka (McGill University, Canada)<br>Kostis Sagonas (National Technical University of Athens, Greece)<br>Naoyuki Tamura (Kobe University, Japan)<br><br>PROGRAM<br><br>April 19 (Monday)<br>12:00-13:20 Registration and lunch<br>13:20-14:20 Invited talk<br> Beluga: programming with dependent types and higher-order data<br> Brigitte Pientka<br>14:40-16:10 Types<br> - A Church-Style Intermediate Language for MLF<br> Didier Remy, Boris Yakobowski<br> - ΠΣ: Dependent Types without the Sugar<br> Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury<br> - Haskell Type Constraints Unleashed<br> Dominic Orchard, Tom Schrijvers<br><br>16:30-18:00 Program analysis and transformation<br> - A Functional Framework for Result Checking<br> Gilles Barthe, Pablo Buiras, César Kunz<br> - Tagfree Combinators for Binding-Time Polymorphic Program Generation<br> Peter Thiemann, Martin Sulzmann<br> - Code Generation via Higher-Order Rewrite Systems<br> Florian Haftmann, Tobias Nipkow<br><br>April 20 (Tuesday)<br>09:00-10.00 Invited talk<br> Using Static Analysis to Detect Type Errors and Race Conditions in Erlang Programs<br> Konstantinos Sagonas<br>10:20-11:50 Foundations<br> - A Complete Axiomatization of Strict Equality<br> Javier Álvez, Francisco Javier López-Fraguas<br> - Standardization and Böhm trees for Lambda-mu calculus<br> Alexis Saurin<br> - An Integrated Distance for Atoms<br> Vicent Estruch, César Ferri, José Hernández-Orallo, M.José Ramírez-Quintana<br>11:50- Lunch, excursion, and banquet<br><br>April 21 (Wednesday)<br>09:00-10:00 Invited talk<br> Solving Constraint Satisfaction Problems with SAT Technology<br> Naoyuki Tamura<br>10:20-11:50 Logic programming<br> - A Pearl on SAT Solving in Prolog<br> Jacob Howe, Andy King<br> - Automatically Generating Counterexamples to Naive Free Theorems<br> Daniel Seidel, Janis Voigtländer<br> - Applying Constraint Logic Programming to SQL Test Case Generation<br> Yolanda García-Ruiz, Rafael Caballero, Fernando Sáenz-Pérez<br>11:50-12:50 Lunch<br>12:50-14:20 Evaluation and normalization<br> - Internal Normalization, Compilation and Decompilation for System F<br> Stefano Berardi, Makoto Tatsuta<br> - Normalization by Evaluation for the beta-eta Calculus of Constructions<br> Andreas Abel<br> - Defunctionalized Interpreters for Call-by-Need Evaluation<br> Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny<br>14:40-16:10 Term rewriting<br> - Complexity Analysis by Graph Rewriting<br> Martin Avanzini, Georg Moser<br> - Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus<br> Jeroen Ketema, Jakob Grue Simonsen<br> - Proving Injectivity of Functions via Program Inversion in Term Rewriting<br> Naoki Nishida, Masahiko Sakai<br>16:30-18:00 Parallelism and control<br> - Delimited Control in OCaml, Abstractly and Concretely. System Description<br> Oleg Kiselyov<br> - Automatic Parallelization of Recursive Functions using Quantifier Elimination<br> Akimasa Morihata, Kiminori Matsuzaki<br> - A Skeleton for Distributed Work Pools in Eden<br> Mischa Dieterle, Jost Berthold, Rita Loogen<br><br>PC CO-CHAIRS<br><br> Matthias Blume (Google, Chicago, USA)<br> German Vidal (Technical University of Valencia, Spain)<br><br>CONFERENCE CHAIR<br><br> Naoki Kobayashi (Tohoku University, Sendai, Japan)<br><br>PC MEMBERS<br><br> Nick Benton (Microsoft Research, Cambridge, UK)<br> Manuel Chakravarty (University of New South Wales, Australia)<br> Michael Codish (Ben-Gurion University of the Negev, Israel)<br> Bart Demoen (Katholieke Universiteit Leuven, Belgium)<br> Agostino Dovier (University of Udine, Italy)<br> John P. Gallagher (Roskilde University, Denmark)<br> Maria Garcia de la Banda (Monash University, Australia)<br> Michael Hanus (University of Kiel, Germany)<br> Atsushi Igarashi (Kyoto University, Japan)<br> Patricia Johann (Rutgers University, USA)<br> Shin-ya Katsumata (Kyoto University, Japan)<br> Michael Leuschel (University of Dusseldorf, Germany)<br> Francisco Lopez-Fraguas (Complutense University of Madrid, Spain)<br> Paqui Lucio (University of the Basque Country, Spain)<br> Yasuhiko Minamide (University of Tsukuba, Japan)<br> Frank Pfenning (Carnegie Mellon University, USA)<br> Francois Pottier (INRIA, France)<br> Tom Schrijvers (Katholieke Universiteit Leuven, Belgium)<br> Chung-chieh "Ken" Shan (Rutgers University, USA)<br> Zhong Shao (Yale University, USA)<br> Jan-Georg Smaus (University of Freiburg, Germany)<br> Nobuko Yoshida (Imperial College London, UK)<br><br>LOCAL CHAIR<br><br> Eijiro Sumii (Tohoku University, Sendai, Japan)<br><br>SOME PREVIOUS FLOPS:<br><br> FLOPS 2008, Ise: <a href="http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/">http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/</a><br> FLOPS 2006, Fuji Susono: <a href="http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/">http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/</a><br> FLOPS 2004, Nara<br> FLOPS 2002, Aizu: <a href="http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/">http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/</a><br> FLOPS 2001, Tokyo: <a href="http://www.ueda.info.waseda.ac.jp/flops2001/">http://www.ueda.info.waseda.ac.jp/flops2001/</a><br><br>SPONSOR<br><br> Japan Society for Software Science and Technology (JSSST), SIG-PPL<br> Graduate School of Information Sciences, Tohoku University<br> International Information Science Foundation<br><br>IN COOPERATION with<br><br> AAFS (Asian Association for Foundation of Software)<br> ACM SIGPLAN<br> ALP (Association for Logic Programming)<br><br>INQUIRIES to<br><br> <a href="mailto:flops2010@easychair.org">flops2010@easychair.org</a><br><br></span></body></html>