February 2021 - Haskell-Cafe

International Conference on Informatics Revolution for Smarter Healthcare (IRSH 2021) Prague
by matteo＠confscience.com 15 Feb '21

15 Feb '21

Call for papers ************************************************* International Conference on Informatics Revolution for Smarter Healthcare (IRSH 2021) Prague- Czech Republic, October 14-15, 2021 https://confscience.com/irsh/ Submission deadline: April 1, 2021 All papers accepted in IRSH 2021 will be published in Springer CCIS (Communications in Computer and Information Science). CCIS is abstracted/indexed in Scopus, SCImago, EI-Compendex, Mathematical Reviews, DBLP, Google Scholar, and Thomson Reuters Conference Proceedings Citation (Former ISI Proceedings) *************************************************************************** IMPORTANT DATES: - Paper Submission: April 1, 2021 - Acceptance Notification: July 1, 2021 - Final Manuscript Due: September 1, 2021 *************************************************************************** The IRSH 2021 conference will be held in Conjunction with: International Conference on Applied Data Science and Intelligence (ADSI 2021) International Conference on Recent Theories and Applications in Transportation and Mobility - (RTATM 2021) *************************************************************************** TOPICS: Authors are invited to submit their original papers to address the topics of the conference, including but not limited to: FUNDAMENTALS AND THEORIES - Interoperability and Data Integration - Confidentiality and Data Security - Data protection - Data Sharing - Security, Privacy, and Trust - Emergent healthcare standards - Emergent healthcare architectures - ICT, Ageing and Disability - Physiological and behavioural modelling - Pandemic and disease modeling - Usability and user experience of medical devices - Human behaviour - Clinical investigation regulatory frameworks - Integrated healthcare approaches - eHealth data standards and interoperability (e.g. HL7/FHIR) - Databases and data warehousing - Big Data and Open Data for healthcare - Design and Development of Methodologies for Healthcare - Emergent Communication Technologies - Real-time interaction theories - Emergent Technologies for Ambient Assisted Living - User Interface Design for healthcare - Sustainability - New approaches for accuracy and effectiveness - Data mining and bioinformatics - Enhanced living environments - Analysis and evaluation of healthcare systems INTELLIGENT HEALTHCARE - Pattern recognition and Machine - Learning for healthcare - Cognitive Informatics - Big Data in Healthcare - Wellbeing Informatics - Data Mining and Data Analytics - Data Visualization - Smart environments - Smart Ambient Assisted Living - Intelligent healthcare solutions - Agent-based solutions for healthcare - Collaboration systems - Intelligent Electronic Health Records - Internet of Things for healthcare - Cyber-Physical Systems for healthcare - Ambient Computing and Reasoning - Context Awareness - Smart devices for eldercare - Autonomy and active ageing - Emergent technologies for intelligent Computer Vision - Service production and delivery - Gamification - Multi-modal interaction - Computer-aided detection and diagnosis - Crowdsourcing for smarted healthcare SERVICES, SYSTEMS, AND INFRASTRUCTURES - Emergent healthcare services - Pervasive health systems and services - Remote healthcare management - Emergent healthcare infrastructure - Industry Revolution 4.0 for healthcare - eHealth - Electronic health records - Assistive technologies - Disease surveillance and patient monitoring systems - Prevention and detection systems - Home monitoring - Healthcare management systems - ICT-based therapeutic systems - ICT-based rehabilitation technologies - Wearable health informatics - Emergent technologies for data analytics - Ambient Assisted Leaving (AAL) - Decision Support Systems - Emergent Technologies for Remote AAL Monitoring - Emergent Technologies and Accessibility - 5G for healthcare - Healthcare supply chain and logistics - Wireless Body Networks - Telemedicine and mobile telemedicine - Mobile Systems - Software Defined infrastructures - Patient empowerment systems - Smart technology for remote patient visits - Biosensors - Medical devices APPLICATIONS - eHealth applications - Application of health informatics in clinical cases - Mobile technologies for healthcare applications - Software Systems in healthcare - Social networking and healthcare - Case Studies - Personalization and patient experience - AR and VR applications - Patient billing - Accounting systems - Personnel and payroll - Materials management - Voice recognition systems - Asset management solutions - Disease management - Feedback integration - Clinical software - Crowd-computing applications - Future directions - Drone-based solutions - Software Defined Networks for healthcare *************************************************************************** OUTSTANDING PAPERS: Based on the peer review scores as well as the presentations at the conference, the authors of outstanding papers will be invited to extend their works for a potential publication in journals special issues with high impact factors. *************************************************************************** PAPER SUBMISSION: Papers must be submitted electronically as PDF files via easychair (https://easychair.org/conferences/?conf=irsh2021) All papers will be peer reviewed. Length of Full papers: 12-15 pages long (written in the LNCS/CCIS one-column page format, 400 words per page) Length of Short papers: less than 12 pages For more information, please refer to the conference website: https://confscience.com/irsh/ *************************************************************************** CONTACT For more information, please send an email to info-irsh(a)confscience.com

1 0

Kind pairs and kind currying/uncurrying
by CASANOVA Juan 13 Feb '21

13 Feb '21

Hello again, At this point, I think what I am trying to do is simply not possible in Haskell, not even with as many extensions as I would want. Perhaps with template Haskell, but that's ground that I am still afraid to tread. But I thought I would ask anyway. (All the code in the rest of the email assumes as many extensions as GHC asks me to compile). The background is more complicated and controversial than the question itself, but I'll give a little bit of it so that you know why I'm trying to do this. I am trying to define a type class that takes other type classes as arguments. That is fairly straightforward by itself. A single parameter type-class has kind (k -> Constraint). So I can write my class SecondOrderClass (cl :: k -> Constraint) The problem, however, is that I want to use this class for multi-parameter type classes as well. A two parameter type class has kind (k1 -> k2 -> Constraint) The most general unifier of these two kinds is, unfortunately, a free kind (k), which thus includes kinds that are not type classes (like types). Therefore, it is not possible to directly specify a class that takes as parameter a type class with any number of arguments. So, thus I thought: I've seen this before. This is currying and uncurrying. Except I'm doing it with kinds except of with types. A brief search didn't yield me any library that would do this. So I thought: This should be fairly easy to do by myself if I throw enough extensions at it. Well, I failed. I tried two variations and neither worked. To be clear, what I tried to do is to * Define a type synonym that would produce a kind representing a pair of two given kinds. * Define type synonyms for currying and uncurrying kinds using the pair kind. The first variation I tried I feel is the most semantically accurate, as it is clear from the beginning of what I am trying to do. The main "insight" I used was using/assuming extensionality of kinds (and partial application of type synonyms) to define a kind pair: type KindPair (a :: ka) (b :: kb) (f :: ka -> kb -> *) = f a b A pair of kinds is simply anything that "owes the two kinds to the type checker". Thus, if given anything expecting those two kinds, it would feed them to it. This by itself compiles fine. But then when trying to define currying and uncurrying, it won't type check: type KCurry (tf :: (KindPair ka kb) -> kc) (ta :: ka) (tb :: kb) = kc type KUncurry (tf :: ka -> kb -> kc) (tp :: (KindPair ka kb)) = kc The error I get is: The type synonym ‘KindPair’ should have 3 arguments, but has been given 2 Partial application of type synonyms is fine, I use it all the time. But it seems it is not fine when it is "kind synonyms"??? It is not even asking me for any extension to allow it. So I tried a more syntactic approach, abusing the notion that GHC treats kinds and types very similarly: type KindPair (a :: ka) (b :: kb) = ((ka -> kb -> *) -> *) type KCurry (tf :: (KindPair ka kb) -> kc) = ka -> kb -> kc type KUncurry (tf :: ka -> kb -> kc) = (KindPair ka kb) -> kc This type checks, but it is just a mirage. If you check the kinds of KCurry and KUncurry it does not look good: (KindPair ka kb -> kc) -> * Uhh... that's not what I said. It's taking the right hand side entirely as a type, not as a kind. This becomes obvious when we try to use them: ftest :: KCurry (KUncurry (,)) Int Int -> (Int, Int) This does not type check, regardless of the definition (ideally ftest = id would work, but we do not even get that far). The error is: Expected kind ‘* -> * -> *’, but ‘KCurry (KUncurry (,))’ has kind ‘*’ So, my question is: Is what I am trying to do possible in Haskell? Is what I am trying to do completely absurd? I do not think it is, but maybe I am being naive? Thanks in advance, and sorry for the long email (again). I tried to be as straight to the point as possible. Juan. The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

3 4

Request for Nominations to the GHC Steering Committee
by Alejandro Serrano Mena 13 Feb '21

13 Feb '21

Dear Haskell community, The three-year term limit of some of the GHC Steering committee members has expired. We are really grateful for the awesome work that Iavor, Richard, and Joachim have done through these years (especially the latter, who has acted as secretary.) As a result, the GHC Steering committee is seeking nominations for new members. The committee scrutinizes, nitpicks, improves, weights and eventually accepts or rejects proposals that extend or change the language supported by GHC and other (public-facing) aspects of GHC. Our processes are described at https://github.com/ghc-proposals/ghc-proposals which is also the GitHub repository where proposals are proposed. We are looking for members who have the ability * to understand such language extension proposals, * to find holes and missing corner cases in the specifications, * foresee the interaction with other language features and specifications, * comment constructively and improve the proposals, * judge the cost/benefit ratio and * finally come to a justifiable conclusion. We look for committee members who have some of these properties: * have substantial experience in writing Haskell applications or libraries, which they can use to inform judgements about the utility or otherwise of proposed features, * have made active contributions to the Haskell community, for some time, * have expertise in language design and implementation, in either Haskell or related languages, which they can share with us. The committee’s work requires a small, but non-trivial amount of time, especially when you are assigned a proposal for shepherding. We estimate the workload to be around 2 hours per week, and our process works best if members usually respond to technical emails within 1-2 weeks (within days is even better). Please keep that in mind if your email inbox is already overflowing. The GHC developers themselves are already well represented already. We seek Haskell _users_ more than GHC hackers. There is no shortage of people who are eager to get fancy new features into the language, both in the committee and the wider community. But each new feature imposes a cost, to implement, to learn, (particularly) through its unexpected interaction with other features. We need to strike a balance, one that encourages innovation (as GHC always has) while still making Haskell attractive for real-world production use and for teaching. We therefore explicitly invite “conservative” members of the community to join the committee. To make a nomination, please send an email to me (as the interim committee secretary) at trupill at gmail.com until February 28th. I will distribute the nominations among the committee, and we will keep the nominations and our deliberations private. We explicitly encourage self-nominations. You can nominate others, but please obtain their explicit consent to do so. (We don’t want to choose someone who turns out to be unable to serve.) On behalf of the committee, Alejandro Serrano

1 0

Surprising lack of generalisation
by Tom Ellis 11 Feb '21

11 Feb '21

Dear all, I don't understand why the type of pBD defined in the where clause of pFG cannot be inferred to a general type in the presence of TypeFamilies. In particular I don't understand why nonetheless the type of pBD definied in the where clause of pF (only slightly simpler) *can* be inferred. Can anyone explain? Thanks Tom {-# LANGUAGE TypeFamilies #-} -- This code came up in the context of writing a parser, but that's -- not terribly important import Prelude hiding ((<$>)) data B = B data D f = F f | GF AP f | DF AM f data AM = AM data AP = AP pB :: Parser B pB = Parser -- Works fine pF :: Parser (D B) pF = pBD GF AP <|> pBD DF AM where pBD f p = f p <$> pB -- Shows the (presumably) inferred type for pBD pFWithType :: Parser (D B) pFWithType = pBD GF AP <|> pBD DF AM where pBD :: (t -> B -> b) -> t -> Parser b pBD f p = f p <$> pB -- One would hope this type would be inferred too pFGWithType :: Parser B -> Parser (D B) pFGWithType pBArg = pBD GF AP <|> pBD DF AM where pBD :: (t -> B -> b) -> t -> Parser b pBD f p = f p <$> pBArg -- But omitting it leads to a type error if TypeFamilies is enabled. -- There is no error if TypeFamilies is not enabled. pFG :: Parser B -> Parser (D B) pFG pBArg = pBD GF AP <|> pBD DF AM where pBD f p = f p <$> pBArg -- The specifics of the parser don't matter data Parser a = Parser (<|>) :: Parser a -> Parser a -> Parser a (<|>) _ _ = Parser (<$>) :: (a -> b) -> Parser a -> Parser b (<$>) _ _ = Parser

3 7

10 PhD studentships in Nottingham
by Graham Hutton 11 Feb '21

11 Feb '21

Dear all, The School of Computer Science at the University of Nottingham is seeking applications for 10 fully-funded PhD studentships: https://tinyurl.com/ten-phds-2021 Applicants in the area of the Functional Programming Laboratory (https://tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor as soon as possible (the application deadline is 15th March): Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Graham Hutton - mathematics of program construction, category theory, program correctness and efficiency, Haskell. Nicolai Kraus - homotopy type theory, higher category theory, constructive mathematics, and related topics. Henrik Nilsson - functional reactive programming, domain- specific languages, generalised notions of computation. The studentships are open to applicants of any nationality. Best wishes, Graham +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK tinyurl.com/ten-phds-2021 Applications are invited for a number of fully funded PhD studentships offered by the School of Computer Science at the University of Nottingham, starting on 1st October 2021. The topics for the studentships are open, but should relate to the interests of one of the School’s research groups: Computational Optimisation and Learning Lab; Computer Vision Lab; Cyber Security; Functional Programming; Intelligent Modelling and Analysis; Mixed Reality Lab and Uncertainty in Data and Decision Making. The studentships are for three and a half years and include a stipend of (minimum) £15,609 per year and tuition fees. Applicants are normally expected to have a 2:1 Bachelor or Masters degree or international equivalent, in Computer Science or a related discipline, and must obtain the support of a potential supervisor in the School prior to submitting their application. Please contact potential supervisors at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to Professor Tony Pridmore (tony.pridmore(a)nottingham.ac.uk) To apply, please submit the following items by email to Lindsay.Norman(a)nottingham.ac.uk: (1) A copy of your CV, including your actual or expected degree class(es), and results of all University examinations; (2) An example of your technical writing, such as a project report or dissertation; (3) Contact details for two academic referees - it is the applicant’s responsibility to ensure that references are requested and sent to Lindsay.Norman(a)nottingham.ac.uk; (4) A research proposal – max 2 x sides A4; (5) A covering letter, which must include the name of the member of staff who has agreed to support your application (without this your application cannot be considered), and the University’s job reference number (SCI1979). Closing date for applications: Monday 15th March 2021. +-----------------------------------------------------------+ 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 contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

lexing nested comments in GHC/Parser/Lexer.x
by Benjamin Redelings 11 Feb '21

11 Feb '21

Hi, I notice that in Lexer.x for GHC nested comments are parsed using a special function, with the comment "nested comments require traversing by hand, they can't be parsed using regular expressions." While I see that nested comments can't be parsed using regular expressions, the lexer has a state stack, and so it seems like nested comments could be parsed by pushing a new "nested comment" state onto the lexer state every time a "{-" is encountered. But perhaps this is not done because its not clear how to make the entire comment into a single token that way? This might be a naive question -- I don't have that much experience with lexers. Thanks! -BenRI

2 1

International Conference on Recent Theories and Applications in Transportation and Mobility - (RTATM 2021) Prague
by matteo＠confscience.com 10 Feb '21

10 Feb '21

Call for papers ************************************************* International Conference on Recent Theories and Applications in Transportation and Mobility - (RTATM 2021) Prague - Czech Republic, October 14-15, 2021 https://confscience.com/rtatm/ Submission deadline: April 1, 2021 All papers accepted in RTATM 2021 will be published in Springer CCIS (Communications in Computer and Information Science). CCIS is abstracted/indexed in Scopus, SCImago, EI-Compendex, Mathematical Reviews, DBLP, Google Scholar, and Thomson Reuters Conference Proceedings Citation (Former ISI Proceedings) *************************************************************************** IMPORTANT DATES: - Paper Submission: April 1, 2021 - Acceptance Notification: July 1, 2021 - Final Manuscript Due: September 1, 2021 *************************************************************************** The RTATM 2021 conference will be held in Conjunction with: International Conference on Applied Data Science and Intelligence (ADSI 2021) International Conference on Informatics Revolution for Smarter Healthcare (IRSH 2021) *************************************************************************** TOPICS: Authors are invited to submit their original papers to address the topics of the conference, including but not limited to: FUNDAMENTALS AND THEORIES - Modelling and Simulation Algorithms - Vehicular Wireless Medium Access Control - V2X communications - Routings and Protocols for Connected Vehicles - Mobility Models and Architectures - Distribution Strategies - Traffic Incident Management Systems - Bio-Inspired Approaches - Optimization and Collaboration - Automatic Control in Vehicular Networks - Energy-aware Connected Mobility - Programming Languages - Sustainable Transportation - Multimodal Transportation Networks and Systems - Systemsb Integration - Driver Behavior Models and Simulation - Human Factors and Travel Behaviour - Green Mobility - Regulations and Bylaws for Intelligent - Transportation and Mobility SMART TRANSPORTATION AND LOGISTICS - Mobility Management - Connected Vehicles - VANETs - Predictive Logistics - Spatio-Temporal Event Tracking - Decision Support Systems - Emergency Management - Logistics and E-Commerce - Supply Chain Design and Execution - Supply Chain Management - Advanced Planning Systems - Fleet Management - Multi-Agent Systems - Machine Learning for Smart Logistics - Intelligent Infrastructures - Real-time Analysis of Comprehensive Supply Chain Data - Smart Synchronization of Logistics Processes - New Approaches for Cost Transparency - Big Data for Smart Logistics - Logistics 4.0 - Mobile Networks - Next-Generation Smart Logistics - Performance Management Approaches - Tests and Deployment - Software Defined Networks - Smart Freight Management - Smart Shipment Management - Smart Warehousing - Smart Inventory management DATA AND SERVICES - Real-Time transportation Data Acquisition - Event Detection and Monitoring - Data Warehouses for connected mobility - Data mining and Data analytics - Data Worthiness in Connected Vehicles - Data Trustworthiness for effective transportation and mobility - Road Traffic Data Analytics - Structured and Unstructured Data for Connected Mobility - Volunteered Geographic Information (VGI) - Data Representation for Connected Mobility - Transportation Data Mining - Transportation and mobility Data Visualization - Cognitive and Context-aware Intelligence - Transportation Decision Support Systems - Mobility as a Service (MaaS) - Intelligent Transportation Services - Smart Mobility Services - Big Data and Vehicle Analytics - Massive Data Management - Collective and connected Intelligence - Next Generation Services - Driver Behaviour Analysis - Geo-Spatial Services - Service-Oriented Architecture (SOA) - Web and Mobile Services SAFETY, SECURITY, AND HAZARD MANAGEMENT - Security Issues in Vehicular Communications - Safety Applications of Connected Vehicles - Weather-related Safety solutions - V2V, V2I and I2V Road Safety Applications - Connected Mobility for Hazard Management - Risk Management - Road Traffic Crashes Analytics - Traffic Jam Prediction - Resource Allocation for Hazard Management - Trust and Privacy Issues in Logistics - Management of Exceptional Events - New approaches to Networking Security for Transportation Applications - Failure modes, human factors, software safety - Automated Failure Analysis - Performance and Human Error Analysis - Design and Reliability of Control Systems - Dispersion Modelling Software - Quantification of Risk *************************************************************************** OUTSTANDING PAPERS: Based on the peer review scores as well as the presentations at the conference, the authors of outstanding papers will be invited to extend their works for a potential publication in journals special issues with high impact factors. *************************************************************************** PAPER SUBMISSION: Papers must be submitted electronically as PDF files via easychair (https://easychair.org/conferences/?conf=rtatm2021) All papers will be peer reviewed. Length of Full papers: 12-15 pages long (written in the LNCS/CCIS one-column page format, 400 words per page) Length of Short papers: less than 12 pages For more information, please refer to the conference website: https://confscience.com/rtatm/ *************************************************************************** CONTACT For more information, please send an email to info-rtatm(a)confscience.com

1 0

21st Midlands Graduate School in the Foundations of Computing Science: Call for Participation
by Andrei Popescu 09 Feb '21

09 Feb '21

CALL FOR PARTICIPATION 21st Midlands Graduate School in the Foundations of Computing Science MGS 21 12-16 April 2021, virtually https://staffwww.dcs.shef.ac.uk/people/G.Struth/mgs21.html OVERVIEW The annual Midlands Graduate School in the Foundations of Computing Science (MGS) offers an intensive programme of lectures on the mathematical foundations of computing. It addresses first of all PhD students in their first or second year, but is open to anyone interested in its topics, from academia to industry and around the world. The MGS has been run since 1999 and is hosted alternately by the Universities of Birmingham, Leicester, Nottingham and Sheffield. MGS 21 is its 21st incarnation. Information about previous events can be found at the MGS web site http://www.cs.nott.ac.uk/MGS PROGRAMME MGS 21 consists of eight courses, each with four or five hours of lectures and a similar number of exercise sessions. Three courses are introductory; one is given by an invited lecturer. These should be attended by all participants. The remaining more advanced courses should be selected based on interest. MGS 21 aims at a mix of livestreamed and prerecorded lectures and livestreamed exercise sessions, with additional social online events. Invited lectures: Monads and Interactions Tarmo Uustalu, Reykjavik Introductory courses: Category Theory Jacopo Emmenegger, Birmingham Type Theory Thorsten Altenkirch, Nottingham Proof Theory Anupam Das, Birmingham Advanced courses: Homotopy Type Theory Nicolai Kraus, Nottingham Inductive and Coinductive Reasoning with Isabelle/HOL Andrei Popescu, Sheffield Effects and Call-by-Push-Value Paul Levy, Birmingham Formal Modelling and Analysis of Concurrent Systems Mohammad Mousavi, Leicester In addition we are organising a session where participants can briefly present and discuss their own research. A call will be made in March. REGISTRATION Participation at MGS 21 is free of charge, but selective. Requests must be submitted online via https://staffwww.dcs.shef.ac.uk/people/G.Struth/mgs21.html Registration deadline is April 1. ORGANISATION Please direct all queries about MGS 21 to Georg Struth. The Sheffield organisers are Harsh Beohar (H.Beohar(a)sheffield.ac.uk) Andrei Popescu (A.Popescu(a)sheffield.ac.uk) Georg Struth (G.Struth(a)sheffield.ac.uk)

1 0

Postdoc Position (up to 3 years) at St Andrews
by Christopher Brown 09 Feb '21

09 Feb '21

Dear All I have an opening for a postdoc to work on a new 3-year EPSRC project in the Programming Languages group at St Andrews. The deadline has been extended to the 26th February. Send me an email (cmb21(a)st-andrews.ac.uk<mailto:cmb21@st-andrews.ac.uk>) if you’d like to informally chat about the post. I’m very happy to chat to you. Thanks Chris Lecturer in Computer Science University of St Andrews Scotland -------------------- The Programming Languages Group seeks a Research Fellow to work on the newly funded 3-year EPSRC project, Energise: Refactorings and Skeletons for Energy-Aware Applications on High-Performance Embedded Systems. Embedded devices, such as mobile phones, drones, medical devices and even satellite imaging are now common place in society. These types of devices rely very heavily on battery power, contributing to climate change and global warming. Optimizing the software that runs on such devices for energy is a very challenging problem for software developers. The Energise project aims to address this issue by providing the developer with a refactoring tool to repurpose their software to make it consume less energy, and to do it in such a way that the code is guaranteed to still meet its specification. The Energise project aims to develop new, formally-motivated, refactorings and transformations that reduce energy consumption for embedded multi-core devices. This includes implementing refactorings for target languages such as C; proving general soundness of the refactorings using e.g. dependent types; developing new programming abstractions (skeletons) for common energy-reducing programming patterns; running experiments; writing proofs of correctness, etc. The post will require skills in formal semantics of programming languages, compilers, program transformation, lightweight formal methods (including, e.g. dependent types) and knowledge of parallelism and non-functional properties, including energy. Informal enquiries can be directed to Dr Chris Brown (cmb21(a)st-andrews.ac.uk<mailto:cmb21@st-andrews.ac.uk>). Applications are particularly welcome from women, people from the Black, Asian, Minority or Ethnic (BAME) community and other protected characteristics who are under-represented in research posts at the University. The University is committed to equality for all, demonstrated through our working on diversity awards (ECU Athena SWAN/Race Charters; Carer Positive; LGBT Charter; and Stonewall). More details can be found at http://www.st-andrews.ac.uk/hr/edi/diversityawards/. Interviews will be held on TBC. Please quote ref: AR2474MR Closing Date: 26 February 2021 School of Computer Science Salary: £33,797 - £36,914 per annum Fixed Term: 3 years Start: As soon as possible More details at: https://www.vacancies.st-andrews.ac.uk/Vacancies/W/6918/0/284952/889/resear…

1 0

tls 1.5.5
by Kazu Yamamoto 08 Feb '21

08 Feb '21

Hi all, I would like to announce that tls 1.5.5 has been released. The main purpose of this version is provide the Network.TLS.QUIC module. This is the first step to bring QUIC to the Haksell community. Changelog says: - QUIC support [#419](https://github.com/vincenthz/hs-tls/pull/419) [#427](https://github.com/vincenthz/hs-tls/pull/427) [#428](https://github.com/vincenthz/hs-tls/pull/428) [#430](https://github.com/vincenthz/hs-tls/pull/430) [#433](https://github.com/vincenthz/hs-tls/pull/433) [#441](https://github.com/vincenthz/hs-tls/pull/441) - Server ECDSA for P-256 [#436](https://github.com/vincenthz/hs-tls/pull/436) - Sort ciphersuites based on hardware-acceleration support [#439](https://github.com/vincenthz/hs-tls/pull/439) - Sending no_application_protocol [#440](https://github.com/vincenthz/hs-tls/pull/440) - Internal improvements [#426](https://github.com/vincenthz/hs-tls/pull/426) [#431](https://github.com/vincenthz/hs-tls/pull/431) Technical information can be found from the following blog posts: - Implementation status of QUIC in Haskell https://kazu-yamamoto.hatenablog.jp/entry/2020/02/18/145038 - Improving QUIC APIs of the TLS library in Haskell https://kazu-yamamoto.hatenablog.jp/entry/2020/09/16/150801 - The Current Plan for Haskell QUIC https://kazu-yamamoto.hatenablog.jp/entry/2020/10/23/141648 IMPORTANT NOTE: If you want to make "tls" faster, please install "cryptonite" with the "support_pclmuldq" flag: % cabal install cryptonite -f support_pclmuldq This enables hardware acceleration for the GCM part of AES-GCM. If you use old GCC, you need to disable the "use_target_attributes" flag: % cabal install cryptonite -f support_pclmuldq -f-use_target_attributes --Kazu

1 0