January 2004 - Haskell

Re: Use of tab characters in indentation-sensitive code
by Wolfgang Thaller 26 Jan '04

26 Jan '04

Graham Klyne wrote: > I think that compilers should issue a warning when indentation that > determines the scope of a construct is found to contain tab characters. I'd say, when it "is found to contain a mixture of tab and space characters". I have successfully written a lot of Haskell code that uses tabs *exclusively* - in that case, the meaning of the program *doesn't* depend on how the tab characters are interpreted. IMHO, there should only be warnings about tabs when their size makes a difference to the meaning of the program, as shown in the examples below: let <spaces>x = 1 <TAB--->y = 1 -- warning let <TAB--->x = 1 -- OK <TAB--->y = 2 -- OK <spaces>z = 3 -- warning a = let x = 1 y = 2 -- OK in ... b = let x = 1 <TAB--->y = 2 -- warning in ... There are many editors that automatically mix tabs and spaces in indentation (and I don't like that - what's it good for?), but some people will certainly want to continue to use them, so I'm not sure if adding warnings like these would be acceptable to them. Cheers, Wolfgang

12 13

Re: Use of tab characters in indentation-sensitive code
by George Russell 26 Jan '04

26 Jan '04

Graham Klyne wrote (according to Wolfgang Thaller, snipped): > I think that compilers should issue a warning when indentation that > determines the scope of a construct is found to contain tab characters. In an ideal world, TAB characters would never have been put into ASCII, and this would be my preferred solution. However, since there would be some people who would object to such purity, a better alternative might be (a) to allow m TABs followed by n spaces at the start of lines. (b) to denote the indention of the line by the two numbers (m,n). (c) to give an error message when comparing two indentions (m1,n1),(m2,n2) where neither m1<=m2,n1<=n2, nor m1>=m2,n1>=n2. Incidentally Unicode allows far more possibilities for fun with indentation (for example half-spaces, IIRC).

2 1

RE: [Haskell] Re: Use of tab characters in indentation-sensitive code
by Bayley, Alistair 26 Jan '04

26 Jan '04

{-# OPTIONS -tabsize 4 #-} I think it's still a bit of a hack, but at least the author tells you what their tabsize was when they wrote it, so you can recover their layout. You could always pre-process the source yourself with sed, if the compiler doesn't understand the option. > -----Original Message----- > From: Ronan Klyne [mailto:ronan@ninebynine.org] > Sent: 26 January 2004 03:53 > To: The Haskell Mailing List > Subject: [Haskell] Re: Use of tab characters in indentation-sensitive > code > > > I support the idea that somthing should be done. I would like > to suggest > that the compiler references an environment variable to > determine how many > spaces a tab represents. I realise that this would cause the > same code to > run on some systems and fail on others, but it would allow a > developer to > set up a comfortable working system without tab characters > ruining the > logic of a program. > > # r ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. ***************************************************************** ________________________________________________________________________ This email has been scanned for all viruses by the MessageLabs Email Security System. For more information on a proactive email security service working around the clock, around the globe, visit http://www.messagelabs.com ________________________________________________________________________

2 1

Implicit return values
by Ben Rudiak-Gould 26 Jan '04

26 Jan '04

I'm sure we've all used the Writer monad from time to time when we want to yield a value which will propagate up several levels of a recursive call tree "behind the scenes". And we've all been annoyed at having to rewrite the whole function in monadic style. WriterT is less intrusive, but not much so, since we have to pepper the code with calls to "lift". I think there's a better solution. It should be possible to turn the idea of linear implicit parameters upside-down, to get values which are automatically propagated upwards and merged as necessary. We would need a class "Mergeable", a counterpart to "Splittable". But we already have such a class (Monoid). Here's a possible syntax. An expression like (123, ^x = "foo") would have the type (Integer, ^x :: String), which is like a tuple but with all but one of the elements having a name. An expression like (123, ^x="foo") - (45, ^x="bar", ^y="baz") would be converted by the compiler to (123 - 45, ^x=("foo" `mappend` "bar"), ^y="baz"), even if the two values passed to (-) were returned from a recursive call and not written out explicitly as I've done here. These return values could then be extracted by matching against the pattern (a, ^x = b), which would return the value of ^x in b, and the scrutinee with ^x removed in a. The semantics seems very simple -- virtually identical to implicit parameters. Implicit return values are dual to exceptions-as-values in some sense: they use an implicit product return type instead of a sum. It should be possible to implicitly return values which are not instances of Monoid: the compiler errors out if it ever needs to merge such a type. Wouldn't this provide a form of uniqueness typing a la Clean? In fact, couldn't we implement safe state threads on top of this, instead of the ST monad? In fact, couldn't we work within several state threads at once? -- Ben

3 7

CFP: JELIA'04 - 9th European Conference on Logics in Artificial Intelligence
by JELIA'04 25 Jan '04

25 Jan '04

/------------------------------------------------------------------/ CALL FOR PAPERS 9th European Conference on Logics in Artificial Intelligence JELIA'04 Lisbon, Portugal, September 27-30 http://centria.di.fct.unl.pt/~jelia2004 Submission deadline: May 9th (abstracts due May 6th) /------------------------------------------------------------------/ INTRODUCTION Logics have, for many years, laid claim to providing a formal basis for the study and development of applications and systems in Artificial Intelligence. With the depth and maturity of formalisms, methodologies and logic-based systems today, this claim is stronger than ever. The European Conference on Logics in Artificial Intelligence (or Journées Européennes sur la Logique en Intelligence Artificielle - JELIA) began back in 1988, as a workshop, in response to the need for a European forum for the discussion of emerging work in this field. Since then, JELIA has been organised biennially, with English as official language, and with proceedings published in Springer-Verlag's Lecture Notes in Artificial Intelligence. Previous meetings took place in Roscoff, France (1988), Amsterdam, Netherlands (1990), Berlin, Germany (1992), York, U.K. (1994), Évora, Portugal (1996), Dagstuhl, Germany (1998), Málaga, Spain (2000) and Cosenza, Italy (2002). The increasing interest in this forum, its international level with growing participation from researchers outside Europe, and the overall technical quality, has turned JELIA into a major biennial forum for the discussion of logic-based approaches to artificial intelligence. AIM AND SCOPE The aim of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04, is to bring together active researchers interested in all aspects concerning the use of logics in artificial intelligence to discuss current research, results, problems and applications of both a theoretical and practical nature. JELIA strives to foster links and facilitate cross-fertilisation of ideas among researchers from various disciplines, among researchers from academia and industry, and between theoreticians and practitioners. Authors are invited to submit papers presenting original and unpublished research in all areas related to the use of Logics in AI. A non-exhaustive list of topics of interest includes: -Abductive and inductive reasoning -Applications of logic-based systems -Automated reasoning and theorem proving -Computational complexity and expressiveness in AI -Description logics -Foundations of logic programming and knowledge-based systems -Hybrid reasoning systems -Knowledge representation and reasoning -Logic based AI systems -Logic based applications to the Semantic Web -Logic based planning and diagnosis -Logic programming and nonmonotonic reasoning -Logics and multi-agent systems -Logics in machine learning -Modal, temporal, spacial and hybrid logics -Non-classical logics -Nonmonotonic reasoning, belief revision and updates -Reasoning about actions, causal reasoning and causation -Uncertain and probabilistic reasoning SUBMISSIONS Papers should be written in English, formatted according to the Springer LNCS style, and not exceed 13 pages including figures, references, etc. Please refer to the conference web pages for further instructions concerning the submission procedures. IMPORTANT DATES Abstract Submission: May 6th, 2004 Paper Submission: May 9th, 2004 Notification: June 21st, 2004 Camera Ready Copy: July 5th, 2004 PROCEEDINGS Proceedings will be published by Springer-Verlag as a volume of the Lecture Notes on Artificial Intelligence series. It is also foreseen the publication of a special issue of a journal collecting extended versions of selected papers presented at the conference. SYSTEM PRESENTATIONS There will be a special session devoted to the presentation of implemented systems. Please refer to the conference web pages for further information. CONFERENCE OFFICIALS Conference Chair: João Leite, Universidade Nova de Lisboa, Portugal Program Chair: José Júlio Alferes, Universidade Nova de Lisboa, Portugal PROGRAM COMMITTEE -José Júlio Alferes, Universidade Nova de Lisboa, Portugal -Franz Baader, TU Dresden, Germany -Salem Benferhat, Université d'Artois, France -Alexander Bochman, Holon Academic Institute of Technology, Israel -Gerhard Brewka, University of Leipzig, Germany -Walter Carnielli, Universidade Estadual de Campinas, Brazil -Luis Fariñas del Cerro, Université Paul Sabatier, France -James Delgrande, Simon Fraser University, Canada -Jürgen Dix, TU Clausthal, Germany -Roy Dyckhoff, University of St Andrews, UK -Thomas Eiter, TU Wien, Austria -Patrice Enjalbert, Université de Caen, France -Michael Fisher, University of Liverpool, UK -Ulrich Furbach, University Koblenz-Landau, Germany -Michael Gelfond, Texas Tech University, USA -Sergio Greco, Università della Calabria, Italy -João Leite, Universidade Nova de Lisboa, Portugal -Maurizio Lenzerini, Università di Roma "La Sapienza", Italy -Nicola Leone, Università della Calabria, Italy -Vladimir Lifschitz, University of Texas at Austin, USA -Maarten Marx, Universiteit van Amsterdam, The Netherlands -John-Jules Meyer, Universiteit Utrecht, The Netherlands -Bernhard Nebel, Universität Freiburg, Germany -Ilkka Niemelä, Helsinki University of Technology, Finland -Manuel Ojeda-Aciego, Universidad de Málaga, Spain -David Pearce, Universidad Rey Juan Carlos, Spain -Luís Moniz Pereira, Universidade Nova de Lisboa, Portugal -Henry Prakken, Universiteit Utrecht, The Netherlands -Luc de Raedt, Universität Freiburg, Germany -Ken Satoh, National Institute of Informatics, Japan -Renate Schmidt, University of Manchester, UK -Terrance Swift, SUNY at Stony Brook, USA -Mirek Truszczynski, University of Kentucky, USA -Wiebe van der Hoek, University of Liverpool, UK -Toby Walsh, University College Cork, Ireland -Mary-Anne Williams, The University of Technology, Sydney, Australia -Michael Zakharyaschev, King's College, UK CONTACT Send your questions and comments to jelia04(a)di.fct.unl.pt

1 0

ANNOUNCE: lhs2tex-1.9
by Andres Loeh 24 Jan '04

24 Jan '04

lhs2TeX version 1.9 =================== We are pleased to announce the first official release of lhs2TeX, a preprocessor to generate LaTeX code from literate Haskell sources. lhs2TeX includes the following features: * Different styles to process your source file: for instance, "tt" style uses a monospaced font for the code while still allowing you to highlight keywords etc, whereas "poly" style uses proportional fonts for identifiers, handles indentation nicely, is able to replace binary operators by mathematical symbols and take care of complex horizontal alignments. * Formatting directives, which let you customize the way certain tokens in the source code should appear in the processed output. * A liberal parser that can handle most of the language extensions; you don't have to restrict yourself to Haskell 98. * Preprocessor-style conditionals that allow you to generate different versions of a document from a single source file (for instance, a paper and a presentation). * Active documents: you can use Haskell to generate parts of the document (useful for papers on Haskell). * A manual explaining all the important aspects of lhs2TeX. Changes ------- Although development on lhs2TeX has begun as early as 1997, it has never been formally released before. This is a first release that should be mostly compatible to versions that have been inofficially distributed so far. It should compile with the latest GHC versions. Two completely new modes have been added compared to previous versions: "poly" mode is designed to replace the old math mode; the restriction of having only one alignment column per code block is lifted and replaced by a generic mechanism that allows complex layouts; "newcode" is a replacement for the old "code" mode that can handle formatting directives and produces LINE pragmas in the generated code. Requirements and Download ------------------------- A source distribution that should be suitable for Unix-based environments is available from http://www.cs.uu.nl/~andres/lhs2tex/ It has been verified to build on Linux and MacOSX. You need a recent version of GHC (5.04.X or higher should do) to build lhs2TeX, and, of course, you need a TeX distribution to make use of lhs2TeX's output. The program includes a configuration that is suitable for use with LaTeX. In theory, there should be no problem to generate code for other TeX flavors, such as plainTeX or ConTeXt. Happy lhs2TeXing, Ralf Hinze and Andres Loeh ralf(a)informatik.uni-bonn.de lhs2TeX(a)andres-loeh.de

4 5

ANNOUNCE: Cryptographic Library for Haskell
by Dominic Steinitz 24 Jan '04

24 Jan '04

I would like to annouce a new release of the Haskell Cryptographic Library (1.1.2). See http://www.haskell.org/crypto/ReadMe.html for more details. This library collects together existing Haskell cryptographic functions. This release contains MD5 and now works with Hugs (November 2003 version). Dominic Steinitz

1 0

GHC 'hslibs/win32/Win32Spawn.hs' syntax error?
by Graham Klyne 24 Jan '04

24 Jan '04

I think module 'hslibs/win32/Win32Spawn.hs' as shipped with GHC has a syntax error, viz: [[ foreign import "spawnProc" spawnProc :: CString -> Ptr CInt -> Ptr CInt -> Ptr CInt -> IO CInt ]] should be: [[ foreign import ccall "spawnProc" spawnProc :: CString -> Ptr CInt -> Ptr CInt -> Ptr CInt -> IO CInt ]] #g ------------ Graham Klyne For email: http://www.ninebynine.org/#Contact

2 1

Haskell 98 programs
by ru li 24 Jan '04

24 Jan '04

Hi folks I have been doing my project about benchmarking of functional languages at York University. I have got my own implementation of Sets ADT, but I also need some applications which use Sets ADT. If any readers of this mailing list have Haskell 98 programs that make use of a data type for sets, I would be very grateful to have copies of those programs.I would use the programs only as test cases in my student project where their source would be duly acknowledged. Thank you very much Ru _________________________________________________________________ Find a cheaper internet access deal - choose one to suit you. http://www.msn.co.uk/internetaccess

1 0

Haskell 98 programs
by ru li 24 Jan '04

24 Jan '04

Hi folks I have been doing my project about benchmarking of functional languages at York University. I have got my own implementation of Sets ADT, but I also need some applications which use Sets ADT. If any readers of this mailing list have Haskell 98 programs that make use of a data type for sets, I would be very grateful to have copies of those programs.I would use the programs only as test cases in my student project where their source would be duly acknowledged. Thank you very much Ru _________________________________________________________________ Find a cheaper internet access deal - choose one to suit you. http://www.msn.co.uk/internetaccess

1 0