September 2012 - Haskell

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

ANNOUNCE: sqlite-simple 0.2.0.0: mid-level API to the sqlite database
by Janne Hellsten 30 Sep '12

30 Sep '12

sqlite-simple provides a convenient API to sqlite that performs automatic data conversion between the database and Haskell types. The API has been modeled directly after postgresql-simple which in turn borrows from mysql-simple. The library is available on hackage at http://hackage.haskell.org/package/sqlite-simple * * Notable changes since the previous announcement: - Better thought out module exports - this release makes it possible to add user-defined FromField instances (see https://github.com/nurpax/sqlite-simple/blob/master/test/UserInstances.hs) - sqlite-simple was upgraded to use the latest direct-sqlite 2.2 - As part of the release, the Snap sqlite-simple plugin snaplet-sqlite-simple was upgraded to the latest sqlite-simple. See http://hackage.haskell.org/package/snaplet-sqlite-simple * * Example usage First create a test database.. --------------- sqlite3 test.db "CREATE TABLE test (id INTEGER PRIMARY KEY, str text);\ INSERT INTO test (str) VALUES ('test string');" --------------- ..and access it in Haskell: --------------- import Control.Applicative import Database.SQLite.Simple import Database.SQLite.Simple.FromRow data TestField = TestField Int String deriving (Show) instance FromRow TestField where fromRow = TestField <$> field <*> field main :: IO () main = do conn <- open "test.db" execute conn "INSERT INTO test (str) VALUES (?)" (Only ("test string 2" :: String)) r <- query_ conn "SELECT * from test" :: IO [TestField] mapM_ print r close conn --------------- * * A lot of the code is directly borrowed from mysql-simple by Bryan O'Sullivan and from postgresql-simple by Leon P. Smith. Like Leon in postgresql-simple, I've borrowed code and documentation directly from both of these ancestor libraries. This package builds on top of the direct-sqlite package by Irene Knapp. Thanks to all of the above for helpful comments, features and code review. * * Bugs, feature requests? I'm happy to receive bug reports via github on: https://github.com/nurpax/sqlite-simple/issues For discussion, I recommend the database-devel mailing list: http://www.haskell.org/mailman/listinfo/database-devel Enjoy!

1 0

PEPM 2013: Deadline Extension
by Shin-Cheng Mu 28 Sep '12

28 Sep '12

F I N A L C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== DEADLINE EXTENSION - Important Dates: Abstract submission: October 2, 2012 Paper submission: October 7, 2012 Notification: November 6, 2012 - Selected papers will be invited to a Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: October 2, 2012 Paper submission: October 7, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers and short papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. INVITED SPEAKERS We are proud to present the following two invited talks: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations See the workshop web site homepage for abstracts. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France)

1 0

Haskell Weekly News: Issue 245
by Daniel Santa Cruz 27 Sep '12

27 Sep '12

Welcome to issue 245 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of September 16 to September 22, 2012. Quotes of the Week * dmwit: You have your intuition correct, despite all the pedantry in the room. * Cale: THIS CODE IS EXCELLENT CODE, I AM AN EXCELLENT ENTERPRISE PROGRAMMER ACCOMPLISHING REAL WORLD TASKS USING PATTERNS LIKE I READ ABOUT IN ALL THE JAVA BLOGS * byorgey: HASKELL is a pure, functional, strongly typed language featuring a name with all capitals, so it is suitable for beginners * ciaranm: a comonad is just a comonoid in the category of endofunctors. what's the coproblem? * dmwit: ISAAC -- ignore success at all costs * merijn: If you're not gonna use the types [by writing them] you might as well just write python * Cale: The real reason for the installed size of GHC being so large is that in the background it secretly downloads a video of SPJ riding a unicycle. Top Reddit Stories * First commercial Haskell-powered (game logic) computer game? (Nikki and the Robots Story Episodes) Domain: buy.joyridelabs.de, Score: 57, Comments: 27 On Reddit: [1] http://goo.gl/hngXz Original: [2] http://goo.gl/Y5Oax * Common misconceptions about Safe Haskell Domain: blog.ezyang.com, Score: 49, Comments: 23 On Reddit: [3] http://goo.gl/NBSx7 Original: [4] http://goo.gl/43i6n * The MonadTrans class is missing a method Domain: haskellforall.com, Score: 44, Comments: 32 On Reddit: [5] http://goo.gl/okxAX Original: [6] http://goo.gl/GnvzB * The Haskell Implementors' Workshop videos and slides available online Domain: haskell.org, Score: 43, Comments: 4 On Reddit: [7] http://goo.gl/LuORg Original: [8] http://goo.gl/pEvww * Writing javascript games in haskell : breakout Domain: jshaskell.blogspot.com, Score: 39, Comments: 10 On Reddit: [9] http://goo.gl/Dv8QK Original: [10] http://goo.gl/lXxsS * HIW 2012. Simon Peyton Jones: GHC Status Update. - YouTube Domain: youtube.com, Score: 37, Comments: 12 On Reddit: [11] http://goo.gl/3GEZK Original: [12] http://goo.gl/j7al9 * Comparing Snap's and Yesod's Template Languages Heist and Hamlet Domain: gist.github.com, Score: 36, Comments: 33 On Reddit: [13] http://goo.gl/AzaVV Original: [14] http://goo.gl/StRaF * Request: Tutorial on debugging using stack trace features of GHC 7.4 Domain: self.haskell, Score: 31, Comments: 6 On Reddit: [15] http://goo.gl/DcR1C Original: [16] http://goo.gl/DcR1C * A kind for regions Domain: monoidal.blogspot.com, Score: 29, Comments: 27 On Reddit: [17] http://goo.gl/4aBe7 Original: [18] http://goo.gl/tBDDW * [screencast] Quick introduction to Haskell using Gtk and the web Domain: vimeo.com, Score: 28, Comments: 4 On Reddit: [19] http://goo.gl/oi2IB Original: [20] http://goo.gl/LOkcf * Warp optimization - Sending header and body at once Domain: yesodweb.com, Score: 27, Comments: 17 On Reddit: [21] http://goo.gl/wstwx Original: [22] http://goo.gl/opsHb * Runtime Codegeneration in Haskell: Harpy vs. LLVM Domain: blog.wien.tomnetworks.com, Score: 24, Comments: 10 On Reddit: [23] http://goo.gl/aD0hE Original: [24] http://goo.gl/jU3nf * Show off your Vim/Emacs config! Domain: self.haskell, Score: 24, Comments: 7 On Reddit: [25] http://goo.gl/jV6Sa Original: [26] http://goo.gl/jV6Sa * Elm 0.4: Graphics Upgrade! Markdown, better for games, new optimizations, minification, ... Domain: elm-lang.org, Score: 22, Comments: 1 On Reddit: [27] http://goo.gl/SJW29 Original: [28] http://goo.gl/2Q5Fg * Making your zipper disappear with Zippo Domain: brandon.si, Score: 22, Comments: 6 On Reddit: [29] http://goo.gl/MQg77 Original: [30] http://goo.gl/Ua8a9 * [ANNOUNCE] Juicy.Pixels 2.0 - With Gif file decoding Domain: hackage.haskell.org, Score: 20, Comments: 12 On Reddit: [31] http://goo.gl/kEKrE Original: [32] http://goo.gl/EVvBh * Videos from this the CUFP 2012 in Copenhagen are now up Domain: cufp.org, Score: 17, Comments: 2 On Reddit: [33] http://goo.gl/mpe8Z Original: [34] http://goo.gl/aCB9I * Haskell developer jobs at StanChart - London, Singapore and Tianjin Domain: haskellers.com, Score: 17, Comments: 6 On Reddit: [35] http://goo.gl/t7axk Original: [36] http://goo.gl/wZrV5 * New GHCJS Hello World (can you find the hidden game?) Domain: ghcjs.github.com, Score: 17, Comments: 10 On Reddit: [37] http://goo.gl/c4BeA Original: [38] http://goo.gl/Aqh1i Top StackOverflow Questions * “What part of Milner-Hindley do you not understand?” votes: 73, answers: 4 Read on SO: [39] http://goo.gl/Nossl * Matching on type level Nat in GHC 7.6 votes: 17, answers: 1 Read on SO: [40] http://goo.gl/YijoA * Threading extra state through a parser in Scala votes: 16, answers: 1 Read on SO: [41] http://goo.gl/8cYMQ * find all types that are instances of a typeclass votes: 13, answers: 1 Read on SO: [42] http://goo.gl/ywHUN * When to use various language pragmas and optimisations? votes: 13, answers: 2 Read on SO: [43] http://goo.gl/qqtID * What are these explicit “forall”s doing? votes: 12, answers: 1 Read on SO: [44] http://goo.gl/fO0kf * How does the ST monad work? votes: 11, answers: 2 Read on SO: [45] http://goo.gl/xxntD * What are the pros and cons of adding additional functions/combinators to a typeclass definition? votes: 10, answers: 2 Read on SO: [46] http://goo.gl/HhDgT * Type parameters constraints for instances of typeclasses with kind * -> * votes: 9, answers: 2 Read on SO: [47] http://goo.gl/bGEQW * Theoretically, is this a valid comonad instance for a list? votes: 9, answers: 2 Read on SO: [48] http://goo.gl/z4DI4 * In haskell how can I uppercase a unicode character with respect to current locale votes: 9, answers: 1 Read on SO: [49] http://goo.gl/enNwK * Does haskell erase types? votes: 8, answers: 2 Read on SO: [50] http://goo.gl/YP8Nn * Is there an Iteratee-like concept which pulls data from multiple sources? votes: 8, answers: 4 Read on SO: [51] http://goo.gl/AOV0Y Until next time, Daniel Santa Cruz References 1. http://buy.joyridelabs.de/ 2. http://www.reddit.com/r/haskell/comments/106ocf/first_commercial_haskellpow… 3. http://blog.ezyang.com/2012/09/common-misconceptions-about-safe-haskell/ 4. http://www.reddit.com/r/haskell/comments/10242c/common_misconceptions_about… 5. http://www.haskellforall.com/2012/09/the-monadtrans-class-is-missing-method… 6. http://www.reddit.com/r/haskell/comments/106xwf/the_monadtrans_class_is_mis… 7. http://www.haskell.org/haskellwiki/HaskellImplementorsWorkshop/2012#Program… 8. http://www.reddit.com/r/haskell/comments/102x4p/the_haskell_implementors_wo… 9. http://jshaskell.blogspot.com/2012/09/breakout.html 10. http://www.reddit.com/r/haskell/comments/109hsb/writing_javascript_games_in… 11. http://www.youtube.com/watch?v=2Pucbf8_hGQ&feature=plcp 12. http://www.reddit.com/r/haskell/comments/102t49/hiw_2012_simon_peyton_jones… 13. https://gist.github.com/3757918 14. http://www.reddit.com/r/haskell/comments/107v79/comparing_snaps_and_yesods_… 15. http://www.reddit.com/r/haskell/comments/104xa2/request_tutorial_on_debuggi… 16. http://www.reddit.com/r/haskell/comments/104xa2/request_tutorial_on_debuggi… 17. http://monoidal.blogspot.com/2012/09/a-kind-for-regions.html 18. http://www.reddit.com/r/haskell/comments/102v1x/a_kind_for_regions/ 19. https://vimeo.com/49918847 20. http://www.reddit.com/r/haskell/comments/10az3o/screencast_quick_introducti… 21. http://www.yesodweb.com/blog/2012/09/header-body 22. http://www.reddit.com/r/haskell/comments/104sx0/warp_optimization_sending_h… 23. http://blog.wien.tomnetworks.com/2012/09/17/runtime-codegeneration-in-haske… 24. http://www.reddit.com/r/haskell/comments/1014ct/runtime_codegeneration_in_h… 25. http://www.reddit.com/r/haskell/comments/10b20f/show_off_your_vimemacs_conf… 26. http://www.reddit.com/r/haskell/comments/10b20f/show_off_your_vimemacs_conf… 27. http://elm-lang.org/blog/announce/version-0.4.0.elm 28. http://www.reddit.com/r/haskell/comments/102zqr/elm_04_graphics_upgrade_mar… 29. http://brandon.si/code/making-your-zipper-disappear-with-zippo/ 30. http://www.reddit.com/r/haskell/comments/103rhu/making_your_zipper_disappea… 31. http://hackage.haskell.org/package/JuicyPixels-2.0 32. http://www.reddit.com/r/haskell/comments/zziwm/announce_juicypixels_20_with… 33. http://cufp.org/videos 34. http://www.reddit.com/r/haskell/comments/102rer/videos_from_this_the_cufp_2… 35. http://www.haskellers.com/jobs/19 36. http://www.reddit.com/r/haskell/comments/106wat/haskell_developer_jobs_at_s… 37. http://ghcjs.github.com/bin/ghcjs-hello.jsexe 38. http://www.reddit.com/r/haskell/comments/10b6h3/new_ghcjs_hello_world_can_y… 39. http://stackoverflow.com/questions/12532552/what-part-of-milner-hindley-do-… 40. http://stackoverflow.com/questions/12463474/matching-on-type-level-nat-in-g… 41. http://stackoverflow.com/questions/12487827/threading-extra-state-through-a… 42. http://stackoverflow.com/questions/12524034/find-all-types-that-are-instanc… 43. http://stackoverflow.com/questions/12534145/when-to-use-various-language-pr… 44. http://stackoverflow.com/questions/12519878/what-are-these-explicit-foralls… 45. http://stackoverflow.com/questions/12468622/how-does-the-st-monad-work 46. http://stackoverflow.com/questions/12515655/what-are-the-pros-and-cons-of-a… 47. http://stackoverflow.com/questions/12497542/type-parameters-constraints-for… 48. http://stackoverflow.com/questions/12537149/theoretically-is-this-a-valid-c… 49. http://stackoverflow.com/questions/12537377/in-haskell-how-can-i-uppercase-… 50. http://stackoverflow.com/questions/12468722/does-haskell-erase-types 51. http://stackoverflow.com/questions/12496654/is-there-an-iteratee-like-conce…

1 0

ESOP Call For Papers
by Simon Peyton-Jones 26 Sep '12

26 Sep '12

Call for Papers ESOP 2013: The European Symposium on Programming http://www.ccs.neu.edu/esop2013/ Affiliated with ETAPS'13 Rome, Italy, 16-24 March 2013 DESCRIPTION AND TOPICS ESOP is an annual conference devoted to fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. ESOP seeks contributions on all aspects of programming language research including, but not limited to, the following areas: * Programming paradigms and styles: functional programming, object-oriented programming, aspect-oriented programming, logic programming, constraint programming, extensible programming languages, domain-specific languages, synchronous and real-time programming languages; * Methods and tools to write and specify programs and languages: programming techniques, logical foundations, denotational semantics, operational semantics, meta programming, module systems, language-based security; * Methods and tools for reasoning about programs: type systems, abstract interpretation, program verification, testing; * Methods and tools for implementation: program transformations, rewriting systems, partial evaluation, experimental evaluations, virtual machines, intermediate languages, run-time environments; * Concurrency and distribution: process algebras, concurrency theory, parallel programming, service-oriented computing, distributed and mobile languages. Contributions bridging the gap between theory and practice are particularly welcome. IMPORTANT DATES 7 October 2012: Submission deadline for abstracts 14 October 2012: Submission deadline for full papers 28 November 2012: Beginning of author response period 14 December 2012: Notification of decision 8 January 2013: Camera-ready versions due 16-24 March 2013: Presentations in Rome, Italy INFORMATION For additional information, point your browser at http://www.ccs.neu.edu/esop2013/

1 0

ANN: HERMIT for GHC 7.6
by Andrew Farmer 25 Sep '12

25 Sep '12

A new version of HERMIT (0.1.2.0) that is compatible with GHC 7.6 is now available on hackage. This release has essentially the same functionality as the 7.4-only pre-alpha release made before ICFP 2012. HERMIT (Haskell Equational Reasoning Model-to-Implementation Tunnel) is a plugin for GHC that provides an interactive interface for applying transformations directly to GHC's internal intermediate language, Core. This plugin is part of a larger HERMIT toolkit, which is being developed at the University of Kansas with the aims of supporting equational reasoning and allowing custom optimizations to be applied without modifying either GHC or the Haskell source code. Introduction to HERMIT via Neil Sculthorpe's Haskell Symposium 2012 talk: http://www.youtube.com/watch?v=x2QH3jJCJso Example transformations can be found in the examples folder, contained in the cabal source package. Hackage: http://hackage.haskell.org/package/hermit Github (for bug reports): https://github.com/ku-fpg/hermit Andrew Farmer

1 0

PEPM 2013: Final Call for Papers
by Shin-Cheng Mu 25 Sep '12

25 Sep '12

F I N A L C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== NEWS - Invited talks: Zhenjiang Hu: Practical Aspects of Bidirectional Graph Transformations Peter Thiemann: Partially Static Operations REMINDER - Important Dates: Abstract submission: September 28, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 - Selected papers will be invited to a Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: September 28, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers and short papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. INVITED SPEAKERS We are proud to present the following two invited talks: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations See the workshop web site homepage for abstracts. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France)

1 0

Re: [Haskell] Hackage2 server testing
by Duncan Coutts 25 Sep '12

25 Sep '12

On 25 September 2012 12:41, Herbert Valerio Riedel <hvr(a)gnu.org> wrote: > Ian Lynagh <ian(a)well-typed.com> writes: > >> I am pleased to announce that a test instance of the Hackage 2 server is >> now running at >> http://new-hackage.haskell.org/ >> >> The plan is to test the new server for 3 weeks (until Monday 24 >> September), before switching over to Hackage 2 for real. > > ...as it's now past monday... what's the status? is the switch-over going to happen now? Hi Herbert, Ian has handed the task over to me, so I'll be leading the switchover, along with the admins we've recruited. We have a few issues we're still working on, mainly to do with importing the old data and making the account switchover smooth. https://github.com/haskell/cabal/issues?labels=hackage2%2Cimportant&state=o… I'll post more details on the cabal-devel mailing list in the coming days, so you can follow it there. -- Duncan Coutts, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0

4 PhD Positions at Chalmers
by Andrei Sabelfeld 25 Sep '12

25 Sep '12

4 PhD Positions at Chalmers University of Technology, Gothenburg, Sweden Deadline: October 31, 2012 The Department of Computer Science and Engineering ( http://www.chalmers.se/cse/EN ) has about 70 faculty members and enrolls about 70 PhD students from more than 30 countries. The research spans the whole spectrum from theoretical foundations to applied systems development. There is extensive national and international collaboration with academia and industry all around the world. We particularly encourage applicants with interests in: -Programming language-based security (up to 2 positions): http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL… or contact Andrei Sabelfeld (andrei at chalmers.se) -Parallel algorithms and data structures in heterogeneous multi-core systems: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL… or contact Philippas Tsigas (tsigas at chalmers.se) -Privacy through language-based security and formal methods: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL… or contact Gerardo Schneider (gerardo.schneider at ituniv.se) Information on how to apply can be found via the URL’s above. Applicants shall have a Master’s Degree or corresponding in Computer Science, Computer Engineering, or in a related discipline. A genuine interest and curiosity in the subject matter and excellent analytical and communication skills, orally as well as literally, are needed. The employment is expected to start early 2013 (deviations are negotiable). As a Ph.D. student you are employed by Chalmers and will receive a salary according to current salary agreements (starting salary at present: approx. 25000SEK before taxes). A maximum of 20% of your time will be devoted to other duties at the department, mainly teaching. The remaining time will be devoted to your own courses and research within the project and you are expected to obtain a Ph.D. within a maximum of 5 years. You may apply even though you might not have completed your degree yet, but expect to do so before the position starts. Knowledge of Swedish is not a prerequisite for application. English is our working language for research and education at Master level. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes; the rest come from more than 30 different countries. Live in Gothenburg: http://youtu.be/sbwVIQeGcdY Study in Gothenburg: http://youtu.be/0WrlGlSyS1c

1 0