Re: [Haskell] Is there an example how to pass a string to VBA?

2006-09-15 Thread Salvador Lucas

We recently did something similar (among other things)
to implement a .NET version of a Haskell tool with a
C# graphical interface. You can take a look to this
paper:

  http://www.dsic.upv.es/~slucas/papers/net06/net06.pdf

Hope it helps!

Regards,

Salvador.

Andreas Marth wrote:


Hallo everybody!

I'm trying to pass a String to VBA and am totally stuck. Does anyody have a
working example how to do this? I am interested in either a plain low level
DLL or a COM DLL or anything else if there is something else. I hope someone
did this already and can give me a helping hand.

A nice weekend for everybody,
Andreas

___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
 



___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


Re: [Haskell] Can anyone help me with partition numbers?

2005-11-25 Thread Salvador Lucas

This does not work properly:

Main> generate 5
[[1,1,1,1,1],[1,1,1,2],[1,1,2,1],[1,1,3],[1,2,1,1],[1,2,2],[1,3,1],[1,4],[2,1,1,1],[2,1,2],[2,2,1],[2,3],[3,1,1],[3,2],[4,1],[5]]

You need to add something else:

parts 0 = [[]]
parts n = [m:p | m<-[1..n], p<-parts (n-m), (null p || m<=head p)]

Main> parts 5
[[1,1,1,1,1],[1,1,1,2],[1,1,3],[1,2,2],[1,4],[2,3],[5]]

Best,

Salvador.

Doaitse Swierstra wrote:


Or (since we started to do someone's  homework anyway)

generate 0 = [[]]
generate n = [x:rest | x <- [1..n], rest <- generate (n-x)]


Doaitse Swierstra



On 2005 nov 25, at 10:29, Tomasz Zielonka wrote:


On Thu, Nov 24, 2005 at 05:52:23PM +0100, Jan van Eijck wrote:


Like so:

generatePs :: (Int,[Int]) -> [[Int]]
generatePs (n,[])   = [take n (repeat 1)]
generatePs (n,(x:xs))   =
  (take n (repeat 1) ++ (x:xs)) : generatePs (pack (x-1) ((n 
+x),xs))

  where
  pack :: Int -> (Int,[Int]) ->(Int,[Int])
  pack 1 (m,xs) = (m,xs)
  pack k (m,xs) = if k > m  then pack (k-1) (m,xs)
  else   pack k (m-k,k:xs)

parts :: Int -> [[Int]]
parts n | n < 1 = error "part: argument <= 0"
| n == 1= [[1]]
| otherwise = generatePs (0,[n])



How about a shorter version?

part :: Integer -> [[Integer]]
part = gen 1
  where
gen m 0 = [[]]
gen m n = [ x:xs | x <- [m..n], xs <- gen x (n - x) ]

Best regards
Tomasz

___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell



___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell



___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


[Haskell] WRS'05 - Last Call for Papers (deadline January 31)

2005-01-26 Thread Salvador Lucas
dline for final versions of accepted papers
April22, 2005Workshop
INVITED SPEAKERS
  * Kokichi Futatsugi  (JAIST, Japan)
  * Hongwei Xi(Boston University, USA)
PROGRAM COMMITTEE
  * Sergio Antoy (Portland)
  * Eduardo Bonelli (Stevens)
  * Roberto Di Cosmo (Paris VII, Co-Chair)
  * Bernhard Gramlich (Wien)
  * Stefano Guerrini (Roma)
  * Salvador Lucas (Valencia)
  * Aart Middeldorp (Innsbruck)
  * Yoshihito Toyama (Tohoku, Co-Chair)
PROGRAM CO-CHAIRS
Roberto Di Cosmo
Laboratoire PPS -  Universite Paris 7, France
Email: [EMAIL PROTECTED]
Yoshihito Toyama
Tohoku University, Japan
Email: [EMAIL PROTECTED]
FURTHER INFORMATION
  * Call for papers in Text, PostScript and PDF format
  * WRS permanent website: http://www.dsic.upv.es/~wrs
  * WRS 2005 e-mail address: [EMAIL PROTECTED]
  * RDP 2005 website: http://www.kurims.kyoto-u.ac.jp/rdp05/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


[Haskell] Call for Participation: Fourth International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04)

2004-05-12 Thread Salvador Lucas
===
Final call for participation, WRS'04, June 2, 2004.
We apologize for multiple copies of this announcements
===
   ***
   * *
   *  WRS'04 CALL FOR PARTICIPATION  *
   * *
   ***
   
The Fourth International Workshop on Reduction Strategies in
Rewriting and Programming (WRS'04) will be held on June, 2, 2003,
in Aachen, Germany, as a part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP'04).

INVITED TALKS will be given by:

   *  Olivier Danvy (University of Aarhus, Denmark),
  Normalization by Evaluation
   *  Jan Willem Klop (Vrije Universiteit Amsterdam, The Netherlands),
  Reduction Cycles
ROUND TABLE Strategies in Programming Languages Today

   *  Moderator: Salvador Lucas
   *  Speakers: Francisco Duran, Claude Kirchner, Ralf Laemmel
PROGRAM
   
   Reduction Cycles (invited talk)
   Jan Willem Klop
   
   Autowrite: A Tool for Term Rewrite Systems and Tree Automata
   Irene Durand
   
   Integrating Decision Procedures in Reflective Rewriting-Based 
   Theorem Provers 
   Manuel Clavel, Miguel Palomino, Juan Santa-Cruz
   
   Some Undecidable Approximations of TRSs
   Jeroen Ketema
   
   Normalization by Evaluation (invited talk)
   Olivier Danvy
   
   Invariant-Driven Strategies for Maude 
   Francisco Duran, Manuel Roldan and Antonio Vallecillo
   
   DS-forest: A Data Structure for Fast Normalization 
   and Efficiently Implementing Strategies (position paper)
   Rakesh Verma and James Thigpen
   
   Strategies in Programming Languages Today (round table)
   Salvador Lucas moderator
   
   Maude's Internal Strategies (round table paper) 
   Francisco Duran
   
   Strategic Rewriting (round table paper)
   Claude Kirchner
   
   Programmable rewriting strategies in Haskell (round table paper)
   Ralf Laemmel
   
WEBSITE
   
   http://www-i2.informatik.rwth-aachen.de/WRS04/

For further questions please contact the program co-chairs:
Sergio Antoy and Yoshihito Toyama at [EMAIL PROTECTED]


___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell


Re: Calling an external command from a Haskell program

2003-10-21 Thread Salvador Lucas
Hi,

Mikael Brockman wrote:
> 
> > You can use..
> >   system :: String -> IO ExitCode
> > in library module System.Cmd
> >
> 
> If you want access to its I/O streams as well, you can use
> Posix.popen, which is not standard Haskell 98, I think, but it's in
> GHC.

Yes, in fact, this was the reason to send my 
first message. I already knew about 'system' in
library System, but the Hugs installation says:

-- Warning: the implementation of these functions in Hugs 98 is very weak.
-- The functions themselves are best suited to uses in compiled programs,
-- and not to use in an interpreter-based environment like Hugs.

Thus, since I normally use Hugs rather than GHC 
I was afraid to have some problem (which one?) with
it.

>From Haskell's WiKi pages I learnt that something else was 
available for POSIX (which I do not use :-( ).

Anyway, I have implemented my utility by using system
and it seems to run quite ok... Unfortunately I still
do not know which is the weak point of these functions 
in Hugs...

Best regards,

Salvador.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell


Calling an external command from a Haskell program

2003-10-15 Thread Salvador Lucas
Dear all,

I think this question is not new, but I am not able to
find the answer. How to proceed to execute an external
Linux command (e.g., 'ls') from a Haskell program?

Thanks in advance,

Salvador.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell


WRS 2003 - Deadline extended to April 3, 2003

2003-03-24 Thread Salvador Lucas
t the workshop. The final
workshop proceedings will be published in the Electronic Notes
in Theoretical Computer Science (ENTCS) series of Elsevier.

PROGRAM COMMITTEE

  Sergio Antoy Portland (USA)
  Zena M. Ariola   Eugene (USA)
  Roberto Di Cosmo Paris VII (France)
  Juergen GieslAachen (Germany)
  Bernhard Gramlich (co-chair) Wien (Austria)
  Salvador Lucas (co-chair)Valencia (Spain)
  Aart Middeldorp  Tsukuba (Japan)
  Ricardo Pe~naMadrid (Spain)
  Pierre Rety  Orleans (France)
  Eelco Visser Utrecht (The Netherlands)

ORGANIZERS

  Bernhard Gramlich  Technische Universitaet Wien
  Salvador Lucas Universidad Politecnica de Valencia


IMPORTANT DATES

  Abstract's submission:March 30, 2003
  Deadline for submissions: April  3, 2003
  Notification: April 25, 2003
  Final version due:May   11, 2003
  Workshop: June   8, 2003

FURTHER INFORMATION

  WRS 2003 website: http://www.dsic.upv.es/~rdp03/wrs
  WRS 2003 e-mail address:  [EMAIL PROTECTED]
  RDP 2003 website: http://www.dsic.upv.es/~rdp03


**

___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell


WRS 2003 - Second Call for Papers

2003-02-17 Thread Salvador Lucas
**
**  second call for papers and participation   ***
**

Third International Workshop on
   Reduction Strategies in Rewriting and Programming (WRS 2003)

   http://www.dsic.upv.es/~rdp03/wrs

  part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003)

 Valencia, Spain, June 8, 2003

--

BACKGROUND AND AIMS

Reduction strategies in rewriting and programming have attracted
an increasing attention within the last years. New types of
reduction strategies have been invented and investigated, and new
results on rewriting / computation under particular strategies
have been obtained. Research in this field ranges from primarily
theoretical questions about reduction strategies to very practical
application and implementation issues. The need for a deeper
understanding of reduction strategies in rewriting and
programming, both in theory and practice, is obvious, since
they bridge the gap between unrestricted general rewriting
(computation) and (more deterministic) rewriting with particular
strategies (programming). Moreover, reduction strategies provide
a natural way to go from operational principles (e.g., graph and
term rewriting, narrowing, lambda-calculus) and semantics (e.g.,
normalization, computation of values, infinitary normalization,
head-normalization) to implementations of programming languages.

Therefore any progress in this area is likely to be of interest
not only to the rewriting community, but also to neighbouring
fields like functional programming, functional-logic programming,
and termination proofs of algorithms.

The workshop wants to provide a forum for the presentation and
discussion of new ideas and results, recent developments, new
research directions, as well as of surveys on existing knowledge
in this area. Furthermore we aim at fostering interaction and
exchange between researchers and students actively working on
such topics. The workshop is part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003) to be held in
Valencia (Spain) on June 8, 2003.

The workshop is (co-)organized by TU Valencia and TU Wien.


TOPICS OF INTEREST

Topics of interest include, but are not restricted to:
- theoretical foundations for the definition and semantic
  description of reduction strategies
- strategies in different frameworks (term rewriting, graph
  rewriting, infinitary rewriting, lambda calculi, higher
  order rewriting and explicit substitutions, conditional
  rewriting, rewriting with built-ins, narrowing, constraint
  solving, etc.) and their application in (equational,
  functional, functional-logic) programming (languages)
- properties of reduction strategies / computations under
  strategies (e.g., completeness, computability, decidability,
  complexity, optimality, (hyper-)normalization, cofinality,
  fairness, perpetuality, context-freeness, neededness,
  laziness, eagerness, strictness)
- interrelations, combinations and applications of
  reduction under different strategies (e.g., equivalence
  conditions for fundamental properties like termination and
  confluence, applications in modularity analysis, connections
  between strategies of different frameworks, etc.)
- program analysis and other semantics-based optimization
  techniques dealing with reduction strategies
- rewrite systems / tools / implementations with flexible /
  programmable strategies as essential concept / ingredient
- specification of reduction strategies in (real) languages
- data structures and implementation techniques for reduction
  strategies.


SUBMISSIONS

We solicit papers on all aspects of reduction strategies in
rewriting and programming. Submissions should describe unpublished
work, except for survey papers which are explicitly welcome,
too. Submissions should not exceed 10 pages (however, survey
papers may be longer) and be sent in postscript or PDF format
to the PC co-chairs at

  [EMAIL PROTECTED]

before March 23, 2003. Submissions should include the title,
authors' names,  affiliations, addresses, and e-mail. Selection
of papers by the PC will be based on originality, significance,
and correctness. Final versions will be due by May 11, 2003.


PUBLICATION

Accepted papers will be included in the preliminary workshop
proceedings that will be available at the workshop. The final
workshop proceedings will be published in the Electronic Notes
in Theoretical Computer Science (ENTCS) series of Elsevier.

PROGRAM COMMITTEE

  Sergio Antoy Portland (USA)
  Zena M. Ariola   Eugene (USA)
  Roberto Di Cosmo Paris VII (France)
  Juergen GieslAachen (Germany)
  Bernhard Gramlich (co-chair) Wien (Austria)
  Salvador 

WRS 2003 - First Call for Papers

2003-01-13 Thread Salvador Lucas
**
***  first call for papers and participation   ***
**

Third International Workshop on
   Reduction Strategies in Rewriting and Programming (WRS 2003)

   http://www.dsic.upv.es/~rdp03/wrs

  part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003)

 Valencia, Spain, June 8, 2003

--

BACKGROUND AND AIMS

Reduction strategies in rewriting and programming have attracted
an increasing attention within the last years. New types of
reduction strategies have been invented and investigated, and new
results on rewriting / computation under particular strategies
have been obtained. Research in this field ranges from primarily
theoretical questions about reduction strategies to very practical
application and implementation issues. The need for a deeper
understanding of reduction strategies in rewriting and
programming, both in theory and practice, is obvious, since
they bridge the gap between unrestricted general rewriting
(computation) and (more deterministic) rewriting with particular
strategies (programming). Moreover, reduction strategies provide
a natural way to go from operational principles (e.g., graph and
term rewriting, narrowing, lambda-calculus) and semantics (e.g.,
normalization, computation of values, infinitary normalization,
head-normalization) to implementations of programming languages.

Therefore any progress in this area is likely to be of interest
not only to the rewriting community, but also to neighbouring
fields like functional programming, functional-logic programming,
and termination proofs of algorithms.

The workshop wants to provide a forum for the presentation and
discussion of new ideas and results, recent developments, new
research directions, as well as of surveys on existing knowledge
in this area. Furthermore we aim at fostering interaction and
exchange between researchers and students actively working on
such topics. The workshop is part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003) to be held in
Valencia (Spain) on June 8, 2003.

The workshop is (co-)organized by TU Valencia and TU Wien.


TOPICS OF INTEREST

Topics of interest include, but are not restricted to:
- theoretical foundations for the definition and semantic
  description of reduction strategies
- strategies in different frameworks (term rewriting, graph
  rewriting, infinitary rewriting, lambda calculi, higher
  order rewriting and explicit substitutions, conditional
  rewriting, rewriting with built-ins, narrowing, constraint
  solving, etc.) and their application in (equational,
  functional, functional-logic) programming (languages)
- properties of reduction strategies / computations under
  strategies (e.g., completeness, computability, decidability,
  complexity, optimality, (hyper-)normalization, cofinality,
  fairness, perpetuality, context-freeness, neededness,
  laziness, eagerness, strictness)
- interrelations, combinations and applications of
  reduction under different strategies (e.g., equivalence
  conditions for fundamental properties like termination and
  confluence, applications in modularity analysis, connections
  between strategies of different frameworks, etc.)
- program analysis and other semantics-based optimization
  techniques dealing with reduction strategies
- rewrite systems / tools / implementations with flexible /
  programmable strategies as essential concept / ingredient
- specification of reduction strategies in (real) languages
- data structures and implementation techniques for reduction
  strategies.


SUBMISSIONS

We solicit papers on all aspects of reduction strategies in
rewriting and programming. Submissions should describe unpublished
work, except for survey papers which are explicitly welcome,
too. Submissions should not exceed 10 pages (however, survey
papers may be longer) and be sent in postscript format to the
PC co-chairs at

  [EMAIL PROTECTED]

before March 23, 2003. Submissions should include the title,
authors' names,  affiliations, addresses, and e-mail. Selection
of papers by the PC will be based on originality, significance,
and correctness. Final versions will be due by May 11, 2003.


PUBLICATION

Accepted papers will be included in the preliminary workshop
proceedings that will be available at the workshop. The final
workshop proceedings will be published in the Electronic Notes
in Theoretical Computer Science (ENTCS) series of Elsevier.

PROGRAM COMMITTEE

  Sergio Antoy Portland (USA)
  Zena M. Ariola   Oregon (USA)
  Roberto Di Cosmo Paris VII (France)
  Juergen GieslAachen (Germany)
  Bernhard Gramlich (co-chair) Wien (Austria)
  Salvador Luca

WRS 2003 - First Call for Papers

2003-01-13 Thread Salvador Lucas
**
***  first call for papers and participation   ***
**

Third International Workshop on
   Reduction Strategies in Rewriting and Programming (WRS 2003)

   http://www.dsic.upv.es/~rdp03/wrs

  part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003)

 Valencia, Spain, June 8, 2003

--

BACKGROUND AND AIMS

Reduction strategies in rewriting and programming have attracted
an increasing attention within the last years. New types of
reduction strategies have been invented and investigated, and new
results on rewriting / computation under particular strategies
have been obtained. Research in this field ranges from primarily
theoretical questions about reduction strategies to very practical
application and implementation issues. The need for a deeper
understanding of reduction strategies in rewriting and
programming, both in theory and practice, is obvious, since
they bridge the gap between unrestricted general rewriting
(computation) and (more deterministic) rewriting with particular
strategies (programming). Moreover, reduction strategies provide
a natural way to go from operational principles (e.g., graph and
term rewriting, narrowing, lambda-calculus) and semantics (e.g.,
normalization, computation of values, infinitary normalization,
head-normalization) to implementations of programming languages.

Therefore any progress in this area is likely to be of interest
not only to the rewriting community, but also to neighbouring
fields like functional programming, functional-logic programming,
and termination proofs of algorithms.

The workshop wants to provide a forum for the presentation and
discussion of new ideas and results, recent developments, new
research directions, as well as of surveys on existing knowledge
in this area. Furthermore we aim at fostering interaction and
exchange between researchers and students actively working on
such topics. The workshop is part of the Federated Conference on
Rewriting, Deduction and Programming (RDP 2003) to be held in
Valencia (Spain) on June 8, 2003.

The workshop is (co-)organized by TU Valencia and TU Wien.


TOPICS OF INTEREST

Topics of interest include, but are not restricted to:
- theoretical foundations for the definition and semantic
  description of reduction strategies
- strategies in different frameworks (term rewriting, graph
  rewriting, infinitary rewriting, lambda calculi, higher
  order rewriting and explicit substitutions, conditional
  rewriting, rewriting with built-ins, narrowing, constraint
  solving, etc.) and their application in (equational,
  functional, functional-logic) programming (languages)
- properties of reduction strategies / computations under
  strategies (e.g., completeness, computability, decidability,
  complexity, optimality, (hyper-)normalization, cofinality,
  fairness, perpetuality, context-freeness, neededness,
  laziness, eagerness, strictness)
- interrelations, combinations and applications of
  reduction under different strategies (e.g., equivalence
  conditions for fundamental properties like termination and
  confluence, applications in modularity analysis, connections
  between strategies of different frameworks, etc.)
- program analysis and other semantics-based optimization
  techniques dealing with reduction strategies
- rewrite systems / tools / implementations with flexible /
  programmable strategies as essential concept / ingredient
- specification of reduction strategies in (real) languages
- data structures and implementation techniques for reduction
  strategies.


SUBMISSIONS

We solicit papers on all aspects of reduction strategies in
rewriting and programming. Submissions should describe unpublished
work, except for survey papers which are explicitly welcome,
too. Submissions should not exceed 10 pages (however, survey
papers may be longer) and be sent in postscript format to the
PC co-chairs at

  [EMAIL PROTECTED]

before March 23, 2003. Submissions should include the title,
authors' names,  affiliations, addresses, and e-mail. Selection
of papers by the PC will be based on originality, significance,
and correctness. Final versions will be due by May 11, 2003.


PUBLICATION

Accepted papers will be included in the preliminary workshop
proceedings that will be available at the workshop. The final
workshop proceedings will be published in the Electronic Notes
in Theoretical Computer Science (ENTCS) series of Elsevier.

PROGRAM COMMITTEE

  Sergio Antoy Portland (USA)
  Zena M. Ariola   Oregon (USA)
  Roberto Di Cosmo Paris VII (France)
  Juergen GieslAachen (Germany)
  Bernhard Gramlich (co-chair) Wien (Austria)
  Salvador Luca

Re: Papers on strictness annotations

2002-06-25 Thread Salvador Lucas Alba



Robert Ennals wrote:

> Although it proposes them for Haskell, it says itself that they were already
> present in Clean

Section 8.3 (6 pages) of Plasmeijer and van Eekelen's book

Functional Programming and Parallel Graph Rewriting
Addison-Wesley

is devoted to (Clean-like) strictness annotations...

Best regards,

Salvador Lucas.

____

Salvador Lucas Alba
Departamento de Sistemas Informaticos y Computacion (DSIC)

Universidad Politecnica de Valencia | phone: + 34 96 387 7353 (73531)
Camino de Vera, s/n | fax:   + 34 96 387 7359
E-46022 Valencia (Spain)| e-mail: [EMAIL PROTECTED]

http://www.dsic.upv.es/users/elp/slucas.html



___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell



RDP'03 - First announcement

2002-04-23 Thread Salvador Lucas Alba


   [Apologies for multiple copies of this announcement]

**
*  First announcement  ***
**

Federated Conference on Rewriting, Deduction and Programming (RDP)

http://www.dsic.upv.es/~rdp03

 Valencia, Spain, June 8 - 14, 2003

--

We are pleased to announce the Federated Conference on Rewriting, Deduction
and Programming (RDP) to be held in Valencia, Spain, in June 2003.

The conference will be hosted by the Departamento de Sistemas Informaticos
y Computacion (DSIC) at the Universidad Politecnica de Valencia.


PARTICIPANTS

   14th Int. Conference on Rewriting Techniques and Applications, RTA'03
   6th  Int. Conference on Typed Lambda Calculi and Applications, TLCA'03
   4th  Int. Workshop on First Order Theorem Proving, FTP'03
   IFIP Working Group 1.6 on Term Rewriting
   4th  Int. Workshop on Rule Based Programming, RULE'03
   16th Int. Workshop on Unification, UNIF'03
   12th Int. Workshop on Functional and (Constraint) Logic Prog., WFLP'03
   3rd  Int. Workshop on Red. Strat. in Rewriting and Programming, WRS'03
   6th  Int. Workshop on Termination, WST'03


DATES

  RDP: June  8 - 14, 2003

  RTA'03 : June  9 - 11
  TLCA'03: June 10 - 12
  FTP'03 : June 12 - 14
  WG 1.6 : June 12
  RULE'03: June  9
  UNIF'03: June  8 - 9
  WFLP'03: June 12 - 13
  WRS'03 : June  8
  WST'03 : June 13 - 14


ORGANIZERS

  The ELP group at the Universidad Politecnica de Valencia

  Officials:

  Salvador Lucas (chair of the organizing committee)
  Elvira Albert  (secretary)
  Maria Alpuente (workshops chair)
  Jose Hernandez (local arrangements)
  Javier Oliver  (secretary)
  Maria Jose Ramirez (local arrangements chair)
  German Vidal   (publicity chair)


CONTACT

  Salvador Lucas

  Departamento de Sistemas Informaticos y Computacion (DSIC)
  Universidad Politecnica de Valencia
  Camino de Vera, s/n
  E-46022 Valencia (Spain)
  phone: + 34 96 387 7353 (73531)
  fax:   + 34 96 387 7359
  e-mail: [EMAIL PROTECTED]
  URL: http://www.dsic.upv.es/users/elp/slucas.html


FURTHER INFORMATION

  RDP website: http://www.dsic.upv.es/~rdp03
  The ELP group:   http://www.dsic.upv.es/users/elp/elp.html

**


___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell



RDP'03 - First announcement

2002-04-22 Thread Salvador Lucas Alba


   [Apologies for multiple copies of this announcement]

**
*  First announcement  ***
**

Federated Conference on Rewriting, Deduction and Programming (RDP)

http://www.dsic.upv.es/~rdp03

 Valencia, Spain, June 8 - 14, 2003

--

We are pleased to announce the Federated Conference on Rewriting, Deduction
and Programming (RDP) to be held in Valencia, Spain, in June 2003.

The conference will be hosted by the Departamento de Sistemas Informaticos
y Computacion (DSIC) at the Universidad Politecnica de Valencia.


PARTICIPANTS

   14th Int. Conference on Rewriting Techniques and Applications, RTA'03
   6th  Int. Conference on Typed Lambda Calculi and Applications, TLCA'03
   4th  Int. Workshop on First Order Theorem Proving, FTP'03
   IFIP Working Group 1.6 on Term Rewriting
   4th  Int. Workshop on Rule Based Programming, RULE'03
   16th Int. Workshop on Unification, UNIF'03
   12th Int. Workshop on Functional and Logic Programming, WFLP'03
   3rd  Int. Workshop on Red. Strat. in Rewriting and Programming, WRS'03
   6th  Int. Workshop on Termination, WST'03


DATES

  RDP: June  8 - 14, 2003

  RTA'03 : June  9 - 11
  TLCA'03: June 10 - 12
  FTP'03 : June 12 - 14
  WG 1.6 : June 12
  RULE'03: June  9
  UNIF'03: June  8 - 9
  WFLP'03: June 12 - 13
  WRS'03 : June  8
  WST'03 : June 13 - 14


ORGANIZERS

  The ELP group at the Universidad Politecnica de Valencia

  Officials:

  Salvador Lucas (chair of the organizing committee)
  Elvira Albert  (secretary)
  Maria Alpuente (workshops chair)
  Jose Hernandez (local arrangements)
  Javier Oliver  (secretary)
  Maria Jose Ramirez (local arrangements chair)
  German Vidal   (publicity chair)


CONTACT

  Salvador Lucas

  Departamento de Sistemas Informaticos y Computacion (DSIC)
  Universidad Politecnica de Valencia
  Camino de Vera, s/n
  E-46022 Valencia (Spain)
  phone: + 34 96 387 7353 (73531)
  fax:   + 34 96 387 7359
  e-mail: [EMAIL PROTECTED]
  URL: http://www.dsic.upv.es/users/elp/slucas.html


FURTHER INFORMATION

  RDP website: http://www.dsic.upv.es/~rdp03
  The ELP group:   http://www.dsic.upv.es/users/elp/elp.html

**


___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell



WRS'2001 - Extended deadline

2001-03-02 Thread Salvador Lucas Alba
 Strategies for Functional Logic Programming
  Eelco Visser (U Utrecht, The Netherlands):
A Survey of Strategies in Program Transformation Systems


PANEL DISCUSSION on ``Hot Topics in Reduction Strategies'' with

  Michael Hanus  U Kiel (Germany)
  Tetsuo Ida U Tsukuba (Japan)
  Paul Klint CWI & U Amsterdam (The Netherlands)


PROGRAM COMMITTEE

  Maria Alpuente TU Valencia (Spain)
  Rachid Echahed IMAG Grenoble (France)
  Bernhard Gramlich (co-chair)   TU Wien (Austria)
  Salvador Lucas (co-chair)  TU Valencia (Spain)
  Vincent van OostromU Utrecht (The Netherlands)
  Rinus Plasmeijer   KU Nijmegen (The Netherlands)
  Manfred Schmidt-SchaussU Frankfurt a.M. (Germany)
  Yoshihito Toyama   U Tohoku (Japan)


LOCAL ORGANIZATION

  Vincent van OostromU Utrecht (The Netherlands)


IMPORTANT DATES

  SubmissionMarch 12, 2001 (extended deadline)
  Notification  March 31, 2001
  Final version April 30, 2001
  Workshop  May 26, 2001


FURTHER INFORMATION

  workshop website   http://www.logic.at/wrs01/
  workshop email address [EMAIL PROTECTED]


**



___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell



WRS'2001 - Second call for papers

2001-02-15 Thread Salvador Lucas Alba
 Strategies for Functional Logic Programming
  Eelco Visser (U Utrecht, The Netherlands):
A Survey of Strategies in Program Transformation Systems


PANEL DISCUSSION on ``Hot Topics in Reduction Strategies'' with

  Michael Hanus  U Kiel (Germany)
  Tetsuo Ida U Tsukuba (Japan)
  Paul Klint CWI & U Amsterdam (The Netherlands)


PROGRAM COMMITTEE

  Maria Alpuente TU Valencia (Spain)
  Rachid Echahed IMAG Grenoble (France)
  Bernhard Gramlich (co-chair)   TU Wien (Austria)
  Salvador Lucas (co-chair)  TU Valencia (Spain)
  Vincent van OostromU Utrecht (The Netherlands)
  Rinus Plasmeijer   KU Nijmegen (The Netherlands)
  Manfred Schmidt-SchaussU Frankfurt a.M. (Germany)
  Yoshihito Toyama   U Tohoku (Japan)


LOCAL ORGANIZATION

  Vincent van OostromU Utrecht (The Netherlands)


IMPORTANT DATES

  SubmissionMarch 1, 2001
  Notification  March 31, 2001
  Final version April 30, 2001
  Workshop  May 26, 2001


FURTHER INFORMATION

  workshop website   http://www.logic.at/wrs01/
  workshop email address [EMAIL PROTECTED]


**



___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell



WRS'2001 - First call for papers

2001-01-18 Thread Salvador Lucas Alba
 Norwich, UK):
(to be confirmed)
  Eelco Visser (U Utrecht, The Netherlands):
A Survey of Strategies in Program Transformation Systems


PANEL DISCUSSION on ``Hot Topics in Reduction Strategies'' with

  Michael Hanus  U Kiel (Germany)
  Tetsuo Ida U Tsukuba (Japan)
  Paul Klint (to be confirmed)   CWI & U Amsterdam (The Netherlands)


PROGRAM COMMITTEE

  Maria Alpuente TU Valencia (Spain)
  Rachid Echahed IMAG Grenoble (France)
  Bernhard Gramlich (co-chair)   TU Wien (Austria)
  Salvador Lucas (co-chair)  TU Valencia (Spain)
  Vincent van OostromU Utrecht (The Netherlands)
  Rinus Plasmeijer   KU Nijmegen (The Netherlands)
  Manfred Schmidt-SchaussU Frankfurt a.M. (Germany)
  Yoshihito Toyama   U Tohoku (Japan)


LOCAL ORGANIZATION

  Vincent van OostromU Utrecht (The Netherlands)


IMPORTANT DATES

  SubmissionMarch 1, 2001
  Notification  March 31, 2001
  Final version April 30, 2001
  Workshop  May 26, 2001


FURTHER INFORMATION

  workshop website   http://www.logic.at/wrs01/
  workshop email address [EMAIL PROTECTED]


**




___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell