- Haskell - Haskell.org

Announcement: Yogurt, a MUD client library
by Martijn van Steenbergen 29 May '08

29 May '08

Hello all, The past weeks I've been working on Yogurt, which as far as I know is the first MUD client for Haskell. It's terminal-based and relies on your terminal for input, output and stuff like ANSI colors. It allows you to set up hooks that listen for specific messages, either from local to remote or vice versa (a generalization of aliases and triggers). Together with variables and timers, this should satisfy the basic scripting needs. It's up for download on hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Yogurt If you play any MUDs, go give Yogurt a try! I'd love to hear your comments, suggestions and experiences. Below is a small program which connects to a MUD and demonstrates some examples. Run it with runhaskell. Kind regards, Martijn van Steenbergen. --- {-# OPTIONS_GHC -fglasgow-exts #-} module Main where import Network.Yogurt import Network.Yogurt.Utils import Data.Char main :: IO () main = connect "eclipse.cs.pdx.edu" 7680 newmoon newmoon :: Mud () newmoon = do -- Automatically log in. mkTriggerOnce "^Enter your name:" $ do sendln "username" sendln "password" -- Sound bell everytime someone sends you a tell. mkTrigger "tells you: " (echo "\BEL") -- Send return every 5 minutes to keep connection alive. -- Most MUDs don't appreciate this. :-) mkTimer 300000 (sendln "") -- Count the number of occurrences of the word "quiet". vQuiet <- mkVar 0 mkTrigger "quiet" $ modifyVar vQuiet (+ 1) mkCommand "quiet" $ readVar vQuiet >>= echoln . show -- Show all currently installed hooks. mkCommand "lshooks" $ do allHooks >>= echoln . unlines . map show -- We can do fun stuff with recursive monads: mkCommand "go" $ mdo t <- mkTimerOnce 1000 (echoln "hello!" >> rmHook h) h <- mkCommand "stop" (rmTimer t >> rmHook h) -- Use semicolons to split commands: mkPrioHook 10 Remote ";" $ do before >>= matchMoreOn . (++ "\n") after >>= matchMoreOn' -- Allow runtime system commands: mkHook Remote "^system (.*)" (group 1 >>= system) -- Speedwalks. For example, 6n expands to n;n;n;n;n;n. mkHook Remote "^[0-9]+[neswud]$" $ do (n, dir) <- fmap (span isDigit) (group 0) sequence $ replicate (read n) (sendln dir) return ()

1 0

ANN: SmallCheck 0.4
by Colin Runciman 27 May '08

27 May '08

SmallCheck 0.4: another lightweight testing library in Haskell -------------------------------------------------------------- A new version of SmallCheck can be obtained from: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/smallcheck or alternatively from http://www.cs.york.ac.uk/fp/smallcheck0.4.tar The difference from 0.3 is that module SmallCheck is now Test.SmallCheck and has been cabal-packaged. SmallCheck is similar to QuickCheck (Claessen and Hughes 2000-) but instead of testing for a sample of randomly generated values, SmallCheck tests properties for all the finitely many values up to some depth, progressively increasing the depth used. Folk-law: if there is any case in which a program fails, there is almost always a simple one. Corollary: if a program does not fail in any simple case, it almost never fails. Other possible sales pitches: * write test generators for your own types more easily * be sure any counter-examples found are minimal * write properties using existentials as well as universals * establish complete coverage of a defined test-space * display counter-examples of functional type Comments and suggestions welcome. Colin Runciman

1 0

ML Workshop 2008: 2nd call for papers
by Eijiro Sumii 27 May '08

27 May '08

********************************************************************** News: The submission web site is now online. ********************************************************************** CALL FOR PAPERS The 2008 ACM SIGPLAN Workshop on ML Sunday, September 21, 2008 Victoria, British Columbia, Canada To be held in conjunction with ICFP 2008 http://www.kb.ecei.tohoku.ac.jp/ml2008/ IMPORTANT DATES: Submission deadline: Monday, June 23, 2008 Notification of acceptance: Friday, July 18, 2008 Final revision due: Monday, July 28, 2008 Workshop: Sunday, September 21, 2008 GOALS OF THE WORKSHOP: ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to build on previous occasions (recent instances are ML 2005 in Tallinn, Estonia, 2006 in Portland, Oregon, and 2007 in Freiburg, Germany), providing a forum to encourage discussion and research on ML and related technology. The 2008 Workshop on ML will be held in conjunction with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) in Victoria, British Columbia, Canada on Sunday, September 21, 2008. This year we extend the scope of the workshop from ML itself to technologies closely related to ML (higher-order, typed, or strict languages) and invite high-quality papers in all areas of crucial importance for the future of ML. SUBMISSION GUIDELINES: We seek papers on topics related to ML, including (but not limited to): * applications * extensions: objects, classes, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems (static and dynamic): inference, effects, overloading, error reporting, contracts, specifications and assertions, etc. * implementation: compilers, interpreters, partial evaluators, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics Submitted papers should describe new ideas, experimental results, ML-related projects, or informed positions regarding proposals for next-generation ML languages. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. All paper submissions must be at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (9pt): http://www.acm.org/sigs/sigplan/authorInformation.htm Accepted papers will be published by the ACM and will appear in the ACM Digital Library. The submission web site is now online. Visit http://www.easychair.org/conferences?conf=ml2008 and follow the instructions. PROGRAM CHAIR: Eijiro Sumii (Tohoku University) PROGRAM COMMITTEE: Sylvain Conchon (Paris-Sud University / INRIA Saclay-Ile-de-France) Karl Crary (Carnegie Mellon University) Andrzej Filinski (DIKU) Robby Findler (The University of Chicago) Cormac Flanagan (University of California at Santa Cruz) Alain Frisch (LexiFi) Dan Grossman (University of Washington) Didier Remy (INRIA Paris-Rocquencourt) Claudio Russo (Microsoft Research Cambridge) Eijiro Sumii (Tohoku University) Hongwei Xi (Boston University)

1 0

SAS 2008 - Call for participation
by German Vidal 26 May '08

26 May '08

****************************************************************** Call for Participation SAS - LOPSTR - PPDP - PLID 2008 http://www.dsic.upv.es/~slp2008/ Valencia, Spain ****************************************************************** IMPORTANT DATES: Early registration: June 10, 2008 ****************************************************************** SAS 2008, July 16-18 Static Analysis Symposium http://www.dsic.upv.es/~sas2008/ LOPSTR 2008, July 17-18 Symposium on Logic-Based Program Synthesis and Transformation http://www.informatik.uni-kiel.de/%7Emh/lopstr08/ PPDP 2008, July 15-17 ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www.clip.dia.fi.upm.es/Conferences/PPDP08/ PLID 2008, July 15 Workshop on Programming Language Interference and Dependence http://www.clip.dia.fi.upm.es/Conferences/PLID08/home.php *** REGISTRATION Please register online at http://www.dsic.upv.es/~slp2008/ The early registration deadline is June 10, 2008. ******************************************************************

1 0

PLID'08 - Last Call for Contributions
by Samir Genaim 26 May '08

26 May '08

********************************************************* * The Fourth International Workshop * * on * * Programming Language Interference and Dependence * * * * co-located with LOPSTR'08, PPDP'08 and SAS'08 * * * * 15 July, 2008, Valencia, Spain * * * * Venue: The Technical University of Valencia * * * * Last Call for Contributions * * * * http://www.clip.dia.fi.upm.es/Conferences/PLID08 * * * ********************************************************* Important Dates =============== Expression of interest June 1, 2008 Extended abstract June 15, 2008 Workshop July 15, 2008 Early Registration June 10, 2008 Workshop Description ==================== Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. Topics of interest include but are not limited to: * Security against unwanted interference and dependence * Models and theories of program interference * Algorithms for reducing or removing interference or for ameliorating its effects * Theory and foundations of program slicing and related dependence analyses * Resource declassification theories * Semantics of dependence and interference * Analyses based on interference and dependence * Abstract interpretation for dependence and interference * Dependence and interference in specifications * Slicing models and specifications * Interaction between dependence and refinement Keynote Speaker =============== Gilles Barthe, IMDEA-software (Madrid, Spain) Submission ========== The workshop welcomes contributions of on-going work and ideas in the field of dependence and interference. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your expression of interest to Samir Genaim (samir at clip.dia.fi.upm.es) before June 1st, 2008. There will be no formal publication of papers. A web-page will be organised collecting all the workshop contributions. Submitted extended abstracts should be of at most 10 pages LNCS-style and should be sent before June 15th 2008. Program Committee ================= David Clark Kings College, London, UK Sebastian Danicic University of London, UK Samir Genaim (chair) Technical University of Madrid, Spain Roberto Giacobazzi University of Verona, Italy Daniele Gorla University of Roma, Italy Sebastian Hunt City University, London, UK Herbert Wiklicky Imperial College, London, UK Steve Zdancewic University of Pennsylvania, USA Local organization chair ======================== Christophe Joubert Technical University of Valencia / DSIC

1 0

MSFP 2008: call for participation
by Conor McBride 25 May '08

25 May '08

+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*-> 2nd Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING +*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*-> 6 July 2008 Reykjavik, Iceland co-located with ICALP 2008 http://msfp.org.uk Call for Participation **early workshop registration ends 5 June** registration via http://www.ru.is/icalp08/ The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. INVITED SPEAKERS *Andrej Bauer* (http://andrej.com/) of the Faculty of Mathematics and Physics, University of Ljubljana, the Institute of Mathematics, Physics and Mechanics, Slovenia, and the Mathematics and Computation weblog (http:// math.andrej.com/) *Dan Piponi* (http://homepage.mac.com/sigfpe/) of Industrial Light and Magic, Academy Award winner, and author of the weblog A Neighbourhood of Infinity (http:// sigfpe.blogspot.com/) ACCEPTED PAPERS (to appear in ENTCS) A Partial Type Checking Algorithm for System U Andreas Abel and Thorsten Altenkirch What is a Categorical Model of Arrows? Robert Atkey Yet another implementation of attribute evaluation Eric Badouel, Bernard Fotsing, and Rodrigue Tchougong Algebraic Specialization of Generic Functions for Recursive Types Alcino Cunha and Hugo Pacheco Modularity and Implementation of Mathematical Operational Semantics Mauro Jaskelioff, Neil Ghani, and Graham Hutton Idioms are oblivious, arrows are meticulous, monads are promiscuous Sam Lindley, Jeremy Yallop, and Philip Wadler Simulating Finite Eilenberg Machines with a Reactive Engine Benoit Razet The recursion scheme from the cofree recursive comonad Tarmo Uustalu and Varmo Vene PROGRAMME COMMITTEE Yves Bertot, INRIA, Sophia-Antipolis Venanzio Capretta (co-chair), Radboud University, Nijmegen Jacques Carette, McMaster University, Ontario Thierry Coquand, Chalmers University, Göteborg Andrzej Filinski, Københavns Universitet Jean-Christophe Filliâtre, LRI, Université Paris Sud Jeremy Gibbons, Oxford University Andy Gill, Galois Peter Hancock, University of Nottingham Oleg Kiselyov, FNMOC Paul Blain Levy, University of Birmingham Andres Löh, Utrecht University Marino Miculan, Università di Udine Conor McBride (co-chair), Alta Systems, Northern Ireland James McKinna, Radboud University, Nijmegen Alex Simpson, University of Edinburgh Tarmo Uustalu, Institute of Cybernetics, Tallinn We're delighted to be able to present such a strong line-up of invited and contributed talks, and we warmly invite you to come and enjoy the fun. Early workshop registration closes on 5 June, and Iceland gets busy in the summer, so do book now to avoid disappointment. Looking forward to seeing you in Iceland Venanzio Capretta Conor McBride

1 0

EUROPEAN MASTERS PROGRAM IN COMPUTATIONAL LOGIC
by Janis Voigtlaender 23 May '08

23 May '08

*** EUROPEAN MASTERS PROGRAM IN COMPUTATIONAL LOGIC *** european.computational-logic.org/ The European Masters Program in Computational Logic is a distributed MSc program which is offered by the following universities: * Universidade Nova de Lisboa, Portugal * Free University of Bozen-Bolzano, Italy * Technische Universitaet Dresden, Germany * Technische Universitaet Wien, Austria * Universidad Politecnica de Madrid, Spain Students select two out of the five partner universities, study for one year at each of the selected universities and will receive a double MSc-degree from the selected universities. NEXT APPLICATION DEADLINES: - 31 May 2008: deadline for all European and non-European students (notification of acceptance: 15 July 2008) SCHOLARSHIPS & MONEY SUPPORT: There will be 12 consortium scholarships to waive one year's tuition fee of 3.000 € for students who newly enroll in the winter semester 2008 and do not receive any other scholarship. These scholarships will be given on the basis of academic merit. Every year 10 EMCL students with European citizenship can visit Australia (Canberra, Sydney, Melbourne or Brisbane) up to 3 months to work on a research project, sponsored by the European Master. The study period in Australia is part of the study programme and it is fully recognised by the European Master's Program in Computational Logic. The guaranteed scholarship is of 3,100 € and it covers the travel and living expenses in Australia. APPLICATION: Check this web page for detailed info on applications: http://european.computational-logic.org/ THE STUDY PROGRAMME: The European Masters Program in Computational Logic is designed to meet the demands of industry and research in this rapidly growing area. Based on a solid foundation in mathematical logic, theoretical computer science, artificial intelligence and declarative programming students will acquire in-depth knowledge necessary to specify, implement and run complex systems as well as to prove properties of these systems. In particular, the focus of instruction will be in deduction systems, knowledge representation and reasoning, artificial intelligence, formal specification and verification, syntax directed semantics, logic and automata theory, logic and computability. This basic knowledge is then applied to areas like logic and natural language processing, logic and the semantic web, bioinformatics, information systems and database technology, software and hardware verification. Students will acquire practical experience and will become familiar in the use of tools within these applications. In addition, students will be prepared for a future PhD, they will come in contact with the international research community and will be integrated into ongoing research projects. They will develop competence in foreign languages and international relationships, thereby improving their social skills. Applicants should have a Bachelor degree (Bologna 1st cycle or equivalent) in Computer Science, Computer Engineering, Logic, or other relevant disciplines; special cases will be considered. The program has various strength that make it unique among European universities: * Curriculum taught entirely in English: The program is open to the world and prepares the students to move on the international scene. * Possibility of a strongly research-oriented curriculum. * Possibility for project-based routes to obtain the degree and extensive lab facilities. * International student community. * Direct interaction with the local and international industry and research centres, with the possibility of practical and research internships that can lead to future employment. * Excellent scholarship opportunities and student accommodations. The European Masters Program in Computational Logic is one of the few European Masters awarded by the European Union's Erasmus Mundus programme from its first year of existence in 2004. The Erasmus Mundus programme is a co-operation and mobility programme in the field of higher education which promotes the European Union as a centre of excellence in learning around the world. It supports European top-quality Masters Courses and enhances the visibility and attractiveness of European higher education in third-countries. It also provides EU-funded scholarships for third-country nationals participating in these Masters Courses, as well as scholarships for EU-nationals studying in third-countries. The European Masters Program in Computational Logic is sponsored scientifically by the European Network of Excellence on Computational Logic (CoLogNET), the European Association of Logic, Language and Information (FoLLI), the European Coordinating Committee for Artificial Intelligence (ECCAI), the Italian Association for Artificial Intelligence (AI*IA), the Italian Association for Informatics (AICA, member of the Council of European Professional Informatics Societies), the Italian Association for Logic and its Applications (AILA), and the Portuguese Association for Artificial Intelligence (APPIA). FURTHER INFORMATION: http://european.computational-logic.org/ Prof. Dr. Steffen Hoelldobler International Center for Computational Logic Technische Universität Dresden 01062 Dresden, Germany phone: [+49](351)46 33 83 40 fax: [+49](351)46 33 83 42 email: sh(a)iccl.tu-dresden.de

1 0

A chance to share your experience
by Simon Peyton-Jones 22 May '08

22 May '08

Friends I know for a fact that many of you are using Haskell successfully for real applications. Yet none of you have sent me an offer of a presentation at the Commercial Users of Functional Programming workshop, which happens in late Sept. I'm the program co-chair, and I confidently expecting several Haskell offers... but not one so far. I am sad. I am very sad. Make me happy! I'm sure you are very busy making your business work. But think what fun it'd be to share your experience with others, meet other people with similar experiences, recruit bright students to your company... Happily, there is still time. The deadline for offers is 2nd June. All we need by then is a short summary of what you think you might say. You don't have to write a paper (not now, not ever). Your presentation does not have to be highly technical. On the contrary, the emphasis is on the process issues that surround functional programming: convincing management, changes to software development, testing, benefits, costs, successes, concerns. I'm going to the Lake District for a week's holiday next week (it's half term in the UK). Please send me a lovely full mailbox to come back to. The CFP is below, and at http://cufp.galois.com/. best wishes Simon Commercial Users of Functional Programming Workshop (CUFP) 2008 26 September 2008, Victoria, British Columbia ============== CALL FOR PRESENTATIONS ====================== Presentation proposals due 2 June 2008 http://cufp.functionalprogramming.com Functional Programming As a Means, Not an End Sponsored by SIGPLAN Co-located with ICFP 2008 _________________________________________________________________ Functional languages have been under academic development for over 25 years, and remain fertile ground for programming language research. Recently, however, developers in industrial, governmental, and open source projects have begun to use functional programming successfully in practical applications. In these settings, functional programming has often provided dramatic leverage, including whole new ways of thinking about the original problem. The goal of the CUFP workshop is to act as a voice for these users of functional programming. The workshop supports the increasing viability of functional programming in the commercial, governmental, and open-source space by providing a forum for professionals to share their experiences and ideas, whether those ideas are related to business, management, or engineering. The workshop is also designed to enable the formation and reinforcement of relationships that further the commercial use of functional programming. Speaking at CUFP If you use functional programming as a means, rather than as an end, we invite you to offer to give a talk at the workshop. Alternatively, if you know someone who would give a good talk, please nominate them! Talks are typically 30-45 minutes long, but can be shorter. They aim to inform participants about how functional programming played out in real-world applications, focusing especially on the re-usable lessons learned, or insights gained. Your talk does not need to be highly technical; for this audience, reflections on the commercial, management, or software engineering aspects are, if anything, more important. You do not need to submit a paper! If you are interested in offering a talk, or nominating someone to do so, send an e-mail to jim (dot) d (dot) grundy (at) intel (dot) com or simonpj (at) microsoft (dot) com by 2 June 2008 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. Program Plans CUFP 2008 will last a full day and feature an invited presentation from Michael Hopcroft, the product unit manager for the forthcoming release of Microsoft Visual Studio F#. Additionally, the program will include a mix of presentations and discussion sessions. Topics will range over a wide area, including: * Case studies of successful and unsuccessful uses of functional programming; * Business opportunities and risks from using functional languages; * Enablers for functional language use in a commercial setting; * Barriers to the adoption of functional languages, and * Mitigation strategies for overcoming limitations of functional programming. There will be no published proceedings, as the meeting is intended to be more a discussion forum than a technical interchange. Program Committee * Lennart Augustsson <lennart (dot) augustsson (at) gmail (dot) com> * Matthias Blume <blume (at) tti-c (dot) org> * Adam Granicz <granicz (dot) adam (at) intellifactory (dot) com> * Jim Grundy (co-chair) <jim (dot) d (dot) grundy (at) intel (dot) com> * John Lalonde <lalonde (at) abstrax (dot) com> * Andy Martin <akmartin (at) us (dot) ibm (dot) com> * Yaron Minsky <yminsky (at) janestcapital (dot) com> * Simon Peyton Jones (co-chair) <simonpj (at) microsoft (dot) com> * Ulf Wiger <ulf (dot) wiger (at) ericsson (dot) com> This will be the fifth CUFP, for more information - including reports from attendees of previous events - see the workshop web site: http://cufp.functionalprogramming.com

1 0

CfP: FDPE 2008
by mh＠informatik.uni-kiel.de 22 May '08

22 May '08

====================================================================== Call for Papers Functional and Declarative Programming in Education (FDPE08) http://www-ps.informatik.uni-kiel.de/fdpe08/ Victoria, BC, Canada, 21 September, 2008 The workshop will be held in conjunction with ICFP 2008. http://www.icfpconference.org/icfp2008/ Important Dates --------------- Submission deadline: Friday, June 20, 2008 Notification of acceptance: Friday, July 25, 2008 Final revision due: Monday, July 14, 2008 Workshop: Sunday, September 21, 2008 Goals of the Workshop --------------------- Functional and declarative programming plays an increasingly important role in computing education at all levels. The aim of this workshop is to bring together educators and others who are interested in exchanging ideas on how to use a functional or declarative programming style in the classroom or in e-learning environments. Beyond the traditional focus of teaching programming by means of the functional or declarative paradigm, we are especially interested in case studies showing how these languages can be elegantly applied in teaching other topics of computer science (such as Appel's use of ML to teach compiler construction). Another interesting area covered by the workshop should be dedicated to teaching functional or declarative programming ideas in industrial environments. Functional and declarative languages have become more influential in industry. Thus, teaching such languages has become an interesting topic, as it must take into consideration long programming experiences in imperative languages. Topics: ------- The workshop will cover a wide spectrum of functional and declarative programming techniques: * programming courses using traditional functional and declarative programming languages (e.g. Haskell, Mathematica, ML, Prolog, Scheme, etc); * programming courses teaching functional programming in commercial languages (e.g. C, C++, Common LISP, etc); * programming courses teaching functional program design in modern OO languages (e.g. Java, C#, Eiffel, etc); * pedagogic programming environments to support functional and declarative programming; * teaching tools implemented with functional and declarative languages and/or ideas; * declarative programming language extensions and implementations with pedagogical relevance; * application courses that benefit heavily from functional and declarative programming (e.g. theorem proving or hardware design). Furthermore, the workshop will also cover all levels of education: * secondary school; * college and university; * post-college and continuing professional education. FDPE will be held in conjunction with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) in Victoria, British Columbia, Canada on Sunday, September 21, 2008. Submitted papers should describe new ideas, experimental results, or education-related projects. In order to encourage lively discussion, submitted papers may describe new ideas of education as well as project proposals about incorporating functional and declarative concepts into education curricula. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. All paper submissions must be at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (9pt). Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Submissions will be refereed by the program commitee who will call upon other members involved in teaching in related areas for expert advice. More details about the submission procedure will be announced on the FDPE website at http://www-ps.informatik.uni-kiel.de/fdpe08/ Registration, hotels, travel, etc. ---------------------------------- Information about registration, accommodation, and travel will eventually be available on the main conference web site (http://www.icfpconference.org/) Program Committee ----------------- * John Clements, California Polytechnic State University, United States * Matthew Flatt, University of Utah, United States * Michael Hanus, University of Kiel, Germany * Frank Huch, University of Kiel, Germany (co-chair) * Adam Parkin, University of Victoria, Canada (co-chair) * Simon Thompson, University of Kent, UK * Mads Torgersen, Microsoft Redmond, United States ----------------------------------------------------------------------

1 0

looking for interesting examples with recursion + state in which you'd want to prove termination
by Byron Cook 20 May '08

20 May '08

Hi Haskell folks, I'm looking for interesting recursive functions (i.e. not tail-recursive) that make use of state in the state monad. I'd like to prove them terminating with a new method I'm developing (or, of course, perhaps disprove termination....). If you have examples in this class that you wouldn't mind sharing, please send them to me. - Byron http://research.microsoft.com/~bycook

1 0