June 2013 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

2nd CFP: SCSS 2013
by Temur Kutsia 18 Sep '13

18 Sep '13

[Please post - apologies for multiple copies.] Second Call for Papers SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ María Alpuente (Technical University of Valencia, Spain) Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University — Qatar Campus) Horatiu Cirstea (Loria, France) Jürgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Paul Jackson (University of Edinburgh, UK) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Pierre-Etienne Moreau (INRIA-LORIA Nancy, France) André Platzer (Carnegie Mellon University, USA) Stefan Ratschan (Czech Academy of Sciences) Rachid Rebiha (University of Lugano, Switzerland and IC Unicamp, Brazil) Enric Rodríguez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Important Dates --------------- April 30, 2013: Abstract submission deadline May 3, 2013: Paper submission deadline June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: SCSS 2013, Castle of Hagenberg, Austria Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing.

2 1

Re: [Haskell] [Haskell-cafe] Job opportunities at Galois
by Iavor Diatchki 27 Jun '13

27 Jun '13

Hello, (Alejandro, sorry for the duplicate message but a couple of folks asked the same, so I thought I'd reply to the list). We are looking for people to work at our office (i.e., not remotely). Unfortunately, H1B visas have run out for this year, so right now we are looking for folks who are already eligible to work in the US. -Iavor On Thu, Jun 27, 2013 at 9:03 AM, Alejandro Serrano Mena <trupill(a)gmail.com>wrote: > Hello, > Are there any specific details to consider when applying? For example, is > living in the US or having a visa required for application? > > Thanks in advance. > > > 2013/6/27 Iavor Diatchki <iavor.diatchki(a)gmail.com> > >> Hello, >> >> Galois is hiring! We're looking for researchers, principal >> investigators, and software engineers, including those with expertise in >> functional programming, formal methods, computer security, control systems, >> informatics, or networking. >> >> For more information, take a look at http://corp.galois.com/careers and >> please feel free to drop me an e-mail if you have questions. >> >> Cheers, >> -Iavor >> >> >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe(a)haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> >> >

1 0

Job opportunities at Galois
by Iavor Diatchki 27 Jun '13

27 Jun '13

Hello, Galois is hiring! We're looking for researchers, principal investigators, and software engineers, including those with expertise in functional programming, formal methods, computer security, control systems, informatics, or networking. For more information, take a look at http://corp.galois.com/careers and please feel free to drop me an e-mail if you have questions. Cheers, -Iavor

1 0

Call for Papers: Kiel Declarative Programming Days 2013
by mh＠informatik.uni-kiel.de 27 Jun '13

27 Jun '13

====================================================================== CALL FOR PAPERS Kiel Declarative Programming Days 2013 September 11-13, 2013 http://www-ps.informatik.uni-kiel.de/kdpd2013/ The Kiel Declarative Programming Days 2013 unifies the following events: * 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013, http://www.dcc.fc.up.pt/INAP-2013/) * 22nd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) * 27th Workshop on Logic Programming (WLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) All events will be jointly organized and have the same dates: Submission of papers: July 7, 2013 Notification of acceptance: July 28, 2013 Camera-ready papers: August 18, 2013 Please look into the web sites of the individual events for details about paper submissions. ======================================================================

1 0

Haskell Weekly News: Issue 271
by Daniel Santa Cruz 27 Jun '13

27 Jun '13

Welcome to issue 271 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 9 to 11, 2013. Quotes of the Week * cmccann: also please note that "malign" remains one of my best function names ever * dolio: Peak file descriptors is a myth. * mami: i think my brain rewired for higher typesystem compatibility in my sleep * elliott: it's impure but only depending on the environment! which is to say it is impure. * johnw: lens makes one into a mutating ninja * applicativ: een my language we say Z for one * DavidJacobs: Code is like poetry; most of it shouldn't have been written. * merijn: If I could program with arbitrary real world side effects I'd use "unsafeStabComputerUser" if someone attempted that * shachaf: Hackage going down regularly is part of the rustic charm of Haskell! * shachaf: JavaScript is the best example of a domain-specific language. Because of the same-origin policy. * chrisdone: [on being invited to help with idris development] dude i've already got 20 yaks lined up waiting to be shaved, don't send me a whole truck full * shachaf: edwardk isn't benevolent or malevolent. edwardk is more of a simple mechanical process tending toward maximal complexity. * AndrejBauer: When have you ever heard a category theorist say: I want to prove this diagram commutesâLet's suppose it doesn't. Top Reddit Stories * Applicative => Monad is coming. Domain: haskell.org, Score: 122, Comments: 62 On Reddit: [1] http://goo.gl/JCvQ4 Original: [2] http://goo.gl/fJxeX * The Homotopy Type Theory Book is now available for free online and in print at Lulu.com Domain: homotopytypetheory.org, Score: 86, Comments: 16 On Reddit: [3] http://goo.gl/x8nLW Original: [4] http://goo.gl/DR9gf * Three useful monads Domain: adit.io, Score: 71, Comments: 25 On Reddit: [5] http://goo.gl/WHqPr Original: [6] http://goo.gl/1r8nC * Beta sign up for FP Complete new IDE Domain: fpcomplete.com, Score: 63, Comments: 11 On Reddit: [7] http://goo.gl/RPV0P Original: [8] http://goo.gl/c03Od * HLearn implements more with 6 trivial lines of Haskell than Weka implements with over 100 complex lines of Java Domain: izbicki.me, Score: 47, Comments: 9 On Reddit: [9] http://goo.gl/EEqwS Original: [10] http://goo.gl/Ukk4E * Top secret School of Haskell articles leaked Domain: self.haskell, Score: 47, Comments: 17 On Reddit: [11] http://goo.gl/zhhYm Original: [12] http://goo.gl/zhhYm * F-algebra tutorial Domain: fpcomplete.com, Score: 41, Comments: 35 On Reddit: [13] http://goo.gl/Ybmbs Original: [14] http://goo.gl/szfGk * John Carmack on haskell today. Domain: self.haskell, Score: 40, Comments: 79 On Reddit: [15] http://goo.gl/8qHkt Original: [16] http://goo.gl/8qHkt * Data Flow Fusion with Series Expressions in Haskell Domain: justtesting.org, Score: 40, Comments: 19 On Reddit: [17] http://goo.gl/ZNeIP Original: [18] http://goo.gl/JAjjy * So you still don't understand Hindley-Milner? Part 1 Domain: akgupta.ca, Score: 38, Comments: 0 On Reddit: [19] http://goo.gl/OOk43 Original: [20] http://goo.gl/SZ1Gb * Ask HN: Any downsides of programming in Haskell? Domain: news.ycombinator.com, Score: 36, Comments: 104 On Reddit: [21] http://goo.gl/vRuHW Original: [22] http://goo.gl/fcleS * FP Complete - Haskell Introduction Domain: youtube.com, Score: 36, Comments: 12 On Reddit: [23] http://goo.gl/GqgC5 Original: [24] http://goo.gl/KoVYs * Fix your posture with haskell Domain: github.com, Score: 35, Comments: 2 On Reddit: [25] http://goo.gl/lznTr Original: [26] http://goo.gl/x21Ax * preprint list for ICFP'13 papers (additional links welcome) Domain: github.com, Score: 34, Comments: 9 On Reddit: [27] http://goo.gl/mZsTn Original: [28] http://goo.gl/bhbC9 * GHC: now with closed type families Domain: github.com, Score: 34, Comments: 15 On Reddit: [29] http://goo.gl/JJSSv Original: [30] http://goo.gl/QlV4s Top StackOverflow Questions * How to compare two functions for equivalence, as in (λx.2*x) == (λx.x+x)? votes: 15, answers: 2 Read on SO: [31] http://goo.gl/A6YDd * Should I use typeclasses or not? votes: 15, answers: 2 Read on SO: [32] http://goo.gl/EOV1M * Is there something like `map2 :: (i -> a) -> (i -> b) -> [i] -> [(a,b)]`? votes: 11, answers: 2 Read on SO: [33] http://goo.gl/WZyEy * Why isn't GeneralizedNewtypeDeriving a Safe Haskell? votes: 11, answers: 1 Read on SO: [34] http://goo.gl/on6Fc * It's not a monad, but what is it? votes: 10, answers: 0 Read on SO: [35] http://goo.gl/sm9gR * Writing efficient iterative loop for ST monad votes: 10, answers: 0 Read on SO: [36] http://goo.gl/WAAwA * Getting multiple results from map with “lens” votes: 10, answers: 2 Read on SO: [37] http://goo.gl/zqX8E * How to run Frege programs on Android? votes: 10, answers: 2 Read on SO: [38] http://goo.gl/XlSCN * Are there problems that can't be solved efficiently without arrays? [duplicate] votes: 9, answers: 0 Read on SO: [39] http://goo.gl/Z5j9a * Haskell: How to organize a group of functions that all take the same arguments votes: 9, answers: 4 Read on SO: [40] http://goo.gl/z64H7 Until next time, [41]+Daniel Santa Cruz References 1. http://www.haskell.org/haskellwiki/Functor-Applicative-Monad_Proposal 2. http://www.reddit.com/r/haskell/comments/1gsejt/applicative_monad_is_coming/ 3. http://homotopytypetheory.org/book/ 4. http://www.reddit.com/r/haskell/comments/1gr3uw/the_homotopy_type_theory_bo… 5. http://adit.io/posts/2013-06-10-three-useful-monads.html 6. http://www.reddit.com/r/haskell/comments/1g3a7e/three_useful_monads/ 7. https://www.fpcomplete.com/blog/2013/06/beta-sign-up 8. http://www.reddit.com/r/haskell/comments/1giy7l/beta_sign_up_for_fp_complet… 9. http://izbicki.me/blog/hlearns-code-is-shorter-and-clearer-than-wekas 10. http://www.reddit.com/r/haskell/comments/1g4v7u/hlearn_implements_more_with… 11. http://www.reddit.com/r/haskell/comments/1g5k80/top_secret_school_of_haskel… 12. http://www.reddit.com/r/haskell/comments/1g5k80/top_secret_school_of_haskel… 13. https://www.fpcomplete.com/user/bartosz/understanding-algebras 14. http://www.reddit.com/r/haskell/comments/1g2g3s/falgebra_tutorial/ 15. http://www.reddit.com/r/haskell/comments/1g1mvx/john_carmack_on_haskell_tod… 16. http://www.reddit.com/r/haskell/comments/1g1mvx/john_carmack_on_haskell_tod… 17. http://justtesting.org/post/53175916852/data-flow-fusion-with-series-expres… 18. http://www.reddit.com/r/haskell/comments/1gi5m1/data_flow_fusion_with_serie… 19. http://akgupta.ca/blog/2013/05/14/so-you-still-dont-understand-hindley-miln… 20. http://www.reddit.com/r/haskell/comments/1g0ueo/so_you_still_dont_understan… 21. https://news.ycombinator.com/item?id=5893442 22. http://www.reddit.com/r/haskell/comments/1gknfs/ask_hn_any_downsides_of_pro… 23. https://www.youtube.com/watch?v=Fqi0Xu2Enaw 24. http://www.reddit.com/r/haskell/comments/1glw2o/fp_complete_haskell_introdu… 25. https://github.com/keera-studios/keera-posture 26. http://www.reddit.com/r/haskell/comments/1gr044/fix_your_posture_with_haske… 27. https://github.com/gasche/icfp2013-papers#readme 28. http://www.reddit.com/r/haskell/comments/1gg2xf/preprint_list_for_icfp13_pa… 29. https://github.com/ghc/ghc/commit/569b26526403df4d88fe2a6d64c7dade09d003ad 30. http://www.reddit.com/r/haskell/comments/1gu2yl/ghc_now_with_closed_type_fa… 31. http://stackoverflow.com/questions/17045941/how-to-compare-two-functions-fo… 32. http://stackoverflow.com/questions/17100036/should-i-use-typeclasses-or-not 33. http://stackoverflow.com/questions/17074424/is-there-something-like-map2-i-… 34. http://stackoverflow.com/questions/17137111/why-isnt-generalizednewtypederi… 35. http://stackoverflow.com/questions/17034427/its-not-a-monad-but-what-is-it 36. http://stackoverflow.com/questions/17126923/writing-efficient-iterative-loo… 37. http://stackoverflow.com/questions/17144334/getting-multiple-results-from-m… 38. http://stackoverflow.com/questions/17222383/how-to-run-frege-programs-on-an… 39. http://stackoverflow.com/questions/17128103/are-there-problems-that-cant-be… 40. http://stackoverflow.com/questions/17176829/haskell-how-to-organize-a-group… 41. https://plus.google.com/105107667630152149014/about

1 0

Re: [Haskell] Quipper: a quantum programming language
by Takayuki Muranushi 21 Jun '13

21 Jun '13

Thank you for your explanation, Peter. 30 trillion of something is quite a lot! In fact it's not easy to imagine that amount of object would fit in a laptop's memory. http://arxiv.org/pdf/1304.3390v1.pdf Is there some technique involved like succinct data structure, shared data structure or streaming write to disk? I'm also interested in Quipper's "scalability" in classical sense, i.e. ability to utilize multi-core and/or distributed computation environments. 2013/6/21 Peter Selinger <selinger(a)mathstat.dal.ca> > Dear Takayuki, > > thanks for your interest! I hope you'll get a chance to play with > Quipper. > > By "scalable", we mean that we have used Quipper to generate circuits > with over 30 trillion gates. So it's not just a toy that works for > small examples. > > Best wishes, -- Peter > > Takayuki Muranushi wrote: > > > > This library excites me! As a physics undergrad I read Nielsen & Chuang > > with my friends, for me quantum computation was best clue of > understanding > > quantum mechanics. Allow me to make a comment, or, a tl;dr question... > > > > Would you elaborate "Quipper is scalable" ? > > > > > > 2013/6/20 Alexander Green <alexander.s.green(a)gmail.com> > > > > > Dear Haskellers, > > > > > > we are proud to announce the first public release of Quipper, an > > > embedded, scalable functional programming language for quantum > > > computing. The Quipper distribution is available here: > > > > > > http://www.mathstat.dal.ca/~selinger/quipper/ > > > > > > and includes extensive documentation, as well as seven worked examples > > > of non-trivial quantum algorithms from the literature. > > > > > > Quipper is embedded in Haskell and makes use of many advanced > > > features of the GHC Glasgow Haskell Compiler. Here are some highlights: > > > > > > * High-level circuit description language, including both gate-by-gate > > > descriptions and powerful higher-order operators for assembling and > > > manipulating circuits. > > > > > > * A monadic semantics, allowing for a mixture of procedural and > > > declarative programming styles. > > > > > > * Built-in facilities for automatic synthesis of reversible quantum > > > circuits, including from classical Haskell code. > > > > > > * Support for hierarchical circuits. > > > > > > * Extensible quantum data types. > > > > > > * Programmable circuit transformers > > > > > > * Support for a dynamic lifting operation to allow circuit generation > > > to depend on parameters generated at circuit execution time. > > > > > > * Extensive libraries of quantum functions, including: libraries for > > > quantum integer and fixed-point arithmetic; the Quantum Fourier > > > transform; an efficient Qram implementation; libraries for > > > simulation of pseudo-classical circuits, Stabilizer circuits, and > > > arbitrary circuits; libraries for exact and approximate > > > decomposition of circuits into specific gate sets. > > > > > > Comments are welcome! > > > > > > Alexander S. Green > > > Peter LeFanu Lumsdaine > > > Neil Julien Ross > > > Peter Selinger > > > Benoit Valiron > > > > > > > > > _______________________________________________ > > > Haskell mailing list > > > Haskell(a)haskell.org > > > http://www.haskell.org/mailman/listinfo/haskell > > > > > > > > > > > > -- > > Takayuki MURANUSHI > > The Hakubi Center for Advanced Research, Kyoto University > > http://www.hakubi.kyoto-u.ac.jp/02_mem/h22/muranushi.html > -- Takayuki MURANUSHI The Hakubi Center for Advanced Research, Kyoto University http://www.hakubi.kyoto-u.ac.jp/02_mem/h22/muranushi.html

1 0

Quipper: a quantum programming language
by Alexander Green 20 Jun '13

20 Jun '13

Dear Haskellers, we are proud to announce the first public release of Quipper, an embedded, scalable functional programming language for quantum computing. The Quipper distribution is available here: http://www.mathstat.dal.ca/~selinger/quipper/ and includes extensive documentation, as well as seven worked examples of non-trivial quantum algorithms from the literature. Quipper is embedded in Haskell and makes use of many advanced features of the GHC Glasgow Haskell Compiler. Here are some highlights: * High-level circuit description language, including both gate-by-gate descriptions and powerful higher-order operators for assembling and manipulating circuits. * A monadic semantics, allowing for a mixture of procedural and declarative programming styles. * Built-in facilities for automatic synthesis of reversible quantum circuits, including from classical Haskell code. * Support for hierarchical circuits. * Extensible quantum data types. * Programmable circuit transformers * Support for a dynamic lifting operation to allow circuit generation to depend on parameters generated at circuit execution time. * Extensive libraries of quantum functions, including: libraries for quantum integer and fixed-point arithmetic; the Quantum Fourier transform; an efficient Qram implementation; libraries for simulation of pseudo-classical circuits, Stabilizer circuits, and arbitrary circuits; libraries for exact and approximate decomposition of circuits into specific gate sets. Comments are welcome! Alexander S. Green Peter LeFanu Lumsdaine Neil Julien Ross Peter Selinger Benoit Valiron

2 1

Extended deadline for a call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13)
by Hongseok Yang 19 Jun '13

19 Jun '13

We have extended the HOPE'13 deadline until a few days after the POPL'14 deadline so as not to conflict with the run-up to the POPL'14 deadline, and to encourage researchers to submit talk proposals based on any POPL'14 submissions that they may be preparing. *NOTE*: According to the POPL'14 FAQ at http://www.cl.cam.ac.uk/~pes20/Stuff/dbr-faq.html (and after consultation with the POPL'14 program chair), we have determined that there is no problem with researchers submitting talk proposals to HOPE'13 based on their POPL submissions, even though the HOPE reviewing process is not double-blind. If you have any questions or concerns about this point, please do not hesitate to contact the HOPE program chairs at hope2013(a)mpi-sws.org. ---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org *** Extended Deadline: JULY 15, 2013 (Monday) *** ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. We recommend to prepare proposals with at most 2 pages, in either plain text or PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. When submitting talk proposals, the authors should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2013 AT mpi-sws.org. Deadline for talk proposals: JULY 15, 2013 (Monday) (NEW) Notification of acceptance: August 2, 2013 (Friday) (NEW) Workshop: September 28, 2013 (Saturday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2013 --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale)

1 0