Re: [Haskell] Re: ANNOUNCE: The jhc Haskell compiler.

2005-04-26 Thread Benjamin Franksen
On Tuesday 26 April 2005 11:15, Tony Finch wrote:
> On Tue, 26 Apr 2005, Ashley Yakeley wrote:
> > Does that mean my program will be GPL if I compile it with jhc?
>
> No; cf. gcc.

Fr details see http://www.gnu.org/licenses/gpl-faq.html#CanIUseGPLToolsForNF

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


Re: [Haskell] MPTCs and type inference

2005-04-26 Thread Andreas Rossberg
Thanks for the detailed explanation that helped clearing up the smog in 
my head. I reckoned that once more the MR was to blame, at least for 
part of it.

in particular, when I compare with the single parameter case:
  class C a where fc :: a -> a -> ()
  c1 x = let p = fc x in ()
  c2 x = let p y = fc x y in ()
where
  c1 :: C a => a -> ()
  c2 :: C a => a -> ()
is inferred, as I would expect.
The inference steps for this case are much the same except, that the
inferred type for "p" now will be: "a -> ()", provided that we can
solve the constraint "C a".  Because we have assumptions about "a" in
the environment (namely it is mentioned in the type of the varible
"x") we cannot generalize the type of "p".  It therefore remains
monomorphic, and the constraint "C a" is propagated to the type of
"c2".
To be more precise, p is not polymorphic *in the variables mentioned by 
the constraint* - the overall type of p could still be polymorphic, 
without changing the outcome.

My understanding now is as follows: a constraint is captured by a 
declaration if at least one of the type variables mentioned in the 
constraint is generalised in the respective type scheme. Is that a 
correct interpretation?

Of course, this is not the only possible rule. Alternatively, 
generalisation could always capture *all* unresolved constraints. For 
example, the type of p in c2 could be C a => a->() without a being 
quantified. That looks a bit more uniform in the face of MPTCs and would 
allow more programs, because contexts induced by dead code in form of an 
unused declaration could be forgotten consistently, not just when some 
of its free variables happen to be bound by a local quantifier.

--
Andreas Rossberg, [EMAIL PROTECTED]
Let's get rid of those possible thingies!  -- TB
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


[Haskell] ICLP 2005 Doctoral Consortium: Call for Applications

2005-04-26 Thread ICLP 2005


   International Conference on Logic Programming
Doctoral Consortium

 Sitges (Barcelona), Spain
 October 2-5, 2005
  http://www.cs.nmsu.edu/~epontell/DC2005
---


The ICLP Doctoral Consortium (DC) is the first ever doctoral
consortium to be offered as part of the International Conference
on Logic Programming. The DC will take place during ICLP 2005 in
Sitges (Barcelona), Spain. The Doctoral Consortium is designed for
doctoral students working in areas related to logic programming,
who are planning to pursue a career in academia. The Doctoral
Consortium aims to provide students with an opportunity to present
and discuss their research directions and to obtain feedbacks from
peers as well as world-renown experts in the field. The Doctoral
Consortium will also offer invited speakers and panels discussions.

  

The Doctoral Consortium is held the during the regular activities
of the ICLP 2005 Conference. The aims of the Doctoral Consortium
are:
  * To provide doctoral students working in the field of
logic programming with a friendly and open forum to
present their research ideas, listen to ongoing work
from peer students, and receive constructive feedback
  * To provide  students with relevant information about
important issues for doctoral candidates and future
academics
  * To develop a supportive community of scholars and a
spirit of collaborative research.
  * To support a new generation of researchers with information
and advice on academic, research, industrial, and non-
traditional career paths.
The Consortium is designed for students currently enrolled in a Ph.D.
program, though we are also open to exceptions (e.g., students
currently in a Masters program and interested in doctoral studies).
The Consortium is for students at any stage of their doctoral studies
are welcome to apply. Applicants are expected to be conducting research
in the field of Logic Programming; topics of interest include (but
are not limited to):
  * Theoretical Foundations of Logic and Constraint Logic
Programming
  * Sequential and Parallel Implementation Technology
  * Static and Dynamic Analysis, Abstract Interpretation,
Compilation Technology, Verification
  * Logic-based Paradigms (e.g., Answer Set Programming,
Concurrent Logic Programming, Inductive Logic Programming)
  * Innovative Applications of Logic Programming
The Consortium allows participants to interact with established
researchers and with other students, through presentations, question-
answer sessions, panel discussions, and invited presentations. The
Doctoral Consortium will provide the possibility to reflect - through
short activities, information sessions, and discussions - on the
process and lessons of research and life in academia. Each participant
will give a short, critiqued, research presentation.
The Doctoral Consortium will be held on a date to be determined, in
parallel with the regular activities of the ICLP 2005 conference; the
ICLP conference will run from October 2nd to October 5th, 2005. Doctoral
Consortium participants will be offered the opportunity to have their
abstracts published in the ICLP 2005 conference proceedings.

Discussants:
Several renown faculty members and researchers in the field of Logic
Programming will join in evaluating the submission packets and will
participate in the Doctoral Consortium, providing feedback to the
presenters. The list of the discussants will be published at a later
date.

   

Detailed submission instructions can be found in the ICLP 2005
Doctoral Consortium web site, at:

   http://www.cs.nmsu.edu/~epontell/DC2005

   

Important Dates
Submission Deadline:  June 1st, 2005
Acceptance Notification:  July, 1st 2005
Last Date to Update
   Research Summary:  July 15th, 2005
Doctoral Consortium:  October 2-5, 2005
ICLP 2005 Conference: October 2-5, 2005

  

Doctoral Consortium Chair:
Enrico Pontelli
Department of Computer Science
New Mexico State University
MSC CS, Box 30001
Las Cruces, NM 88003, USA
epontell _a_t_ cs.nmsu.edu
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


Re: [Haskell] Re: ANNOUNCE: The jhc Haskell compiler.

2005-04-26 Thread Tony Finch
On Tue, 26 Apr 2005, Ashley Yakeley wrote:
>
> Does that mean my program will be GPL if I compile it with jhc?

No; cf. gcc.

Tony.
-- 
f.a.n.finch  <[EMAIL PROTECTED]>  http://dotat.at/
BISCAY: WEST 5 OR 6 BECOMING VARIABLE 3 OR 4. SHOWERS AT FIRST. MODERATE OR
GOOD.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell


[Haskell] Re: ANNOUNCE: The jhc Haskell compiler.

2005-04-26 Thread Ashley Yakeley
In article <[EMAIL PROTECTED]>,
 John Meacham <[EMAIL PROTECTED]> wrote:

> > Very interesting! What license uses jhc? The COPYING file seems to be empty.
> 
> It is under the GPL. 

Does that mean my program will be GPL if I compile it with jhc?

-- 
Ashley Yakeley, Seattle WA

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