From lemming at henning-thielemann.de Sat Jan 4 17:40:35 2014 From: lemming at henning-thielemann.de (Henning Thielemann) Date: Sat, 04 Jan 2014 18:40:35 +0100 Subject: [Haskell] ANN: unicode-0.0 Message-ID: <52C84793.9070905@henning-thielemann.de> The first announcement this year: The 'unicode' package contains functions for construction of various characters like: * block graphic elements * frame elements * fractions * subscript and superscript characters http://hackage.haskell.org/package/unicode The package is simple Haskell 2010. For example usage see the included 'visualize' example, buildable with 'cabal install -fbuildExamples', and http://code.haskell.org/~thielema/set-cover/example/Domino.hs From icfp.publicity at googlemail.com Wed Jan 8 01:47:58 2014 From: icfp.publicity at googlemail.com (David Van Horn) Date: Tue, 7 Jan 2014 20:47:58 -0500 Subject: [Haskell] ICFP 2014: Call for papers Message-ID: ===================================================================== 19th ACM SIGPLAN International Conference on Functional Programming ICFP 2014 Gothenburg, Sweden, 1-3 September 2014 http://www.icfpconference.org/icfp2014 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world) Author response: Wednesday, 23 April, 2014 Friday, 25 April, 2014 Notification: Monday, 5 May, 2014 Final copy due: Wednesday, 11 June, 2014 Scope ~~~~~ ICFP 2014 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security * Education: teaching introductory programming; parallel programming; mathematical proof; algebra * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world), submit a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available: http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web at https://www.easychair.org/conferences/?conf=icfp2014 . Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC-11 on Wednesday, 23 April 2014, to read reviews and respond to them. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking the definitive version of ACM article should reduce user confusion over article versioning. After your article has been published and assigned to your ACM Author Profile page, please visit http://www.acm.org/publications/acm-author-izer-service to learn how to create your links for fee downloads from the ACM DL. General Chair: Johan Jeuring, Utrecht University Program Chair: Manuel Chakravarty, University of New South Wales Program Committee: Edwin Brady, University of St Andrews Derek Dreyer, Max Planck Institute for Software Systems Ralf Hinze, University of Oxford Zhenjiang Hu, National Institute of Informatics Patricia Johann, Appalachian State University Ken Larsen, University of Copenhagen Yukiyoshi Kameyama, University of Tsukuba Anil Madhavapeddy, University of Cambridge Geoffrey Mainland, Drexel University David Mazi?res, Stanford University Jay McCarthy, Brigham Young University Matthew Might, University of Utah Ulf Norell, Chalmers University of Technology Tiark Rompf, Swiss Federal Institute of Technology in Lausanne Chung-chieh Shan, Indiana University Mary Sheeran, Chalmers University of Technology Matt Sottile, Galois Don Syme, Microsoft Research Jesse Tov, Harvard University From marlowsd at gmail.com Fri Jan 10 14:52:02 2014 From: marlowsd at gmail.com (Simon Marlow) Date: Fri, 10 Jan 2014 14:52:02 +0000 Subject: [Haskell] Fun in the Afternoon at Facebook London: 12 March 2014 Message-ID: <52D00912.1020806@gmail.com> [ please forward this to anyone who might be interested ] Fun in the Afternoon is a regular(ish) event consisting of talks about Functional Programming and related topics. The next one will be held at the Facebook offices in London on 12 March 2014 As with other Fun in the Afternoon events in the past (see http://sneezy.cs.nott.ac.uk/fun/) the plan is to have an afternoon of talks and meet up with fellow FPers, probably followed by some drinking and food. Facebook is located in Covent Garden, and is easily reachable by public transport (however, it is not so easily reachable by private transport!). I'll send out full details including the program and directions nearer the time. Anyone is welcome to attend - if you'd like to come along, just drop me an email. If you'd like to give a talk, please drop me an email containing a title and abstract. Talks will probably be about 30 minutes, depending on the number of talk proposals. The atmosphere is intended to be Fun and informal, so talks that are not fully-baked are completely fine. Try out your crazy ideas on a not-entirely-unforgiving audience. See you in London! Cheers, Simon From amf at ncc.up.pt Fri Jan 10 16:10:34 2014 From: amf at ncc.up.pt (=?ISO-8859-1?Q?M=E1rio_Florido?=) Date: Fri, 10 Jan 2014 16:10:34 +0000 Subject: [Haskell] First call-for-papers - Linearity 2014 In-Reply-To: References: Message-ID: <52D01B7A.8040005@ncc.up.pt> [We apologize if you have received multiple copies of this message] ============================================================================== Call for Papers Third International Workshop on Linearity http://vsl2014.at/linearity/ July 13, 2014 Vienna, Austria An associated event of the Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th ACM/IEEE Symposium on Logic in Computer Science (LICS), as part of the Vienna Summer of Logic. ============================================================================== Aim and Scope ------------- Ever since the birth of Girard's linear logic, there has been a stream of research where linearity is a key issue, covering both theoretical topics and applications to several areas of Computer Science, such as work on proof technology, complexity classes and more recently quantum computation, program analysis, expressive operational semantics, linear programming languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. Linearity is a key feature in both theoretical and practical approaches to computer science, and the goal of this workshop is to present work exploring linearity both in theory and practice. Topics of interest include new results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Specifically, topics of interest include, but are not limited to: * sub-linear logics * linear term calculi * linear type systems * linear proof-theory * linear programming languages * applications to concurrency * interaction-based systems * verification of linear systems * quantum models of computation * biological and chemical models of computation Important Dates --------------- * April 13, 2014: Submission deadline * May 10, 2014: Author notification * May 28, 2014: Deadline for final versions of accepted papers * July 13, 2014: Workshop Submission and Publication -------------------------- Authors are invited to submit an extended abstract (8 pages max) describing original ideas and recent results not published nor submitted elsewhere, or a 5-page abstract presenting relevant work that has been or will be published elsewhere, or work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=linearity2014 After the workshop, authors of the extended abstracts will be invited to submit a longe version of their work (typically a 15-pages paper) for publication in an electronic journal such as EPTCS. These submission will undergo a second round of referring. Furthermore, we envision publication of a special issue of a journal after the event. Programme Committee ------------------- * Sandra Alves (chair) * Iliano Cervesato (chair) * Kaustuv Chaudhuri * Maribel Fern?ndez * M?rio Florido * Simon Gay * Simone Martini * Luca Paolini * Simona Ronchi Della Rocca * Carsten Schuermann * Robert Simmons * Vasco Vasconcelos Contact ------- Sandra Alves: sandra at dcc.fc.up.pt Iliano Cervesato: iliano at cmu.edu -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: cfp.pdf Type: application/pdf Size: 86800 bytes Desc: not available URL: From calimeri at mat.unical.it Fri Jan 10 17:12:41 2014 From: calimeri at mat.unical.it (Francesco Calimeri) Date: Fri, 10 Jan 2014 18:12:41 +0100 Subject: [Haskell] 5th Answer Set Programming Competition 2014 - FIRST CALL FOR PARTICIPANTS Message-ID: [apologies for any cross-posting] ======================================================================== ================================================================== 5th Answer Set Programming Competition 2014 Call for Participant Systems Aalto University, University of Calabria, University of Genova Spring/Summer 2014 http://aspcomp2014.mat.unical.it/ aspcomp2014 at mat.unical.it ================================================================== Special edition of the ASP competition series -system track- part of the Olympic Games of the Vienna Summer of Logic 2014 == Important Dates == * March 1st, 2014 : Participant registration opens * March 31st, 2014: The competition starts * July 22nd, 2014 : Awards are presented at FLoC ======================================================================== Answer Set Programming (ASP) is a well-established paradigm of declarative programming with close relationship to other declarative modeling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. The ASP Competition is usually a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. Past ASP Competition editions were held at the University of Potsdam (Germany) in 2007, the University of Leuven (Belgium) in 2009, the University of Calabria (Italy) in 2011 and the Vienna University of Technology (Austria) in 2013. In order to join the Vienna Summer of Logic, which is expected to be the largest event in the history of logic, we this year depart from the "usual" timeline, and the 5th ASP Competition will be run in the first half of 2014 jointly at Aalto University (Finland), the University of Calabria (Italy) and the University of Genova (Italy). Another reason for having an event only one year after the 4th ASP Competition is that in 2013 the new ASP-Core-2 language was introduced, but at that time it was not fully supported by most participant solvers, and/or the submitters did not have sufficient time to support new language features in a completely satisfactory way. Thus, an early event can be an opportunity to push the usage of the new standard, and draw a more complete picture about the approaches that can efficiently solve problems with various features. == Call for Participant Systems == Participants of the Answer Set Programming Competition will compete on a selected collection of benchmark problems, taken from a variety of benchmark problem domains as well as real-world applications. These include, but are not limited to: * Classic and application-oriented graph problems * Scheduling, Timetabling, and other resource allocation problems * Sequential and Temporal Planning * Combinatorial Optimization problems * Deductive Database tasks on large data-sets * Puzzles and Combinatorics * Ontology reasoning * Automated Theorem Proving and Model Checking * Constraint Programming problems * Other AI problems The competition consists of a System Track (as called in past competitions), which compares dedicated solvers on ASP benchmarks. Participants compete with solving systems for the ASP-Core-2 language. Some more details are given in the following: - The benchmark domains are taken from past editions. - Systems of the 2013 edition will be considered. (Developers will have the chance of submitting up-to-date versions of their solvers.) - Submissions of new solvers are encouraged. The competition will include sub-tracks not only based on "complexity" of problems (as in past events), but also considering language features. Our aim is to clearly indicate what (combinations of) techniques work for a particular (set of) feature(s), and also widening the participation to teams that cannot (yet) support the full standard. We welcome the submission of parallel and portfolio systems exploiting multiple cores or multiple algorithms for solving the given instances. These solvers will have dedicated tracks, assuming a sufficient number of submissions in each track. Of course, we also welcome the submission of any kind of solvers, e.g., SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, Planning reasoners, or any other that can be adapted/applied to the evaluation of logic programs encoded in ASP-Core-2. == Important Dates == * March 1st, 2014 : Participant registration opens * March 31st, 2014: The competition starts * July 22nd, 2014 : Awards are presented at FLoC For further information and submission instructions please visit the competition web site http://aspcomp2014.mat.unical.it/ or contact us by email: aspcomp2014 at mat.unical.it From jeremy.gibbons at cs.ox.ac.uk Sun Jan 12 17:15:27 2014 From: jeremy.gibbons at cs.ox.ac.uk (Jeremy Gibbons) Date: Sun, 12 Jan 2014 17:15:27 +0000 Subject: [Haskell] UTP-2014 Unifying Theories of Programming - call for papers Message-ID: ********************************************************************** 5th International Symposium on Unifying Theories of Programming co-located with FM2014 May 12 - 13, 2014 Singapore http://www.comp.nus.edu.sg/~pat/UTP2014/index.html ********************************************************************** CALL FOR PAPERS Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent years. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, locality, concurrency and communication. Despite these differences, such theories may be unified in a way which greatly facilitates their study and comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artifacts of software development in a seamless, logically consistent way. Hoare and He's Unifying Theories of Programming (UTP) is widely acknowledged as one of the most significant such unification approaches. Based on their pioneering work, the aims of the UTP Symposium series are to reaffirm the significance of the ongoing UTP project and to stimulate efforts to advance. The Symposium provides a focus for the sharing of results by those already actively contributing, and raises awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. To this end the Symposium welcomes contributions on all the themes that can be related to the Unifying Theories of Programming. SUBMISSIONS Papers may be up to 20 pages in length and should be prepared using LaTeX in Springer LNCS paper format. Submissions should be made through the UTP 2014 EasyChair site; instructions are athttp://www.comp.nus.edu.sg/~pat/UTP2014 PUBLICATION Symposium post-proceedings will appear in Springer's Lectures Notes in Computer Science, as in past editions of the Symposium. (To be confirmed.) DATES Abstract due: January 17, 2014 Full paper due: January 24, 2014 Notification: March 7, 2014 Camera-ready for pre-proceedings: April 11, 2014 Symposium: May 12-13, 2014 CHAIR David Naumann (Stevens Institute of Technology) ORGANISATION CHAIR Jin Song DONG (National University of Singapore) PROGRAMME COMMITTEE Bernhard K. Aichernig (Graz University of Technology) Hugh Anderson (National University of Singapore) Jonathan P. Bowen (Birmingham City University) Ana Cavalcanti (University of York) Andrew Butterfield (Trinity College Dublin) Leo Freitas (Newcastle University) Jeremy Gibbons (University of Oxford) Lindsay Groves (Victoria University of Wellington) Walter Guttmann (University of Canterbury) Ian Hayes (University of Queensland) Jeremy Jacob (University of York) Zhiming Liu (Birmingham City University) David Naumann, chair (Stevens Institute of Technology) Marcel Oliveira (Universidade Federal do Rio Grande do Norte) Geguang Pu (East China Normal University) Shengchao Qin (Teesside University) Georg Struth (University of Sheffield) Jun Sun (Singapore University of Technology and Design) Meng Sun (Peking University) Burkhart Wolff (University of Paris-Sud) Naijun Zhan (Chinese Academy of Sciences) Huibiao Zhu (East China Normal University) JOINT EVENT FM 2014, the 19th International Symposium on Formal Methods http://www.comp.nus.edu.sg/~pat/FM2014/ Jeremy.Gibbons at cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From hbzhu at sei.ecnu.edu.cn Thu Jan 16 00:24:23 2014 From: hbzhu at sei.ecnu.edu.cn (Huibiao Zhu) Date: Thu, 16 Jan 2014 08:24:23 +0800 Subject: [Haskell] Call for Papers: TASE 2014 Message-ID: <589831870.24920@ecnu.edu.cn> TASE 2014 - CALL FOR PAPERS ****************************************************************** The 8th International Symposium on Theoretical Aspects of Software Engineering (TASE 2014) 1-3 September 2014, Changsha, China http://www.nudt.edu.cn/tase2014 For more information email: TASE2014 at nudt.edu.cn ****************************************************************** OVERVIEW The 8th Theoretical Aspects of Software Engineering Symposium (TASE 2014), will be held in Changsha, China in September, 2014. Modern society is increasingly dependent on software systems that are becoming larger and more complex. This poses new challenges to the various aspects of software engineering, for instance, software dependability in trusted computing, interaction with physical components in cyber physical systems, distribution in cloud computing applications, etc. Hence, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2014 aims to provide a forum for people from academia and industry to communicate their latest results on theoretical advances in software engineering. TASE 2014 is the 8th in the TASE series. The past TASE symposiums were successfully held in Shanghai ('07), Nanjing ('08), Tianjin ('09), Taipei ('10), Xi'an ('11), Beijing ('12), Birmingham ('13). The proceedings of the TASE symposia were all published by the IEEE Computer Society Press. TOPICS The symposium is devoted to theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Specification and Verification * Program Analysis * Software Testing * Model-Driven Engineering * Software Architectures and Design * Aspect and Object Orientation * Embedded and Real-Time Systems * Software Processes and Workflows * Component-Based Software Engineering * Software Safety, Security and Reliability * Reverse Engineering and Software Maintenance * Service-Oriented and Cloud Computing * Semantic Web and Web Services * Type System and Theory * Program Logics and Calculus * Probability in Software Engineering SUBMISSION Submission should be done through the TASE 2014 submission page, handled by the EasyChair conference system: https://www.easychair.org/conferences/?conf=tase2014 As in previous years, the proceedings of the conference are planned to be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 8 pages in Two-Column IEEE format. IMPORTANT DATES Abstract submission: 28 February 2014 (23h59 GMT) Paper submission: 07 March 2014 (23h59 GMT) Notification: 28 April 2014 Camera-ready: 19 May 2014 Conference: 1-3 September 2014 GENERAL CHAIR Jifeng He (East China Normal University, China) PROGRAM CO-CHAIRS Ji Wang (National University of Defense Technology, China) Martin Leucker (University of Lubeck, Germany) STEERING COMMITTE Keijiro Araki (Kyushu University, Japan) Shengchao Qin (Teesside University, UK) Jifeng He (East China Normal University, China) Huibiao Zhu (East China Normal University, China) Michael Hinchey (Lero, Ireland) PROGRAM COMMITTEE Earl Barr (University College London, UK) Nikolaj Bjorner (Microsoft Research, USA) Zhenhua Duan (Xidian University, China) Xinyu Feng (University of Science and Technology of China, China) Peter Habermehl (Liafa, Paris 7, France) Dang Van Hung (Vietnam National University, Vietnam) Lingxiao Jiang (Singapore Management University, Singapore) Xiaoshan Li (University of Macau, Macau) Xuandong Li (Nanjing University, China) Shaoyin Liu (Hosei University, Japan) Xiaoqing(Frank) Liu (Missouri University of Science and Technology, USA) Michael Lyu (Chinese University of Hong Kong, China) Xiaoguang Mao (National University of Defense Technology, China) Huaikou Miao (Shanghai University, China) Antoine Mine (Ecole Normale Superieure Paris, France) Paritosh K. Pandya (Tata Institute of Fundamental Research, India) Jun Pang (University of Luxembourg, Luxembourg) Sungwoo Park (Pohang University of Science and Technology, Korea) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Cesar Sanchez (IMDEA Software Institute, Spain) Axel Simon (Technical University of Munich, Germany) Volker Stolz (University of Oslo, Norway) Yih-Kuen Tsay (National Taiwan University, Taiwan) Tomas Vojnar (Brno University of Technology, Czech Republic) Hai Wang (Aston University, UK) Yi Wang (Uppsala University, Sweden) Eric Wong (UT-Dallas, USA) Yingfei Xiong (Peking University, China) Hongli Yang (Beijing University of Technology, China) Naijun Zhan (Chinese Academy of Sciences, China) Hongyu Zhang (Tsinghua University, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China) ORGANIZING CHAIR Wei Dong (National University of Defense Technology, China) PUBLICITY CHAIR Yanjun Wen (National University of Defense Technology, China) -------------- next part -------------- An HTML attachment was scrubbed... URL: From byorgey at seas.upenn.edu Fri Jan 17 21:57:19 2014 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Fri, 17 Jan 2014 16:57:19 -0500 Subject: [Haskell] ANNOUNCE: Diagrams 1.0 Message-ID: <20140117215719.GA21107@seas.upenn.edu> The diagrams team is very pleased to announce the 1.0 release of diagrams [1], a framework and embedded domain-specific language for declarative drawing in Haskell. Check out the gallery [2] for some examples of what it can do. Diagrams can be used for a wide range of purposes, from data visualization [3] to illustration [4] to art [5], and diagrams code can be seamlessly embedded in blog posts [6], LaTeX documents [7], and Haddock documentation [8], making it easy to incorporate diagrams into your documents with minimal extra work. [1] http://projects.haskell.org/diagrams [2] http://projects.haskell.org/diagrams/gallery.html [3] http://idontgetoutmuch.wordpress.com/2013/10/23/parking-in-westminster-an-analysis-in-haskell/ [4] https://www.fpcomplete.com/user/edwardk/cellular-automata/part-1 [5] http://mathlesstraveled.com/2013/04/06/stars-of-the-minds-sky-with-diagrams/ [6] http://byorgey.wordpress.com/2012/08/28/creating-documents-with-embedded-diagrams/ [7] http://projects.haskell.org/diagrams/doc/latex.html [8] http://byorgey.wordpress.com/2013/03/23/introducing-diagrams-haddock/ What's new ---------- Brent recently gave a talk at the New York Haskell Users' Group [12] presenting the new release. You can find videos of the talk on vimeo: part 1 presents a basic introduction to the library [13], and part 2 talks about mathematical abstraction and DSL design [14]. The slides are also available [15]. [12] http://www.meetup.com/NY-Haskell/ [13] http://vimeo.com/84104226 [14] http://vimeo.com/84249042 [15] http://www.cis.upenn.edu/~byorgey/pub/13-11-25-nyhaskell-diagrams.pdf This release includes a number of significant new features and improvements. Highlights include: - Support for drawing arrows between given points or between diagrams, with many options for customization (tutorial [16], documentation [17], API [18]). [16] http://projects.haskell.org/diagrams/doc/arrow.html [17] http://projects.haskell.org/diagrams/doc/manual.html#arrows [18] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Arrow.html - A new framework for creating custom command-line-driven executables for diagram generation (tutorial [19], API [20]). [19] http://projects.haskell.org/diagrams/doc/cmdline.html [20] http://projects.haskell.org/diagrams/haddock/Diagrams-Backend-CmdLine.html - Offsets of trails and paths, i.e. compute the trail or path lying a constant distance from the given one (documentation [21], API [22]). [21] http://projects.haskell.org/diagrams/doc/manual.html#offsets-of-segments-trails-and-paths [22] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Offset.html - A new API, based on Metafont, for constructing cubic splines with control over things like tangents and "tension" (tutorial [23], API [24]). [23] http://projects.haskell.org/diagrams/doc/metafont.html [24] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Path-Metafont.html - Tangent and normal vectors of segments and trails (API [25]). [25] http://projects.haskell.org/diagrams/haddock/Diagrams-Tangent.html - Alignment can now be done by trace in addition to envelope (API [26]). [26] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Align.html - The lens [27] package is now used consistently for record fields throughout the library (documentation [28]). [27] http://hackage.haskell.org/package/lens [28] http://projects.haskell.org/diagrams/doc/manual.html#faking-optional-named-arguments - Across-the-board improvements in performance and size of generated files. See the release notes [29] for full details, and the migration guide [30] for help porting your diagrams 0.7 code to work with diagrams 1.0. [29] http://projects.haskell.org/diagrams/releases.html [30] http://www.haskell.org/haskellwiki/Diagrams/Dev/Migrate1.0 Try it out ---------- For the truly impatient: cabal install diagrams Diagrams is supported under GHC 7.4 and 7.6. To get started, read the quick start tutorial [31], which will introduce you to the fundamentals of the framework and provide links for further reading. For those who are less impatient and want to really dig in and use the power features, read the extensive user manual [32]. There is also a growing collection of tutorials [33] on specific topics. [31] http://projects.haskell.org/diagrams/doc/quickstart.html [32] http://projects.haskell.org/diagrams/doc/manual.html [33] http://projects.haskell.org/diagrams/documentation.html Get involved ------------ Diagrams has a friendly and growing community of users and developers. To connect with the community, subscribe to the project mailing list [34], and/or come hang out in the #diagrams IRC channel on freenode.org for help and discussion. Development continues stronger than ever, and there are a wide range of projects available for new contributors of all levels of Haskell skill. Make some diagrams. Fix some bugs [35]. Submit your cool examples for inclusion in the gallery [36] or your cool code for inclusion in the diagrams-contrib [37] package. [34] http://groups.google.com/group/diagrams-discuss [35] http://github.com/diagrams/ [36] http://projects.haskell.org/diagrams/gallery.html [37] http://hackage.haskell.org/package/diagrams%2Dcontrib Happy diagramming! Brought to you by the diagrams team: - Daniel Bergey - Jeff Rosenbluth - Ryan Yates - Brent Yorgey with contributions from: - Jan Bracker - Conal Elliott - Daniil Frumin - Sam Griffin - Niklas Haas - Peter Hall - Claude Heiland-Allen - Deepak Jois - John Lato - Felipe Lessa - Chris Mears - Ian Ross - Carlos Scheidegger - Vilhelm Sj?berg - Michael Sloan - Jim Snavely - Luite Stegeman - Kanchalai Suveepattananont - Michael Thompson - Scott Walck From pyrocrane1 at aol.com Sat Jan 18 17:25:49 2014 From: pyrocrane1 at aol.com (Pyro Crane) Date: Sat, 18 Jan 2014 12:25:49 -0500 (EST) Subject: [Haskell] Just started working with Haskell. Need some help Message-ID: <8D0E2897644541B-1058-8B6C@webmail-d276.sysops.aol.com> Hi, I just started working with Haskell Running it on a RHEL linux operating system I was able to download and install it, along with libraries and packages (or, at least, what I thought were the libraries and packages) But, when I try to run a simple script, I keep getting the error : "Could not find module XXXXXX".............. I understand what this error means ---- there is a package/library missing. I tried using the "Cabal Update" command, but this did not solve the problem. So, I am now fixing this problem the primitive way, as follows : (a) I use Google to first find out what the missing module is (b) then, based on what google says, I am able to determine the name of the actual package that needs to be installed (c) I use "Cabal Install" to install the package (d) I try to run the script again (e) I get the same error, but this time, it cannot find a different module (f) I go back to Google to locate the missing module etc, etc, etc, etc Obviously, this is as slow as it is ridiculous............... especially when one considers that there are probably hundreds of these modules/packages And, now, I've come up against a module/package, which I am unable to locate in Google. It's missing from my installation, and Google does not know what it is, or where I can find it Is there any way to simply install ALL required packages??? I thought I already did this, but obviously I missed something Thanks -------------- next part -------------- An HTML attachment was scrubbed... URL: From v.dijk.bas at gmail.com Wed Jan 22 16:49:54 2014 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Wed, 22 Jan 2014 17:49:54 +0100 Subject: [Haskell] ANN: ZuriHac 2014 Message-ID: Dear Haskellers, After a very successful ZuriHac 2013 we are delighted to announce ZuriHac 2014! When: Friday 6 June 2014 - Sunday 8 June 2014 Where: Erudify offices, Zurich, Switzerland ZuriHac is an international Haskell hackathon: a grassroots, collaborative coding festival with a simple focus, to build and improve Haskell libraries, tools, and infrastructure. This is a great opportunity to meet your fellow Haskellers in real life, find new contributors for your project, improve existing libraries and tools, or even start new ones! Registration ------------ If you wish to attend, please register by filling in this form: http://bit.ly/ZuriHac2014 Please note that we have a limited number of places -- first come, first served. Full details can be found on the wiki page: http://www.haskell.org/haskellwiki/ZuriHac2014 We look forward to seeing you there! -- The organisers of ZuriHac 2014 ZuriHac 2014 is sponsored by Erudify & Google From kovens at strgroup.co.uk Thu Jan 23 12:07:46 2014 From: kovens at strgroup.co.uk (Katy Ovens) Date: Thu, 23 Jan 2014 12:07:46 -0000 Subject: [Haskell] HASKELL CAREER OPPORTUNITIES! Message-ID: <9D4C287ED5FAC7429330411C62B003CC19C5D420@strdc1.STR2.local> Urgently seeking Software Engineers with Haskell interest / skills to join a leading technology organisation, focused on a revolutionary new HPC project. Candidates can work from home / remotely part-time but MUST be willing to be based in Cambridge at least 2-3 days a week. Flexible packages on offer to suit a range of experience levels. Get in touch for discussion with Katy Ovens on kovens at strgroup.co.uk http://www.strgroup.co.uk/ Katy Ovens , CertRP Lead Account Manager - Engineering 023 9232 2308 07511 011 918 kovens at strgroup.co.uk 1 Quay Point, Northarbour Road, Portsmouth, PO6 3TD, UK - http://www.strgroup.co.uk/ Join our social networks: http://www.linkedin.com/company/str-group http://www.facebook.com/pages/STR-Group/157182227861 http://twitter.com/#!/STR_Group All detailed pricing models will exclude local taxation charges unless otherwise stated, for a copy of our terms and conditions please http://www.strgroup.co.uk/terms-and-conditions.cms.asp STR Ltd is a limited company registered in England and Wales. Registered number: 04064332. Registered office: 1 Quay Point, Northarbour Road, Portsmouth, PO6 3TD. Please note that STR Ltd may monitor email traffic data and also the content of email for the purposes of security and staff training. IMPORTANT: This message is private and confidential. If you have received this message in error, please notify us and remove it from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or contain viruses. STR Limited therefore does not accept liability for any errors or omissions in the contents of this message, which arise as a result of e-mail transmission. If verification is required please request a hard-copy version. -- This message has been scanned for viruses and dangerous content and is believed to be clean. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ms at chalmers.se Thu Jan 23 19:50:05 2014 From: ms at chalmers.se (Mary Sheeran) Date: Thu, 23 Jan 2014 20:50:05 +0100 Subject: [Haskell] ARRAY'14 Call for Papers Message-ID: ARRAY 14: ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming Co-located with PLDI 2014, Edinburgh, UK. A full-day workshop on Friday June 13th, following the main conference. http://www.sable.mcgill.ca/array/ A new workshop on Libraries, Languages and Compilers for Array Programming will have its first instance with PLDI this year (on June 13 in Edinburgh). The workshop aims to bring together the various groups (including functional programmers) that work on array programming. Papers from readers of this mailing list would be very welcome. The deadline for submission of four to six-page research or tool papers is April 2nd 2014, with notification on April 18th. Note the SIGPLAN sponsorship and the fact that students can apply for SIGPLAN PAC funding. It will be a fun workshop! For more information see http://www.sable.mcgill.ca/array/ and think about submitting! Mary Sheeran (with Laurie Hendren (Chair), Alex Rubinsteyn and Jan Vitek) -------------- next part -------------- An HTML attachment was scrubbed... URL: From yangliu at ntu.edu.sg Sat Jan 25 16:36:13 2014 From: yangliu at ntu.edu.sg (Liu Yang (Asst Prof)) Date: Sat, 25 Jan 2014 16:36:13 +0000 Subject: [Haskell] Call for Papers: ICFEM 2014, Luxembourg, 3-7 November 2014 Message-ID: <5A4257BA3B1EEA45B17620B30FD656E12CA8C7AF@EXCHMBOX31.staff.main.ntu.edu.sg> [We apologize for multiple copies.] ============================================================ Call for Papers ICFEM 2014 16th International Conference on Formal Engineering Methods Luxembourg, 3-7 November 2014 http://icfem2014.uni.lu ============================================================ The 16th International Conference on Formal Engineering Methods (ICFEM 2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from 3rd November to 7 November 2014. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, present their research, and help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2014 is organised and sponsored by The University of Luxembourg. The city of Luxembourg itself is on the UNESCO World Heritage List, on account of the historical importance of its fortifications. Luxembourg was the first city to be named European Capital of Culture twice. SCOPE AND TOPICS ---------------------------------------- Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered. + Abstraction and refinement + Formal specification and modelling + Program analysis + Software verification + Software model checking + Formal approaches to software testing + Formal methods for self-adaptive systems + Formal methods for object and component systems + Formal methods for concurrent and real-time systems + Formal methods for cloud computing and cyber-physical systems + Formal methods for software safety, security, reliability and dependability + Tool development, integration and experiments involving verified systems + Formal methods used in certifying products under international standards + Formal model-based development and code generation This year, ICFEM will have special tracks on application of formal methods in three areas: + Computer Security + Biology + Healthcare Submissions in these topics are especially encouraged. Papers in these areas will be subject to the same rigorous review process as other papers. Accepted special track papers will be organised into special sessions. SUBMISSION AND PUBLICATION ---------------------------------------- Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be made through the ICFEM 2014 submission page (https://www.easychair.org/conferences/?conf=icfem2014), handled by the EasyChair conference management system. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in a special issue of the Formal Aspect Computing journal. WORKSHOP AND TUTORIAL ---------------------------------------- The last two days of the conference (6th and 7th November 2014) will be dedicated to workshops, tutorials and other satellite events. The organising committee of ICFEM 2014 therefore cordially invites proposals for one-day workshops and one-day or half-day tutorials in any area related to formal methods or software engineering, but particularly in new or emerging fields of application of formal methods. Proposals for workshops/tutorial should contain: + a title and brief description of the topic and the history of the workshop/tutorial, if applicable; + the names and contact details of the potential organisers; + a brief justification of the topic and estimated size of audience; + a description of any special technical requirements. Proposals should be sent to ICFEM2014 Workshops Chair, Jun Sun, at > no later than 22nd March 2014. SUMMER SCHOOL VTSA 2014 ---------------------------------------- The summer school on verification technology, systems & applications takes place at University of Luxembourg from October 27-31, 2014. It is a co-located event with ICFEM 2014 and is organized by the Montefiore Institute, University of Luxembourg, INRIA Nancy, and the Max Planck Insitute for Informatics Saarbr?cken. More detailed information will be provided at the summer school's website. IMPORTANT DATES ---------------------------------------- Abstract Submissions due: 11 April 2014 Full Paper Submissions due: 18 April 2014 Workshop/Tutorial Proposals: 22 March 2014 Acceptance Notification: 20 June 2014 Camera-ready Papers Due: 13 July 2014 ORGANISING COMMITTEE ---------------------------------------- General Co-Chairs Michael Butler, University of Southampton, United Kingdom Sjouke Mauw, University of Luxembourg, Luxembourg Program Committee Co-Chairs Stephan Merz, INRIA, France Jun Pang, University of Luxembourg, Luxembourg Workshop and Tutorial Co-Chairs Jun Sun, Singapore University of Technology and Design, Singapore Local Organisation Chair Andrzej Mizera, University of Luxembourg, Luxembourg Publicity Chair Yang Liu, Nanyang Technological University, Singapore Web Chair: Piotr Kordy, University of Luxembourg, Luxembourg PROGRAM COMMITTEE ---------------------------------------- Frank de Boer, CWI, The Netherlands Jonathan Bowen, Birmingham City University, United Kingdom Michael Butler, University of Southampton, United Kingdom Kostas Chatzikokolakis, CNRS and ?cole Polytechnique, France Zhenhua Duan, Xidian University, China Colin Fidge, Queensland University of Technology, Australia Stefania Gnesi, ISTI-CNR, Italy Radu Grosu, Vienna University of Technology, Austria Ian Hayes, University of Queensland, Australia Michaela Huhn, Technische Universit?t Clausthal, Germany Pierre Kelsen, University of Luxembourg, Luxembourg Steve Kremer, INRIA Nancy, France Jean Krivine, CNRS and Universit? Paris Diderot, France Peter Gorm Larsen, Engineering College of Aarhus, Denmark Xuandong Li, Nanjing University, China Shang-Wei Lin, National University of Singapore, Singapore Shaoying Liu, Hosei University, Japan Yang Liu, Nanyang Technological University, Singapore Sjouke Mauw, University of Luxembourg, Luxembourg Dominique Mery, Universit? de Lorraine, France Stephan Merz, INRIA Nancy, France Mohammad Reza Mousavi, Halmstad University, Sweden Peter Mueller, ETH Zurich, Switzerland Shin Nakajima, National Institute of Informatics, Japan Jun Pang, University of Luxembourg, Luxembourg Ion Petre, ?bo Akademi University, Finland Jaco van de Pol, University of Twente, The Netherlands Shengchao Qin, Teesside University, United Kingdom Zongyan Qiu, Peking University, China Jing Sun, University of Auckland, New Zealand Jun Sun, Singapore University of Technology and Design, Singapore Kenji Taguchi, AIST, Japan Viktor Vafeiadis, MPI-SWS, Germany Hai H. Wang, Aston University, United Kingdom Wang Yi, Uppsala University, Sweden Huibiao Zhu, East China Normal University, China STEERING COMMITTEE ---------------------------------------- Keijiro Araki, Kyushu University, Japan Michael Butler, University of Southampton, United Kingdom Jin Song Dong, National University of Singapore, Singapore Jifeng He, East China Normal University, China Shaoying Liu (Chair), Hosei University, Japan Jeff Offutt, George Mason University, United States Shengchao Qin, University of Teesside, United Kingdom ________________________________ CONFIDENTIALITY:This email is intended solely for the person(s) named and may be confidential and/or privileged.If you are not the intended recipient,please delete it,notify us and do not copy,use,or disclose its contents. Towards a sustainable earth:Print only when necessary.Thank you. -------------- next part -------------- An HTML attachment was scrubbed... URL: From yangliu at ntu.edu.sg Sat Jan 25 16:48:23 2014 From: yangliu at ntu.edu.sg (Liu Yang (Asst Prof)) Date: Sat, 25 Jan 2014 16:48:23 +0000 Subject: [Haskell] 2nd Call for Papers: ICECCS 2014, Tianjin, China, 4-7 Aug 2014 Message-ID: <5A4257BA3B1EEA45B17620B30FD656E12CA8C8A5@EXCHMBOX31.staff.main.ntu.edu.sg> [We apologize for multiple copies.] ============================================================ Call for Papers ICECCS 2014 (The 19th IEEE International Conference on Engineering of Complex Computer Systems) 4-7 August 2014 School of Computer Science and Technology Tianjin University, China http://cs.tju.edu.cn/iceccs/2014 ============================================================ IMPORTANT DATES --------------------------- * Abstract submission: February 14, 2014 * Paper submission deadline: February 28, 2014 * Workshop proposal submission: February 28, 2014 * Notification of acceptance: April 22, 2014 * Camera-ready material for publication: May 4, 2014 * Checking for Production: May 14, 2014 * Conference date: August 4-7, 2014 Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. SCOPE AND TOPICS --------------------------- Authors are invited to submit papers describing original, unpublished research results, case studies and toolsed research results, case studies and tools. Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: * Requirement specification and analysis * Verification and validation * Security and privacy of complex systems * Model-driven development * Reverse engineering and refactoring * Architecture software * Big Data Management * Ambient intelligence, pervasive computing * Ubiquitous computing, context awareness, sensor networks * Design by contract * Agile methods * Safety-critical & fault-tolerant architectures * Adaptive, self-managing and multi-agent systems * Real-time, hybrid and embedded systems * Systems of systems * Tools and tool integration * Industrial case studies SUBMISSION --------------------------- Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. Papers are divided into two categories: * Technical Papers and * Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. FULL PAPERS Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. POSTER PAPERS Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedings. PAPER SUBMISSION Submitted manuscripts should be in English and formatted in the style of the Conference Publishing Services (CPS) Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All submissions should be made through the Easychair Website: https://www.easychair.org/account/signin.cgi?conf=iceccs2014 ORGANIZING COMMITTEES --------------------------- General Co-Chairs * JinSong Dong, National University of Singapore, Singapore * Zhiyong Feng, Tianjin University, China. Program Committee Co-Chairs * Etienne Andre, Universite Paris 13, France * Lei Zhang, Tianjin University, China Workshop Chairs * Zhenhua Duan, Xidian University, Xi'an * YuanFang Li, Monash University, Australia Publicity Chair * Yang Liu, Nanyang Technological University, Singapore Tutorial Chair * Jun Sun, Singapore University of Technology and Design, Singapore Local Chairs * Xiaohong Li, Tianjin University, China * Guangquan Xu, Tianjin University, China Doctoral Symposium Chair * Xin Peng, Fudan University, China Registration Chair * Jing Hu, Tianjin University, China Web Chairs * Xiaofei Xie, Tianjin University, China * Gang Shen, Tianjin University, China PROGRAMME COMMITTEE --------------------------- * Aiguier Marc, Ecole Centrale Paris, France * Ait Ameur Yamine, IRIT/ENSEEIHT, France * Almeida Luis, Fac de Eng da Universidade do Porto, Portugal * Andre Etienne, Universite Paris 13, France (co-chair) * Artho Cyrille, AIST, Japan * Baresi Luciano, DEI - Politecnico di Milano, Italy * Brooke Phillip J, Teesside University, UK * Calinescu Radu, University of York, UK * Chen Yixiang,School of Software,East China Normal University,China * Cirstea Corina, University of Southampton, UK * Di Giandomenico Felicita, ISTI-CNR, Italy * Dowek Gilles, INRIA, France * Eder Kerstin, University of Bristol, Department of Computer Science, UK * Furia Carlo Alberto, ETH Zurich, Switzerland * Gerard Sebastien, CEA, LIST, France * Grechanik Mark, University of Illinois at Chicago, United States * Groves Lindsay, Victoria University of Wellington, New Zealand * Guerra Esther, Universidad Autonoma de Madrid, Spain * He Fei, School of Software, Tsinghua University, China * Kim Moonzoo, KAIST, South Korea * Kroening Daniel, Computer Science Department, Oxford University, UK * Laleau Regine, Universite Paris-Est Creteil, France * Laplante Phillip, Penn State, United States * Lau Kung-Kiu, UK * Li Bing,State Key Lab of Software Engineering, Wuhan University, China * Li Xiaohong, Tianjin University, China * Li Yuan-Fang, Monash University, Australia * Lindsay Peter, The University of Queensland, Australia * Liu Ling,School of Software,Tsinghua University,China * Liu Yang, Nanyang Technological University, Singapore * Lo David, Singapore Management University, Singapore * Luettgen Gerald, University of Bamberg, Germany * Mao Xiaoguang, School of Computer Science,cNational University of Defense Technology, China * Margaria Tiziana, University of Potsdam, Germany * Martin Andrew, Department of Computer Science, University of Oxford, UK * Mccann Julie, Imperial College, UK * Mery Dominique, Universite de Lorraine, LORIA, France * Miao HuaiKou,Shanghai University,China * Mirandola Raffaela, Politecnico di Milano, Italy * Nesi Paolo, University of Florence, Italy * Pang Jun, University of Luxembourg, Luxembourg * Perseil Isabelle, Inserm, France * Pettit Robert, United States * Prehofer Christian, Munich, Germany * Rumpe Bernhard, RWTH Aachen University, Germany * Seceleanu Cristina, Malardalen University, Vasteras, Sweden * Stolz Volker, University of Oslo, Norway * Sun Jing, The University of Auckland, New Zealand * Sun Jun, Singapore University of Technology and Design, Singapore * Taguchi Kenji, AIST, Japan * Tamzalit Dalila, LINA Laboratory, University of Nantes, France * Tian Cong, Xidian University, China * Vardanega Tullio, University of Padua, Italy * Van Hoorn Andre, University of Stuttgart, Germany * Wang Farn, National Taiwan University, Taiwan * Wang Hai H, University of Aston, UK * Wang Qianxiang, Software Engineering Insisute, Peking University, China * Wang Xinyu, Computer College of Zhejiang University, China * Wehrheim Heike, Universitaet Paderborn, Germany * Xu Baowen, Nanjin University, China * Xu Guangquan, Tianjin University, China * Xu Jing, Nankai University, China * Yuan Ling, Huazhong University of Science and Technology, China * Zalila Bechir, ReDCAD Laboratory, University of Sfax, Tunisia * Zhan Naijun, Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, China * Zhang Lei, Tianjin University, China (co-chair) * Zhao JianJun, Shanghai Jiao Tong University, China * Zhao Wenyun, Fudan University, China * Zhu Huibiao, Software Engineering Institute, East China Normal University, China * Zschaler Steffen, King's College London, UK ________________________________ CONFIDENTIALITY:This email is intended solely for the person(s) named and may be confidential and/or privileged.If you are not the intended recipient,please delete it,notify us and do not copy,use,or disclose its contents. Towards a sustainable earth:Print only when necessary.Thank you. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jeremy.gibbons at cs.ox.ac.uk Sun Jan 26 01:56:01 2014 From: jeremy.gibbons at cs.ox.ac.uk (Jeremy Gibbons) Date: Sun, 26 Jan 2014 01:56:01 +0000 Subject: [Haskell] UTP Symposium: extended submission deadline Message-ID: <2C4A7850-0650-4AE6-8D2D-215A87D2CC78@cs.ox.ac.uk> *** revised submission deadline *** ********************************************************************** 5th International Symposium on Unifying Theories of Programming co-located with FM2014 May 12 - 13, 2014 Singapore http://www.comp.nus.edu.sg/~pat/UTP2014/index.html ********************************************************************** CALL FOR PAPERS Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent years. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, locality, concurrency and communication. Despite these differences, such theories may be unified in a way which greatly facilitates their study and comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artifacts of software development in a seamless, logically consistent way. Hoare and He's Unifying Theories of Programming (UTP) is widely acknowledged as one of the most significant such unification approaches. Based on their pioneering work, the aims of the UTP Symposium series are to reaffirm the significance of the ongoing UTP project and to stimulate efforts to advance. The Symposium provides a focus for the sharing of results by those already actively contributing, and raises awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. To this end the Symposium welcomes contributions on all the themes that can be related to the Unifying Theories of Programming. SUBMISSIONS Papers may be up to 20 pages in length and should be prepared using LaTeX in Springer LNCS paper format. Submissions should be made through the UTP 2014 EasyChair site; instructions are athttp://www.comp.nus.edu.sg/~pat/UTP2014 PUBLICATION Symposium post-proceedings will appear in Springer's Lectures Notes in Computer Science, as in past editions of the Symposium. (To be confirmed.) DATES (revised) Full paper due: February 21, 2014 Notification: April 4, 2014 Camera-ready for pre-proceedings: April 25, 2014 Symposium: May 12-13, 2014 CHAIR David Naumann (Stevens Institute of Technology) ORGANISATION CHAIR Jin Song DONG (National University of Singapore) PROGRAMME COMMITTEE Bernhard K. Aichernig (Graz University of Technology) Hugh Anderson (National University of Singapore) Jonathan P. Bowen (Birmingham City University) Ana Cavalcanti (University of York) Andrew Butterfield (Trinity College Dublin) Leo Freitas (Newcastle University) Jeremy Gibbons (University of Oxford) Lindsay Groves (Victoria University of Wellington) Walter Guttmann (University of Canterbury) Ian Hayes (University of Queensland) Jeremy Jacob (University of York) Zhiming Liu (Birmingham City University) David Naumann, chair (Stevens Institute of Technology) Marcel Oliveira (Universidade Federal do Rio Grande do Norte) Geguang Pu (East China Normal University) Shengchao Qin (Teesside University) Georg Struth (University of Sheffield) Jun Sun (Singapore University of Technology and Design) Meng Sun (Peking University) Burkhart Wolff (University of Paris-Sud) Naijun Zhan (Chinese Academy of Sciences) Huibiao Zhu (East China Normal University) JOINT EVENT FM 2014, the 19th International Symposium on Formal Methods http://www.comp.nus.edu.sg/~pat/FM2014/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From genial at alva.ro Tue Jan 28 19:57:02 2014 From: genial at alva.ro (Alvaro J. Genial) Date: Tue, 28 Jan 2014 14:57:02 -0500 Subject: [Haskell] [ANN] yocto-0.1.2 Message-ID: Howdy, I'd like to present a minimal JSON encoding/decoding library: http://hackage.haskell.org/package/yocto-0.1.2 >From the README: Yocto is exceedingly simple: it only exports one type, Value (which can represent any JSON-encoded data) in addition to Read and Show instances for it--which, respectively, take care of decoding and encoding values automatically. It's worth mentioning that Yocto handles numbers as Rationals rather than Doubles, which makes it faithful to the JSON standard and lets it handle rational numbers of arbitrary magnitude and precision. The name is a play on metric unit prefixes: AttoJson is a tiny JSON library, and Yocto is even smaller. (The entire implementation fits in fewer than 80 lines x 80 columns.) [It is meant primarily for interactive use and one-offs, which is how I'm handwaving hijacking Read and Show.] Anyway, I hope you find it useful; the code lives here: https://github.com/ajg/yocto Alvaro http://alva.ro -------------- next part -------------- An HTML attachment was scrubbed... URL: From cma at bitemyapp.com Tue Jan 28 20:13:31 2014 From: cma at bitemyapp.com (Christopher Allen) Date: Tue, 28 Jan 2014 12:13:31 -0800 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: I like it a lot and just used it to help somebody intimidated by Parsec in the IRC channel. Still cringing at the read/show :) On Tue, Jan 28, 2014 at 11:57 AM, Alvaro J. Genial wrote: > Howdy, > > I'd like to present a minimal JSON encoding/decoding library: > > http://hackage.haskell.org/package/yocto-0.1.2 > > From the README: > > Yocto is exceedingly simple: it only exports one type, Value (which can > represent any JSON-encoded data) in addition to Read and Show instances for > it--which, respectively, take care of decoding and encoding values > automatically. > > It's worth mentioning that Yocto handles numbers as Rationals rather than > Doubles, which makes it faithful to the JSON standard and lets it handle > rational numbers of arbitrary magnitude and precision. > > The name is a play on metric unit prefixes: AttoJson is a tiny JSON > library, and Yocto is even smaller. (The entire implementation fits in > fewer than 80 lines x 80 columns.) > > [It is meant primarily for interactive use and one-offs, which is how I'm > handwaving hijacking Read and Show.] > > Anyway, I hope you find it useful; the code lives here: > > https://github.com/ajg/yocto > > Alvaro > http://alva.ro > > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From genial at alva.ro Tue Jan 28 20:36:40 2014 From: genial at alva.ro (Alvaro J. Genial) Date: Tue, 28 Jan 2014 15:36:40 -0500 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: On Tue, Jan 28, 2014 at 3:13 PM, Christopher Allen wrote: > I like it a lot and just used it to help somebody intimidated by Parsec in > the IRC channel. > Thanks, that's great to hear! Still cringing at the read/show :) Aye... if it helps, I'm open to typeclass suggestions. :) Alvaro http://alva.ro -------------- next part -------------- An HTML attachment was scrubbed... URL: From bos at serpentine.com Tue Jan 28 20:38:21 2014 From: bos at serpentine.com (Bryan O'Sullivan) Date: Tue, 28 Jan 2014 12:38:21 -0800 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: On Tue, Jan 28, 2014 at 12:36 PM, Alvaro J. Genial wrote: > Aye... if it helps, I'm open to typeclass suggestions. :) > Don't use a typeclass at all: just write encode and decode functions. -------------- next part -------------- An HTML attachment was scrubbed... URL: From genial at alva.ro Tue Jan 28 20:51:01 2014 From: genial at alva.ro (Alvaro J. Genial) Date: Tue, 28 Jan 2014 15:51:01 -0500 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: On Tue, Jan 28, 2014 at 3:38 PM, Bryan O'Sullivan wrote: > Don't use a typeclass at all: just write encode and decode functions. Seems like a Codec class with such functions would be useful, perhaps analogous to the Binary class [1] but also suitable for textual encodings. Alvaro http://alva.ro [1] http://hackage.haskell.org/package/binary-0.7.1.0/docs/Data-Binary.html#t:Binary -------------- next part -------------- An HTML attachment was scrubbed... URL: From cma at bitemyapp.com Tue Jan 28 20:53:05 2014 From: cma at bitemyapp.com (Christopher Allen) Date: Tue, 28 Jan 2014 12:53:05 -0800 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: Are you bent on making it more elaborate/complicated than it needs to be? Why not just keep it encode/decode? On Tue, Jan 28, 2014 at 12:51 PM, Alvaro J. Genial wrote: > > On Tue, Jan 28, 2014 at 3:38 PM, Bryan O'Sullivan wrote: > >> Don't use a typeclass at all: just write encode and decode functions. > > > Seems like a Codec class with such functions would be useful, perhaps > analogous to the Binary class [1] but also suitable for textual encodings. > > Alvaro > http://alva.ro > > [1] > http://hackage.haskell.org/package/binary-0.7.1.0/docs/Data-Binary.html#t:Binary > > > > > > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From genial at alva.ro Tue Jan 28 20:56:52 2014 From: genial at alva.ro (Alvaro J. Genial) Date: Tue, 28 Jan 2014 15:56:52 -0500 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: On Tue, Jan 28, 2014 at 3:53 PM, Christopher Allen wrote: > Are you bent on making it more elaborate/complicated than it needs to be? > Oh, I'm just thinking out loud. Why not just keep it encode/decode? > Yeah, that's a good suggestion; I may adopt it for 0.1.3. Alvaro http://alva.ro -------------- next part -------------- An HTML attachment was scrubbed... URL: From cma at bitemyapp.com Tue Jan 28 21:25:16 2014 From: cma at bitemyapp.com (Christopher Allen) Date: Tue, 28 Jan 2014 13:25:16 -0800 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: Cool, thanks again for sharing this, I look forward to using it for teaching Parsec and Haskell :) On Tue, Jan 28, 2014 at 12:56 PM, Alvaro J. Genial wrote: > > On Tue, Jan 28, 2014 at 3:53 PM, Christopher Allen > wrote: > > Are you bent on making it more elaborate/complicated than it needs to be? >> > > Oh, I'm just thinking out loud. > > Why not just keep it encode/decode? >> > > Yeah, that's a good suggestion; I may adopt it for 0.1.3. > > Alvaro > http://alva.ro > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From haskell at ibotty.net Wed Jan 29 08:38:22 2014 From: haskell at ibotty.net (Tobias Florek) Date: Wed, 29 Jan 2014 09:38:22 +0100 Subject: [Haskell] [ANN] yocto-0.1.2 In-Reply-To: References: Message-ID: <52E8BDFE.6080802@ibotty.net> hi, > I may adopt it for 0.1.3. not, that it matters for that package, but the package versioning policy says, you should raise the version to 0.2.0. greetings, tobias florek From kh at cs.st-andrews.ac.uk Thu Jan 30 12:45:16 2014 From: kh at cs.st-andrews.ac.uk (Kevin Hammond) Date: Thu, 30 Jan 2014 12:45:16 +0000 Subject: [Haskell] 8 Funded PhD Positions at St Andrews Message-ID: <8F9F607F-5630-4572-9532-22840229ADD0@cs.st-andrews.ac.uk> [Please forward to suitable candidates. Thanks! Kevin.] We have eight funded research scholarships available under the University of St Andrews Seventh Century scheme. These are open to students from any country, and pay fees as well as maintenance. The deadline for applications is March 31st 2014, but it's good to apply earlier. We have an active group of about ten academic academics, postdoctoral research fellows and postgraduate students working on a variety of topics. We'd welcome applicants who are interested in any aspect of functional programming and related areas, including: Parallel Functional programming; Heterogeneous multicores (including CPU/GPU combinations); Refactoring; Patterns of computation; Machine-Learning; Compilation; Real-time functional programming (e.g. in Hume); Semantics of Programming Languages; Functional cloud computing; Functional Programming and Security; Dependent Types; Effects and other extra-functional properties; Relaxed memory consistency; Multicore programming; Formal concurrency models; Concurrency verification; Application of functional ideas to other paradigms, including C and C++. We work with various functional languages including Haskell, Erlang, idris, OCAML, Hume and F#. We have excellent links with both academic and industry, and are coordinating the EU Framework 7 ParaPhrase project, which involves 13 partners from 8 European countries: http://www.paraphrase-ict.eu Please contact me to discuss possible project ideas. Applications should be made through: http://www.cs.st-andrews.ac.uk/prospective-pg/research-degrees When applying, please indicate that you would like to apply for 7th Century Funding. Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk). The University of St Andrews is a charity registered in Scotland : No SC013532 From P.Achten at cs.ru.nl Fri Jan 31 08:49:19 2014 From: P.Achten at cs.ru.nl (Peter Achten) Date: Fri, 31 Jan 2014 09:49:19 +0100 Subject: [Haskell] TFP 2014 - 2nd call for papers Message-ID: <52EB638F.3080700@cs.ru.nl> --------------------------------- 2ND C A L L F O R P A P E R S --------------------------------- ======== TFP 2014 =========== 15th Symposium on Trends in Functional Programming May 26-28, 2014 Utrecht University Soesterberg, The Netherlands http://www.cs.uu.nl/wiki/TFP2014/WebHome *** Submission for TFP 2014 is now open: please direct your browser to *** http://www.cs.uu.nl/wiki/TFP2014/PaperSubmission The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected revised papers will be published as a Springer Lecture Notes in Computer Science (LNCS) volume. TFP 2014 will be the main event of a pair of functional programming events. The other is the International Workshop on Trends in Functional Programming in Education (TFPIE). TFPIE will take place on May 25th. Its website is located at http://www.cs.uwyo.edu/~jlc/tfpie14/ The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, St. Andrews (UK) in 2012 and Provo (Utah, USA) in 2013. For further general information about TFP please see the TFP homepage. INVITED SPEAKERS TFP is pleased to announce talks by the following two invited speakers: John Hughes of Chalmers, Goteborg, Sweden, is well-known as author of Why Functional Programming Matters, and as one of the designers of QuickCheck (together with Koen Claessen); the paper on QuickCheck won the ICFP Most Influential Paper Award in 2010. Currently he divides his time between his professorship and Quviq, a company that performs property-based testing of software with a tool implemented in Erlang. Dr. Geoffrey Mainland received his PhD from Harvard University where he was advised by Greg Morrisett and Matt Welsh. After a two year postdoc with the Programming Principles and Tools group at Microsoft Research Cambridge, he is now an assistant professor at Drexel University. His research focuses on high-level programming language and runtime support for non-general purpose computation. SCOPE The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Using functional techniques to reason about imperative/object-oriented programs Debugging for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2014 program chair, Jurriaan Hage at J.Hage at uu.nl. BEST PAPER AWARDS To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. SPONSORS TFP is financially supported by NWO (Netherlands Organisation for Scientific Research), Well-Typed and Erlang Solutions. PAPER SUBMISSIONS Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (16 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. In the case of a FULL STUDENT paper, the draft paper will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. IMPORTANT DATES Submission of draft papers: March 17, 2014 Notification: March 24, 2014 Registration: April 7, 2014 TFP Symposium: May 26-28, 2014 Student papers feedback: June 9th, 2014 Submission for formal review: July 1st, 2014 Notification of acceptance: September 8th, 2014 Camera ready paper: October 8th, 2014 PROGRAM COMMITTEE Peter Achten Radboud University Nijmegen Emil Axelsson Chalmers Lucilia Camarao de Figueiredo Universidade Federal de Ouro Preto Laura Castro University of A Coruna Frank Huch Christian-Albrechts-University of Kiel Matthew Fluet Rochester Institute of Technology Jurriaan Hage (chair) University of Utrecht Yukiyoshi Kameyama University of Tsukuba Andrew Kennedy Microsoft Research Tamas Kozsik Eotvos Lorand University Ben Lippmeier University of New South Wales Luc Maranget INRIA Jay McCarthy (co-chair) Brigham Young University Marco T. Morazan Seton Hall University Ricardo Pena Universidad Complutense de Madrid Alexey Rodriguez LiquidM Sven-Bodo Scholz Heriot-Watt University Manuel Serrano INRIA Sophia Antipolis Simon Thompson University of Kent Tarmo Uustalu Inst of Cybernetics David Van Horn University of Maryland Janis Voigtlaender University of Bonn From Graham.Hutton at nottingham.ac.uk Fri Jan 31 11:45:48 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Fri, 31 Jan 2014 11:45:48 +0000 Subject: [Haskell] Midlands Graduate School 2014 - register now! References: Message-ID: <40C673C1-DADC-47B2-A31F-A3E2A1C4E9BD@exmail.nottingham.ac.uk> Begin forwarded message: The Midlands Graduate School (MGS) in the Foundations of Computing Science is a collaboration between researchers at the Universities of Birmingham, Leicester, Nottingham and Sheffield. It was established in 1999. The MGS has two main goals: to provide PhD students with a sound basis for research in the mathematical and practical foundations of computing and to give PhD students the opportunity to make contact with established researchers in the field and their peers who are at a similar stage in their research careers. This year, the MGS is at the University of Nottingham. It will start on 22 April and finish on 26 April. Core Courses Course Title Acronym Lecturer Affiliation Category Theory CAT Roy Crole Leicester Denotational Semantics DEN Achim Jung Birmingham Typed Lambda Calculus LAM Paul Blain Levy Birmingham Advanced Courses Course Title Acronym Lecturer Affiliation Concurrency, Causality, Reversibility CCR Irek Ulidowski Leicester Theory of Randomised Search Heuristics HEU Dirk Sudholt, Per Kristian Lehre,Pietro S. Oliveto, Christine Zarges Birmingham, Nottingham, Sheffield Homotopy Type Theory HOT Thorsten Altenkirch Nottingham Infinite Data Structures INF Venanzio Capretta Nottingham Logical relations and parametricity PAR Uday Reddy Birmingham Higher-Order Functional Reactive Programming REA Neelakantan Krishnaswami Birmingham + an invited lecture course on Dependently Typed Programming by Conor McBride. The fee is ?440, this includes on campus accommodation with breakfast, lunches, coffees and a workshop dinner! More information is available on http://www.cs.nott.ac.uk/~txa/mgs.2014/ from where you also find a link to the registration page page. The registration deadline is Friday, 21 March. Please register as soon as possible since there is a limited number of spaces which are allocated on a 1st come 1st serve base. Hope to see you in Nottingham, Thorsten P.S. Please forward to other people who may be interested. -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. -------------- next part -------------- An HTML attachment was scrubbed... URL: