Haskell

Download

haskell@haskell.org

July 2007

46 participants
32 discussions

TTSS 07 CFP
by Huibiao Zhu 05 Jul '07

05 Jul '07

1st International Workshop on Harnessing Theories for Tool Support in Software (TTSS’07) 22-23 September 2007, Macau, China http://www.iist.unu.edu/ttss07 Co-located with ICTAC 2007 The aim of the workshop is to bring together practitioners and researchers from academia, industry and government to present and discuss ideas about: a) How to deal with the complexity of software projects by multi-view modeling and separation of concerns about the design of functionality, interaction, concurrency, and extra-functionality, and b) How to ensure correctness and dependability of software using formal methods and tools of modeling, design, verification and validation into design and development processes and environments The workshop will provide enough time for discussion on problems and research. Each presentation will be 25 minutes followed by 10 minutes discussion. Topics of interest include, but are not limited to, the following areas: • Mathematical frameworks, methods and tools for model-driven development • Models, calculus and tool support for component-based and object-oriented software • rCOS and relational mathematical frameworks of object and component systems and their tool support PAPER SUBMISSION TTSS invites authors to submit original and unpublished work. Submissions should include an abstract, key words, the e-mail address of the corresponding author, and must not exceed 15 pages using ENTCS style. The submission website is http://www.easychair.org/TTSS07 PROCEEDINGS We are talking to ENTCS about the publication of the proceedings, and will consider the publication of a special issue of a journal for selected papers. IMPORTANT DATES • Submission deadline: 15 July, 2007 • Notification of acceptance: 15 August 2007 • Final manuscript due: 1 September 2007 Organized and supported by ECNU and UNU-IIST Program Chairs Geguang Pu ECNU, China Volker Stolz, UNU-IIST, Macau, China Local Organization Chair Volker Stolz, UNU-IIST, Macau, China Program Committee Members Farhad Arbab, CWI, The Netherlands Luis Barbosa, Universidade do Minho, Portugal James C. Browne, UT Austin, US Kung-Kiu Lau, Manchester University, UK Jin Liu, ECNU, China Xiaoshan Li, Macau University, China Markus Lumpe, Iowa State University, USA Zongyan Qiu, Peking University, China Anders P. Ravn, Aalborg University, Denmark Abhik Roychoudhury, NUS, Singapore Bernhard Schätz, TU Munich, Germany Heinrich Schmidt, RMIT University, Australia Meng Sun, CWI, The Netherlands Petr Tuma, Charles University, Czech Republic R. Venkatesh, TATA, India Xu Wang, UNU-IIST, Macau, China Ji Wang, NLPDP, China Naijun Zhan, CAS, China Jianhua Zhao, Naijin University, China Gianluigi Zavattaro, University of Bologna, Italy Advisors Patrick Cousot, ENS, France Jifeng He, ECNU, China Mathai Joseph, TATA, India Zhiming Liu, UNU-IIST, Macau, China Bertrand Meyer, ETH, Switzerland Jim Woodcock, University of York, UK

1 0

Where's the problem ?
by Rome 03 Jul '07

03 Jul '07

Hi everyone, I write a program for fast online multiplication, this means, leading digits are computed first, so this program is able to handle real numbers. My program and Source-Code is available under http://www.romeinf04.de http://www.romeinf04.de but only with german comments, because this is my master thesis. Now the problem: My program computes using the schoenhage-strassen multiüply-subroutine the output everytime only until the 32777th Digit, but then it holds without an error message. Windows Task manager tells me CPU Usage 100% and Memory Allocation is increasing. Profiling told me, the function Algorithm.resultOfMult is using this memory. To compute the 32777th digit, my program needs several digits of the input-numbers including the 32800th. I'm using GHC 6.6.1 with option -O2 to compile. Output is row-wise by an IO-function, calling itself recursively with updated parameters, hte output looks like: dig11 dig21 --> res1 dig12 dig22 --> res2 dig12 dig23 --> res3 . . . and so on If I use the Naive-Multiply-Subroutine, the problem occurs at the 16392th digit. I don't have any idea, where the problem might be... Greetings Roman Please excuse my english writing, I'm from Germany. -- View this message in context: http://www.nabble.com/Where%27s-the-problem---tf4019116.html#a11414756 Sent from the Haskell - Haskell mailing list archive at Nabble.com.

1 1