May 2012 - Haskell - Haskell.org

ASPCOMP 2013: 4th OPEN Answer Set Programming Competition: Call for Benchmark Problems
by Francesco Calimeri 12 May '12

12 May '12

[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently open and in the Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage Problem submission deadline: Aug 31th, 2012 * Competition stage "Model & Solve" submission deadline: Mar 1st, 2013 "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 Announcement of results and awards at LPNMR 2013 - Corunna, Spain For further information please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013(a)kr.tuwien.ac.at.

1 0

ANNOUNCE: Haskell Communities and Activities Report (22nd ed., May 2012)
by Janis Voigtländer 12 May '12

12 May '12

On behalf of all the contributors, I am pleased to announce that the Haskell Communities and Activities Report (22nd edition, May 2012) is now available in PDF and HTML formats: http://haskell.org/communities/05-2012/report.pdf http://haskell.org/communities/05-2012/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. I hope you will find it as interesting a read as I did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline to the call. The editor collects all the contributions into a single report and feeds that back to the community. When I try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ========================================= End of October 2012: target deadline for contributions to the November 2012 edition of the HC&A Report ========================================= Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editor for a simple e-mail reminder in October (you could point me to them as well, and I can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Janis Voigtlaender <hcar at haskell.org>

2 1

ANNOUNCE: haskell-src-exts 1.13.3
by Niklas Broberg 10 May '12

10 May '12

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.13.3! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts This release attempts to fix a bunch of long-standing (and a few new) bugs, while still avoiding a new major version bump. Changelog: 1.13.2 --> 1.13.3 =============== * Fundep premises are now allowed to be empty. * Fix the bug where the lexer would crash on a LINE pragma that did not include a line number. * Fix the bug where the lexer would require the # of a MagicHash-style type constructor to be succeeded by at least one character in the file. * Fix really long-standing bug where the parser would crash with an ugly "Internal error" error message if encountering an extra }. * Report errors at the right place for function arity mismatches. Earlier they were reported at end of file, now they are reported where the function is declared. * Lexer now properly fails on line-breaks in string literals. * Lexer now handles character escapes up to 0x10FFFF (unicode). Cheers, /Niklas

1 0

Gentle reminder: Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 20
by S D Swierstra 10 May '12

10 May '12

Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous two occasions students were all very happy with the school and we plan to repeat this success this year. The intended audience are prospective master students who have been in contact with Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In the previous two years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/bin/view/USCS2012/WebHome -- the poster you can print and hang somewhere (why not your office door): http://www.cs.uu.nl/wiki/pub/USCS2012/WebHome/USCSpos12.pdf -- the official summerschool site where you can register: http://www.utrechtsummerschool.nl/index.php?type=courses&code=H9 Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra PS: apologies if you get this mail more than once _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

6th International School on Rewriting (ISR), Valencia, July 16-20, 2012
by Santiago Escobar 10 May '12

10 May '12

Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th Valencia, Spain Early registration before June 15, 2012! Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, and logic, and it is the basis of well-known programming paradigms like functional and equational programming, which are taught at the universitary level in many countries. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) and are implemented in popular systems like Mathematica, Autocad, and others. Rewriting techniques play a relevant role in computing research, education, and industry. Two tracks are offered, including the lectures and the courses: - Track A: for newcomers in the field, or just for people who want to obtain a new, updated exposure. * Jose Meseguer. Introduction to Term Rewriting * Albert Rubio. Termination of Rewriting: Foundations and Automation * Santiago Escobar. A Rewriting-Based Specification and Programming Language: Maude * Beatriz Alarcon & Raul Gutierrez. Exercises on Term Rewriting - Track B: for those who want to get deeper in the most recent developments and applications of rewriting. * Maria Alpuente: Narrowing Techniques and Applications * Temur Kutsia: Matching, unification, and generalizations * Pierre Lescanne: Lambda Calculus: extensions and applications * Narciso Marti-Oliet: Rewriting Logic and Applications * Georg Moser: Automated Complexity Analysis of Term Rewriting Systems * Albert Oliveras: SAT and SMT techniques in Proof and Verification * Sophie Tison: Tree Automata, Turing Machines and Term Rewriting * Xavier Urbain: Certification of Rewriting Properties * Andrei Voronkov: Automated Reasoning and Theorem Proving For more information, please contact Salvador Lucas <slucas(a)dsic.upv.es>

1 0

FHPC 2012: Workshop on Functional High Performance Computing
by Clemens Grelck 10 May '12

10 May '12

======================================================================== CALL FOR PAPERS FHPC 2012 ACM SIGPLAN Workshop on Functional High Performance Computing Copenhagen, Denmark September 15th, 2012 http://www.hiperfit.dk/fhpc12/ Co-located with the International Conference on Functional Programming (ICFP 2012) ======================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Such computations would typically -- but not necessarily -- involve execution on highly parallel systems ranging from multi-core multi-processor systems to graphics accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale compute clusters or any combination thereof. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. The 2012 FHPC workshop comes with a particular theme motivated by geographic co-location with the newly established HIPERFIT Research Centre for Functional High-Performance Computing for Financial Information Technology (www.hiperfit.dk) at the University of Copenhagen. Hence, we particularly encourage submissions with a background in computational finance. Notwithstanding, the workshop welcomes submissions from other application domains as much as general-purpose work on the theory and practice of declarative approaches to high-performance computing. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submission Deadline: 6th June 2012, anywhere on earth * Author Notification: 27th June 2012 * Final Papers Due : 10th July 2012 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (double column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. The page limit is 12 pages. Any paper submitted must adhere to ACM SIGPLAN's republication policy. Submission deadlines and page limit are firm. Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm) Workshop Organizers: ==================== Andrzej Filinski Clemens Grelck DIKU Informatics Institute University of Copenhagen University of Amsterdam Universitetsparken 1 Science Park 904 2100 Copenhagen 1098XH Amsterdam Denmark Netherlands andrzej(a)diku.dk c.grelck(a)uva.nl Tentative Programme Committee: ============================== Marco Aldinucci University of Torino, Italy Manuel Chakravarty University of New South Wales, Australia Andrzej Filinski University of Copenhagen, Denmark (chair) Clemens Grelck University of Amsterdam, Netherlands (chair) Gaetan Hains University of Paris Est, France Zhenjiang Hu National Institute of Informatics, Japan Mike Giles Oxford University, UK Neal Glew Intel Inc., USA Ryan Newton University of Indiana, USA Satnam Singh Microsoft Research/University of Birmingham, UK Phil Trinder Heriot-Watt Unversity, UK Viktoria Zsok Eotvos Lorand University Budapest, Hungary Workshop Organizers: ==================== Andrzej Filinski Clemens Grelck DIKU Informatics Institute University of Copenhagen University of Amsterdam Universitetsparken 1 Science Park 904 2100 Copenhagen 1098XH Amsterdam Denmark Netherlands andrzej(a)diku.dk c.grelck(a)uva.nl h -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ----------------------------------------------------------------------

1 0

Haskell Weekly News: Issue 226
by Daniel Santa Cruz 09 May '12

09 May '12

Welcome to issue 226 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 29 to May 5, 2012. Quotes of the Week * acowley: I write the most complicated bottoms * Cale: OpenGL is the Rubik's Cube of graphics libraries. It's nearly impossible to change some things without affecting other things Top Reddit Stories * HJ — Haskell-to-JavaScript compiler (WIP) Domain: chrisdone.com, Score: 74, Comments: 23 On Reddit: [1] http://goo.gl/gP51N Original: [2] http://goo.gl/g32rz * Life Without Objects Domain: skipoleschris.blogspot.co.uk, Score: 52, Comments: 17 On Reddit: [3] http://goo.gl/LZmLC Original: [4] http://goo.gl/NLhKH * New major release of the containers package Domain: blog.johantibell.com, Score: 52, Comments: 25 On Reddit: [5] http://goo.gl/yjblJ Original: [6] http://goo.gl/DKlmd * Haskell and the World: Encodings and the Common Misuse of ByteString Domain: a-dimit.blogspot.com, Score: 50, Comments: 27 On Reddit: [7] http://goo.gl/WloCn Original: [8] http://goo.gl/oeIIW * How to write hybrid CPU/GPU programs with Haskell Domain: parfunk.blogspot.com.au, Score: 48, Comments: 3 On Reddit: [9] http://goo.gl/u9A9l Original: [10] http://goo.gl/s917R * phantom tainting with kind error messages Domain: article.gmane.org, Score: 35, Comments: 5 On Reddit: [11] http://goo.gl/V9qRd Original: [12] http://goo.gl/cx4cD * Annotated slides: Comparing Dynamic and Static Language Approaches to Web Frameworks (Rails vs Yesod) Domain: cs.kent.ac.uk, Score: 32, Comments: 11 On Reddit: [13] http://goo.gl/jE2iK Original: [14] http://goo.gl/2dIjQ * SPJ talk: Towards Haskell in the Cloud Domain: skillsmatter.com, Score: 30, Comments: 16 On Reddit: [15] http://goo.gl/fVc0e Original: [16] http://goo.gl/NMtPD * hotswap -- a simple, high level interface to plugins for hotswapping code Domain: hackage.haskell.org, Score: 29, Comments: 8 On Reddit: [17] http://goo.gl/kvhOS Original: [18] http://goo.gl/VMAe0 * Online Haskell typechecker Domain: haskellonline.org, Score: 29, Comments: 12 On Reddit: [19] http://goo.gl/uV3HY Original: [20] http://goo.gl/lSwhb Top StackOverflow Questions * Algebraically interpreting polymorphism votes: 21, answers: 5 Read on SO: [21] http://goo.gl/7krnc * Absolute value of negative zero - bug, or a part of the floating point standard? votes: 16, answers: 3 Read on SO: [22] http://goo.gl/HDpRc * how to implement doubly linked lists votes: 10, answers: 1 Read on SO: [23] http://goo.gl/hXyDM * GHC type inference for higher rank types - assigning to monotypes votes: 10, answers: 1 Read on SO: [24] http://goo.gl/TqYtX * Communication between Java and Haskell votes: 9, answers: 3 Read on SO: [25] http://goo.gl/zMYwx * Default constraint kinds are ignored votes: 9, answers: 2 Read on SO: [26] http://goo.gl/AElL4 * Scrap Your Boilerplate equivalent in Scala? votes: 7, answers: 1 Read on SO: [27] http://goo.gl/Cd7k4 * Does the chain function in underscore.js create a monad? votes: 7, answers: 1 Read on SO: [28] http://goo.gl/DUYkB * Why do Haskell list comprehensions with multiple generators treat the rightmost generator as the tightest loop? votes: 6, answers: 3 Read on SO: [29] http://goo.gl/BnndW * Haskell records, cleaner approach? votes: 6, answers: 1 Read on SO: [30] http://goo.gl/MymyL Until next time, Daniel Santa Cruz References 1. http://chrisdone.com/hj/ 2. http://www.reddit.com/r/haskell/comments/t06ej/hj_haskelltojavascript_compi… 3. http://skipoleschris.blogspot.co.uk/2012/04/life-without-objects.html 4. http://www.reddit.com/r/haskell/comments/t1oen/life_without_objects/ 5. http://blog.johantibell.com/2012/05/new-major-release-of-containers-package… 6. http://www.reddit.com/r/haskell/comments/t688l/new_major_release_of_the_con… 7. http://a-dimit.blogspot.com/2012/04/strings-in-haskell.html 8. http://www.reddit.com/r/haskell/comments/syo8h/haskell_and_the_world_encodi… 9. http://parfunk.blogspot.com.au/2012/05/how-to-write-hybrid-cpugpu-programs.… 10. http://www.reddit.com/r/haskell/comments/t7znh/how_to_write_hybrid_cpugpu_p… 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/98103 12. http://www.reddit.com/r/haskell/comments/t6dn7/phantom_tainting_with_kind_e… 13. http://www.cs.kent.ac.uk/~nccb/rails-yesod-slides.pdf 14. http://www.reddit.com/r/haskell/comments/t1aw8/annotated_slides_comparing_d… 15. http://skillsmatter.com/podcast/home/haskell-cloud/js-4179 16. http://www.reddit.com/r/haskell/comments/t0qg0/spj_talk_towards_haskell_in_… 17. http://hackage.haskell.org/package/hotswap-0.1.9.3 18. http://www.reddit.com/r/haskell/comments/t24lr/hotswap_a_simple_high_level_… 19. http://haskellonline.org/ 20. http://www.reddit.com/r/haskell/comments/t41bk/online_haskell_typechecker/ 21. http://stackoverflow.com/questions/10453558/algebraically-interpreting-poly… 22. http://stackoverflow.com/questions/10395761/absolute-value-of-negative-zero… 23. http://stackoverflow.com/questions/10386616/how-to-implement-doubly-linked-… 24. http://stackoverflow.com/questions/10424375/ghc-type-inference-for-higher-r… 25. http://stackoverflow.com/questions/10370177/communication-between-java-and-… 26. http://stackoverflow.com/questions/10381278/default-constraint-kinds-are-ig… 27. http://stackoverflow.com/questions/10423329/scrap-your-boilerplate-equivale… 28. http://stackoverflow.com/questions/10431999/does-the-chain-function-in-unde… 29. http://stackoverflow.com/questions/10399577/why-do-haskell-list-comprehensi… 30. http://stackoverflow.com/questions/10427217/haskell-records-cleaner-approach

1 0

Call for Participation: HOR'12, Nagoya
by Makoto Hamana 09 May '12

09 May '12

===================================================================== Call for Participation 6th International Workshop on Higher-Order Rewriting HOR 2012 June 2, 2012, Nagoya, Japan Colocated with RTA'12 http://www.cs.gunma-u.ac.jp/events/hor/ ====================================================================== HOR is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. Invited speaker --------------- * Zhenjiang Hu (National Institute of Informatics, Japan) Can Graph Transformation be Bidirectionalized? -- Bidirectional Semantics of Structural Recursion on Graphs -- Special Session: Current Status of Higher-Order Termination Tools ----------------------------------------------------------------- * Carsten Fuhs: Haskell termination tool * Rene Thiemann: Isabelle termination tool * Aoto,Yamada: Simply-typed TRS termination tool * Cynthia Kop: WANDA, termination tool for AFS Accepted papers --------------- * Beniamino Accattoli and Delia Kesner: The permutative lambda-calculus (The original paper was presented at LPAR'12, LNCS 7180, pp.381-395) * Thibaut Balabonski: A Unified Approach to Fully Lazy Sharing (The original paper was presented at POPL'12, pp.233-246) * Yuki Chiba and Takahito Aoto: Pattern Matching Algorithm for Higher Order Program Transformations * Jean-Pierre Jouannaud and Jian-Qi Li: Termination of higher-order rewriting in dependent type calculi * Vincent van Oostrom: Confluence via Critical Valleys * Kristoffer Rose: Higher Order Rewriting for Real Programmers

1 0

Creating a factorial function in GHC
by Angus Comber 09 May '12

09 May '12

I am trying to create a factorial function in GHC. I am following the online learnyouahaskell.com book (specifically types-and-typeclasses page). Bear in mind this is my day 1 of learning Haskell. The book suggests: factorial :: Integer -> Integer factorial n = product [1..n] But if I enter first line then press <Enter> I see: <interactive>:1:1 Not in scope: 'factorial' What am I doing wrong? Angus

2 1

FINAL CFP: TFPIE 2012
by Marco Morazan 07 May '12

07 May '12

CALL FOR PAPERS/PRESENTATIONS TFPIE 2012 International Workshop on Trends in Functional Programming in Education 2012 June 11 2012 University of St Andrews, Scotland http://www.cs.ru.nl/P.Achten/TFPIE_2012/TFPIE_2012_home.html *** NEW: SUBMISSIONS ARE NOW OPENED! *** The deadline to submit articles/abstracts to TFPIE is May 20 *** See the TFPIE 2012 website for instructions. The first International Workshop on Trends in Functional Programming in Education, TFPIE 2012, will be co-located with TFP 2012 at the University of St Andrews in Scotland. The goal of TFPIE is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas, and work in progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chairs of TFPIE 2012 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or an article (up to 16 pages). The authors of all accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Any visitors to the TFPIE 2012 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, the program committee will review, using prevailing academic standards, the articles accepted for presentation to select the best for publication in Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TOPICS OF INTEREST TFPIE 2012 welcomes submissions describing practical techniques used in the classroom, tools used and/or developed, and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: FP and beginning CS students FP in Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy If you are not sure if your work is appropriate for TFPIE 2012, please contact the PC chairs by e-mail at: tfpie2012(a)cs.ru.nl . Program Committee Peter Achten, Radboud University Nijmegen Jost Berthold, University of Copenhagen Marc Feeley, University of Montreal Ralf Hinze, University of Oxford Shriram Krishnamurthi, Brown University Michel Mauny, ENSTA Paris Tech James McKinna, UK Marco T. Morazan, Seton Hall University Rinus Plasmeijer, Radboud University Nijmegen Simon Thompson, University of Kent Important Dates May 20 submission of abstract or article May 25 notification of acceptance June 11 TFPIE July 6 submission of formal paper September 10 notification of acceptance October 1 camera-ready paper Venue The University of St Andrews is Scotland's first university and the third oldest in the English-speaking world, founded in 1413. Over six centuries it has established a reputation as one of Europe's leading and most distinctive centers for teaching and research. St Andrews is situated on the east coast of Fife, Scotland, UK. The town is approximately 50 miles north-east of Edinburgh, 14 miles south-east of Dundee, 78 miles south of Aberdeen, and 82 miles east of Glasgow making it easily accessible by any means of transportation. Help on traveling to St Andrews can be found at: http://www.st-andrews.ac.uk/visiting/GettingtoStAndrews/ . Questions? If you have any questions, do not hesitate to contact us at: tfpie2012(a)cs.ru.nl . -- Cheers, Marco

1 0