- Haskell - Haskell.org

Second MetaOCaml Workshop: Final CFP
by kswadi＠cs.rice.edu 13 Jun '05

13 Jun '05

FINAL CALL FOR PAPERS (DEADLINE EXTENDED) ========================================= The Second MetaOCaml Workshop http://www.metaocaml.org/workshop05 To be held at GPCE'05 (Wednesday Sep 28, 2005, Tallinn, Estonia) MetaOCaml is a multi-stage extension of the widely used functional programming language OCaml. It provides a generic core for expressing macros, staging, and partial evaluation. As such, it also provides unique support for building aspect weavers in a statically typed setting. The workshop is a forum for discussing experience with using MetaOCaml as well as possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, and implementation of MetaOCaml. The workshop welcomes reports on * novel applications (especially interpreters and aspect weavers), * extensions (macros, new language constructs, offshoring translations), * implementation techniques (compilation, RTCG), support (debugging, profiling), * educational use, * basic theory (staging annotations, static typing, static analysis, environment classifiers, etc). Each submission will be reviewed by at least three members of the Program Committee (PC). The PC will work to provide detailed and constructive comments to the authors. The workshop will only have informal proceedings, and is intended to be close in spirit to the Haskell, ML, and Scheme workshops. Based on author requests and PC decisions, authors will be given either 25-minute or 15-minute slots to present their ideas, either of which will be followed by 15 minutes of questions and discussion. At the end of the workshop, one hour will be allocated to an open discussion to review the outcomes of the meeting, and to discuss future challenges and directions for MetaOCaml. Submission: For uniformity, authors are encouraged to use the latest ACM SIGS conference style file (option 1). We also request that submissions be limited to 12 pages in this style. We ask that papers be submitted in PDF or Postscript forms through the online submission page at http://metaocaml.cs.rice.edu/submit.html. Important Dates: Submission deadline (firm): June 24, 2005 until midnight GMT (Please use online form at http://www.metaocaml.org/workshop05) Notification of acceptance: July 11, 2005 Final versions posted at the workshop sites: October 20, 2005 Registration: Registration for the workshop is part of registering for GPCE'05. The event is co-located with TFP 2005 and ICFP 2005, which already provides housing and transportation information. Program Committee: Cristiano Calcagno Imperial College Rowan Davies University of Western Australia Ralf Hinze Universität Bonn Oleg Kiselyov FNMOC, Monterey, CA, USA Christopher League Long Island University Xavier Leroy INRIA, Paris Emir Pasalic Rice University Jeremy Siek Indiana University, Bloomington Yannis Smaragdakis Georgia Tech Kedar Swadi Rice University (Chair) Walid Taha Rice University Stephanie Weirich University of Pennsylvania Hongwei Xi Boston University

1 0

[ESSLLI2006] Last Call for Courses and Workshop Proposals
by Carlos Areces 13 Jun '05

13 Jun '05

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 18th European Summer School in Logic, Language and Information ESSLLI 2006 31 July - 11 August, 2006, Malaga, Spain http://esslli2006.lcc.uma.es %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% LAST CALL FOR COURSE and WORKSHOP PROPOSALS ******* Deadline: Friday June 17, 2005. ******* --------------------------------------------- (Please distribute as widely as possible) The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. The ESSLLI 2006 Program Committee invites proposals for foundational, introductory, and advanced courses, and for workshops for the 18th annual Summer School on a wide range of timely topics that have demonstrated their relevance in the following fields: - Logic and Language - Logic and Computation - Language and Computation PROPOSAL SUBMISSION: Proposals should be submitted through a web form available at http://www.folli.org/submission.php All proposals should be submitted no later than ******* Friday June 17, 2005. ******* Authors of proposals will be notified of the committee's decision no later than Friday September 23, 2005. Proposers should follow the submission guidelines privided in the full call at http://folli.loria.fr/cfp.txt while preparing their submissions; proposals that deviate cannot be considered. -- Carlos Eduardo Areces INRIA Lorraine INRIA Lorraine. 615, rue du Jardin Botanique 54602 Villers les Nancy Cedex, France phone : +33 (0)3 83 58 17 90 fax : +33 (0)3 83 41 30 79 e-mail : carlos.areces(a)loria.fr www : http://www.loria.fr/~areces visit : http://hylo.loria.fr -> The Hybrid Logic's Home Page

1 0

FSTTCS05
by S. P. Suresh 13 Jun '05

13 Jun '05

Dear Listserv coordinator, Please post the following Call for Papers. Any queries may be sent to fsttcs(a)imsc.res.in. Thanks and best regards, S.P. Suresh for FST&TCS 2005 ---------------------------------------------------------------- The 25th Conference on Foundations of Software Technology and Theoretical Computer Science - FST&TCS 2005 December 15--18, 2005, Hyderabad, INDIA Call for Papers * Important dates: Submission deadline: Abstracts: 17 June 2005 Paper: 24 June 2005 Notification: 19 August 2005 Final Version due: 16 September 2005 * Satellite Workshops: December 12--14, 2005. Algorithms for Networks: coordinated by Amit Kumar (IIT, Delhi) and Aravind Srinivasan (Maryland, USA) Software verification: coordinated by P. Madhusudan (Urbana, USA) and Sriram Rajamani (Microsoft, USA) * Confirmed invited Speakers: Manindra Agrawal, Tom Henzinger, Igor Walukiewicz. * For details see: http://www.fsttcs.org/ ----------------------------------------------------------------

1 0

[ANNOUNCEMENT]: TFP '05: Second Call for Papers
by Kevin Hammond 13 Jun '05

13 Jun '05

[With apologies in advance for any duplication. Kevin] SECOND CALL FOR PAPERS TFP 2005 <http://www.tifp.org/tfp05>: Sixth Symposium on Trends in Functional Programming, September 23rd-24th 2005, Tallinn, Estonia (co-located with ICFP 2005 and GPCE 2005). Deadline for submission of extended abstracts: Friday 8th July 2005 The 2005 Symposium on Trends in Functional Programming (TFP '05) is an international forum for researchers with interests in all aspects of functional programming languages, focusing on providing a broad view of current and future trends in Functional Programming. Previous TFP symposia were held in Munich, Germany in 2004, in Scotland in 2002 and 2003, as successors to the successful series of Scottish Functional Programming Workshops. TFP <http://www.tifp.org/> aims to combine a lively environment for presenting the latest research results with a formal post-symposium refereeing process leading to the publication by Intellect of a high-profile volume containing a selection of the best papers presented at the symposium. A review of a previous TFP proceedings can be found in the July 2003 issue of the Journal of Functional Programming. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. The TFP05 best student paper award (i.e. for the best paper with a student as first author) acknowledges more formally the special attention TFP has for students. The 2004 award was given to Ron van Kesteren for the paper entitled: "Proof Support for General Type Classes". In order to enhance the quality of student submissions, student papers will be given the option of a feedback on their submission to the symposium proceedings. This feedback is intended for authors who are less familiar with a formal publication process and will provide general qualitative feedback on the submission, but will not give a grade or ranking. SCOPE OF THE SYMPOSIUM The Symposium recognises that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five categories of paper. High-quality papers are solicited in any of these categories: RESEARCH PAPERS (leading-edge, previously unpublished research work) POSITION PAPERS (on what new trends should or should not be) PROJECT PAPERS (descriptions of recently started new projects) EVALUATION PAPERS (what lessons can be drawn from a finished project) OVERVIEW PAPERS (summarizing work with respect to a trendy subject) Papers must be original, and not submitted for simultaneous publication in any other forum. They may consider any aspect of functional programming: theoretical, implementation- oriented, or more experience-oriented. Also applications of functional programming techniques to other languages may be considered. Papers on the following subject areas are particularly welcome: o functional programming and security o functional programming and mobility o functional programming applied to global computing o functional languages for embedded systems o telecommunications applications in functional languages o functional GRIDs o validation and verification of functional programs o functional languages for reasoning about imperative/object-oriented programs o interoperability with imperative programming languages o dependently typed functional programming o any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the TFP05 program chair, Marko van Eekelen, marko(a)cs.ru.nl. PROCEEDINGS Acceptance to the symposium will be based upon extended abstracts of at least 6 and at most 10 pages. Accepted abstracts are to be completed to full papers for publication in the proceedings that will be available at the symposium in Tallinn. In addition, we intend to continue the TFP tradition of publishing a high-quality subset of contributions in the Intellect series on Trends in Functional Programming. Revised papers will be refereed after the symposium to the normal standards and a subset of the best papers over all categories will be selected for publication by Intellect. This implies (among other things) that: * the paper is written in English. * the paper is well written. * the topic of the paper should be stated clearly. * the submission should clearly indicate to which paper category it belongs: a research, position, project, evaluation or overview paper; it should also indicate whether the paper is a student paper (i.e. first author a student). * for research papers, the approach to solving the problem should be outlined clearly and a detailed discussion of the solution must be given. * the work is properly compared with relevant related work. * there is an abstract, introduction and conclusion. * for research papers, the conclusion should summarise the problem, the solution, and how the work solves the problem. * papers for the symposium proceedings must adhere to the formatting instructions using the tfp.cls style, as will be provided on the TFP05 site; papers must not exceed 16 pages (papers in some categories may comprise considerably less pages). * papers submitted for publication by Intellect must follow formatting and any other instructions provided by the Program Chair. Papers will be judged on their contribution to the research area, with different criteria applying to different categories of paper, as appropriate. SIGNIFICANT DATES Submission of extended abstracts: Friday 8th July 2005 Notification of acceptance: Friday 22th July 2005 Early registration deadline: Friday 29th July 2005 Submission of full papers: Friday 2nd September 2005 Symposium at Tallinn, Estonia: Friday 23rd-Saturday 24th Sept. 2005 Feedback to student papers: Friday 21st October 2005 (provisional) Submission for formal proceedings: Friday 16th December 2005 (provisional) Notification of acceptance: Friday 10th February 2006 (provisional) Camera-ready version: Friday 10th March 2006 (provisional) ORGANISATION Symposium Chair: Kevin Hammond (University of St. Andrews) Program Chair: Marko van Eekelen (Radboud University Nijmegen, NL) Local Organisation: Tarmo Uustalu (Institute of Cybernetics, Tallinn) Treasurer: Greg Michaelson (Heriot-Watt University, Edinburgh) PROGRAM COMMITTEE: Andrew Butterfield Trinity College Dublin (Ireland) Gaetan Hains Université d'Orleans (France) Therese Hardin Université Paris VI (France) Kevin Hammond St Andrews University (UK) John Hughes Chalmers University (Sweden) Graham Hutton University of Nottingham (UK) Hans-Wolfgang Loidl Ludwig-Maximilians-University Munich (Germany) Rita Loogen Philipps-University Marburg (Germany) Greg Michaelson Heriot-Watt University Edinburgh (UK) John O'Donnell University of Glasgow (UK) Ricardo Peña Universidad Complutense de Madrid (Spain) Rinus Plasmeijer Universitaet Nijmegen (The Netherlands) Claus Reinke University of Kent at Canterbury (UK) Sven Bodo Scholz University of Hertfordshire (UK) Doaitse Swierstra Utrecht University (The Netherlands) Phil Trinder Heriot-Watt University Edinburgh (UK) Tarmo Uustalu Institute of Cybernetics, Tallinn (Estonia) SPONSORS We are actively looking for additional TFP sponsors, who may help to subsidise attendance by research students, for example. If you or your organization might be willing to sponsor TFP, or if you know someone who might be willing to do so, please do not hesitate to contact the Symposium chair: Kevin Hammond. Your students will be grateful!

1 0

[HLPP 2005] Call for participation
by Loulergue Frédéric 11 Jun '05

11 Jun '05

Please accept our apologies in case you receive this information from multiple sources. ************************************************************************ HLPP 2005: Third International workshop on High-level parallel programming and applications Call for participation Monday/Tuesday 4-5 July, 2005 Coventry, United Kingdom Detailed informations: http://hlpp.free.fr ************************************************************************ Parallel and distributed systems are now readily available as their price/performance ratio continues to improve. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Sequential programming has long benefited from high-level programming techniques and tools that have made today's immense range of software economically viable. Two decades of research into high-level parallel and distributed programming have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Grid systems offer a tremendous computing power. Nevertheless, this power is far from being effectively exploited. In addition to technical problems related to portability and access, grid computing needs new programming paradigms. Research on high level programming for meta and grid computing is particularly relevant. This workshop follows HLPP 2001 and HLPP 2003, and is aimed at: - computer science researchers, practitioners, graduate students - scientific computing researchers, practitioners, graduate students - high-performance application developers (e.g. in DBMS, data-mining, parallel model checking, virtual reality) Invited Lecture --------------- Scheduling in dynamic networks Friedhelm Meyer auf der Heide Professor, head of the research group Algorithms and Complexity at the Heinz Nixdorf Institute and of the Computer Science Department of the University of Paderborn Presentations ------------- Experimental Evaluation of BSP Programming Libraries Peter Krusche A Hybrid Shared Memory Execution Model for a Data Parallel Language with I/O Clemens Grelck, Steffen Kuthe and Sven-Bodo Scholz Implementation of Parallel Data Structures in BSML Frederic Gava HirondML: Fair Threads Migrations for Objective Caml Julien Verlaguet and Emmanuel Chailloux Integrating Remote Invocations with Asynchronism and Cooperative Multitasking Noemi Rodriguez and Silvana Rossetto Shared Message Buffering without Intermediate Memory Copy Gagarine Yaikhom Improving Functional Topology Skeletons With Dynamic Channels Jost Berthold and Rita Loogen On Implementing the Farm Skeleton Michael Poldner and Herbert Kuchen High Level Parallel Skeletons for Dynamic Programming Ignacio Pelaez, Francisco Almeida, Daniel Gonzalez Skeletal Parallel Programming with OcamlP3L 2.0 R. Di Cosmo, Z. Li, S. Pelagatti, P. Weis Evaluating computational costs while handling data and control parallelism Sonia Campa Automatic deployment of ASSIST applications using process algebra Marco Aldinucci and Anne Benoit Accepted papers will be published in a special issue of Parallel Processing Letters, World Scientific Publishing (provided revisions suggested by the referees are made). Programme committee ------------------- Rob Bisseling (Univ. of Utrecht, The Netherlands) Murray Cole (Univ. of Edinburgh, UK) Alexandros Gerbessiotis (NJIT, USA) Sergei Gorlatch (Univ. of Muenster, Germany) Gaétan Hains (Univ. of Orléans, France) Zhenjiang Hu (Univ. of Tokyo, Japan) Christoph Kessler (Linköpings Universitet, Sweden) Frédéric Loulergue (Univ. Paris Val de Marne, France) Mauricio Marín (Univ. de Magallanes, Chile) Quentin Miller(Somerville College, Oxford, UK) Andrea Pietracaprina (Univ. of Padova, Italy) Geppino Pucci (Univ. of Padova, Italy) Alexander Tiskin (Univ. of Warwick, UK) Chairs and Organizers --------------------- Alexander Tiskin (Univ. of Warwick, UK) <tiskin@dcs·warwick·ac·uk> Frédéric Loulergue (Univ. Paris Val de Marne, France) <loulergue@univ-paris12·fr> Registration ------------ Participants must register by Thursday 16 June. The workshop fee is 165 GBP (standard) or 95 GBP (student). This includes accommodation and meals. See http://hlpp.free.fr for registration details. Venue ----- The workshop is being held in the Department of Computer Science, University of Warwick, Coventry CV4 7AL, United Kingdom Dates ----- Thursday 16 June 2005: deadline for registration Sunday 3 July 2005: dinner Monday 4 July 2005: presentation of papers dinner Tuesday 5 July 2005: invited lecture by Prof.Dr.F.Meyer auf der Heide presentation of papers workshop ends at noon ************************************************************************

1 0

ICFP 2005 - Accepted papers
by Benjamin Pierce 10 Jun '05

10 Jun '05

The following papers will be presented at the 2005 International Conference on Functional Programming, in Tallinn, Estonia, September 26-28, 2005. For more information: http://www.brics.dk/~danvy/icfp05 Hope to see you there! - Benjamin Pierce ICFP '05 program chair ------------------------------------------------------------------------ ------------- Dynamic Optimization for Functional Reactive Programming using Generalized Algebraic Data Types by Henrik Nilsson Acute: high-level programming language design for distributed computation by Peter Sewell, James J. Leifer, Keith Wansbrough, Francesco Zappa Nardelli, Mair Allen-Williams, Pierre Habouzit, and Viktor Vafeiadis Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Programs by J. Guadalupe Ramos, Josep Silva, German Vidal Monadic Augment and Generalised Short Cut Fusion by Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene A Logical Analysis of Aliasing in Imperative Higher-Order Functions by Martin Berger, Kohei Honda and Nobuko Yoshida An Expressive Language of Signatures by Norman Ramsey, Kathleen Fisher, and Paul Govereau Aspectual Caml: an Aspect-Oriented Functional Language by Hideaki Tatsuzawa, Hidehiko Masuhara and Akinori Yonezawa Witnessing Side-effects by Tachio Terauchi and Alex Aiken Recursive Type Generativity by Derek Dreyer Backtracking, Interleving, and Terminating Monad Transformers (Functional Pearl) by Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry Scrap your Nameplate (Functional Pearl) by James Cheney Qualified types for MLF by Daan Leijen and Andres Loeh PolyAML: A polymorphic aspect-oriented functional programmming language by Daniel S. Dantas, David Walker, Geoffrey Washburn and Stephanie Weirich A Principled Approach to Operating System Construction in Haskell by Thomas Hallgren, Mark P Jones, Rebekah Leslie, Andrew Tolmach Modular Verification of Concurrent Assembly Code with Dynamic Thread Creation and Termination by Xinyu Feng and Zhong Shao Associated Type Synonyms by Manuel M. T. Chakravarty, Gabriele Keller, and Simon Peyton Jones AtomCaml: First-Class Atomicity via Rollback by Michael F. Ringenburg and Dan Grossman Combining Programming with Theorem Proving by Chiyan Chen and Hongwei Xi A Language-based Approach to Functionally Correct Imperative Programming by Edwin Westbrook, Aaron Stump, Ian Wehrman Continuations from Lightweight Stack Inspection or, Passing on Continuation-Passing by Greg Pettyjohn, John Clements, Joe Marshall, Shriram Krishnamurthi, Matthias Felleisen The anatomy of a loop: A story of scope and control by Olin Shivers High-level Views on Low-level Representations by Iavor Diatchki Mark P. Jones Rebekah Leslie A Step-Indexed Model of Substructural State by Amal Ahmed, Matthew Fluet, Greg Morrisett Scrap your boilerplate with class: extensible generic functions by Ralf Laemmel, Simon Peyton Jones Exploring partial type inference for Predicative fragments of System-F by Didier Remy Type Inference, Principal Typings, and Let-Polymorphism for First-Class Mixin Modules by Henning Makholm and J. B. Wells

1 0

FM'05: 2nd Call for Participation
by events-admin＠fmeurope.org 09 Jun '05

09 Jun '05

Second Call for Participation www.csr.ncl.ac.uk/fm05 It is our pleasure to invite you to attend FM'05, the leading international conference for researchers and practitioners in formal methods for the development of computing systems. This year, the conference is being held at the University of Newcastle upon Tyne, UK on 18-22 July. Formal methods continue to have a major impact on systems and software engineering, especially in areas where dependability, security and trust matter. FM'05 aims to publish the latest developments of interest to researchers and practitioners alike. The outstanding programme of tutorials and workshops covers the range from circuit design, through high integrity programming to fault tolerance, architectures and automated reasoning. Wednesday 20th July is a special Industry Day, with a series of invited talks on experiences of formal methods going mainstream. The programme of around 30 research papers, announced in mid-April, will provide an opportunity to get up to date in all these areas and more. Alongside the tutorials, workshops and research symposium, there will be displays of tools, products, research projects and publishers. The Final programme can be downloaded from www.csr.ncl.ac.uk/fm05/downloads/FM05_Programme.pdf. FM'05 is being held in one of England's most dynamic cities, famous for its captivating welcome, and situated at the heart of an historic and beautiful region. There will be plenty of opportunity for informal discussion: social activities include a reception at the Hatton Gallery and conference dinner in Alnwick Castle and Gardens. We look forward to welcoming you to Newcastle in July! John Fitzgerald, General Chair Ian Hayes, Andrzej Tarlecki, Programme Chairs TO REGISTER download a registration form from www.csr.ncl.ac.uk/fm05 or contact the Organiser: Claire Smith, Tel: +44 (0) 191 222 7999 Fax: +44 (0) 191 222 8788 _______________________________________________ events mailing list events(a)fmeurope.org http://www.fmeurope.org/mailman/listinfo/events

1 0

question : updating an array
by mt 07 Jun '05

07 Jun '05

hi everybody, (it's my first post...) here is my problem: say i have a list of values [Values], for each of them, i need to update an array. if each value corresponds to just one cell of the array i could have done something like this : > myValues = [1..100] > myArray = values but for each value, i want to update more than just one cell. for example, the '1' could map to cell1, cell2 and cell3 of the array and the '2' could map to cell2, cell3 and cell4. my question is : how can i represent the array in haskell to do what i've described? i've a lot of values and each one maps to quite a lot of cells. the array will only be updated (a lot of time) then written to disk. (practicaly, each value is a sample position in the R² plane and the result of f :: Value -> Result is spread across many pixels of an image... so f can be understood as a functional image.) thanks a lot, bye, minh thu

1 0

Template Haskell Question: Spliced expr. of type TypeQ
by Eike M. Scholz＠gmx.de 07 Jun '05

07 Jun '05

Hi, maybe someone can help me with this: I was wandering if I could do something similar to Depended Types using Template-Haskell. The documentation of GHC (6.2.2 and 6.4) says that a splice may occur in place of a type, but I get a parse error when I try that. So here is what I did: made a Module Templates: module Templates where expr = [| 1337*7331 |] decl = [d| hello = putStr "Hello\n"|] ty = [t| Int |] and made test file: import Templates $(decl) -- works well (tested with ghci) e = $(expr) -- works also well i :: ($tyr) -- gives a parse error i = 1 I would be really happy if someone knows how to make the last example must be written, or if that works at all. (If not, maybe the Documentation should get updated) and thanks you for reading this posting, anyway. -- Eike

2 1

Strictness question
by Gary Morris 07 Jun '05

07 Jun '05

Hello everyone, I've been playing with implementing the Kocher attacks on RSA in Haskell. For the simplest version, I decided to implement the exponentiation in the same module. However, my initial tests suggest that the times don't have any correlation with the operations being performed. I'm wondering, however, if this is because some of the computation is being delayed until later in the program (when I'm not timing) - if that makes any sense. My code is: {- For a given n, base, val, expt and i, this function computes val ^ 2 and then, if the ith bit of expt is 1, multiplies by base, and returns the result. (All these computations are done mod n.) -} > exptmod' :: Integer -> Integer -> Integer -> Int -> Integer -> Integer > exptmod' n base expt i val | testBit expt i = (val ^ 2) * base `mod` n > | otherwise = val ^ 2 `mod` n {- This function uses exptmod' to compute base ^ expt mod n. Because it folds from the right, it checks bits from keySize down to 0, even though the list comprehension goes the other direction. -} > exptmod :: Integer -> Integer -> Integer -> Int -> Integer > exptmod base expt n keySize = foldr (exptmod' n base expt) 1 [0..keySize] to compute the exponentiation and mods. Later, I time it using: > time :: IO a -> IO (a, Integer) > time act = do time1 <- accuticks > res <- act > time2 <- accuticks > return (res, time2 - time1) > check :: Integer -> IO Integer > check m = do (_,t) <- time (ioexptmod m privkey modulus keySize) > return t > ioexptmod :: Integer -> Integer -> Integer -> Int -> IO Integer > ioexptmod base expt n keySize = return $! exptmod base expt n keySize where accuticks is an interface to the rdtsc op on Windows and to clock_gettime(CLOCK_REALTIME,...) on Linux. My hope was that the use of $! would force it to compute the exponentiation while I was timing -- and the average times are around 30K clock cycles, suggesting that it's doing the work, but I was wondering if it was possible that I was missing something. Thanks, /g -- I'll see you down in Arizona Bay

3 2