- Haskell - Haskell.org

CFP - PADL'2005 - Deadline Sept. 10
by Manuel Hermenegildo 04 Sep '04

04 Sep '04

************************************************************************* * - PAPER SUBMISSION DEADLINE APPROACHING: *** September 10th! *** * * - BEST PAPER AWARD: A best paper award ($500) will be given to the * * paper judged most innovative and practical. * * - PADL 05 proceedings will be published as Springer Verlag LNCS. * * Past proceedings: LNCS 1551, 1753, 1990, 2257, 2562, and 3057. * ************************************************************************* FINAL CALL FOR PAPERS Seventh International Symposium on Practical Aspects of Declarative Languages 2005 (PADL 05) http://www.unm.edu/~herme/padl05/ Long Beach, California, USA January 10-11, 2005 Co-located with ACM POPL, January 12-14, 2005 Paper submission deadline: September 10th Declarative languages build on sound theoretical foundations to provide attractive frameworks for application development. These languages have been successfully applied to a wide array of different real-world situations, including database management, active networks, software engineering, decision support systems, or music composition. New developments in theory and implementation have opened up new application areas. At the same time, the application of declarative languages to novel problems raises numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications often drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include: * Innovative applications of declarative languages. * Declarative domain-specific languages and applications. * Practical applications of theoretical results. * New language developments and their impact on applications. * Evaluation of implementation techniques on practical applications. * Novel implementation techniques relevant to applications. * Novel uses of declarative languages in the classroom. * Practical experiences. PADL 05 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the first six PADL symposia (past proceedings can be found in Springer Verlag LNCS, numbers 1551, 1753, 1990, 2257, 2562, and 3057). In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL, January 12-14. IMPORTANT DATES Paper Submission: September 10, 2004 Notification: October 10, 2004 Camera-ready: November 10, 2004 Symposium: January 10-11, 2005 SUBMISSION GUIDELINES Authors should submit an electronic copy of the full paper (written in English) in Postscript (Level 2) or PDF. Submission should be completed using the electronic procedure available at the conference website. Papers must be no longer than 15 pages, written in 11-point font and with single spacing. Since the final proceedings will be published as Lecture Notes in Computer Science by Springer Verlag, authors are strongly encouraged to use the LNCS paper formatting guidelines for their submission. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email and postal addresses, telephone and fax numbers, abstract, and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chairs for information on how to submit hard copies. MOST PRACTICAL PAPER AWARD A cash prize of US$500 will be awarded to the submission that is judged by the program committee to be the best in terms of practicality, originality, and clarity of presentation. The program committee may choose not to make an award; or may make multiple awards, in which case the award money will be evenly divided. CONTACTS Please visit the conference web site: http://www.unm.edu/~herme/padl05/ for further information. For additional information about papers and submissions, please contact the Program Chairs: Manuel Hermenegildo (1,2) herme(a)unm.edu, or Daniel Cabeza (2) dcabeza(a)fi.upm.es 1 Departments of Computer Science and Electrical and Computer Engineering The University of New Mexico, Albuquerque, NM 87131, U.S.A. 2 Facultad de Informatica, Universidad Politecnica de Madrid 28660-Boadilla del Monte, Madrid, Spain For additional information about the conference please contact the General Chair: Gopal Gupta Department of Computer Science University at Texas at Dallas, Dallas, TX, U.S.A. gupta(a)utdallas.edu SPONSORED BY: ACM SIGPLAN (applied for), COMPULOG Americas (http://www.cs.nmsu.edu/~complog) The Association for Logic Programming (http://www.cs.kuleuven.ac.be/~dtai/projects/ALP/) -- ----------------------------------------------------------------------------- Manuel Hermenegildo | University of New Mexico, NM, USA Professor, P. of Asturias Chair | Office: ECE 219A Depts. of Computer Science and | Tel: +1 (505) 277 -9328/-3112 Electrical and Computer Engineering | http://www.unm.edu/~herme -----------------------------------------------------------------------------

1 0

APLAS'04: Call for Participation + Posters
by Craciun Mihai Florin Gabriel 03 Sep '04

03 Sep '04

Apology if you receive multiple copies. ------------------------------------------------------------------------------- CALL FOR PARTICIPATION The Second Asian Symposium on Programming Languages and Systems (APLAS 2004) Taipei, Taiwan, November 4-6, 2004 http://www.iis.sinica.edu.tw/Conference/APLAS2004/ Early Registration Ends on Oct. 8, 2004 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ VENUE ===== Institute of Information Science, Academia Sinica Nangang 115, Taipei, Taiwan REGISTRATION FEE ================ General: US$ 250 (early), US$ 275 (late). Student: US$ 150 (early), US$ 175 (late). POSTERS ======= Poster submission remains open until Sept. 10, 2004. Please visit http://www.comp.nus.edu.sg/~aplas/posters.htm PROGRAM ======= Day I : November 4, 2004 8:30-9:30 Invited Talk * A CLP Approach to Modelling Systems Joxan Jaffar (National University of Singapore) 9:30-10:30 Session 1 (Program Transformation) * An Algebraic Approach to Bi-directional Updating Shin-Cheng Mu (University of Tokyo), Zhenjiang Hu (University of Tokyo), and Masato Takeichi (University of Tokyo) * Network Fusion Pascal Fradet (INRIA) and St�phane Hong Tuan Ha (IRISA/INRIA) 11:00-12:30 Session 2 (XML Processing) * Translation of Tree-processing Programs into Stream-processing Programs based on Ordered Linear Type Koichi Kodama (Tokyo Institute of Technology), Kohei Suenaga (University of Tokyo), and Naoki Kobayashi (Tokyo Institute of Technology) * An Implementation of Subtyping among Regular Expression Types Kenny Zhuo Ming Lu (National University of Singapore) and Martin Sulzmann (National University of Singapore) * An Implementation Scheme for XML Transformation Languages through Derivation of Stream Processors Keisuke Nakano (University of Tokyo) 2:00-3:30 Session 3 (Software Safety) * Detecting Discrepancies in Legacy Telecom Applications Through Lightweight Static Analysis: A War Story Tobias Lindahl (Uppsala University) and Konstantinos Sagonas (Uppsala University) * History Effects and Verification Christian Skalka (University of Vermont) and Scott Smith (The Johns Hopkins University) * Controlled Declassification based on Intransitive Noninterference Heiko Mantel (ETH Z�rich) and David Sands (Chalmers University of Technology) 4:00-5:30 Session 4 (Concurrency) * A Concurrent System of Multi-Ported Processes with Causal Dependency Tatsuya Abe (University of Tokyo) * Concurrency Combinators for Declarative Synchronisation Pawel T. Wojciechowski (�cole Polytechnic F�d�rale de Lausanne) * A Uniform Reduction Equivalence of Process Calculi Zining Cao (Peking University) Day II : November 5, 2004 8:30-9:30 Invited Talk * Substructural Operational Semantics and Linear Destination-Passing Style Frank Pfenning (Carnegie Mellon University) 10:00-11:30 Session 5 (Type Systems) * PType System: A Featherweight Parallelizability Detector Dana Na Xu (National University of Singapore), Siau-Cheng Khoo (National University of Singapore), and Zhenjiang Hu (University of Tokyo) * A Type Theory for Krivine-style Evaluation and Compilation Kwanghoon Choi (Japan Advanced Institute of Science and Technology) and Atsushi Ohori (Japan Advanced Institute of Science and Technology) * Region-Based Memory Management for a Dynamically-Typed Language Akihito Nagata (University of Tokyo), Naoki Kobayashi (Tokyo Institute of Technology), and Akinori Yonezawa (University of Tokyo) 11:30-12:30 Session of Posters 2:00-3:30 Session 6 (Program Generation) * Protocol Specialization Matthias Neubauer (Universit�t Freiburg) and Peter Thiemann (Universit�t Freiburg) * Automatic Generation of Editors for Higher-Order Data Structures Peter Achten (Nijmegen University), Marko van Eekelen (Nijmegen University), Rinus Plasmeijer (Nijmegen University), and Arjen van Weelden (Nijmegen University) * A MATLAB-based Code Generator for Sparse Matrix Computations Hideyuki Kawabata (Hiroshima City University), Mutsumi Suzuki (Hiroshima City University), and Toshiaki Kitamura (Hiroshima City University) 4:30-6:00 Session 7 (Foundations) * D-Fusion: a Distinctive Fusion Calculus Michele Boreale (Universit� di Firenze), Maria Grazia Buscemi (Universit� di Pisa), and Ugo Montanari (Universit� di Pisa) * A Functional Language for Logarithmic Space Peter M�ller Neergaard (Brandeis University) * Build, Augment and Destroy, Universally Neil Ghani (University of Leicester), Tarmo Uustalu (Tallinn University of Technology), and Varmo Vene (University of Tartu) * Free Sigma-monoids: a Higher-order Syntax with Metavariables Makoto Hamana (Gunma University) Day III : November 6, 2004 8:30-9:30 Invited Talk * The Scala Experiment -- Can We Provide Better Language Support for Component Systems? Martin Odersky (�cole Polytechnic F�d�rale de Lausanne) 9:30-10:30 Session 8 (Applications) * Pointcuts as Functional Queries Michael Eichberg (Darmstadt University of Technology), Mira Mezini (Darmstadt University of Technology), and Klaus Ostermann (Darmstadt University of Technology) * Formal Design and Verification of Real-Time Embedded Software Pao-Ann Hsiung (National Chung Cheng University) and Shang-Wei Lin (National Chung Cheng University) 11:00-12:30 Session 9 (Objects) * McJava -- A Design and Implementation of Java with Mixin-Types Tetsuo Kamina (University of Tokyo) and Tetsuo Tamai (University of Tokyo) * A Relational Model for Object-Oriented Designs He Jifeng (United Nations University), Zhiming Liu (United Nations University), Xiaoshan Li (University of Macau), and Shengchao Qin (National University of Singapore) * Exploiting Java Objects Behavior for Memory Management and Optimizations Zoe C. H. Yu (University of Hong Kong), Francis C. M. Lau (University of Hong Kong), and Cho-Li Wang (University of Hong Kong) 2:00-6:00 Excursion (Optional) MORE INFORMATION ================ Please visit APLAS 2004 local arrangement web site at http://www.iis.sinica.edu.tw/Conference/APLAS2004/ CONTACT ======= Please send e-mail to APLAS2004(a)iis.sinica.edu.tw -------------------------------------------------------------------------------

1 0

TLCA'05 Second Call for Papers
by Hasegawa Masahito 03 Sep '04

03 Sep '04

Seventh International Conference on Typed Lambda Calculi and Applications (TLCA '05) Nara, Japan 21-23 April 2005 (Colocated with RTA as RDP '05) http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/ SECOND CALL FOR PAPERS ** NEW: INVITED SPEAKERS ** ** IMPORTANT: SUBMISSION DEADLINE 2 NOVEMBER 2004 ** The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed lambda calculi and related systems. The following list of topics is non-exhaustive: * Typed and untyped lambda-calculi as models of computation. * Proof-theory: Natural deduction, sequent calculi, cut elimination and normalization. Propositions as types, linear logic and proof nets. * Types: Subtypes, dependent types, type inference, polymorphism, types for security. * Semantics: Denotational semantics, game semantics, realizability, categorical models. * Programming languages: Foundations of functional and object-oriented programming, proof search, logic programming, type checking. * Implementation: Abstract machines, parallel execution, optimal reduction, program optimization. * Computer-aided reasoning. The programme of TLCA'05 will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series. [http://www.springer.de/comp/lncs/index.html] Invited Speakers: ----------------- Thierry Coquand, Goteborg Amy Felty, Ottawa (joint speaker with RTA) Susumu Hayashi, Kobe Submissions: ------------ The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution: in particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format. An abstract (ASCII text) of no more than 150 words should be sent separately at least a week before the paper submission deadline. All submissions should be sent by e-mail to tlca05(a)mimuw.edu.pl Important dates: ---------------- Authors are required to submit a paper title and a short abstract at least a weak before the paper submission deadline. All deadlines below are at 24:00 Central European time (GMT+1). Titles and abstracts due: October 25, 2004 Paper submission deadline: November 2, 2004 Notification: December 22, 2004 Final versions due: January 31, 2005 Accepted papers should be prepared according to Springer LNCS guidelines as described in http://www.springer.de/comp/lncs/authors.html. Final versions must include all source files. Further information is available from the conference web page http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/ Inquiries concerning submissions and programme should be addressed to tlca05(a)mimuw.edu.pl. Inquiries concerning the conference organization and participation should be sent to tlca05org(a)kurims.kyoto-u.ac.jp TLCA Steering Committee: ------------------------ Samson. Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich TLCA 05 Programme Committee: ---------------------------- Thorsten Altenkirch, University of Nottingham Stefano Berardi, University of Turin Adriana Compagnoni, Stevens Institute of Technology, Hoboken Herman Geuvers, Nijmegen University Andy Gordon, Microsoft Research, Cambridge Fritz Henglein, Copenhagen University Martin Hofmann, LMU Munich Assaf J. Kfoury, Boston University Atsushi Ohori, JAIST, Tatsunokuchi Laurent Regnier, IML Marseille Pawel Urzyczyn, Warsaw University, chair Marek Zaionc, Jagiellonian University, Cracow TLCA 05 Organizing Committee: ----------------------------- Masahito Hasegawa, Kyoto, chair Ryu Hasegawa, Tokyo Mitsu Okada, Keio Masahiko Sato, Kyoto Masako Takahashi, ICU ------------------------------------------------------------------------------

1 0

Announce: HaRP (Haskell Regular Patterns) version 0.2
by Niklas Broberg 01 Sep '04

01 Sep '04

We have released a new version of HaRP. Major updates are: * A revised syntax. * Regular patterns are now non-greedy by default. More information and downloads can be found at http://www.dtek.chalmers.se/~d00nibro/harp/ /Niklas Broberg _________________________________________________________________ Add photos to your e-mail with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

1 0

ANNOUNCE: Zinc Curry Compiler 0.9.1 released
by Diego Berrueta 31 Aug '04

31 Aug '04

I'm glad to announce the new release of the Zinc Curry Compiler. It is still under development, so many features may fail, but it should perform OK with simple programs. The Zinc Compiler is the result of an effort to write an experimental compiler for a version of the Curry functional logic programming language[1], extended with Haskell's type classes. The Zinc project is being developed at the University of Oviedo (Spain) by Diego Berrueta as a final year project, under the direction of Prof. Jose E. Labra. The compiler is written in Haskell, on the top of the Münster Curry Compiler[2]. The current release of the Zinc Compiler is 0.9.1. Sources and instructions can be grabbed from the project web site at http://zinc-project.sourceforge.net/ Any feedback will be greatly appreciated. [1] http://www.informatik.uni-kiel.de/~mh/curry/ [2] http://danae.uni-muenster.de/~lux/curry/ -- ________________ | Diego Berrueta \_______________________ | E-mail: <diego(a)berrueta.net> | | Jabber: berrueta(a)jabber.org | | AsturLiNUX: http://www.asturlinux.org/ | |________________________________________|

1 0

Re: [Haskell] Dependent types, was:2-D Plots, graphical representation of massive data
by MR K P SCHUPKE 31 Aug '04

31 Aug '04

>I think you are confusing Dependent Types with Functional Dependencies. Actually the two are not that dissimilar... If we allow types to depend on types (which is what Functional Dependencies allow) IE: class a b | a -> b instance Int Float instance Float Int For example is really a function on the type level mapping a to b. All that is missing is a way to make types depend on values... which can be done with dictionary passing. Here is an example: class ReifyBool t w where reifyBool :: Prelude.Bool -> t -> w instance (Apply t AllTrue w,Apply t AllFalse w) => ReifyBool t w where reifyBool Prelude.True t = apply t AllTrue reifyBool Prelude.False t = apply t AllFalse The limitation here is that an 'instance' must exist for each possibility in the program, so we are limited to a finite range of values... although we can use type recursion in the class to make the code smaller, we still must have some limit known at compile time, for example Int: class (NotNegative m,NotPositive n) => ReifyNotPositive m t i n w where reifyNotPositive :: Integral i => m -> t -> i -> n -> w instance NotPositive n => ReifyNotPositive Zero t i n w where reifyNotPositive _ _ _ _ = error "Number to be reified exceeds maximum range." instance (NotPositive n,ReifyNotPositive m t i (Pre n) w,Ctrl.Apply t n w) => ReifyNotPositive (Suc m) t i n w where reifyNotPositive (Suc m) t i n | i<0 = reifyNotPositive m t (i+1) (Pre n) | otherwise = Ctrl.apply t n (I appologise if the code is a little verbose, but to avoid mistakes I have cut and pasted from a working project - but you can see the important features)... So by combining reification to a type level representation and functional dependancies we arrive at dependant types... Keean./

1 0

ListMap example
by jeff polakow 31 Aug '04

31 Aug '04

Hello, Why is the following not an arrow? newtype ListMap i o = LM ([i] -> [o] instance Arrow ListMap where pure f = LM (map f) LM f >>> LM g = LM (g . f) first (LM f) = LM ((uncurry zip) . (cross f id) . unzip) thanks, Jeff

2 1

BBEdit syntax highlighting for Haskell
by David Menendez 31 Aug '04

31 Aug '04

If anyone else is using BBEdit 8.0 on the Mac, I've put together a simple language module for highlighting Haskell syntax. <http://www.eyrie.org/~zednenem/sw/bbedit/haskell-syntax.plist> To install, download the file above to ~/Application Support/BBEdit/Language Modules and restart BBEdit. -- David Menendez <zednenem(a)psualum.com> | "In this house, we obey the laws <http://www.eyrie.org/~zednenem> | of thermodynamics!"

1 0

2-D Plots, graphical representation of massive data
by Frédéric Nicolier 29 Aug '04

29 Aug '04

I have done some code in order to interface haskell and octave. It is actually very simple, but it works. The communication between octave and haskell is done via files. I'm planning to change this and use sockets. This file belongs to my project : use haskell for image/signal procesing algorithms. For my opinion, people (in image processing reseach) uses matlab/octave because it allow bad programmers to test new algorithms very easy. Haskell can do better in this task. Fred \begin{code} ----------------------------------------------------------------------------- -- | -- Module : HipsExternal -- Copyright : (c) Fred Nicolier 2004 -- License : GPL -- -- Maintainer : Fred Nicolier -- Stability : experimental -- Portability : portable -- -- Links to external computation engine (octave) -- -- Examples: -- -- >myCos :: Num a => a -> Double -- >myCos x = head.head.octaveFunc $ ["a=" ++ show x, -- > "export(cos(a))"] -- > -- >doubleOct :: Num a => [a] -> [Double] -- >doubleOct list = head.octaveFunc $ ["a=" ++ show list, -- > "export(2*a)"] -- -- >fftOct list -- > = octaveFunc ["s=" ++ show list, -- > "f=fft(s)", -- > "export(real(f),imag(f))"] ----------------------------------------------------------------------------- module HipsExternal (octaveExec, octaveSend, octaveFunc ) where import System import IO import System.IO.Unsafe -- --------------------------------------------------------- -- --------------------------------------------------------- octaveExec :: [String] -> IO String octaveExec cmds = do system ("./octaveshell \"" ++ cmd ++ "\"") readFile "export.dat" where cmd = foldr insertSep "" cmds insertSep a b = a ++ ";" ++ b octaveSend :: [String] -> IO ExitCode octaveSend cmds = do system ("./octaveshell \"" ++ cmd ++ "\" &") where cmd = foldr insertSep "" cmds insertSep a b = a ++ ";" ++ b octaveFunc :: [String] -> [[Double]] octaveFunc = (map $ (map read).words).lines.unsafePerformIO.octaveExec \end{code} octaveshell is just a excutable file containing : \begin{code} #!/bin/sh echo "$*" | octave -qf \end{code} Fred Nicolier ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/

1 0

RE: [Haskell] 2-D Plots, graphical representation of massive data
by Zabiyaka, Yuliya 28 Aug '04

28 Aug '04

>I would like to ask the original poster, who asked first about the >Matlab<->Haskell links >what are her/his *concrete* problems... I have a list of timestamps representing how long it takes a process to finish under different conditions. I also have a summary of the stages that process goes through. It is way too many numbers to make sense of them without some kind of graphical representation. I get all these information out of Haskell simulator. Therefore I would like to be able to do two things in Haskell: 1) analyze the data (mean, std dev etc) - that's the easy part and I more or less know how to do it in Haskell 2) display result of the analysis (pie charts, histograms, plots) Yulia

7 8