*** FLOPS 2010: 2nd Call for Participation ***

Matthias Blume <[email protected]> Wed, 24 Mar 2010 22:03:45 -0500
Newsgroups gmane.comp.lang.ml.devel,gmane.comp.lang.sml.smlnj
Message-ID <[email protected]>
--===============3785459799104606028==
Content-Type: multipart/alternative; boundary=Apple-Mail-4--878750710


--Apple-Mail-4--878750710
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

                       2nd Call For Participation

    Tenth International Symposium on Functional and Logic Programming
                             FLOPS 2010

                          April 19-21, 2010
			    Sendai, JAPAN

             http://www.kb.ecei.tohoku.ac.jp/flops2010/


           ** Early registration ends on April 2, 2010 **


FLOPS is a forum for research on all issues concerning declarative
programming, including functional programming and logic programming,
and aims to promote cross-fertilization 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), and Ise (2008).

VENUE

The meeting will be held at the Aoba Memorial Hall, in the Aoba-yama
Campus of the Tohoku University.

REGISTRATION

The registration is now open at the Symposium home page:
http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration

PROCEEDINGS

The proceedings will be published as volume 6009 of Lecture Notes in
Computer Science, Springer, and distributed at the Symposium.

INVITED SPEAKERS

Brigitte Pientka (McGill University, Canada)
Kostis Sagonas (National Technical University of Athens, Greece)
Naoyuki Tamura (Kobe University, Japan)

PROGRAM

April 19 (Monday)
12:00-13:20 Registration and lunch
13:20-14:20 Invited talk
            Beluga: programming with dependent types and higher-order =
data
            Brigitte Pientka
14:40-16:10 Types
          - A Church-Style Intermediate Language for MLF
            Didier Remy, Boris Yakobowski
          - =CE=A0=CE=A3: Dependent Types without the Sugar
            Thorsten Altenkirch, Nils Anders Danielsson, Andres L=C3=B6h, =
Nicolas Oury
          - Haskell Type Constraints Unleashed
            Dominic Orchard, Tom Schrijvers

16:30-18:00 Program analysis and transformation
          - A Functional Framework for Result Checking
            Gilles Barthe, Pablo Buiras, C=C3=A9sar Kunz
          - Tagfree Combinators for Binding-Time Polymorphic Program =
Generation
            Peter Thiemann, Martin Sulzmann
          - Code Generation via Higher-Order Rewrite Systems
            Florian Haftmann, Tobias Nipkow

April 20 (Tuesday)
09:00-10.00 Invited talk
            Using Static Analysis to Detect Type Errors and Race =
Conditions in Erlang Programs
            Konstantinos Sagonas
10:20-11:50 Foundations
          - A Complete Axiomatization of Strict Equality
            Javier =C3=81lvez, Francisco Javier L=C3=B3pez-Fraguas
          - Standardization and B=C3=B6hm trees for Lambda-mu calculus
            Alexis Saurin
          - An Integrated Distance for Atoms
            Vicent Estruch, C=C3=A9sar Ferri, Jos=C3=A9 =
Hern=C3=A1ndez-Orallo, M.Jos=C3=A9 Ram=C3=ADrez-Quintana
11:50-      Lunch, excursion, and banquet

April 21 (Wednesday)
09:00-10:00 Invited talk
            Solving Constraint Satisfaction Problems with SAT Technology
            Naoyuki Tamura
10:20-11:50 Logic programming
          - A Pearl on SAT Solving in Prolog
            Jacob Howe, Andy King
          - Automatically Generating Counterexamples to Naive Free =
Theorems
            Daniel Seidel, Janis Voigtl=C3=A4nder
          - Applying Constraint Logic Programming to SQL Test Case =
Generation
            Yolanda Garc=C3=ADa-Ruiz, Rafael Caballero, Fernando =
S=C3=A1enz-P=C3=A9rez
11:50-12:50 Lunch
12:50-14:20 Evaluation and normalization
          - Internal Normalization, Compilation and Decompilation for =
System F
            Stefano Berardi, Makoto Tatsuta
          - Normalization by Evaluation for the beta-eta Calculus of =
Constructions
            Andreas Abel
          - Defunctionalized Interpreters for Call-by-Need Evaluation
            Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny
14:40-16:10 Term rewriting
          - Complexity Analysis by Graph Rewriting
            Martin Avanzini, Georg Moser
          - Least Upper Bounds on the Size of Church-Rosser Diagrams in =
Term Rewriting and =CE=BB-Calculus
            Jeroen Ketema, Jakob Grue Simonsen
          - Proving Injectivity of Functions via Program Inversion in =
Term Rewriting
            Naoki Nishida, Masahiko Sakai
16:30-18:00 Parallelism and control
          - Delimited Control in OCaml, Abstractly and Concretely. =
System Description
            Oleg Kiselyov
          - Automatic Parallelization of Recursive Functions using =
Quanti=EF=AC=81er Elimination
            Akimasa Morihata, Kiminori Matsuzaki
          - A Skeleton for Distributed Work Pools in Eden
            Mischa Dieterle, Jost Berthold, Rita Loogen

PC CO-CHAIRS

 Matthias Blume (Google, Chicago, USA)
 German Vidal (Technical University of Valencia, Spain)

CONFERENCE CHAIR

 Naoki Kobayashi (Tohoku University, Sendai, Japan)

PC MEMBERS

 Nick Benton (Microsoft Research, Cambridge, UK)
 Manuel Chakravarty (University of New South Wales, Australia)
 Michael Codish (Ben-Gurion University of the Negev, Israel)
 Bart Demoen (Katholieke Universiteit Leuven, Belgium)
 Agostino Dovier (University of Udine, Italy)
 John P. Gallagher (Roskilde University, Denmark)
 Maria Garcia de la Banda (Monash University, Australia)
 Michael Hanus (University of Kiel, Germany)
 Atsushi Igarashi (Kyoto University, Japan)
 Patricia Johann (Rutgers University, USA)
 Shin-ya Katsumata (Kyoto University, Japan)
 Michael Leuschel (University of Dusseldorf, Germany)
 Francisco Lopez-Fraguas (Complutense University of Madrid, Spain)
 Paqui Lucio (University of the Basque Country, Spain)
 Yasuhiko Minamide (University of Tsukuba, Japan)
 Frank Pfenning (Carnegie Mellon University, USA)
 Francois Pottier (INRIA, France)
 Tom Schrijvers (Katholieke Universiteit Leuven, Belgium)
 Chung-chieh "Ken" Shan (Rutgers University, USA)
 Zhong Shao (Yale University, USA)
 Jan-Georg Smaus (University of Freiburg, Germany)
 Nobuko Yoshida (Imperial College London, UK)

LOCAL CHAIR

 Eijiro Sumii (Tohoku University, Sendai, Japan)

SOME PREVIOUS FLOPS:

 FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/
 FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/
 FLOPS 2004, Nara
 FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/
 FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/

SPONSOR

  Japan Society for Software Science and Technology (JSSST), SIG-PPL
  Graduate School of Information Sciences, Tohoku University
  International Information Science Foundation

IN COOPERATION with

 AAFS (Asian Association for Foundation of Software)
 ACM SIGPLAN
 ALP (Association for Logic Programming)

INQUIRIES to

 [email protected]


--Apple-Mail-4--878750710
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><span =
class=3D"Apple-style-span" style=3D"font-family: monospace; =
">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; =
&nbsp; &nbsp; 2nd Call For =
Participation<br><br>&nbsp;&nbsp;&nbsp;&nbsp;Tenth International =
Symposium on Functional and Logic =
Programming<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;FLOPS =
2010<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;April 19-21, 2010<br><span class=3D"Apple-tab-span" =
style=3D"white-space: pre; ">	</span><span class=3D"Apple-tab-span" =
style=3D"white-space: pre; ">	</span><span class=3D"Apple-tab-span" =
style=3D"white-space: pre; ">	</span>&nbsp;&nbsp;&nbsp;&nbsp;Sendai, =
JAPAN<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;<a =
href=3D"http://www.kb.ecei.tohoku.ac.jp/flops2010/">http://www.kb.ecei.toh=
oku.ac.jp/flops2010/</a><br><br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;&nbsp;&nbsp;&nbsp;** 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=3D"http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registrat=
ion">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>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;Beluga: programming with dependent types and higher-order =
data<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;Brigitte Pientka<br>14:40-16:10 =
Types<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- A =
Church-Style Intermediate Language for =
MLF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;Didier Remy, Boris =
Yakobowski<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
- =CE=A0=CE=A3: Dependent Types without the =
Sugar<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;Thorsten Altenkirch, Nils Anders Danielsson, Andres L=C3=B6h, =
Nicolas =
Oury<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Haskell Type Constraints =
Unleashed<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;Dominic Orchard, Tom Schrijvers<br><br>16:30-18:00 Program =
analysis and =
transformation<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;- A Functional Framework for Result =
Checking<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;Gilles Barthe, Pablo Buiras, C=C3=A9sar =
Kunz<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Tagfree Combinators for Binding-Time Polymorphic Program =
Generation<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;Peter Thiemann, Martin =
Sulzmann<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Code Generation via Higher-Order Rewrite =
Systems<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;Florian Haftmann, Tobias Nipkow<br><br>April 20 =
(Tuesday)<br>09:00-10.00 Invited =
talk<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;Using Static Analysis to Detect Type Errors and Race Conditions in =
Erlang =
Programs<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;Konstantinos Sagonas<br>10:20-11:50 =
Foundations<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;- A Complete Axiomatization of Strict =
Equality<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;Javier =C3=81lvez, Francisco Javier =
L=C3=B3pez-Fraguas<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;- Standardization and B=C3=B6hm trees for Lambda-mu =
calculus<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;Alexis =
Saurin<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
An Integrated Distance for =
Atoms<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;Vicent Estruch, C=C3=A9sar Ferri, Jos=C3=A9 Hern=C3=A1ndez-Orallo, =
M.Jos=C3=A9 Ram=C3=ADrez-Quintana<br>11:50- =
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Lunch, excursion, and banquet<br><br>April =
21 (Wednesday)<br>09:00-10:00 Invited =
talk<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;Solving Constraint Satisfaction Problems with SAT =
Technology<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;Naoyuki Tamura<br>10:20-11:50 Logic =
programming<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;- A Pearl on SAT Solving in =
Prolog<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;Jacob Howe, Andy =
King<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Automatically Generating Counterexamples to Naive Free =
Theorems<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;Daniel Seidel, Janis =
Voigtl=C3=A4nder<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;- Applying Constraint Logic Programming to SQL Test Case =
Generation<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;Yolanda Garc=C3=ADa-Ruiz, Rafael Caballero, Fernando =
S=C3=A1enz-P=C3=A9rez<br>11:50-12:50 Lunch<br>12:50-14:20 Evaluation and =
normalization<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;- Internal Normalization, Compilation and Decompilation for System =
F<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;Stefano Berardi, Makoto =
Tatsuta<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Normalization by Evaluation for the beta-eta Calculus of =
Constructions<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;Andreas =
Abel<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Defunctionalized Interpreters for Call-by-Need =
Evaluation<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;Olivier Danvy, Kevin Millikin, Johan Munk, Ian =
Zerny<br>14:40-16:10 Term =
rewriting<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-=
 Complexity Analysis by Graph =
Rewriting<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;Martin Avanzini, Georg =
Moser<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term =
Rewriting and =
=CE=BB-Calculus<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;Jeroen Ketema, Jakob Grue =
Simonsen<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Proving Injectivity of Functions via Program Inversion in Term =
Rewriting<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;Naoki Nishida, Masahiko Sakai<br>16:30-18:00 Parallelism and =
control<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Delimited Control in OCaml, Abstractly and Concretely. System =
Description<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;Oleg =
Kiselyov<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;- =
Automatic Parallelization of Recursive Functions using Quanti=EF=AC=81er =
Elimination<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;Akimasa Morihata, Kiminori =
Matsuzaki<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-=
 A Skeleton for Distributed Work Pools in =
Eden<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;Mischa Dieterle, Jost Berthold, Rita Loogen<br><br>PC =
CO-CHAIRS<br><br>&nbsp;Matthias Blume (Google, Chicago, =
USA)<br>&nbsp;German Vidal (Technical University of Valencia, =
Spain)<br><br>CONFERENCE CHAIR<br><br>&nbsp;Naoki Kobayashi (Tohoku =
University, Sendai, Japan)<br><br>PC MEMBERS<br><br>&nbsp;Nick Benton =
(Microsoft Research, Cambridge, UK)<br>&nbsp;Manuel Chakravarty =
(University of New South Wales, Australia)<br>&nbsp;Michael Codish =
(Ben-Gurion University of the Negev, Israel)<br>&nbsp;Bart Demoen =
(Katholieke Universiteit Leuven, Belgium)<br>&nbsp;Agostino Dovier =
(University of Udine, Italy)<br>&nbsp;John P. Gallagher (Roskilde =
University, Denmark)<br>&nbsp;Maria Garcia de la Banda (Monash =
University, Australia)<br>&nbsp;Michael Hanus (University of Kiel, =
Germany)<br>&nbsp;Atsushi Igarashi (Kyoto University, =
Japan)<br>&nbsp;Patricia Johann (Rutgers University, =
USA)<br>&nbsp;Shin-ya Katsumata (Kyoto University, =
Japan)<br>&nbsp;Michael Leuschel (University of Dusseldorf, =
Germany)<br>&nbsp;Francisco Lopez-Fraguas (Complutense University of =
Madrid, Spain)<br>&nbsp;Paqui Lucio (University of the Basque Country, =
Spain)<br>&nbsp;Yasuhiko Minamide (University of Tsukuba, =
Japan)<br>&nbsp;Frank Pfenning (Carnegie Mellon University, =
USA)<br>&nbsp;Francois Pottier (INRIA, France)<br>&nbsp;Tom Schrijvers =
(Katholieke Universiteit Leuven, Belgium)<br>&nbsp;Chung-chieh "Ken" =
Shan (Rutgers University, USA)<br>&nbsp;Zhong Shao (Yale University, =
USA)<br>&nbsp;Jan-Georg Smaus (University of Freiburg, =
Germany)<br>&nbsp;Nobuko Yoshida (Imperial College London, =
UK)<br><br>LOCAL CHAIR<br><br>&nbsp;Eijiro Sumii (Tohoku University, =
Sendai, Japan)<br><br>SOME PREVIOUS FLOPS:<br><br>&nbsp;FLOPS 2008, =
Ise:&nbsp;<a =
href=3D"http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/">http://www.ma=
th.nagoya-u.ac.jp/~garrigue/FLOPS2008/</a><br>&nbsp;FLOPS 2006, Fuji =
Susono:&nbsp;<a =
href=3D"http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/">http://hagi.is.s.u-toky=
o.ac.jp/FLOPS2006/</a><br>&nbsp;FLOPS 2004, Nara<br>&nbsp;FLOPS 2002, =
Aizu:&nbsp;<a =
href=3D"http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/">http://www.ipl.t.u-toky=
o.ac.jp/FLOPS2002/</a><br>&nbsp;FLOPS 2001, Tokyo:&nbsp;<a =
href=3D"http://www.ueda.info.waseda.ac.jp/flops2001/">http://www.ueda.info=
.waseda.ac.jp/flops2001/</a><br><br>SPONSOR<br><br>&nbsp;&nbsp;Japan =
Society for Software Science and Technology (JSSST), =
SIG-PPL<br>&nbsp;&nbsp;Graduate School of Information Sciences, Tohoku =
University<br>&nbsp;&nbsp;International Information Science =
Foundation<br><br>IN COOPERATION with<br><br>&nbsp;AAFS (Asian =
Association for Foundation of Software)<br>&nbsp;ACM =
SIGPLAN<br>&nbsp;ALP (Association for Logic =
Programming)<br><br>INQUIRIES to<br><br>&nbsp;<a =
href=3D"mailto:[email protected]">[email protected]</a><br><br=
></span></body></html>=

--Apple-Mail-4--878750710--


--===============3785459799104606028==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

------------------------------------------------------------------------------
Download Intel&#174; Parallel Studio Eval
Try the new software tools for yourself. Speed compiling, find bugs
proactively, and fine-tune applications for parallel performance.
See why Intel Parallel Studio got high marks during beta.
http://p.sf.net/sfu/intel-sw-dev
--===============3785459799104606028==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Sml-implementers mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/sml-implementers

--===============3785459799104606028==--