- Haskell - Haskell.org

Research Associateship in Metaprogramming Languages
by Andrew Pitts 01 Nov '00

01 Nov '00

POSTDOCTORAL RESEARCH ASSOCIATE IN METAPROGRAMMMING LANGUAGES at the UNIVERSITY OF CAMBRIDGE COMPUTER LABORATORY Cambridge, UK We are seeking a postdoctoral Research Associate to work on implementing an exciting new approach to representing, computing and reasoning about syntactical structures that involve variable-binding. START DATE: 1 January 2001, or as soon as possible thereafter. SALARY: 16,775--25,213 GBP per year, depending on age and qualifications. DURATION: 3 years. THE PROJECT: People who create software systems that manipulate syntactical structures (interpreters, compilers, proof checkers, proof assistants, etc) agree that dealing with variable-binding constructs, renaming of bound variables, capture-free substitution, etc, is very often a nightmare. Despite the efforts of many smart people, no clear winner has emerged from the different approaches to this problem that have been proposed so far---name-carrying terms, de Bruijn nameless terms, higher order abstract syntax. We have a new approach to this long-standing problem based on some simple mathematics to do with permuting variables. We think it is very exciting because our way of representing abstract syntax modulo renaming of bound names seems to integrate very well with the inductive data types and pattern-matching facilities of existing functional programming languages commonly used for metaprogramming activities, such as ML or Haskell. Roughly speaking, we are aiming to extend those languages so that the user can write syntax-manipulating code using explicitly named bound variables and be notified by the language's static type system if their code descends below the level of abstraction that identifies pieces of syntax up to renaming bound variables. Can our new approach be implemented efficiently? Does it result in a programming style that's useful for metaprogramming and that aids refining and reasoning about such programs? That's what we aim to find out. The project is called "FreshML: A Fresh Approach to Name Binding in Metaprogramming Languages" and is funded by the UK EPSRC and Microsoft Research. It is led by Andrew Pitts in collaboration with Mike Gordon at the Cambridge University Computer Laboratory and Simon Peyton Jones at the Cambridge Laboratory of Microsoft Research. See the FreshML web page at <www.cl.cam.ac.uk/users/amp12/freshml/> for more details. THE JOB: We are looking for an experienced hacker (in the best sense of the word) to design and implement a new language, FreshML, embodying our new approach to binding. You need to have enough brain-power to understand the FreshML type system and dynamic semantics, and you will have an opportunity to contribute to them---but the main areas where we need your help are in the design of a programming language to embody the type system, an implementation to demonstrate its practicality, and significant examples of its use. You should hold a PhD or equivalent qualification and have experience with the implementation of typed functional programming languages such as ML or Haskell. Experience with systems for machine-assisted reasoning or with programming language theory will be advantageous. THE ENVIRONMENT: You will be based in the Cambridge University Computer Laboratory (currently located in central Cambridge, but which will move to purpose-built accommodation on the west side of the city during late summer 2001). Further details of the Computer Laboratory can be found at <www.cl.cam.ac.uk>. The FreshML project involves the Laboratory's Theory and Semantics research group <www.cl.cam.ac.uk/Research/TSG/> and the Automated Reasoning research group <www.cl.cam.ac.uk/Research/HVG/>. It also involves collaboration with the Programming Principles & Tools group at Microsoft Research Cambridge <research.microsoft.com/ppt/>. HOW TO APPLY: Send a full CV, names of at least two referees, and a brief statement saying how you think you fit the post, what you expect to contribute, and what you hope to get out of the job, to: Ms Caroline Bean Cambridge University Computer Laboratory Pembroke Street Cambridge CB2 3QG, UK email: Caroline.Bean(a)cl.cam.ac.uk tel: +44 1223 334607 fax: +44 1223 334611 ENQUIRIES about this job should be directed to: Andrew Pitts, Cambridge University Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, UK (email: Andrew.Pitts(a)cl.cam.ac.uk, tel: +44 1223 334629). CLOSING DATE FOR APPLICATIONS: 1 December 2000

1 0

<no subject>
by S Dublin 29 Oct '00

29 Oct '00

1 0

MBR'01 Conference
by Lorenzo Magnani 29 Oct '00

29 Oct '00

Please accept our apologies if you receive multiple copies of this call If you want to receive updated information please send your complete address Last updated October 29, 2000 ********************************************************************** MODEL-BASED REASONING: SCIENTIFIC DISCOVERY, TECHNOLOGICAL INNOVATION, VALUES (MBR'01), Pavia, Italy, May 17-19, 2001. ********************************************************************** Up-to date information on the conference will be found at http://philos.unipv.it/courses/progra1.html or http://www.unipv.it/webphilos_lab/courses/progra1.html ********************************************************************** GENERAL INFORMATION >From Thursday 17 to Saturday 19 May 2001 (three days) the International Conference "MODEL-BASED REASONING. SCIENTIFIC DISCOVERY, TECNOLOGICAL INNOVATION, VALUES" will be held at the University of Pavia (near Milan, Italy). PROGRAM The conference will deal with the logical, epistemological, and cognitive aspects of modeling practices employed in scientific discovery and technological innovation, including computational models of such practices. Abduction is widely recognized as a significant reasoning process in discovery whose features are in need of explication. We will solicit papers that examine various forms of model-based reasoning, such as analogical and visual modeling, from philosophical, historical, sociological, psychological, or computational perspectives. We also plan to address the problem of model-based reasoning in ethics reasoning, especially pertaining to science and technology. RELEVANT RESEARCH AREAS We shall call for papers that cover topics from the following list: - abduction - analogical reasoning - causal and counterfactual reasoning in model construction - computational models of model-based reasoning and scientific reasoning - conceptual combination and theory formation - hypothetical and explanatory reasoning - logical analyses that may contribute to our understanding of the issues in model-based reasoning - model-based reasoning in ethics - models and manipulative reasoning - models and technological innovation - thought experimenting - visual, spatial, imagistic modeling, reasoning, and simulation SUBMISSIONS OF PAPERS All submitted papers will be carefully refereed. The precise format of the conference will be fixed after we have an idea of the number of accepted papers. We are thinking in terms of presentations of 40 and 20 minutes. The funding is Italian and US, but we are also looking elsewhere for further financing (and would appreciate any suggestions). A selected subset will be invited for inclusion (subject to refereeing) in a book which will constitute an advanced handbook for scientists and researchers. The book will be published by an international publishing house. Moreover another selected subset will be invited for inclusion (subject to refereeing) in special issues of suitable international Journals. FORMAT Authors must submit three printed copies and an electronic version - formatted in Microsoft Word, RTF, PDF, or Postcript format - of an extended abstract (about 1000 words) not later than November 30, 2000. Please send electronically the extended abstract to the program chair at the address lmagnani(a)cc.gatech.edu in case of problem with the above address please use lorenzo(a)philos.unipv.it or lmagnaniusa(a)netscape.net REGISTRATION AND FURTHER INFORMATION Registration Fees: Before 15 March 2001: Normal: ITL. 300.000 = appr. US$ 155 (EUR 154.93) (to participate in all the activities of the Conference) Students: Free After 15 March 2001: Normal: ITL. 350.000 = appr. US$ 175 (EUR 180.75) (to participate in all the activities of the Conference) Students: Free METHOD OF PAYMENT AND REGISTRATION DEADLINE: Bank (Swift) Transfer to BANCA REGIONALE EUROPEA S.p.A BRANCH PAVIA - Sede SWIFT BREUITM2 301 Bank Code 06906.11301 Acc. n. 520 Dipartimento di Filosofia indicating CONVEGNO INTERNAZIONALE MBR'01 PLEASE REGISTER by email, fax or air mail (before March 15, 2001) by sending PROGRAM CHAIR first and last name, function, institution, full address, phone, fax and email. For information about paper submission and the program that is not available on the web site, please contact the program chair. IMPORTANT DATES Registration deadline............................15 March 2001 Submission deadline..............................30 Nov 2000 Notification of acceptance.....................28 Feb 2001 Final papers (from those selected for publication) due........30 June 2001 Conference....................................17-19 May 2001 PROGRAM CHAIR Lorenzo MAGNANI School of Public Policy and College of Computing Program in Philosophy, Science, & Technology Georgia Institute of Technology, 685 Cherry Street Atlanta, GA, 30332 - 0345, USA Office: 404-894-0950 & 404-385-0884, Home: 404-875-3566 Fax: 404-385-0504 & 404-894-2970 Email: lorenzo.magnani(a)cc.gatech.edu Address in Italy: Department of Philosophy and Computational Philosophy Laboratory University of Pavia, Piazza Botta 6, 27100 Pavia, Italy Office: +39-0382-506283, Home: +39-0383-371067 Fax: +39-0382-23215 Email: lorenzo(a)philos.unipv.it PROGRAM CO-CHAIR Nancy J. NERSESSIAN (Program Co-Chair) Program in Cognitive Science School of Public Policy and College of Computing, Georgia Institute of Technology, Atlanta, USA Email: nancyn(a)cc.gatech.edu PROGRAM CO-CHAIR Kenneth J. KNOESPEL (Program Co-Chair) School of History, Technology, and Society, and Program in Cognitive Science Georgia Institute of Technology, Atlanta, USA Email: kenneth.knoespel(a)hts.gatech.edu PROGRAM COMMITTEE - Ann Bostrom, School of Public Policy, Georgia Institute of Technology, Atlanta, GA, USA - Elena Gagliasso, Department of Philosophical and Epistemological Studies, University of Rome La Sapienza, Rome, ITALY - Dedre Gentner, Psychology Department, Northwestern University, Evanston, IL 60208, USA - Ronald N. Giere, Department of Philosophy, University of Minnesota, MN, USA - Mark L. Johnson, Department of Philosophy, 1295 University of Oregon, Eugene, OR, USA - Kenneth Knoespel, School of History, Technology, and Society, Georgia Institute of Technology, Atlanta, GA, USA - Lorenzo Magnani, Department of Philosophy, University of Pavia, Pavia, ITALY and School of Public Policy and College of Computing, Georgia Institute of Technology, Atlanta, GA, USA - Pat Langley, Adaptive Systems Group, DaimlerChrysler Research & Technology Center, Palo Alto, CA, USA - Nancy J. Nersessian, School of Public Policy and College of Computing, Georgia Institute of Technology, Atlanta, GA, USA - Brian Norton, School of Public Policy, Georgia Institute of Technology, Atlanta, GA, USA - Claudio Pizzi, Department of Philosophy and Social Sciences, University of Siena, Siena, ITALY - Mario Stefanelli, Department of Computer Science, University of Pavia, Pavia, ITALY - Paul Thagard, Department of Philosophy, University of Waterloo, Waterloo, CANADA - Ryan D. Tweney, Bowling Green State University, Bowling Green, OH, USA - Stella Vosniadou, Department of Philosophy and History of Science, Brain and Cognitive Science Division, National and Capodistrian University of Athens, Athens, GREECE. LOCAL ORGANIZING COMMITTEE Riccardo Dossena (riki.dox@libero), Elena Gandini (elegand(a)yahoo.com) Rosella Gennari (gennari(a)hum.uva.nl) Lorenzo Magnani (lmagnani(a)cc.gatech.edu) Massimo Manganaro (triskel(a)worldonline.it) Stefania Pernice (stepernice(a)libero.it) Matteo Piazza (pimat(a)yahoo.com) Giulio Poletti (philosophia(a)libero.it) Stefano Rini (s.rini(a)philos.unipv.it) Andrea Venturi (aventuri@philos.unipv.,it) (Department of Philosophy, University of Pavia, Pavia, Italy), Mario Stefanelli (mstefa(a)ipvstefa.unipv.it) (Department of Computer Science, University of Pavia, Pavia, Italy). IMPORTANT ADDRESSES LORENZO MAGNANI (Conference Chair) School of Public Policy and College of Computing Program in Philosophy, Science, & Technology Georgia Institute of Technology, 685 Cherry Street Atlanta, GA, 30332 - 0345, USA Office: 404-894-9050 & 404-385-0884, Home: 404-875-3566 Fax: 404-385-0504 & 404-894-2970 Email: lorenzo.magnani(a)cc.gatech.edu Address in Italy: Department of Philosophy and Computational Philosophy Laboratory University of Pavia, Piazza Botta 6, 27100 Pavia, Italy Office: +39-0382-506283, Home: +39-0383-371067 Fax: +39-0382-23215 Email: lorenzo(a)philos.unipv.it CONFERENCE SITE: Collegio Ghislieri, Piazza Ghislieri, 27100 PAVIA, Italy, phone +39 0382 22044. The Conference is sponsored by UNIVERSITY OF PAVIA, ITALY GEORGIA INSTITUTE OF TECHNOLOGY, ATLANTA, GA, USA UNIVERSITY OF SIENA, ITALY UNIVERSITY OF ROME "LA SAPIENZA", ITALY, MURST (Ministero dell'Università e della Ricerca Scientifica e Tecnologica), ITALY, CARIPLO (CASSA DI RISPARMIO DELLE PROVINCIE LOMBARDE, MILAN, ITALY) HOW TO REACH PAVIA LINATE Airport: People arriving by plane at LINATE should take the bus to the CENTRAL STATION of Milan (cf below fron this Station to Pavia). In LINATE it could be convenient to take a Taxi because the airport is close to the center of Milan. Moreover, The bus company SGEA offers six runs from LINATE to Pavia at 9.00, 10.00, 12.00 AM and 2.00, 5.00, 8.30 PM. The last stop is Pavia, near the station (see again our updated web page for possible alterations of this time-table) (from Pavia to LINATE six runs at 5,00, 7.45, 10.00 AM, 1.00, 4.00, 6.00 PM) (one hour trip). In Pavia there is only one station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. MALPENSA 2000 and OLD MALPENSA Airports (usually people arrive to Malpensa 2000 and not to OLD MALPENSA): People arriving by plane at MALPENSA 2000 (also called MALPENSA 2000 Terminal 1) or at "old" MALPENSA (now called MALPENSA NORTH but also called Malpensa 2000 Terminal 2) should take the bus to the CENTRAL STATION of Milan. There is also a bus AND A TRAIN from Malpensa 2000 to the NORTH STATION (Piazzale Cadorna) of Milan, in this case from NORTH Station you will have to take the underground MM1 to the Central Station: trains to Pavia leave from Central station). Moreover, the bus company SGEA offers four runs from MALPENSA 2000 to Pavia at 9.00 AM, 1:30 PM, 5.00 PM, and 9:30 PM - from Malpensa North (OLD Malpensa or Malpensa 2000 Terminal 2 5 munutes later) (from Pavia to MALPENSA 2000 and to OLD MALPENSA four runs at 7.00 AM, 11:00 AM, 3.15 PM, and 7:00 PM) (one hour and half trip). The last stop is Pavia, near the station (see again our updated web page for possible alterations of this time-table) In Pavia there is only one station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. There are trains from MILAN (Central Station) to PAVIA and vice Versa about every an hour (routes: MILAN-GENOVA; MILAN-VENTIMIGLIA; MILAN-LA SPEZIA; MILAN-SAVONA; MILAN-SESTRI LEVANTE; MILAN-IMPERIA; MILAN-ALBENGA; Pavia is the first stop only if the train is not slow, that is, if it is not, in ITALIAN, "L", locale). In Pavia there is only one rail station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. ACCOMMODATION The WEB site of the Tourist Office is http://www.systemy.it/pavia/home.html (new! sorry, only in Italian). The email address is info(a)apt.pv.it. When available you will find the whole list of hotels and other information concerning Pavia and its history. See also http://www.itwg.com/ct_00036.asp. In case of accommodation problems remember we will have at our disposal some rooms at special "conference rates" in the Colleges of the University. For further information please contact the Program Chair. As the the conferences dates are very close to summer holidays we recommend making your reservations as early as possible and before March 31, 2000 at the latest. ALL ACCOMMODATIONS (EXCEPT FOR INVITED SPEAKERS) WILL BE PROCESSED BY: Agenzia Viaggi ALOHATOUR Corso Cairoli 11 I - 27100 PAVIA Italy Phone: +39-0382-539565 Fax: +39-0382-539572 +39-0382-539504 email (only to request information): aloha(a)buonviaggio.it (cut here) ********************************************************************** ACCOMMODATION FORM - MBR'01 ---------------------------------------------------------------------- TO BE FAXED: +39-0382-539572 +39-0382-539504 OR MAILED: Agenzia Viaggi ALOHATOUR Corso Cairoli 11 I - 27100 PAVIA Italy email (only to request information): aloha(a)buonviaggio.it ---------------------------------------------------------------------- FILL IN CAPITAL LETTERS, PLEASE LAST NAME:___________________FIRST NAME:_____________Prof./Dr./Mr./Ms. AFFILIATION/UNIVERSITY/DEPT.__________________________________________ STREET:_______________________________________________________________ TOWN:___________________________CODE:_____________COUNTRY:____________ PHONE:__________________FAX:__________________E-MAIL:_________________ TYPE OF TRAVELLING:__________________DATE OF ARRIVAL:_________________ DATE OF DEPARTURE:___________________NUMBER OF NIGHTS:________________ CREDIT CARD NUMBER AND TYPE__________________________ EXPIRATION_____________ (you can also pay by bank transfer and postal order, please see below) ACCOMMODATION INCL. BREAKFAST SINGLE ROOM+BATH. / DOUBLE ROOM+BATH. ***HOTEL EXCELSIOR, Piazza Stazione, PAVIA LIT. 100.000 / LIT. 150.000 ______________ (EUR. 51.64 / EUR. 77.46) ****HOTEL ARISTON, Via Scopoli, PAVIA LIT. 130.000 / LIT. 190.000 +_____________ (EUR. 67.13 / EUR. 98.12) ****HOTEL MODERNO, Viale V. Emanuele, PAVIA LIT. 170.000 / LIT. 230.000 +_____________ (EUR. 87.79 / EUR. 118.78) RESERVATION CHARGE LIT. 25.000 +_______ (EUR. 12.91) TOTAL AMOUNT: =_____________ ACCOMMODATION DEPOSIT: ONE NIGHT LIT......... - _____________ (EUR) ACCOMMODATION BALANCE: LIT......... =_____________ (EUR)........ Hotel Excelsior (from the station walk east) Hotel Moderno (from the station walk north) To reach Hotel Ariston take the bus n. 3 or taxi. ____________________________________________________________________ PLEASE FAX OR MAIL THIS FORM AND PAY BY *CREDIT CARD* BEFORE *15 MARCH 2001* TO: FAX: +39-0382-539572 +39-0382-539504 MAIL ADDRESS: Agenzia Viaggi ALOHATOUR Corso Cairoli 11 I - 27100 PAVIA Italy email (only to request information): aloha(a)buonviaggio.it DATE OF PAYMENT____________YOUR SIGNATURE____________________ ________________________________________________________________________ PLEASE FAX OR MAIL THIS FORM AND PAY BY *BANK TRANSFER* BEFORE *15 MARCH 2001* (fax or mail also a copy of the bank transfer) TO: BANCA REGIONALE EUROPEA S.p.A.BRANCH PAVIA - SedeSWIFT BREUITM2 301Bank Code 6906.11301 Agenzia Viaggi ALOHATOUR S.r.l. Acc.n 19952/4 DATE OF PAYMENT____________YOUR SIGNATURE___________________ ________________________________________________________________________ PLEASE FAX OR MAIL THIS FORM AND PAY BY *POSTAL ORDER* BEFORE* 15 MARCH 2001* (fax or mail also a copy of the postal receipt) TO: Agenzia Viaggi ALOHATOUR Corso Cairoli 11 I - 27100 PAVIA Italy DATE OF PAYMENT______________________YOUR SIGNATURE______________________ _________________________________________________________________________ ALHOATOUR WILL MAIL OR FAX YOU THE RESERVATION VOUCHER ALOHATOUR WILL SATISFY THE REQUESTS AS FAR AS POSSIBLE. IF NOT POSSIBLE, ANOTHER SIMILAR ACCOMMODATION WILL BE ARRANGED.

1 0

Overloaded function and implicit parameter passing
by José Romildo Malaquias 27 Oct '00

27 Oct '00

Hi. While experimenting with the implicit parameter extension to Haskell 98, implemented in GHC 4.08.1 and latest Hugs, I came accross a difference among those implementations regarding overloading functions with implicit parameters. As a test consider the program ------------------------- cut here module Main where class C a where f :: (?env :: Integer) => a -> Integer instance C Integer where f x = ?env + x main = putStrLn (show (f (45::Integer) with ?env = 100)) ------------------------- cut here Hugs accepts this program and outputs 145, as expected. But GHC 4.08.1 refuses to compile it, emitting the message $ ghc -fglasgow-exts Test1.hs -o test1 Test1.hs:7: Unbound implicit parameter `env_rJX :: Integer' arising from use of `env_rJX' at Test1.hs:7 In the first argument of `+', namely `env_rJX' In the right-hand side of an equation for `f': env_rJX + x Compilation had errors Would anybody comment on what is going on with GHC? I am willing to use implicit parameters in the software I am developing, but I have the need to overload functions with implicit parameters. While Hugs is good for development, its performance may rule it out when the final product is ready. So I will need a good Haskell compiler to compile my system. Any comments? Romildo -- Prof. José Romildo Malaquias <romildo(a)iceb.ufop.br> Departamento de Computação Universidade Federal de Ouro Preto Brasil

3 2

class instance with nested types
by Matthias Höchsmann 27 Oct '00

27 Oct '00

Hello, I have the following problem: basic datatypes > type Sequence a = [a] > data Tree a = N a (Forest a) deriving (Ord,Eq,Show) > type Forest a = Sequence (Tree a) i want to construct a class Xy > class Xy s a where > test :: s a -> a and make an instance for list of characters > instance Xy [] Char where > test [a] = a this works, and an instance for a forest and tried something like this > instance ([] Tree) Char where > test x@(N a xs):txs = a I get illegal type errors. Is it possible to use nested types in a class ? Hope you can help me Matthias

3 4

RE: .net and haskell
by Nigel Perry 27 Oct '00

27 Oct '00

At 10:27 am -0700 26/10/00, Simon Peyton-Jones wrote: >| I was reading some .net stuff (ducks) on microsoft, and they >| mentioned haskell as one of the languages someone was >| targetting for it. >| Anyone know anything about this project? > >I know of several stabs in this direction, none completed. > >- There is most of a Java back end for GHC > >- There are various pieces of a C# back end for GHC, > compiling via in intermediate generic OO language > called GOO. Nigel Perry is working on this (actively > I think) This is indeed being worked on. Currently user code compiles (as far as it has been tested) but there is no prelude yet so it doesn't run too well ;-) The code generator was designed for research and supporting scripting, which is a kind way of saying it doesn't produce blazingly fast code. > >- Don Syme and Reuben Thomas are working on a back end for > GHC that compiles to a polymorphically-typed IL for .NET > that is Don's baby. A lot of this works, but it's not complete. > >Maybe others are doing stuff too? It's a pity that there's nothing >that's usable yet, but I hope that'll change. Cheers, Nigel

1 0

RE: .net and haskell
by Simon Peyton-Jones 26 Oct '00

26 Oct '00

| I was reading some .net stuff (ducks) on microsoft, and they | mentioned haskell as one of the languages someone was | targetting for it. | Anyone know anything about this project? I know of several stabs in this direction, none completed. - There is most of a Java back end for GHC - There are various pieces of a C# back end for GHC, compiling via in intermediate generic OO language called GOO. Nigel Perry is working on this (actively I think) - Don Syme and Reuben Thomas are working on a back end for GHC that compiles to a polymorphically-typed IL for .NET that is Don's baby. A lot of this works, but it's not complete. Maybe others are doing stuff too? It's a pity that there's nothing that's usable yet, but I hope that'll change. Simon

1 0

cpp superior to ghc . . .
by George Russell 26 Oct '00

26 Oct '00

Why does the Haskell language not allow "type" declarations to appear in the declaration parts of where and let clauses? I've just been writing a huge functions which requires lots and lots of repetitive internal type annotations (to disambiguate some complicated overloading) but I can't abbreviate them with "type" because they depend on things only in scope inside the function. In the end I abbreviated them with a few #define's but I don't really think it should be that way . . .

4 3

Re: Haskell Programming Environment
by senganb＠ia.nsc.com 25 Oct '00

25 Oct '00

> Hello, > > I'm writing my master thesis. Its subject is 'Haskell Programming > Environment'. It is (or rather will be) an extended text editor working i= > n > graphical (XFree86) environment designed for Haskell programmers. It will= > be > implemented using Fudgets library. > I'm wondering what features would you like to find in such environment. W= > hat > should be neccessary, what would help, what would make writing programs > easier, etc. > I have some concepts, but I would like to hear some suggestions from you. > > Thanks for all answers. a) the ablility to highlight an area of code and get its type (be it a function, or some well-formed chunk of code b) the ability to highlight a function and get its definition in another area (think multiple text editing in vim) c) interaction with hugs/stg-hugs so that just written code can be pasted into a "hugs window" for evaluation. d) Debug mode which automatically adds "deriving show" to all datatypes which are not showable/adds exporting of all Datatypes as non-abstract for use in hugs to just allow things to be tried out. e) Debug mode which invisibly replaces functions such as "fromJust" with error making versions (... fromJust' "the file and line at which I'm invoked" ...) to make it easier to find the cause of the error (fromJust Nothing just comes up with an error telling you that it's fromJust that failed. Last time that happened, I hacked hugs to dump the evaluation stack, from which I guessed which possible fromJusts it could have been). f) Use ghc's .hi file to allow strictness of arguments to appear if you leave the mouse over an argument. g) For bonus points (harder, but really useful when stuck): given an expression, show me (possibly using daVinci) how it gets evaluated: Lazyness behaviour is not always obvious, I'd like to see it. I've been wanting to code one of these myself, but have had no time. Try and see if stg-hugs is useable yet since that would be a much better environment to do it in. Sengan

2 1

group theory. Reply
by S.D.Mechveliani 25 Oct '00

25 Oct '00

Hi, all, To Eric Allen Wohlstadter's (wohlstad(a)cs.ucdavis.edu) : Are there any Haskell libraries or programs related to group theory? I am : taking a class and it seems like Haskell would be a good programming : language for exploring/reasoning about group theory. What I had in mind : was perhaps you could have a function which takes a list(set) and a : function with two arguments(binary operator) and checks to see whether or : not it is a group. I think it might be a fun exercies to write myself but : I'd like to see if it's already been done or what you guys think about it. Marc van Dongen <dongen(a)cs.ucc.ie> writes > I think Sergey Mechveliani's docon (algebraic DOmain CONstructor) > has facilities for that. Have a look at: > > http://www.cs.bell-labs.com/who/wadler/realworld/docon.html Sorry, DoCon (<http://www.botik.ru/pub/local/Mechveliani/docon/2.01/>) really supports the Commutative Rings, but provides almost nothing for the Group theory. For example, for the domain (Integer,Integer) it would set automatically (IsGroup,Yes) for the Additive semigroup and (IsGroup,No) for the Multiplicative semigroup. For the additive case, it would also set the group generator list [(1,0),(0,1)]. In both cases, it would also set cardinality = Infinity. Similar attributes are formed for the constructors of Permutation, Vector, Matrix, Polyninomial, Fraction, ResidueRing. And that is all. It does not provide so far any real algorithmic support for the Group theory, except some operations on permutations. But one may develop the program by adding the needed algorithms and introducing new attributes. : What I had in mind : was perhaps you could have a function which takes a list(set) and a : function with two arguments(binary operator) and checks to see whether or : not it is a group. I think it might be a fun exercies to write myself but : I'd like to see if it's already been done or what you guys think about it. I never programmed this. It looks like some exercise in algorithms. There are also books on the combinatorial group theory, maybe, they say something about efficient procedures for this. Regards, ------------------ Sergey Mechveliani mechvel(a)botik.ru

2 1