- Haskell - Haskell.org

[TFP 2015] 2nd call for papers
by Peter Achten 13 Feb '15

13 Feb '15

----------------------------- S E C O N D C A L L F O R P A P E R S ----------------------------- ======== TFP 2015 =========== 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers will be published as a Springer Lecture Notes in Computer Science (www.springer.com/lncs) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/) == INVITED SPEAKER == TFP is pleased to announce a talk by the following invited speaker: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2015 program chair, Manuel Serrano. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TFP is financially supported by <to be announced> == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp2015 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: March 17, 2015 Notification: March 24, 2015 Registration: April 7, 2015 TFP Symposium: June 3-5, 2015 Student papers feedback: June 9, 2015 Submission for formal review: July 1, 2015 Notification of acceptance: September 8, 2015 Camera ready paper: October 8, 2015 == PROGRAM COMMITTEE == Janis Voigtländer University of Bonn, DE Scott Owens University of Kent, UK Neil Sculthorpe Swansea University, UK Colin Runciman University of York, UK Manuel Serrano Inria (PC chair), FR Rinus Plasmeijer University of Nijmegen, NL Tomas Petricek University of Cambridge, UK Marco T. Morazan Seton Hall University, USA Wolfgang De Meuter Vrije Universiteit Brussel, BE Michel Mauny Ensta ParisTech, FR Sam Lindley The University of Edinburgh, UK Daan Leijen Microsoft, USA Jurriaan Hage Utrecht University, NL Andy Gill University of Kansas, USA Thomas Gazagnaire University of Cambrige, UK Lars-Ake Fredlund Universidad Politécnica de Madrid, ES Jean-Christophe Filliatre Université Paris Sud Orsay, FR Marc Feeley Université de Montréal, CA Olaf Chitil University of Kent, UK Edwin Brady University of St Andrews, UK

1 0

STAF 2015: Joint Call for Papers
by Vadim Zaytsev 13 Feb '15

13 Feb '15

———————————————————————————————————————————— * Joint Call for Papers for STAF 2015 * Software Technologies: Applications and Foundations * 20-24 July 2015, L'Aquila, Italy * http://www.disim.univaq.it/staf2015/ * https://twitter.com/staf2015 ———————————————————————————————————————————— STAF 2015 events include: - ICMT'15: Eighth International Conference on Model Transformation - ECMFA'15: Eleventh European Conference on Modelling Foundations and Applications - TAP'15: Ninth International Conference on Tests and Proofs - ICGT'15: Seventh International Conference on Graph Transformation - TTC'15: Eighth Transformation Tool Contest - BX'15: Fourth International Workshop on Bidirectional Transformations - Projects Showcase - Doctoral Symposium - (more workshops TBA) ———————————————————————————————————————————— The deadlines coming up soon are (abstract/paper deadlines given, if applicable): - 13/20 February: TAP - 15/22 February: ICMT - 27 February/6 March: ECMFA - 11 March: TTC (cases) - 20/27 March: ICGT We provide some brief information on each of the conferences below, please refer to their corresponding websites for complete calls for submissions, as well as more detailed explanation of each event's topics and priorities. ———————————————————————————————————————————— * 9th International Conference on Tests and Proofs (TAP 2015) * http://tap2015.in.tum.de/ * http://tap2015.in.tum.de/call.shtml * https://www.easychair.org/conferences/?conf=tap2015 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. TAP 2015 will accept three kinds of submissions: regular research papers, short papers and tutorial proposals. TAP 2015 keynote talk will be given by Einar Broch Johnsen. Organisation: - Program Co-Chair: Jasmin C. Blanchette (TU Muenchen, Inria) - Program Co-Chair: Nikolai Kosmatov (CEA LIST) ———————————————————————————————————————————— * 8th International Conference on Model Transformation (ICMT 2015) * http://www.model-transformation.org/ * http://www.di.univaq.it/diruscio/sites/ICMT2015/?page_id=21 * https://easychair.org/conferences/?conf=icmt2015 Model transformation encompasses a variety of technical spaces (modelware, grammarware, dataware, ontoware), a variety of model representations (text, tables, trees, graphs) and a variety of transformation paradigms (rule-based transformations, term rewriting, OO manipulations, weaving, refactoring). The study of model transformation includes foundations, structuring mechanisms, and properties, such as modularity, composability and parametrisation of transformations, transformation languages, techniques and tools. To achieve impact on software engineering in general, methodologies and tools are required to integrate model transformation into existing development environments and processes. Four kinds of submissions are sought: research papers, application papers, exploratory papers and tool demo papers. Organisation: - Program Co-Chair: Dimitris Kolovos (University of York, UK) - Program Co-Chair: Manuel Wimmer (Vienna University of Technology, Austria) - Social Chair: James R. Williams (University of York, UK) - Web Chair: Javier Troya (Vienna University of Technology, Austria) ———————————————————————————————————————————— * 11th European Conference on Modelling Foundations and Applications (ECMFA 2015) * https://www.uni-marburg.de/fb12/swt/ecmfa2015/ * https://www.uni-marburg.de/fb12/swt/ecmfa2015/cfp.pdf * https://www.easychair.org/conferences/?conf=ecmfa2015 The ECMFA conference series is dedicated to advancing the state of knowledge and fostering the industrial application of Model-Based Engineering as an approach to the design, analysis and development of software and systems that relies on exploiting high-level models and computer-based automation to achieve significant boosts in both productivity and quality. Its focus is on engaging the key figures of research and industry in a dialogue which results in stronger and more effective practical application of MBE, hence producing more reliable software based on state-of-the-art research results. ECMFA has two distinct Paper Tracks: one for research papers (Track F) dealing with the foundations for MBE, and one for industrial applications papers (Track A) dealing with the applications of MBE, including experience reports on MBE tools. Organisation: - Foundations Program Chair: Gabriele Taentzer (Philipps-Universitaet Marburg, Germany) - Applications Program Chair: Francis Bordeleau (Carleton University, Ottawa, Canada) ———————————————————————————————————————————— * 8th Transformation Tool Contest (TTC 2015) * http://www.transformation-tool-contest.eu/ * http://www.transformation-tool-contest.eu/cfc.html * https://www.easychair.org/conferences/?conf=ttc2015 The aim of the Transformation Tool Contest is to evaluate and compare the expressiveness, the usability and the performance of transformation tools for structured data along a number of selected challenging case studies. Cases can still be submitted up to 11 March 2015. In 2015, our special focus is on program transformations and bidirectional transformations. Shortly after that deadline, the best cases will be selected, a Call for Solutions will be issued, and then people have the chance to submit solutions to the selected cases until 29 April 2015. Organisation: - Tassilo Horn (University of Koblenz-Landau, Germany) - Filip Krikava (University of Lille & INRIA Lille) - Louis Rose (University of York, UK) ———————————————————————————————————————————— * 7th International Conference on Graph Transformation (ICGT 2015) * http://btn1x4.inf.uni-bayreuth.de/icgt2015/ * http://btn1x4.inf.uni-bayreuth.de/icgt2015/cfp.html * http://www.easychair.org/conferences/?conf=icgt2015 Many dynamic structures can be represented as graphs and their changes modeled as graph transformations. Theory and applications of graphs, graph grammars and graph transformation systems have been studied in our community for more than 40 years. This year ICGT offers two tracks: a Foundations Track and an Applications Track. The research papers (limited to 16 pages) submitted for the Foundations Track describe innovative contributions to current research on the foundations of graph transformations and are evaluated with respect to their originality, significance, and technical soundness. Papers for the applications track can be submitted in different categories: technical papers (limited to 16 pages), case studies (limited to 12 pages) and tool demo papers (limited to 8 pages). Organisation: - Program Co-Chair: Francesco Parisi-Presicce (University of Rome La Sapienza, Italy) - Program Co-Chair: Bernhard Westfechtel (University of Bayreuth, Germany) - Publicity Chair: Thomas Buchmann (University of Bayreuth, Germany) ———————————————————————————————————————————— Organisation of STAF 2015: - General Chair: Alfonso Pierantonio (Università degli Studi dell’Aquila, Italy) - Workshop Co-Chair: Davide Di Ruscio (Università degli Studi dell’Aquila, Italy) - Workshop Co-Chair: Pieter Van Gorp (Eindhoven University of Technology, The Netherlands) - Doctoral Symposium Co-Chair: Henry Muccini (Università degli Studi dell’Aquila, Italy) - Doctoral Symposium Co-Chair: Dániel Varró (Budapest University of Technology and Economics, Hungary) - Doctoral Symposium Co-Chair: Martin Gogolla (University of Bremen, Germany) - Projects Showcase Co-Chair: Marco Autili (Università degli Studi dell’Aquila, Italy) - Projects Showcase Co-Chair: Bernhard Schätz (firtiss GmbH, Germany) - Publication Co-Chair: Louis Rose (University of York, UK) - Publication Co-Chair: Javier Troya (Technische Universität Wien, Austria) - Social Media and Publicity Chair: Vadim Zaytsev (Universiteit van Amsterdam, The Netherlands) - Web Chair: Francesco Basciani (Università degli Studi dell’Aquila, Italy) - Local: Massimo Tivoli, Romina Eramo, Ludovico Iovino, Francesco Gallo, Juri Di Rocco, Gianni Rosa ————————————————————————————————————————————

1 0

Rank-N types with (.) composition
by Tyson Whitehead 11 Feb '15

11 Feb '15

I came across something that seems a bit strange to me. Here is a simplified version (the original was trying to move from a lens ReifiedFold to a lens-action ReifiedMonadicFold) {-# LANGUAGE RankNTypes #-} import Control.Applicative newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } trip :: Wrap -> Wrap trip a = Wrap (extract a) The compiler is okay with this. It chokes on this alternative though trip :: Wrap -> Wrap trip = Wrap . extract giving (GHC 7.8.2) Couldn't match type ‘f0 Int’ with ‘forall (f :: * -> *). Functor f => f Int’ Expected type: f0 Int -> Wrap Actual type: (forall (f :: * -> *). Functor f => f Int) -> Wrap In the first argument of ‘(.)’, namely ‘Wrap’ In the expression: Wrap . extract I'm guessing this is because the compiler fancy footwork to handle the implicit parameters, something like trip a = Wrap (\f fDict -> extract a f fDict) where f is the Functor type and fDict is the associated dictionary, isn't compatible with the (.) definition of f . g = \x -> f (g x) Is this correct? I would appreciate anyone insight here. Is there a way combine these (.) style? Thanks! -Tyson

6 10

Re: [Haskell] [Haskell-cafe] GHC 7.10 Prelude: we need your opinion
by Simon Peyton Jones 10 Feb '15

10 Feb '15

| What were the objections? Especially the principle ones? Please read the info pages, which set out the arguments quite carefully. Also, I spammed several email lists to ensure broad coverage, but it'd be best to debate on the libraries(a)haskell.org, rather than reply-to-all; that's what it's for. (Which I failed to send the announcement to! I'll fix that.) Simon | -----Original Message----- | From: Miguel Mitrofanov [mailto:miguelimo38@yandex.ru] | Sent: 10 February 2015 15:59 | To: Simon Peyton Jones; haskell(a)haskell.org; Haskell Cafe (haskell- | cafe(a)haskell.org) GHC users; ghc-devs(a)haskell.org | Subject: Re: [Haskell-cafe] GHC 7.10 Prelude: we need your opinion | | What were the objections? Especially the principle ones? | | 10.02.2015, 18:51, "Simon Peyton Jones" <simonpj(a)microsoft.com>: | > Haskell Friends | > | > This email asks for your help in deciding how to proceed with some | Prelude changes in GHC 7.10. Please read on, but all the info is also | at the survey link, here: http://goo.gl/forms/XP1W2JdfpX. Deadline | is 21 Feb. | > | > The Core Libraries Committee (CLC) is responsible for developing the | core libraries that ship with GHC. This is an important but | painstaking task, and we owe the CLC a big vote of thanks for taking | it on. | > | > For over a year the CLC has been working on integrating the Foldable | and Traversable classes (shipped in base in GHC 7.8) into the core | libraries, and into the Prelude in particular. Detailed planning for | GHC 7.10 started in the autumn of 2014, and the CLC went ahead with | this integration. | > | > Then we had a failure of communication. As these changes affect the | Prelude, which is in scope for all users of Haskell, these changes | should be held to a higher bar than the regular libraries@ review | process. However, the Foldable/Traversable changes were not | particularly well signposted. Many people have only recently woken up | to them, and some have objected (both in principle and detail). | > | > This is an extremely unfortunate situation. On the one hand we are | at RC2 for GHC 7.10, so library authors have invested effort in | updating their libraries to the new Prelude. On the other, altering | the Prelude is in effect altering the language, something we take | pretty seriously. We should have had this debate back in 2014, but | here we are, and it is unproductive to argue about whose fault it is. | We all share responsibility. | > | > We need to decide what to do now. A small group of us met by Skype | and we've decided to do this: | > | > · Push back GHC 7.10's release by at least a month, to late | March. This delay also gives us breathing space to address an | unrelated show-stopping bug, Trac #9858. | > | > · Invite input from the Haskell community on which of two | approaches to adopt (this survey). The main questions revolve around | impact on the Haskell ecosystem (commercial applications, teaching, | libraries, etc etc), so we want to ask your opinion rather than guess | it. | > | > · Ask Simon Marlow and Simon Peyton Jones to decide which | approach to follow for GHC 7.10. | > | > Wiki pages have been created summarizing these two primary | alternatives, including many more points and counter-points and | technical details: | > | > · Overall summary: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710 | > | > · Details of Plan List: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List | > | > · Details of Plan FTP: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP | > | > This survey invites your input on which plan we should follow. Would | you please | > | > · Read the details of the alternative plans on the three | wiki pages above | > | > · Add your response to the survey | > | > Please do read the background. Well-informed responses will | help. Thank you! | > | > DEADLINE: 21 February 2015 | > | > Simon PJ | > | > , | > | > _______________________________________________ | > Haskell-Cafe mailing list | > Haskell-Cafe(a)haskell.org | > http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

GHC 7.10 Prelude: we need your opinion
by Simon Peyton Jones 10 Feb '15

10 Feb '15

Haskell Friends This email asks for your help in deciding how to proceed with some Prelude changes in GHC 7.10. Please read on, but all the info is also at the survey link, here: http://goo.gl/forms/XP1W2JdfpX. Deadline is 21 Feb. The Core Libraries Committee (CLC) is responsible for developing the core libraries that ship with GHC. This is an important but painstaking task, and we owe the CLC a big vote of thanks for taking it on. For over a year the CLC has been working on integrating the Foldable and Traversable classes (shipped in base in GHC 7.8) into the core libraries, and into the Prelude in particular. Detailed planning for GHC 7.10 started in the autumn of 2014, and the CLC went ahead with this integration. Then we had a failure of communication. As these changes affect the Prelude, which is in scope for all users of Haskell, these changes should be held to a higher bar than the regular libraries@ review process. However, the Foldable/Traversable changes were not particularly well signposted. Many people have only recently woken up to them, and some have objected (both in principle and detail). This is an extremely unfortunate situation. On the one hand we are at RC2 for GHC 7.10, so library authors have invested effort in updating their libraries to the new Prelude. On the other, altering the Prelude is in effect altering the language, something we take pretty seriously. We should have had this debate back in 2014, but here we are, and it is unproductive to argue about whose fault it is. We all share responsibility. We need to decide what to do now. A small group of us met by Skype and we've decided to do this: · Push back GHC 7.10's release by at least a month, to late March. This delay also gives us breathing space to address an unrelated show-stopping bug, Trac #9858. · Invite input from the Haskell community on which of two approaches to adopt (this survey<http://goo.gl/forms/XP1W2JdfpX>). The main questions revolve around impact on the Haskell ecosystem (commercial applications, teaching, libraries, etc etc), so we want to ask your opinion rather than guess it. · Ask Simon Marlow and Simon Peyton Jones to decide which approach to follow for GHC 7.10. Wiki pages have been created summarizing these two primary alternatives, including many more points and counter-points and technical details: · Overall summary: https://ghc.haskell.org/trac/ghc/wiki/Prelude710<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> · Details of Plan List: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> · Details of Plan FTP: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> This survey invites your input on which plan we should follow. Would you please · Read the details of the alternative plans on the three wiki pages above · Add your response to the survey<http://goo.gl/forms/XP1W2JdfpX> Please do read the background. Well-informed responses will help. Thank you! DEADLINE: 21 February 2015 Simon PJ

1 0

First Call for Papers, PxTP 2015
by Andrei Paskevich 10 Feb '15

10 Feb '15

The Fourth International Workshop on Proof eXchange for Theorem Proving (PxTP) http://pxtp15.lri.fr/ August 2-3, 2015, Berlin, Germany associated with CADE 2015 Important dates * Abstract submission: Thu, May 7, 2015 * Paper submission: Thu, May 14, 2015 * Notification: Tue, June 16, 2015 * Camera ready versions due: Thu, June 25, 2015 * Workshop: August 2-3, 2015 Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automated and interactive, during the past decades, made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and also collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools to exchange problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation and communication methods, standards, protocols, and programming interfaces. The workshop welcomes the interested developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and in descriptions of the current bottlenecks and proposals for improvement. Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs connected to problems, proofs, and models; * comparison, refactoring, and optimization of proofs; * practical experiences, case studies, feasibility studies; * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations). Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org/) Papers will be submitted via EasyChair, at the PxTP'2015 workshop page (http://www.easychair.org/conferences/?conf=pxtp2015) Accepted full papers will appear in an EPTCS volume. Invited speakers (joint with the AMI'2015 workshop) * Georges Gonthier (Microsoft Research) * Bart Jacobs (KU Leuven) Program committee * Jesse Alama (Vienna University of Technology) * Peter Baumgartner (NICTA) * Jasmin Blanchette (TU München) * Guillaume Burel (CÉDRIC, ENSIIE) * Évelyne Contejean (LRI, CNRS, Université Paris Sud) * Cezary Kaliszyk (University of Innsbruck), co-chair * Ramana Kumar (University of Cambridge) * Dale Miller (Inria / LIX, École polytechnique) * Bruno Woltzenlogel Paleo (Vienna University of Technology) * Andrei Paskevich (LRI, Université Paris Sud), co-chair * Damien Pous (LIP, CNRS, ENS Lyon) * Geoff Sutcliffe (University of Miami) * Laurent Théry (Inria) * Cesare Tinelli (University of Iowa) * Josef Urban (Radboud University Nijmegen)

1 0

4Yr PostDoc with McBride/Ghani
by Neil Ghani 09 Feb '15

09 Feb '15

Please forward to anyone you think might be interested cheers neil Salary range: £30434 - £34,233 FTE: 1.0 Term: Fixed Term (4 years) Closing date: 23 February 2015 Applications are invited for a Research Associate to work under the supervision of Professor Neil Ghani and Dr Conor McBride on the EPSRC grant "Homotopy Type Theory: Programming and Verification". Homotopy Type Theory (HoTT) is a revolutionary new approach to type theory where types are interpreted as spaces, terms as points and equalities as paths. Decades of research in homotopy theory has uncovered the structure of such paths and HoTT uses this structure as the basis of a new theory of equality. Excitingly, within homotopy theory, one naturally studies higher homotopies of paths between paths and this gives the higher dimensional structure of equality we previously lacked. The objective of this grant is to translate the advances of HoTT into more concrete programming language and verification tools. You will join a team consisting of Prof Neil Ghani, Dr Conor McBride at the University of Strathclyde as well as Dr Nicola Gambino at the University of Leeds and Dr Thorsten Altenkirch at the Univeristy of Nottingham. We will be hiring an RA to work on the more theoretical parts of the project at Nottignham while your main duties will be to conduct research on the more applied - that is programming language - aspects of the project at Strathclyde. You will possess a PhD in mathematics or computer science and be familiar with type theory, category theory and programming languages. Interviews have been scheduled for 25 March 2015. For informal enquiries, please contact Professor Neil Ghani, (email: neil.ghani(a)strath.ac.uk<mailto:neil.ghani@strath.ac.uk> or tel: 0141 548 4303) or Dr Conor McBride, (email conor.mcbride(a)strath.ac.uk<mailto:conor.mcbride@strath.ac.uk> or tel 01415483121.

1 0

CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015
by Nabeel Al-Qirim 08 Feb '15

08 Feb '15

CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 IIT’15: The 11th International Conference on Innovations in Information Technology 2015 URL: http://www.it-innovations.ae/iit2015/posters.html The IIT’15 Student Poster and Demos Committee invites all undergraduate and graduate students to submit an extended (2 pages max.) abstract and to display it as a poster during the IIT’15. The poster topic should fall within the conference’s theme and tracks. SUBMISSION Extended abstracts should be sent to Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae. All students are encouraged to review their abstracts with their faculty advisers prior to submission. All accepted abstracts will be published by the IIT’15 proceedings. IMPORTANT DATES -Student Poster (Extended Paper) Submission May 30, 2015 -Notification of Student Poster acceptance July 15, 2015 -Camera ready Extended Paper and Poster material September 01, 2015 -Conference November 01-03, 2015 BEST STUDENT POSTER AWARDS There will be a competition for best student poster award at the IIT’15. This award will be given to recognize student excellence in research and presentation. CONTACT Queries should be directed to: Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae Thanks, Dr. Nabeel Al-Qirim IIT’15 Student Poster and Demos Chair College of Information Technology United Arab Emirates University P.O Box 15551 - Al Ain United Arab Emirates Tel: +971-3-7135531 Mobile: +971-507308705 Fax: +971-3-7672018 Email: nalqirim(a)uaeu.ac.ae Website: http://nalqirim.wix.com/nabeel-al-qirim ________________________________ Disclaimer: This email and the file(s) attached shall remain confidential and is intended for the receivers use only. If you are not the intended receiver or if you have received this email by mistake, please advise the sender and delete the email along with its attachment(s) from your system immediately. You do not have the right to copy/print/distribute this email or attached file(s), or to release its contents to any other party other than the intended receivers whatsoever; except if you take prior written approval from the sender. If you violate the above, you will be legally held accountable.

1 0

Re: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316
by Takenobu Tani 07 Feb '15

07 Feb '15

sorry, frequent mail in important thread. I understood why I did not receive initial mail. Daniel's initial mail was determined that the spam mail in Gmail. I found it in Gmail spam folder. Cheers, Takenobu 2015-02-07 10:32 GMT+09:00 Takenobu Tani <takenobu.hs(a)gmail.com>: > Hi Brandon, > > Thank you for your help. > I think my environmental problems. > > It's OK, if everyone could read it in cafe:-) > > Thank you, > Takenobu > > > > 2015-02-06 23:12 GMT+09:00 Brandon Allbery <allbery.b(a)gmail.com>: > >> On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani <takenobu.hs(a)gmail.com> >> wrote: >> >>> and, to haskell-cafe, >>> "Haskell Weekly News: Issue 316" original message[1] had sent only to >>> haskell@haskell.org? >>> (not to haskell-cafe? or my mailer trouble?) >>> >> >> gmail suppresses duplicate messages, so if you are subscribed to both >> lists you will receive it only once. >> >> -- >> brandon s allbery kf8nh sine nomine >> associates >> allbery.b(a)gmail.com >> ballbery(a)sinenomine.net >> unix, openafs, kerberos, infrastructure, xmonad >> http://sinenomine.net >> > >

1 0

Re: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316
by Brandon Allbery 06 Feb '15

06 Feb '15

On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani <takenobu.hs(a)gmail.com> wrote: > and, to haskell-cafe, > "Haskell Weekly News: Issue 316" original message[1] had sent only to > haskell@haskell.org? > (not to haskell-cafe? or my mailer trouble?) > gmail suppresses duplicate messages, so if you are subscribed to both lists you will receive it only once. -- brandon s allbery kf8nh sine nomine associates allbery.b(a)gmail.com ballbery(a)sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net

1 0