- Haskell - Haskell.org

DoCon-2.08 announcement
by Serge D. Mechveliani 20 Dec '04

20 Dec '04

Announcement ------------ A Computer Algebra program DoCon-2.08 is released: http://www.botik.ru/~mechvel/ click at docon-2.08 (Russian site), ftp.botik.ru/pub/local/Mechveliani/docon/ (same), http://www.haskell.org/docon/distrib/ (USA site) DoCon-2.08 is a library of Haskell functions and data structures. It is written in an extension of Haskell-98 including multiparametric classes, overlapping instances and `undecidable' instances. It was tested under the Glasgow Haskell system of 6.2.2, under Linux. The main differences to the previous release of 2.06 are: * it is ported to a more recent system ghc-6.2.2, the Manual is revised slightly, * it includes some support for non-commutative polynomials over a commutative ring, * several bugs are fixed. ----------------- Serge Mechveliani mechvel(a)botik.ru

1 0

ICFP 2005 - Call for Papers
by Benjamin Pierce 18 Dec '04

18 Dec '04

[For those who have not been to Estonia, we've collected some reactions from others who have attended meetings there recently. Check out http://www.brics.dk/~danvy/icfp05/Tallinn to see what they've said! -BCP] International Conference on Functional Programming (ICFP 2005) Call for Papers September 26-28, 2005 Tallinn, Estonia Submission deadline: 13 April, 2005 http://www.brics.dk/~danvy/icfp05/ ICFP 2005 seeks original papers on the art and science of functional programming. Submissions are invited on all topics ranging from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects and concurrency. Particular topics of interest include: * Applications and domain-specific languages: Systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems and web programming, XML processing, security. * Foundations: Formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. * Design: Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming. * Implementation: Abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. * Transformation and analysis: Abstract interpretation, partial evaluation, program transformation. * Software-development techniques for functional programming: Design patterns, specification, verification, validation, debugging, test generation, tracing and profiling. * Practice and experience: Functional programming in education and industry. * Functional pearls: Elegant, instructive examples of functional programming. Papers in the last three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. A special issue of the Journal of Functional Programming will highlight selected papers from the meeting. Submission instructions will be available by 1 March, 2005, at http://www.cis.upenn.edu/~bcpierce/icfp05. Important Dates: Submission deadline: 13 April, 2005 On-line response to reviews: 18-19 May, 2005 Author notification: 3 June, 2005 Camera-ready copy: 10 July, 2005 Organizers: Conference Chair: Olivier Danvy (BRICS, University of Aarhus) Program Chair: Benjamin Pierce (University of Pennsylvania) Program Committee: Mariangiola Dezani (Universita di Torino) Mary Fernandez (AT&T Labs) Matthew Flatt (University of Utah) Cedric Fournet (Microsoft Research) Jacques Garrigue (Kyoto University) Jason Hickey (California Institute of Technology) John Hughes (Chalmers University) Johan Jeuring (Utrecht University) Frank Pfenning (Carnegie Mellon University) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (University of Cambridge) Norman Ramsey (Harvard University) Manuel Serrano (INRIA Sophia Antipolis) Peter Thiemann (Universitat Freiburg) Jan Vitek (Purdue University)

1 0

Force evaluation
by Michael Walter 14 Dec '04

14 Dec '04

Hi, is there a way to force the "full" evaluation of a value (unless seq, which only brings the term to WHNF)? In my case, I have an algebraic data type Foo, and I would like to catch the exceptions that will occur during the evaluation of a value of Foo, for something like: foo <- force makeFoo `catch` \e -> defaultFoo Thanks, Michael

7 9

CFP: GMVAG'2005
by Dr. M. Sarfraz 12 Dec '04

12 Dec '04

==================== Apologies for cross posting ==================== Dear Colleague It is my pleasure to invite you to participate in the International Conference on Geometric Modeling, Visualization & Graphics (GMVAG 2005). This conference is holding in conjunction with 8th Joint Conference on Information Sciences (JCIS 2005), JULY 21 - 26, 2005, Salt Lake City, Utah, USA. The GMVAG'05 web site is: http://www.jcis.org/pages/subconference/gmvag/gmvag.aspx. Please visit this site for up-to-date information. You are urged to disseminate the Call for Papers of GMVAG 2005 (attached herewith) within your domain of contact. In addition to the regular conference proceedings, the GMVAG 2005 is also planning to have the followings: · TWO special issues of two distinct well reputed International journals on two different themes from the main topics of GMVAG 2005. · One Edited Book published by a well known publisher. The selection of these papers will be made after the conference, based upon carefully reviewed criteria. The selected papers will be published by their extended versions. Best regards Dr Muhammad Sarfraz GMVAG'2005 - Chair Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi Arabia. Tel: +966-3-860-2763 Fax: +966-3-860-2763 Email: sarfraz(a)kfupm.edu.sa

1 0

PADL 2005: Call for participation (early reg. deadline near)
by Daniel Cabeza Gras 10 Dec '04

10 Dec '04

---------------------------------------------------------------------- Apologies for multiple copies or if you are not interested ---------------------------------------------------------------------- CALL FOR PARTICIPATION * NEW: Provisional Program included * 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 Early registration deadline: ** December 15th ** 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. PROGRAM CHAIRS Manuel Hermenegildo The University of New Mexico AND Universidad Politecnica de Madrid Daniel Cabeza Universidad Politecnica de Madrid PROGRAM COMMITTEE Kenichi Asai Ochanomizu University, Japan Manuel Carro T.U. Madrid, Spain Bart Demoen K.U. Leuven, Belgium Robert Findler The University of Chicago, US John Gallagher Roskilde University, Denmark Hai-Feng Guo University of Nebraska at Omaha, US Gopal Gupta University at Texas at Dallas, US (General Chair) Chris Hankin Imperial College London, UK Joxan Jaffar National U. of Singapore, Singapore Alan Mycroft Cambridge University, UK Gopalan Nadathur U. of Minnesota, US Lee Naish U. of Melbourne, Australia Simon Peyton-Jones Microsoft Research, US John Reppy University of Chicago, US Morten Rhiger Roskilde University, Denmark Francesca Rossi University of Padova, Italy Vitor Santos-Costa U, Federal do Rio de Janeiro, Brazil Terrance Swift S.U. of New York at Stony Brook, US David S. Warren S.U. of New York at Stony Brook, US INVITED SPEAKERS Norman Ramsey Harvard University Saumya Debray The University of Arizona PROVISIONAL PROGRAM Day 1: Monday, Jan 10th, 2005 12:00 - 1:00 : REGISTRATION 1:00 - 1:10 : WELCOME AND OPENING REMARKS 1:10 - 2:10 : Invited talk - Norman Ramsey, Harvard University "Building the World from First Principles: Declarative Machine Descriptions and Compiler Construction" 2:10 - 2:30 : COFFEE BREAK 2:30 - 4:00 : Practical Applications "Character-Based Cladistics and Answer Set Programming" Daniel Brooks, Esra Erdem, James Minett, Donald Ringe "Specializing Narrowing for Timetable Generation: A Case Study" Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frederic Prost "Functional Framework for Sound Synthesis" Jerzy Karczmarczuk 4:00 - 4:30 : COFFEE BREAK 4:30 - 6:30 : Functional Programming "A Full Pattern-based Paradigm for XML Query Processing" Benzaken Véronique, Castagna Giuseppe, Miachon Cédric "Type Class Directives" Bastiaan Heeren, Jurriaan Hage "Improved Fusion for Optimizing Generics" Sjaak Smetsers, Artem Alimarine "The Program Inverter LRinv and its Structure" Masahiko Kawabe, Robert Glueck 8:00 pm : PADL Dinner Day 2: Tuesday, Jan 11th, 2005 8:00 - 9:00 : BREAKFAST 9:00 - 10:00 : Invited talk - Saumya Debray, University of Arizona "Code Compression" 10:00 - 10:30 : COFFEE BREAK 10:30 - 12:00 : Constraint Programming "Solving Constraints on Sets of Spatial Objects" Jesus M. Almendros-Jimenez, Antonio Corral "Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization" James Bailey, Peter Stuckey "Solving Collaborative Fuzzy Agents Problems with CLP(FD)" Susana Munoz-Hernandez, Jose Manuel Gomez-Perez 12:00 - 1:30 : LUNCH BREAK 1:30 - 3:00 : Implementation of Logic Programming Extensions "A Provably Correct Compiler for Efficient Model Checking of Mobile Processes" Ping Yang, Yifei Dong, C.R. Ramakrishnan, Scott A. Smolka "An Ordered Logic Program Solver" Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir "Improving Memory usage in the BEAM" Ricardo Lopes, Vitor Santos-Costa 3:00 - 3:30 : COFFEE BREAK 3:30 - 5:30 : New Language Developments "Role-based Declarative Synchronization for Reconfigurable Systems" Vlad Tanasescu, Pawel Wojciechowski "Towards a More Practical Hybrid Probabilistic Logic Programming Framework" Emad Saad, Enrico Pontelli "Safe Programming with Pointers through Stateful Views" Dengping Zhu, Hongwei Xi "Towards Provably Correct Code Generation via Horn Logical Continuation Semantics" Qian Wang, Gopal Gupta, Michael Leuschel 5:30 : END OF SYMPOSIUM CONTACTS Please visit the conference web site: http://www.unm.edu/~herme/padl05/ for further information. 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/)

1 0

2nd Call for papers: 6th International Workshop on Rule-Based Programming RULE'05
by Horatiu Cirstea 10 Dec '04

10 Dec '04

[Apologies for multiple copies.] 2nd CALL FOR PAPERS RULE'05 6th International Workshop on Rule-Based Programming April 23, 2005 http://rule2005.loria.fr Affiliated to RDP'05, the Federated Conference on Rewriting, Deduction, and Programming. April 19-23, 2005 Nara, Japan Scope: ------ Rule-based programming is currently experiencing a renewed period of growth with the emergence of new concepts and systems that allow a better understanding and better usability. On the theoretical side, after the in-depth study of rewriting concepts during the eighties, the nineties saw the emergence of the general concepts of rewriting logic and of the rewriting calculus. On the practical side, new languages and systems such as ASF+SDF, BURG, CHRS, Claire, ELAN, Maude, and Stratego have shown that rules are a useful programming tool. The practical application of rule-based programming prompts research into the algorithmic complexity and optimization of rule-based programs as well as into the expressivity, semantics and implementation of rule-based languages. The purpose of this workshop is to bring together researchers from the various communities working on rule-based programming to foster fertilisation between theory and practice, as well as to favour the growth of this programming paradigm. The previous editions of the RULE workshop were held in Aachen (2004) and Valencia (2003) during the RDP conference "Rewriting, Deduction and Programming", and Pittsburg (2002), Firenze (2001), and Montreal (2000) during the PLI conference "Principles, Logics, and Implementations of high-level programming languages". See http://rewriting.loria.fr (Item "Venues") for more details about these workshops. We solicit original papers on all topics of rule-based programming, including but not restricted to * Languages for rule-based programming - Expressivity - Semantics - Implementation techniques * Applications of rule-based programming - Analysis of rule-based programs - Programming methods * Environments for rule-based programming - (Partial) Evaluation - Abstract machines for rewriting * Combination of rule-based programming with other paradigms * System descriptions Submission procedure and publication: ------------------------------------- Papers (of at most 15 pages) should be submitted electronically as PostScript or PDF files to one of the program committee chairs: Horatiu Cirstea (Horatiu.Cirstea(a)loria.fr) or Narciso Marti-Oliet (narciso(a)sip.ucm.es) The message should also contain a text-only abstract and author information. Papers should be received by January 31, 2005. ******************************************** Accepted papers will be published in the preliminary proceedings volume, which will be available during the workshop. Publication of the final proceedings in Electronic Notes in Theoretical Computer Science (ENTCS) is anticipated. Workshop organizers: -------------------- Horatiu Cirstea, LORIA & Universite Nancy II, France Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain Program Committee: ------------------ Mark van den Brand (CWI, The Netherlands) Horatiu Cirstea (Co-Chair, LORIA, France) Steven Eker (SRI International, USA) Maribel Fernandez (King's College, UK) Kokichi Futatsugi (JAIST, Japan) Jean-Louis Giavitto (Universite d'Evry Val d'Essone, France) Christian Holzbaur (University of Vienna, Austria) Salvador Lucas (Universidad Politecnica de Valencia, Spain) Narciso Marti-Oliet (Co-Chair, Universidad Complutense de Madrid, Spain) Ugo Montanari (Universita di Pisa, Italy) Eelco Visser (Utrecht University, The Netherlands) Gerd Wagner (Eindhoven University of Technology, The Netherlands) Important dates: ---------------- Deadline for submissions: January 31, 2005 Notification of acceptance: March 8, 2005 Camera-ready papers: March 21, 2005 Workshop: April 23, 2005

1 0

PersistentDocument: A library for dealing with undo and file management in Haskell
by Arjan van IJzendoorn 09 Dec '04

09 Dec '04

Hello all, In our Bayesian network editor Dazzle with a wxHaskell GUI there were two places where we needed to maintain a document that can be saved to disk. And we wanted to have undo (and redo) in both places. Of course, we didn't want to write this functionality twice. After factoring out the common parts the library is so general that it might be useful for others writing editors, too. The library takes care of maintaining a document, keeping track of whether it is dirty (changed w.r.t. disk version), providing save and save as functionality, enabling and disabling menu items, updating the title bar, warning if you try to close a document that is "dirty", dealing with unlimited undo/redo and more. The reason for combining undo/redo and file management is because there is interaction between them. For example, when you save a file, the versions of the document in the undo and redo buffers become "dirty". All in all, it is quite subtle code that you don't want to write time after time. If you are writing some kind of editor and are interested in using the library, check out the (heavily documented) source code at: http://www.cs.uu.nl/~afie/pd09122004.zip The zip contains three files: 1) PersistentDocument.hs: the implementation of what is described above. This module is not dependent on wxHaskell by the way. 2) PDDefaults.hs: default implementations of the call-back functions in wxHaskell 3) PDDemo.hs: a demo application allowing you to edit a list of strings. It uses the two other files and thus supports undo/redo and cool file management for "free". In the demo file you can see how to start it. If you have suggestions for better names, need functions that are not in the interface or you have any other comment, send it to wxhaskell-users(a)lists.sourceforge.net At some point this functionality will be added to the wxHaskell distribution. However, I first want to let other people have a look at it and process their comments. Have fun, Arjan PS: If you want to see what our Dazzle editor looks like, go to http://www.cs.uu.nl/dazzle/

1 0

TLDI'05 Call for Participation
by David Walker 08 Dec '04

08 Dec '04

************************************************************************* * Call for Participation * * * * TLDI'05: Types in Language Design and Implementation * * * * In conjunction with the * * ACM Symposium on Principles of Programming Languages (POPL) 10 * * January 2005 * * Long Beach, CA * * http://www.eecs.harvard.edu/~greg/tldi05 * ************************************************************************* TLDI is a workshop on the role of types in all aspects of language design, compiler construction, and software development. In recent years, type systems and type analyses have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In recognition of the expanding role of types, TLDI'03 expanded on the previous Workshops on Types in Compilation (TIC) to bring together researchers to share new ideas and results in this area. This year the workshop will be January 10th, preceding POPL'05. The workshop will be held at the Hyatt Regency in Long Beach, CA. For registration and other details, please see the POPL'05 web page: http://www.cs.princeton.edu/~dpw/popl/05/ Program: -------------------------------------------------------------- Invited Talk: Evolution of a Safe Type System for C Trevor Jim, AT&T Laboratories The Open Verifier Framework for Foundational Verifiers Bor-Yuh Chang, Adam Chlipala, George Necula, Robert Schneck An Open and Shut Typecase Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich Types for Describing Coordinated Data Structures Michael Ringenburg, Dan Grossman Decideable Subclassing-Bounded Quantification Juan Chen Type Inference for Atomicity Cormac Flanagan, Stephen Freund, Marina Lifshin Grammar-Based Analysis of String Expressions Peter Thiemann Nonlocal Type Inference Adam Chlipala, Leaf Petersen, Robert Harper Automated and Certified Conformance to Responsiveness Policies Joseph Vanderwaart, Karl Crary Type-Based Verification of Assembly Language for Compiler Debugging Bor-Yuh Chang, Adam Chlipala, George Necula, Rober Schneck Non-Interfaerence for a JVM-like Language Gilles Barthe, Tamara Rezk -------------------------------------------------------------- Program chair: Manuel Fähndrich, Microsoft Research Program committee: * Karl Crary (Carnegie Mellon University) * Dominic Duggan (Stevens Institute of Technology) * Cormac Flanagan (University of California at Santa Cruz) * Todd Millstein (University of California at Los Angeles) * Yasuhiko Minamide (University of Tsukuba) * Francois Pottier (INRIA Rocquencourt) * Peter Sewell (Cambridge University) * Carsten Schuermann (Yale University) * David Walker (Princeton University) General chair: Greg Morrisett, Harvard University

1 0

[PAPP2005] Deadline extension
by Frederic Loulergue 07 Dec '04

07 Dec '04

************************ DEADLINE EXTENSION *********************** PAPP 2005 - Second International Workshop on Practical Aspects of High-level Parallel Programming http://papp2005.free.fr part of The International Conference on Computational Science May 22-25, 2005, Atlanta, USA AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Parallel and grid computing are solutions to the increasing need for computing power. High level languages offer a high degree of abstraction which ease the development of complex systems. Being based on formal semantics, it is even possible to certify the correctness of critical parts of the applications. Algorithmic skeletons, parallel extensions of functional languages, such as Haskell and ML, or parallel logic and constraint programming, parallel execution of declarative programs such SQL queries, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. TOPICS We welcome submission of original, unpublished papers in English on topics including: * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel languages design, implementation and optimisation * functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high level parallel libraries * applications in all fields of high-performance computing (using high-level tools) * benchmarks, experiments using such languages and tools PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Springer-Verlag LNCS series, as part of the ICCS proceedings. Papers (PDF file) should be sent together with a short abstract in plain text to loulergue at univ-paris12.fr with subject "[PAPP2005 Workshop] Submission" no later than 20 december 2004. We invite you to submit a full paper of 8 pages (A4), describing new and original results. The submitted paper must be formatted according to the rule of Lecture Notes in Computer Science (LNCS). Submission implies the willingness of at least one of the authors to register and present the paper. An early email with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers should be presented at the workshop and extended and revised versions will be published in a special issue of Parallel and Distributed Computing Practices, provided revisions suggested by the referees are made. IMPORTANT DATES 20 december 2004 Full paper due 31 January 2005 Referee reports and unofficial notification 14 February 2005 Notification 28 Februray 2005 Camera-ready paper due May 2005 Journal version due June 2005 Referee reports July-October 2005 Revision of papers, final notification November 2005 Final paper due PROGRAMME COMMITTEE Marco Aldinucci (CNR/Univ. of Pisa, Italy) Rob Bisseling (Univ. of Utrecht, The Netherlands) Frank Dehne (Griffith Univ., Australia) Alexandros Gerbessiotis (NJIT, USA) Stephen Gilmore (Univ. of Edinburgh, UK) Clemens Grelck (Univ. of Luebeck, Germany) Sergei Gorlatch (Univ. of Muenster, Germany) Isabelle Guérin-Lassous (INRIA, France) Zhenjiang Hu (Univ. of Tokyo, Japan) Frederic Loulergue (Univ. Paris Val de Marne, France) Fethi A. Rabhi (Univ. of New South Wales, Australia) Casiano Rodríguez León (Univ. La Laguna, Spain) CHAIR AND ORGANIZER Dr. Frederic LOULERGUE Laboratory of Algorithms, Complexity and Logic (LACL) University of Paris Val de Marne 61, avenue du General de Gaulle F-94010 CRETEIL - FRANCE

1 0

whereis the lazyness ?
by Fred Nicolier 06 Dec '04

06 Dec '04

I'am a little bit confused by the following error messages : \begin{code} import Array type SignalOf = Array Int funcSignal :: (Num a, Num b) => (Int, Int) -> (a -> b) -> SignalOf b funcSignal b f = listArray b [f (fromIntegral k) | k <- range b] instance (Num a) => Num (SignalOf a) where fromInteger k = funcSignal (minB, maxB) (const i) where minB = (minBound :: Int) + 1 maxB = (maxBound :: Int) - 1 i = fromInteger k \end{code} When testing on ghci -> *Main> let x = 1::SignalOf Int Loading package haskell98 ... linking ... done. *Main> bounds x zsh: segmentation fault (core dumped) ghci infArray.hs Is it not possible to define a really huge array ? Fred

3 4