- Generics - Haskell.org

Oberwolfach Seminar on Mathematics for Scientific Programming
by Jeremy.Gibbons＠cs.ox.ac.uk 05 Sep '13

05 Sep '13

Call for Participation OBERWOLFACH SEMINAR ON MATHEMATICS FOR SCIENTIFIC COMPUTATION Mathematisches Forschunginstitut Oberwolfach 24th to 30th November 2013 http://www.mfo.de/occasion/1348a MOTIVATION Computational science today depends crucially on simulations, which are typically based on algorithms that have a sound mathematical justification. For example, an iterative procedure such as Newton's method is motivated by appealing to the properties of twice continuously differentiable functions and their Taylor expansion, which also yield convergence conditions and approximation estimates. These algorithms are then implemented on a computer, using a programming language such as Fortran or C++. Often, the implementation will introduce new computational steps and otherwise modify the structure of the mathematical algorithm - for handling or reducing round-off errors, enabling more efficient memory access, exploiting parallelization, and so on. As a result, the final implementation usually looks very different from the mathematical algorithm, and the justification given for the latter does not directly extend to the former. But if we are to ensure the correctness of simulations, we need mathematical certainty for both. We aim to bring to the scientific programming community mathematical techniques that allow us to achieve the transition from mathematical algorithm to efficient implementation in a principled manner, with each step motivated by the application of a mathematical theorem. The intended participants are students and researchers in computational science (including areas such as engineering, biology, and economics), and any scientists dissatisfied with state of the art in transforming mathematics into code. They will be equipped subsequently to make a significant contribution to increasing the correctness of the simulations that play such an important role in current scientific activity. CONTENT This rigorous approach to programming is most easily presented in the framework of functional programming: program calculation can be reduced to straightforward equational reasoning, provided that all program variables are immutable. Accordingly, we will introduce the basic syntax and ideas using Haskell, currently the one of the most successful functional programming languages. The emphasis is not on functional programming as such, and even less so on a specific language such as Haskell; but rather, on the mathematics behind program development, which can then be transferred to other contexts, such as imperative programming, or parallel programming. This mathematical foundation lies in category theory, which unifies what could otherwise appear as a large collection of "bite-sized" theorems for program development, too many for any developer to remember and use efficiently. Category theory is a broad subject: we will limit ourselves to what is essential as a framework for datatypes and programs (functors, universal properties, algebras, monads). The many examples, such as fusion (loop elimination), optimal bracketing (important for non-associative operations such as those on floating-point numbers), or parallel programming skeletons (such as Google's MapReduce), will be readily understandable and relevant to scientific computing practitioners. One of the most effective ways to counter floating-point errors and to obtain validated results is to use interval analysis, which however requires more complex data structures and algorithms than is common in other areas of scientific computation. Extending a function on real or floating-point numbers to one on intervals is a matter of symbolic computation, similar to the symbolic differentiation or integration that is performed by tools such as Mathematica. The problem of obtaining the best extension is complicated by the fact that some familiar properties (such as that x-x=0 for any x, and distributivity of multiplication over addition) do not apply to intervals, and is a good source of examples for calculational programming. Finally, we will present a larger application, a generic program for inter-temporal optimization with dynamic programming. This kind of problem is ubiquitous in economic modeling, and hence in many integrated assessment models, such as those aiming to compute costs of climate change. It has both algebraic aspects (the organization of the computation for backward induction), which can be tackled with the categorical methods presented, and numerical ones (the local optimization techniques), where interval analysis can be used. The Seminar is organized by: * Paul Flondor, Professor of Mathematics at Politehnica University Bucharest (pflondor(a)yahoo.co.uk) * Jeremy Gibbons, Professor of Computing at the University of Oxford (jeremy.gibbons(a)cs.ox.ac.uk) * Cezar Ionescu, researcher at Potsdam Institute for Climate Impact Research (ionescu(a)pik-potsdam.de) HOW TO APPLY Applications to participate should include * full name and address, including e-mail address * short CV, present position, university * name of supervisor of PhD thesis * a short summary of previous work and interest and should be sent preferably by e-mail (pdf files) to: Prof. Dr. Dietmar Kröner Mathematisches Forschungsinstitut Oberwolfach Schwarzwaldstr. 9-11 77709 Oberwolfach-Walke Germany seminars(a)mfo.de The deadline for applications is 15th September, and the number of participants is restricted to 25. The Institute covers accommodation and food; thanks to support from the Carl Friedrich von Siemens Foundation, some contribution may also be made towards travel expenses. For more information, contact the organizers or see the Institute's webpage: http://www.mfo.de/scientific-programme/meetings/oberwolfach-seminars

1 0

Workshop on Generic Programming (WGP 2013), Second call for Papers
by Jacques Carette 10 Jun '13

10 Jun '13

====================================================================== CALL FOR PAPERS WGP 2013 9th ACM SIGPLAN Workshop on Generic Programming Boston, Massachusetts, USA Saturday, September 29th, 2013 http://www.wgp-sigplan.org/2013 Co-located with the International Conference on Functional Programming (ICFP 2013) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- Jeremiah Willcock (co-chair), Indiana University Jacques Carette (co-chair), McMaster University Florian Rabe, Jacobs University Bremen Emilie Balland, INRIA Bordeaux Jeremy Siek, University of Colorado, Boulder Gabriel Dos Reis, Texas A&M University Christophe Raffalli, Savoie University Anya Helene Bagge, Universitetet i Bergen Tiark Rompf, Ecole Polytechnique Federale de Lausanne Andreas Abel, Ludwig-Maximilians-Universitat Munchen Edward Kmett, S&P Capital IQ William Cook, University of Texas, Austin Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Submission details ------------------ Deadline for submission: Friday 2013-06-14 Notification of acceptance: Wednesday 2013-07-11 Final submission due: Tuesday 2013-07-25 Workshop: Sunday 2013-09-28 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). The length is restricted to 12 pages. 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 program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Copenhagen, Denmark 2012 (affiliated with ICFP12), * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * Edinburgh, UK 2009 (affiliated with ICFP09), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- Marcin Zalewski (chair) Bruno Oliveira Jaako Järvi Shin-Cheng Mu Andres Löh Ronald Garcia Magne Haveraaen Tim Sheard Stephanie Weirich

1 0

Dom Bosco - Aprovados rela��o publicada
by David Anderson 05 Jun '13

05 Jun '13

Dom Bosco ANA ANGELICA PEREIRA ALVES, LETICIA BAIRLE, FRANCISCO ANDERSON VALE DO NASCIMENTO, PAULO DE SIQUEIRA SILVA, JOÃO CARLOS MOREIRA DE CARVALHO, DAMIANA PEREIRA DE OLIVERIA, MARIA DO SOCORRO DE ALBURQUERQUE ARRUDA BARBOSA, JAIME CUSTODIO DA SILVA FILHO. SEBASTIANA MÁRCIA GOMES DE MELO, ÉRICA FRANCISCA BATISTA DE MELO, MAYRES RAQUEL DA SILVA PINHEIRO, JUCIMARA VICENTE DOS SANTOS, WEULLER TEIXEIRA DE MAGALHAES. Cabeceiras. Acopiara ANA CAROLINA DE FIGUEIREDO COSTA, LIGEOVÂNIA FABRÍCIA HACÁRIO SILVA, FRANCISCO EMANUEL TIMBO FERREIRA JUNIOR, PAULO MATHEUS MOTA MARANHAO, JOÃO CARLOS MOREIRA DE CARVALHO, DAMIÃO FRANCISCO BARBOSA FILHO, MARIA GISELDA DE OLIVEIRA ARAÚJO, JANAINA SALES DE BRITO. SHERLANE CRISTINA DA SILVA, ANTONIO LEONARDO FREITAS SIQUEIRA, LUCAS MEDEIROS CAVALCANTE COSTA, GILDENE Mº DE MACEDO RODRIGUES, RAYSA PINHEIRO LEMOS. Canabrava do Norte. Andradas ANA ANGELICA PEREIRA ALVES, LETICIA BAIRLE, FRANCISCO ANDERSON VALE DO NASCIMENTO, PAULO DE SIQUEIRA SILVA, JOÃO CARLOS MOREIRA DE CARVALHO, DAMIANA PEREIRA DE OLIVERIA, MARIA DO SOCORRO DE ALBURQUERQUE ARRUDA BARBOSA, JAIME CUSTODIO DA SILVA FILHO. SEBASTIANA MÁRCIA GOMES DE MELO, ÉRICA FRANCISCA BATISTA DE MELO, MAYRES RAQUEL DA SILVA PINHEIRO, JUCIMARA VICENTE DOS SANTOS, WEULLER TEIXEIRA DE MAGALHAES. Canabrava do Norte.

1 0

CfP: Workshop Haskell and Rewriting Techniques HART 2013
by Johan Jeuring 10 Apr '13

10 Apr '13

Haskell is an advanced purely-functional programming language. Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations. There are strong connections between Haskell programming and rewriting. Therefore, we announce a new workshop, International Workshop on Haskell And Rewriting Techniques (HART 2013) http://www.imn.htwk-leipzig.de/HART2013/ to be held on June 27, in conjunction with RDP 2013, in Eindhoven. (RDP contains RTA, the main rewriting conference.) We plan a half day of discussions, in an informal setting, on how Haskell and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example, equational reasoning and other rewriting techniques for program verification and analysis; lambda calculi and type systems for functional programs and higher order rewriting systems; rewriting of type expressions in the type checker; rewriting of programs by refactoring tools, optimizers, code generators; execution of programs as a form of graph rewriting; template Haskell, introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. When in doubt, contact a member of the PC. Program committee: Alcino Cunha (U Minho) Jürgen Giesl (RWTH Aachen) Andy Gill (U of Kansas) Johan Jeuring (U Utrecht) Keisuke Nakano (UEC Tokyo) Kristoffer H Rose (IBM Watson) (co-chair) Christian Sternagel (JAIST) Janis Voigtländer (U Bonn) Johannes Waldmann (HTWK Leipzig) (co-chair) Dates: May 6: deadline for submissions May 20: notification of acceptance June 27: workshop Submission and Proceedings: Two categories of submissions are invited: Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. Presentation-only papers. Describing work recently published or submitted. Will not be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is handled through the EasyChair HART2013 page, https://www.easychair.org/conferences/?conf=hart2013 In line with the informal style of the workshop, the reviewing of submissions will be light. When accepting and scheduling presentations, preference will be given to original research. Proceedings will be made available electronically at the workshop.

1 0

WGP 2013 Call for Papers
by Jacques Carette 18 Mar '13

18 Mar '13

Dear list subscribers, apologies if you receive multiple copies of this CFP. ====================================================================== CALL FOR PAPERS WGP 2013 9th ACM SIGPLAN Workshop on Generic Programming Boston, Massachusetts, USA Saturday, September 29th, 2013 http://www.wgp-sigplan.org/2013 Co-located with the International Conference on Functional Programming (ICFP 2013) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- Jeremiah Willcock (co-chair), Indiana University Jacques Carette (co-chair), McMaster University Florian Rabe, Jacobs University Bremen Emilie Balland, INRIA Bordeaux Jeremy Siek, University of Colorado, Boulder Gabriel Dos Reis, Texas A&M University Christophe Raffalli, Savoie University Anya Helene Bagge, Universitetet i Bergen Tiark Rompf, Ecole Polytechnique Federale de Lausanne Andreas Abel, Ludwig-Maximilians-Universitat Munchen Edward Kmett, S&P Capital IQ William Cook, University of Texas, Austin Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Submission details ------------------ Deadline for submission: Friday 2013-06-14 Notification of acceptance: Wednesday 2013-07-11 Final submission due: Tuesday 2013-07-25 Workshop: Sunday 2013-09-28 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). The length is restricted to 12 pages. 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 program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Copenhagen, Denmark 2012 (affiliated with ICFP12), * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * Edinburgh, UK 2009 (affiliated with ICFP09), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- Marcin Zalewski (chair) Bruno Oliveira Jaako Järvi Shin-Cheng Mu Andres Löh Ronald Garcia Magne Haveraaen Tim Sheard Stephanie Weirich

1 0

Research Assistantship at Oxford on Bidirectional Transformations
by Jeremy.Gibbons＠cs.ox.ac.uk 05 Mar '13

05 Mar '13

Postdoctoral Research Assistant "A THEORY OF LEAST-CHANGE FOR BIDIRECTIONAL TRANSFORMATIONS" Department of Computer Science, University of Oxford Applications are invited for a Research Fellowship on an EPSRC-funded project "A Theory of Least-Change for Bidirectional Transformations". The project is a collaboration between Professor Jeremy Gibbons in the Department of Computer Science, University of Oxford, and Dr Perdita Stevens and Dr James Cheney in the School of Informatics, University of Edinburgh. The project concerns bidirectional transformations, which are a means of maintaining consistency between multiple information sources: when one source is edited, the others may need updating to restore consistency. There are applications in model-driven engineering, database design, and program development, among others. A bidirectional transformation can be implemented in terms of several unidirectional restoring functions, one per source; but this duplicates information, wasting effort and risking inconsistencies. Bidirectional transformation languages allow one to describe the consistency relationship and the restoring functions with a single declarative specification. Our aim in this project is to study the principle of least change: that a bidirectional transformation should not make unnecessary or unnecessarily large changes when it re-establishes consistency. The primary focus of the Oxford contribution is the development of a theory of alignment for bidirectional transformations on structured data, especially in the case of non-free datatypes such as associative lists and graphs. We conjecture that the mathematics of container datatypes and combinatorial species will be particularly relevant. The Fellowship will be under the supervision of Professor Jeremy Gibbons at Oxford, and is available for three years from 31st August 2013 (or any time before that). The salary is on a standard scale, from £29,541 to £36,298 per annum. For further details, including a job description and information on how to apply, please see the webpage (http://www.cs.ox.ac.uk/news/619-full.html) If you have any questions, please write to me (jeremy.gibbons(a)cs.ox.ac.uk) Please pass this advert on to anyone you think may be interested. Jeremy Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0

Workshop on Haskell And Rewriting Techniques (HART) 2013
by Johan Jeuring 16 Feb '13

16 Feb '13

Call for papers: Workshop on Haskell And Rewriting Techniques (HART) 2013 See http://www.imn.htwk-leipzig.de/HART2013/ -- Johan

1 0

Three University Lectureships in Software Engineering at Oxford
by Jeremy.Gibbons＠cs.ox.ac.uk 07 Jan '13

07 Jan '13

University of Oxford Department of Computer Science in association with Kellogg College, Oxford UNIVERSITY LECTURERS IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) - THREE POSTS The Department of Computer Science proposes to appoint three University Lecturers in Computer Science from 1st April 2013 and no later than 1st October 2013. The successful candidate will be offered a Non-Tutorial Fellowship at Kellogg College under arrangements described in Further Particulars. The salary will be on a scale currently up to £57,581 per annum. The teaching duties of the appointees will be performed for the Software Engineering Programme, which offers part-time MScs in Software Engineering and Software and Systems Security, taught via a series of intensive one-week modules. The research interests of candidates should be in any area of Software Engineering or Computer Science relevant to these programmes. Applicants should hold a relevant PhD and have experience in any area which broadens the activities of the Software Engineering Programme (http://www.softeng.ox.ac.uk/) Full details of the qualifications required and the duties of the post can be found in the Further Particulars (http://www.cs.ox.ac.uk/files/5213/SEP_UL_FPs.pdf) The closing date for applications is Friday 8th February 2013. Queries about the post should be addressed in the first instance to Elizabeth Walsh at elizabeth.walsh(a)cs.ox.ac.uk or telephone: +44 (0) 1865 283503. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The University is an Equal Opportunities Employer.

1 0

University Lectureship in Computer Science (Software Engineering) at Oxford
by Jeremy.Gibbons＠cs.ox.ac.uk 27 Nov '12

27 Nov '12

University of Oxford Department of Computer Science in association with Kellogg College, Oxford UNIVERSITY LECTURER IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) The Department of Computer Science proposes to appoint a University Lecturer in Computer Science from 1st March 2013 and no later than 1st October 2013. The successful candidate will be offered a Non-Tutorial Fellowship at Kellogg College under arrangements described in Further Particulars. The salary will be on a scale currently up to £57,581 per annum. Applicants should hold a relevant PhD and have experience in any area which broadens the activities of the Software Engineering Programme (http://www.softeng.ox.ac.uk/) Full details of the qualifications required and the duties of the post can be found in the Further Particulars (http://www.cs.ox.ac.uk/files/5161/SEP_UL_FPs.pdf) The closing date for applications is Thursday 27th December, 2012. Queries about the post should be addressed in the first instance to Elizabeth Walsh at elizabeth.walsh(a)cs.ox.ac.uk or telephone: +44 (0) 1865 283503. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The University is an Equal Opportunities Employer.

1 0

adding meta-operators to guarded-rewriting
by Nicolas Frisby 01 Nov '12

01 Nov '12

I brainstormed a bit about adding meta-operators to guarded-rewriting last night. Are any of the package's authors/maintainers interested in discussing these ideas further? If so — who would it be appropriate to chat with? Thanks.

2 2