- Haskell - Haskell.org

Re: newbie
by Steinitz, Dominic J 12 Mar '01

12 Mar '01

Monads in Haskell use the Kleisli triple definition which is equivalent to the two natural transformations and functor definition (with the appropriate laws) - see Algebraic Theories by Manes. When using the do notation you are effectively working in the Kleisli category generated by the monad. Dominic. edrx(a)inx.com.br on 10/03/2001 10:13:00 To: haskell cc: bcc: Dominic Steinitz Subject: Re: newbie Frank Atanassow wrote: > G Murali wrote (on 09-03-01 00:43 +0000): > > I'm new to this monads stuff.. can you tell me what it is simply ? > > an example would be highly appreciated.. i want it is very very > > simple terms please.. > > A monad on category C is a monoid in the category of endofunctors on C. > > Is that simple enough? ;) > > No? Then see "Using Monads" at http://haskell.org/bookshelf/ > > (Sorry, I just couldn't resist!) Uh-oh. I'm a junior categorist and toposopher and I confess that all my few attempts to understand what Haskell's monads have to do with the categorical notion of a monad have failed more or less miserably. Can someone point me to a relevant paper, or give a quick explanation? Thanks in advance, and sorry for the dumb question, Eduardo Ochs http://angg.twu.net/ edrx(a)inx.com.br _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell ------------------------------------------------------------------------------------------------- 21st century air travel http://www.britishairways.com

1 0

Re: newbie
by Leonid Bouriakovsky 10 Mar '01

10 Mar '01

Perhaps, this paper will help: http://citeseer.nj.nec.com/62964.html >Eduardo Ochs wrote: > >>Frank Atanassow wrote: >> >> A monad on category C is a monoid in the category of endofunctors on C. >> >> Is that simple enough? ;) > >Uh-oh. I'm a junior categorist and toposopher and I confess that all >my few attempts to understand what Haskell's monads have to do with >the categorical notion of a monad have failed more or less miserably. >Can someone point me to a relevant paper, or give a quick explanation?

1 0

Re: newbie
by edrx＠inx.com.br 10 Mar '01

10 Mar '01

Frank Atanassow wrote: > G Murali wrote (on 09-03-01 00:43 +0000): > > I'm new to this monads stuff.. can you tell me what it is simply ? > > an example would be highly appreciated.. i want it is very very > > simple terms please.. > > A monad on category C is a monoid in the category of endofunctors on C. > > Is that simple enough? ;) > > No? Then see "Using Monads" at http://haskell.org/bookshelf/ > > (Sorry, I just couldn't resist!) Uh-oh. I'm a junior categorist and toposopher and I confess that all my few attempts to understand what Haskell's monads have to do with the categorical notion of a monad have failed more or less miserably. Can someone point me to a relevant paper, or give a quick explanation? Thanks in advance, and sorry for the dumb question, Eduardo Ochs http://angg.twu.net/ edrx(a)inx.com.br

1 0

exception handling..
by G Murali 09 Mar '01

09 Mar '01

Hi, Is it possible to do/mimic exception handling in Haskell using monads.. if so can you throw in some pointers on this please.. gmu _________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.

1 0

Interesting application for RandomIOR
by Jan Skibinski 09 Mar '01

09 Mar '01

Well, at least interesting for me ... Thinking a bit about modelling of a standard interpretation of a measurement in Quantum Mechanics I came up with this tiny addendum to module QuantumVector: http://www.numeric-quest.com/haskell/Observation.hs which simulates apparently random choice of an eigenvalue and collapses the state to its corresponding eigenvector. Jan

1 0

newbie
by G Murali 09 Mar '01

09 Mar '01

hi there, I'm new to this monads stuff.. can you tell me what it is simply ? an example would be highly appreciated.. i want it is very very simple terms please.. help please! gmu _________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.

3 2

PEPM'02, Preliminary Call for Papers
by Peter Thiemann 09 Mar '01

09 Mar '01

PRELIMINARY CALL FOR PAPERS 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'02) Portland, Oregon, USA, January 14-15, 2002 (preceding POPL'02) http://www.informatik.uni-freiburg.de/~thiemann/pepm02 Submission deadline: October, 2001 The PEPM'02 workshop will bring together researchers working in the areas of semantics-based program manipulation, partial evaluation, and program generation. The workshop focuses on techniques, supporting theory, and applications of the analysis and manipulation of programs. Technical topics include, but are not limited to: * Program manipulation techniques: transformation, specialization, normalization, reflection, rewriting, run-time code generation, multi-level programming. * Program analysis techniques: abstract interpretation, static analysis, binding-time analysis, attribute grammars, constraints. * Related issues in language design and models of computation: imperative, functional, logical, object-oriented, parallel, distributed, mobile, secure, domain-specific. * Programs as data objects: staging, meta-programming, incremental computation, mobility, tools and techniques, prototyping and debugging. * Applications: systems programming, scientific computing, algorithmics, graphics, security checking, simulation, compiler generation, compiler optimization, decompilation. * Assessment: applicability of program manipulation techniques to particular architectures and language paradigms, scalability, benchmarking, portability. Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of program manipulation in the broadest sense are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair prior to submission. SUBMISSION INFORMATION Papers should be submitted electronically via the workshop's Web page. Exceptionally, submissions may be emailed to the program chair: <URL:mailto:thiemann@informatik.uni-freiburg.de>. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 5000 words, excluding bibliography and figures. Excessively long submissions may be rejected outright. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe work that has not previously been published in a major forum. Authors must indicate if a closely related paper is also being considered for another conference or journal. Proceedings will be published as a technical report at the University of Freiburg. A special issue of the journal "Higher-Order and Symbolic Computation" <URL:http://www.wkap.nl/journals/lasc> is planned afterwards. PROGRAM COMMITTEE Maria Alpuente (Unversity of Valencia, Spain) Evelyn Duesterwald (Hewlett-Packard Labs, USA) Robert Glueck (DIKU, Denmark) Michael Hanus (Christian-Albrecht-University of Kiel, Germany) Zhenjiang Hu (University of Tokyo, Japan) John Hughes (Chalmers Technical University, Sweden) Mark Jones (OGI, USA) Siau-Cheng Khoo (NUS, Singapore) Jakob Rehof (Microsoft Research, USA) Joao Saraiva (University of Minho, Portugal) Ulrik Schultz (University of Aarhus, Denmark) Peter Thiemann (University of Freiburg, Germany, chair) David Walker (CMU, USA)

1 0

FG/MOL 2001 Second CFP
by Ahti Pietarinen 09 Mar '01

09 Mar '01

*********************************************************************** [apologies if you receive this more than once] FGMOL'01 FGMOL'01 FGMOL'01 FGMOL'01 FGMOL'01 FGMOL'01 FGMOL'01 FGMOL'01 FORMAL GRAMMAR/MATHEMATICS OF LANGUAGE CONFERENCE August 10--12, 2001 Helsinki, Finland SECOND CALL FOR PAPERS We are pleased to announce the joint meeting of two conferences: the sixth conferene on Formal Grammar and the seventh on the Mathematics of Language. The joint meeting will be held just prior to the European Summer School in Logic, Language, and Information. AIMS and SCOPE FGMOL'01 provides a forum for the presentation of new and original research on formal grammar and mathematical aspects of language, especially with regard to the application of formal methods to natural language analysis. Themes of interest include, but are not limited to, * formal and computational syntax, semantics, pragmatics, and phonology; * model-theoretic and proof-theoretic methods in linguistics; * constraint-based and resource-sensitive approaches to grammar; * foundational, methodological and architectural issues in grammar. * mathematical properties of linguistic frameworks * theories and models of natural language processing and generation * parsing theory * statistical and quantitative models of language SPECIAL SESSION on MODEL-THEORETIC SYNTAX There will be a special session of invited papers on model-theoretic syntax. The speakers will be Geoffrey K. Pullum (keynote), Patrick Blackburn, James Rogers, and Uwe Moennich. ADDITIONAL INVITED SPEAKERS to be announced. SUBMISSION DETAILS We invite E-MAIL submissions of abstracts for 30-minute papers (including questions, comments, and discussion). A submission should consist of two parts: - an information sheet (in ascii), containing the name of the author(s), affiliation(s), e-mail and postal address(es) and a title; - an abstract, consisting of a description of not more than 5 pages (including figures and references). Abstracts may be either in plain ASCII or in (unix-compatible encoded) postscript, PDF, or DVI. Abstracts can be sent to fgmol(a)cs.indiana.edu ABSTRACT SUBMISSION DEADLINE April 1, 2001 NOTIFICATION OF ACCEPTANCE May 15, 2001 PROCEEDINGS A full version of each accepted paper will be included in the conference proceedings, to be distributed at the conference. Full papers are due June 30, 2001. PROGRAMME COMMITTEE Anne Abeill'e (Paris) Patrick Blackburn (INRIA) Gosse Bouma (Groningen) Mary Dalrymple (Xerox Parc) Nissim Francez (Haifa) Thilo Goetz (IBM) David Johnson (IBM) Mark Johnso (Brown) Aravind Joshi (UPenn) Gerhard J"ager (Utrecht) Ruth Kempson (London) Alain Lecomte (LORIA) Uwe Moennich (T"ubingen) Glyn Morrill (U.P. Catalunya) Michael Moortgat (Utrecht) Owen Rambo (Cogentex) James Rogers (Earlham) Giorgio Satta (Padova) Mark Steedman (Edinburgh) FURTHER INFORMATION Web site for ESSLLI XIII: http://www.helsinki.fi/esslli/ Web site for FGMOL'01 :http://www.cis.upenn.edu/~ircs/mol/mol7.html The organizers: Geert-Jan Kruijff gj(a)cogsci.ed.ac.uk Larry Moss lsm(a)cs.indiana.edu Dick Oehrle oehrle(a)linc.cis.upenn.edu %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%[LaTeX2E Source File]%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentclass{article} \usepackage{tabularx} \setlength{\textwidth}{7in} \setlength{\oddsidemargin}{-.5in} \setlength{\topmargin}{-36pt} \pagestyle{empty} \begin{document} \begin{center} {\em Please Post}\\[.1cm] {\large{\bf Formal Grammar / Mathematics of Language Conference --- FGMOL'01\\ CALL FOR PAPERS}}\\ {August 10--12, 2001}\qquad Helsinki\\ \end{center} \begin{center} \begin{tabular}{@{}p{.27\textwidth}|p{.70\textwidth}@{}} %\small\ixpt\setlength{\baselineskip}{9pt} \footnotesize \begin{flushleft} {\bf Programme Committee} \end{flushleft} \begin{tabular}{l@{}} Anne Abeill\'{e} (Paris) \\ Patrick Blackburn (INRIA) \\ Gosse Bouma (Groningen) \\ Mary Dalrymple (Xerox Parc) \\ Nissim Francez (Haifa)\\ Thilo Goetz (IBM)\\ David Johnson (IBM) \\ Mark Johnson (Brown)\\ Aravind Joshi (UPenn)\\ Gerhard J\"{a}ger (Utrecht)\\ Ruth Kempson (London)\\ Alain Lecomte (LORIA)\\ Uwe M\"{o}nnich (T\"{u}bingen)\\ Glyn Morrill (U.P. Catalunya) \\ Michael Moortgat (Utrecht) \\ Owen Rambow (Cogentex)\\ James Rogers (Earlham) \\ Giorgio Satta (Padova) \\ Mark Steedman (Edinburgh)\\ [12pt] {\bf Organizing Committee}\\ Geert-Jan Kruijff (Prague)\\ Larry Moss (Indiana)\\ Richard Oehrle (Ashford) \end{tabular} \medskip {\bf Important Dates} \smallskip \begin{tabular}{l@{}} Abstracts Due: March 31, 2001\\ Notification: May 15, 2001\\ Final Versions: June 30, 2001\\ Conference: August 10-12, 2001\\ \end{tabular} \medskip {\bf Addresses:\quad} \smallskip \begin{tabular}{l@{}} ESSLLI XIII: \\ \texttt{http://www.helsinki.fi/esslli}\\ FGMOL'01:\\ \texttt{http://www.cis.upenn.edu/\ldots}\\ $\quad$ \texttt{\ldots $^{\sim}$ircs/mol/mol7.html} \end{tabular} & \setlength{\parskip}{2pt} We are pleased to announce the joint meeting of two conferences: the sixth conferene on Formal Grammar and the seventh on the Mathematics of Language. The joint meeting will be held just prior to the European Summer School in Logic, Language, and Information. \medskip {\it Aims And Scope} FGMOL'01 provides a forum for the presentation of new and original research on formal grammar and mathematical aspects of language, especially with regard to the application of formal methods to natural language analysis. Themes of interest include, but are not limited to, \begin{itemize} \setlength{\itemsep}{0pt}\setlength{\parskip}{0pt} \item formal and computational syntax, semantics, pragmatics, and phonology; \item model-theoretic and proof-theoretic methods in linguistics; \item constraint-based and resource-sensitive approaches to grammar; \item foundational, methodological and architectural issues in grammar. \item mathematical properties of linguistic frameworks \item theories and models of natural language processing and generation \item parsing theory \item statistical and quantitative models of language \end{itemize} \noindent We welcome papers from a wide variety of frameworks. \medskip {\it Special session on model-theoretic syntax} Invited speakers for this are Geoffrey K. Pullum (keynote), Patrick Blackburn, James Rogers, and Uwe Moennich. \medskip {\it Additional Invited Speakers} to be announced. \medskip {\it Submission Details} We invite E-MAIL submissions of abstracts for 30-minute papers (including questions, comments, and discussion). A submission should consist of two parts: \begin{itemize} \setlength{\itemsep}{0pt}\setlength{\parskip}{0pt} \item an information sheet (in ascii), containing the name of the author(s), affiliation(s), e-mail and postal address(es) and a title; \item an abstract, consisting of a description of not more than 5 pages (including figures and references). Abstracts may be either in plain ASCII or in (unix-compatible encoded) postscript, PDF, or DVI. \end{itemize} \noindent Abstracts can be sent to {\tt fgmol@cs.indiana.edu} (Larry Moss). \medskip {\it Abstract Submission Deadline} March 31, 2001 {\it Notification of Acceptance} May 15, 2001 {\it Proceedings} A full version of each accepted paper will be included in the conference proceedings, to be distributed at the conference. Full papers are due June 30, 2001. \end{tabular} \end{center} \end{document}

1 0

RE: GHC - Cygwin Installation and also DirectX (fwd)
by Mike Thomas 08 Mar '01

08 Mar '01

> > The exe is 4270K, but I can live with that. > > Even stripped? Woops, sorry. That make it 1869K - a substantial improvement! > (Unfortunately GHC does give you big EXEs, and > fundamentally > will until we get dynamic linking working again; however, I think > I might be > able to improve things drastically even before then by re-enabling object > splitting for the libraries under Windows.) Thanks. Even without this GHC now stands up very well from my perspective. I no longer have an excuse for procrastination! Cheers Mike Thomas.

1 0

RE: Just one question
by Simon Marlow 08 Mar '01

08 Mar '01

Alba Marina Lopez Arguelles writes: > - There's a function in the library Socket called connectTo > and I would > like to know how does it work 'from the inside'. connectTo is in the Socket library, and it is implemented in terms of the lower level primitives from SocketPrim. It takes a hostname and port, and returns a normal Haskell Handle, on which you can use hGetLine and hPutStr as you would with a file or pipe. This is easiest way to open up a connection to a server and communicate with it. > - I also would like to know what does the function readSocket (from > SocketPrim) return. I don't recommend using readSocket. Using the normal Haskell I/O functions with a socket Handle should be enough. Cheers, Simon

1 0