November 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

Haskell stars in experimental film
by Simon Peyton-Jones 02 Jan '13

02 Jan '13

Friends You may enjoy this weird 2-minute video: http://www.youtube.com/watch?v=WtfvoiqLZrs&feature=youtu.be It stars our cat (who is called Haskell at my children's insistence) in an "experimental concrete music video", created by a Cambridge undergrad music student. Enjoy! (What is concrete music, btw?) Simon

4 3

Re: [Haskell] Status of Haskell'?
by Gábor Lehel 01 Dec '12

01 Dec '12

On Fri, Nov 30, 2012 at 11:06 PM, Nate Soares <nate(a)so8r.es> wrote: > >> This standardization process amounts to "endorsement of existing >> features" which seems like not a bad process at all. It makes >> the standard descriptive rather than predictive. > > > +1. I agree generally with Gabor's points -- GHC is in the drivers seat. But > at some point we should take a look at all the things GHC has made that did > pay off and that are good and make them official. > > I'd very much like to see that endorsement happen soon, even if it's not > aggressive. Well, I'm not so sure it's a great idea to just bake "what GHC does at this moment" (for any particular extension) into the standard without really thinking about it. Even then, you have to figure out, in great detail, what GHC does, and write it all down! That's not negligible effort, either. And the alternative is to also publicly discuss and hash all of it out down to the little tiny gritty stuff. But wanting to write a new standard (big effort!) just to get rid of some pragmas and make people feel better (small payoff!) feels like a mismatch to me. Maybe as some kind of useful in-between point, the GHC folks could figure out which extensions they like enough that they would, modulo all the details getting figured out and specified, be in favor of them going into a new standard, and fold all of them into a new LANGUAGE definition? So then you would write {-# LANGUAGE HaskellNext #-}, or HaskellGHC, or something like that, to enable all of them in one go. That wouldn't require specifying things down to the tiniest details (which is what a standard requires), but only at the granularity of particular extensions, which is what people seem to be looking for. Maybe instead of the GHC people deciding it, there could be some kind of community process (such as a vote). (And yeah, this sounds eerily similar to -fglasgow-exts, which is what we got rid of in favor of LANGUAGE pragmas, but maybe the fact that -fglasgow-exts turned mostly all extensions on indiscriminately, whereas this would be a curated subset, is a significant enough difference to turn it from a bad idea into a good one.) -- Your ship was destroyed in a monadic eruption.

5 6

Re: [Haskell] Status of Haskell'?
by Simon Peyton-Jones 01 Dec '12

01 Dec '12

I'd argue that it's not. Haskell hasn't had a release in years, and I think it's time to put a little pressure on the community. The question is: who is "the community"? It's fairly clear that the Haskell Prime process itself is languishing. The last message about the development process that I can find is this one from Malcolm Wallace<http://www.haskell.org/pipermail/haskell-prime/2011-January/003335.html>, in January 2011. But please don't blame Malcolm or the committee<http://hackage.haskell.org/trac/haskell-prime/wiki/Committee>. Developing new, well-specified changes to Haskell will only happen if there is a vigorous eco-system of folk who are prepared to devote the love and time to do it. There are plenty of people (myself among them) who would be delighted if there was a series of well-specified updates to the Haskell standard; but it is harder to assemble a group that is willing to move that process forward. Why not? I don't think it's laziness or selfishness; just look at how helpful people are on the mailing list. Rather, I am guessing that it's a subconscious assessment of cost/benefit. The cost is certainly significant, and (unlike a quick email response on Haskell Cafe) takes place over months. The benefit, for an individual, is harder to articulate. GHC defines a de-facto standard, simply by existing, and for many practical purposes that is good enough. However, GHC is (quite consciously) exploring stuff that may or may not ultimately turn out to be a good idea: it's a laboratory, not an every-detail-thought-out product. [Though of course we try hard to be good enough for production use.] So there is real merit in having a group, not too closely coupled to GHC, that picks off the best ideas and embodies them in a language standard. But if for any one individual, GHC is "good enough", then the benefits of a language standard may seem distant and diffuse. I don't have a solution to this particular conundrum. As many of you will remember, the Haskell Prime process<http://hackage.haskell.org/trac/haskell-prime/wiki/Process> was itself developed in response to a sense that making a "big iteration" of the language was so large a task that no one felt able to even begin it. Hence the deliberately more incremental nature of Haskell Prime; but even this lighter-weight process is rather stuck. I'm sure that any solution will involve (as it did in earlier stages) motivated individuals who are willing to take up leadership roles in developing Haskell's language definition. I'm copying this to the main Haskell list, in the hope of attracting volunteers! Simon From: haskell-prime-bounces(a)haskell.org [mailto:haskell-prime-bounces@haskell.org] On Behalf Of Nate Soares Sent: 27 November 2012 22:44 To: Ben Millwood Cc: haskell-prime(a)haskell.org Prime Subject: Re: Status of Haskell'? > it might be wise to see what GHC decides to do on that front, first, I'd argue that it's not. Haskell hasn't had a release in years, and I think it's time to put a little pressure on the community. On Tue, Nov 27, 2012 at 2:15 PM, Ben Millwood <haskell(a)benmachine.co.uk<mailto:haskell@benmachine.co.uk>> wrote: On Tue, Nov 27, 2012 at 5:35 PM, Ian Lynagh <igloo(a)earth.li<mailto:igloo@earth.li>> wrote: > [...] adding DeriveDataTypeable > hopefully wouldn't be too controversial [...] This is a little tricky since the Data class itself makes (essential, I think) use of Rank2Types. Typeable ought to be fine, but it might be wise to see what GHC decides to do on that front, first, e.g. whether it's going to autoderive all instances or forbid user instances or anything else similarly bold. _______________________________________________ Haskell-prime mailing list Haskell-prime(a)haskell.org<mailto:Haskell-prime@haskell.org> http://www.haskell.org/mailman/listinfo/haskell-prime

6 5

Haskell Weekly News: Issue 252
by Daniel Santa Cruz 29 Nov '12

29 Nov '12

Welcome to issue 252 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of November 18 to 24, 2012. Quotes of the Week * rwbarton: edwardk now has Lens under Control * atriq: My son looks a bit like me, he can put away the plates after dinner now thanks to edwardk! * mgsloan: Lens got 99 operators, but a (|>) ain't one. * hiptobecubic: I feel like this program is just a bunch of glue and duct tape holding a bottle of nitroglycerine off of the ground. * xplat: Some software is worth trying; most is just plain trying. * edwardk: Control.Lens is my secret ploy to get everyone to give up on Haskell and just move on to Agda as they find the Haskell types too complicated by comparison. * rwbarton: alpha reduction is what happens when you let edwardk maintain your module * edwardk: er that was a tongue sticking out, not an operator suggestion Top Reddit Stories * [Haskell] Leaving Microsoft Domain: haskell.org, Score: 139, Comments: 24 On Reddit: [1] http://goo.gl/DnzZF Original: [2] http://goo.gl/eVcXi * Help Nikki (Game written in Haskell) jump on Steam! Domain: joyridelabs.de, Score: 77, Comments: 8 On Reddit: [3] http://goo.gl/EzLh8 Original: [4] http://goo.gl/H84Nl * Gaussian distributions are monoids Domain: izbicki.me, Score: 46, Comments: 24 On Reddit: [5] http://goo.gl/i4keo Original: [6] http://goo.gl/C0gnN * Getting Started with Lenses Domain: newartisans.com, Score: 42, Comments: 32 On Reddit: [7] http://goo.gl/nv4ab Original: [8] http://goo.gl/h2zCa * Designing the Haskell IDE Domain: fpcomplete.com, Score: 41, Comments: 112 On Reddit: [9] http://goo.gl/yz1Rf Original: [10] http://goo.gl/gpJd7 * Putting haskell down Domain: b7j0c.org, Score: 33, Comments: 279 On Reddit: [11] http://goo.gl/8JWmr Original: [12] http://goo.gl/tZcbj * London Haskell Video (24-Oct-2012) – Why Do Monads Matter? Domain: youtube.com, Score: 33, Comments: 5 On Reddit: [13] http://goo.gl/uWH6w Original: [14] http://goo.gl/KqDji * Combinatorial species definition (Brent Yorgey) Domain: byorgey.wordpress.com, Score: 31, Comments: On Reddit: [15] http://goo.gl/0llrA Original: [16] http://goo.gl/PWIep * PhD Positions in Functional Programming at Chalmers (appl. deadline 2012-12-12) Domain: chalmers.se, Score: 28, Comments: On Reddit: [17] http://goo.gl/WAmYP Original: [18] http://goo.gl/JenYO * Video of the presentations at the first NYC Haskell User's Group meetup. Domain: vimeo.com, Score: 25, Comments: 10 On Reddit: [19] http://goo.gl/rxN75 Original: [20] http://goo.gl/uV4wc Top StackOverflow Questions * Where to start with dependent type programming? votes: 16, answers: 1 Read on SO: [21] http://goo.gl/HXdOu * What other ways can state be handled in a pure functional language besides with Monads? votes: 13, answers: 3 Read on SO: [22] http://goo.gl/D86hV * Why are some Prelude functions defined in terms of foldl? votes: 8, answers: 3 Read on SO: [23] http://goo.gl/wewrb * cabal FFI dependency votes: 8, answers: 1 Read on SO: [24] http://goo.gl/JFtJM * How to write Ctrl-C handler in Haskell? votes: 7, answers: 1 Read on SO: [25] http://goo.gl/pS651 * Why does the 2-tuple Functor instance only apply the function to the second element? votes: 5, answers: 2 Read on SO: [26] http://goo.gl/qGgSv * Type Families with GHC.Generics or Data.Data votes: 5, answers: 0 Read on SO: [27] http://goo.gl/mERdP * Haskell Programmatically/Dynamically Define Functions votes: 5, answers: 6 Read on SO: [28] http://goo.gl/22Wf0 * is this implementation of merge sort good? votes: 5, answers: 1 Read on SO: [29] http://goo.gl/Skznl * Railroad diagrams for Haskell? votes: 5, answers: 1 Read on SO: [30] http://goo.gl/ZeJa9 * Is FRP a proper way to implement most “event-driven” things? votes: 5, answers: 1 Read on SO: [31] http://goo.gl/QglPp * Stack overflow in very simple code votes: 5, answers: 1 Read on SO: [32] http://goo.gl/wB0kg * Mapping over Either's Left votes: 5, answers: 3 Read on SO: [33] http://goo.gl/oJX4v * Haskell - strict vs non-strict with foldl votes: 5, answers: 2 Read on SO: [34] http://goo.gl/3ElzK Until next time, Daniel Santa Cruz References 1. http://www.haskell.org/pipermail/haskell/2012-November/023566.html 2. http://www.reddit.com/r/haskell/comments/13m8eu/haskell_leaving_microsoft/ 3. http://joyridelabs.de/blog/?p=1548 4. http://www.reddit.com/r/haskell/comments/13muex/help_nikki_game_written_in_… 5. http://izbicki.me/blog/gausian-distributions-are-monoids 6. http://www.reddit.com/r/haskell/comments/13qyg2/gaussian_distributions_are_… 7. http://newartisans.com/2012/11/getting-started-with-lenses/ 8. http://www.reddit.com/r/haskell/comments/13l9vj/getting_started_with_lenses/ 9. http://fpcomplete.com/designing-the-haskell-ide/ 10. http://www.reddit.com/r/haskell/comments/13gn8k/designing_the_haskell_ide/ 11. https://www.b7j0c.org/blog/putting_haskell_down.html 12. http://www.reddit.com/r/haskell/comments/13g0ul/putting_haskell_down/ 13. http://www.youtube.com/watch?v=3q8xYFDYLeI 14. http://www.reddit.com/r/haskell/comments/13nwxu/london_haskell_video_24oct2… 15. http://byorgey.wordpress.com/2012/11/20/combinatorial-species-definition/ 16. http://www.reddit.com/r/haskell/comments/13iz3p/combinatorial_species_defin… 17. http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?rmpag… 18. http://www.reddit.com/r/haskell/comments/13nxtx/phd_positions_in_functional… 19. http://vimeo.com/53906049 20. http://www.reddit.com/r/haskell/comments/13hyjt/video_of_the_presentations_… 21. http://stackoverflow.com/questions/13497865/where-to-start-with-dependent-t… 22. http://stackoverflow.com/questions/13536761/what-other-ways-can-state-be-ha… 23. http://stackoverflow.com/questions/13474932/why-are-some-prelude-functions-… 24. http://stackoverflow.com/questions/13544642/cabal-ffi-dependency 25. http://stackoverflow.com/questions/13441676/how-to-write-ctrl-c-handler-in-… 26. http://stackoverflow.com/questions/13442544/why-does-the-2-tuple-functor-in… 27. http://stackoverflow.com/questions/13448361/type-families-with-ghc-generics… 28. http://stackoverflow.com/questions/13452907/haskell-programmatically-dynami… 29. http://stackoverflow.com/questions/13455849/is-this-implementation-of-merge… 30. http://stackoverflow.com/questions/13485374/railroad-diagrams-for-haskell 31. http://stackoverflow.com/questions/13486293/is-frp-a-proper-way-to-implemen… 32. http://stackoverflow.com/questions/13489676/stack-overflow-in-very-simple-c… 33. http://stackoverflow.com/questions/13503965/mapping-over-eithers-left 34. http://stackoverflow.com/questions/13533586/haskell-strict-vs-non-strict-wi…

1 0

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

27 Nov '12

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

1 0

Call for Papers: PLACES'13 -- Deadline for Abstracts 14 December
by Wim Vanderbauwhede 26 Nov '12

26 Nov '12

CALL FOR PAPERS PLACES'13 Programming Language Approaches to Concurrency and Communication-cEntric Software 23rd March 2013, Rome, Italy (affiliated with ETAPS 2013) http://places13.di.fc.ul.pt/ Applications today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed from a large number of processing units. Many applications need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems is inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. ** Topics of Interest ** Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: * language design and implementations for communications and/or concurrency, * session types, * concurrent data types, * concurrent objects and actors, * multicore programming, * use of message passing in systems software, * interface languages for communication and distribution, * program analysis, * web services, * novel programming methodologies for sensor networks, * integration of sequential and concurrent programming, * high-level programming abstractions for security concerns in concurrent, distributed programming, * runtime architectures for concurrency, * scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Submission Guidelines ** Authors should submit a title and an abstract by Wednesday 14th December 2012. Papers of up to *five pages* in length should be submitted in PDF format by Wednesday 21st December 2012 using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2013 Preliminary proceedings will be available at the workshop. The post proceeding will be published as an EPTCS volume. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. Enquiries can be sent to the PC co-chairs. ** Important Dates ** Abstract (title & abstract): 14th December 2012 Paper Submission (up to 5 pages): 21st December 2012 Paper Notification: 23rd January 2012 Final versions of papers: 4th February 2012 ** Program Committee ** Alastair Beresford, University of Cambridge, UK Viviana Bono, Universita di Torino, Italy Alastair Donaldson, Imperial College London, UK Dan Ghica, University of Birmingham, UK Joshua Guttman, Worcester Polytechnic Institute, MA, US Thomas Hildebrandt, University of Copenhagen, Denmark Paul Keir, Codeplay Ltd, UK Hans-Wolfgang Loidl, Heriot-Watt University, UK Conor McBride, University of Strathclyde, UK Jeremy Singer, University of Glasgow, UK Sven-Bodo Scholz, Heriot-Watt University, UK Nikhil Swamy, Microsoft Research, US Wim Vanderbauwhede (co-chair), University of Glasgow, UK Hugo Torres Vieira, Universidade de Lisboa, Portugal Nobuko Yoshida (co-chair), Imperial College London, UK ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK Kohei Honda, Queen Mary, University of London, UK Simon Gay, University of Glasgow, UK Alan Mycroft, University of Cambridge, UK Vasco Vasconcelos, University of Lisbon, Portugal Nobuko Yoshida, Imperial College London, UK -- If it's pointless, what's the point? If there is a point to it, what's the point? (Tibor Fischer, "The Thought Gang")

1 0

ANN: time-1.4.0.2
by Ashley Yakeley 25 Nov '12

25 Nov '12

time-1.4.0.2 is now on Hackage. 1.4.0.2 fixes bugs and infelicities in the formatting and parsing in Data.Time.Format For formatting: * %0Y, %_Y, %0G and %_G now pad to four characters. * Likewise %0C, %_C, %0f and %_f pad to two characters. For parsing: * Runs of n whitespace characters now match n or more whitespace characters. Formerly it matched zero or more whitespace characters. * %Y, %G, %C and %f match one or more digits * %0Y and %0G match exactly four digits. %0C and %0f match exactly two digits General: * Now uses mkTyCon3 instead of deprecated mkTyCon (contributed by Chris Moline) Testing: * Various infrastructure improvements (Chris Moline and me) * QuickCheck properties now tested I tried using Cabal's "detailed" test-suite, but it doesn't play well with QuickCheck and is very slow with large numbers of small test cases. I'm now making use of the test-framework package, which does play well with QuickCheck. -- Ashley Yakeley

1 0

PhD Positions in Functional Programming at Chalmers University of Technology
by Koen Claessen 23 Nov '12

23 Nov '12

Chalmers is hiring PhD students in the Functional Programming group, to work on topics such as domain-specific languages, compilers, testing, automated reasoning, computer linguistics, and more. Read the announcement here: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?rmpag… The application deadline is 2012-12-12. Please pass this on to interested students. /Koen ---- PhD student positions in Functional Programming The Department has 76 faculty members and enrolls about 70 PhD students from more than 30 countries. The research spans the whole spectrum, from theoretical underpinnings to applied systems development. There is extensive national and international collaboration with academia and industry all around the world. Information about the division The Functional Programming group at Chalmers is a world-leading research group with an outstanding track record in research, and an excellent network of collaborators in both academia and industry. The group has done ground breaking work in embedded domain specific languages (DSLs) and in software testing (where work on QuickCheck has been hugely influential both inside and outside the functional programming community). We are collaborating with Ericsson to develop Feldspar, a DSL for Digital Signal Processing algorithm development. We are also working on DSLs for programming GPUs and for FPGA programming. We have obtained a large grant from the Swedish Strategic Research Agency to work on Resource Aware Functional Programming, and this project brings together DSLs and testing. It also allows us to have a steady flow of interesting visitors. In a new EU project, PROWESS, we will work on new techniques for modelling and property-based testing in web services. We also have a strong interest in automated theorem proving. With four professors and five assistant professors, the group enjoys critical mass, and provides the ideal research environment for doctoral studies in Functional Programming. Job description The PhD students will join the Functional Programming group and contribute to its research in the general area of Functional Programming. The selection of specific research projects for the present positions will take into account both the interests of the new students and the research agenda of the group. There will be ample opportunities for collaboration with the group's academic and industrial contacts. The job is a full time employment, limited to five years. 80% of the working time is devoted to research studies, and the remaining 20% to other duties, mainly teaching. It is expected that the student will obtain the PhD within the five-year period. Qualifications Applicants should have a Master’s Degree or corresponding (Sw. civilingenjörsexamen) in Computer Science, Computer Engineering, or in a related discipline. Strong research interest and relevant research track record must be well documented in the application. A genuine interest and curiosity in Functional Programming and excellent analytical and communication skills, orally as well as literally, are needed. In particular, we welcome applicants with documented interest in domain-specific languages, software testing and specification, or automated theorem proving. 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 applying since English is our working language for research, and we publish internationally. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students at the department come from more than 30 different countries.

1 0