[TYPES/announce] Deadline approaching: Call for Posters: ACM SIGPLAN Workshop on Machine Learning and Programming Languages 2018

[Alvin Cheung]

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Deadline quickly approaching! Final call for posters.



ACM SIGPLAN Workshop on Machine Learning and Programming Languages (MAPL)

https://pldi18.sigplan.org/track/mapl-2018-papers#Call-for-Papers

To be held in conjunction with PLDI 2018 in Philadelphia, USA

*Call for Posters*

We invite poster submissions that are related to the workshop topics:

- Programming language and compiler support for machine learning 
applications
- Programming language support and implementation of deep learning 
frameworks

- Inductive programming
- Probabilistic programming
- Application of machine learning to compilation and run-time scheduling
- Collaborative human / computer programming
- Interoperability between machine learning frameworks and existing code 
bases

- Infrastructure and techniques for mining and analyzing large code bases

For each poster, please prepare a maximum 1 page abstract summarizing 
your project. All reasonable posters will be accepted. The poster titles 
will be posted on the workshop website but will not be included as part 
of the official proceedings, hence authors will be able to submit their 
work as a full paper to other venues.


*Important Dates*
Abstract submission: Fri May 18 2018
Notification: Fri May 25 2018

*Submission Website*
https://mapl18posters.hotcrp.com

If you have any questions, please feel free to contact the program chair.

On behalf of our organizational committee:
Alvin Cheung, University of Washington, USA (Program Chair)
Justin Gottschlich, Intel Labs, USA (General Chair)
Tatiana Shpeisman, Google, USA (Steering Committee Chair)

[TYPES/announce] Extended Deadline CfP LACompLing2018 - Logic and Algorithms in Computational Linguistics 2018, Stockholm

[Roussanka Loukanova]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

CALL FOR PAPERS
* Extended submission deadline *
*** 31 May 2018 ***
for papers and abstracts (due to requests)

=
CALL FOR PAPERS

Symposium Logic and Algorithms in Computational Linguistics 2018
(LACompLing2018)
Stockholm, 28-31 August 2018
Department of Mathematics, Stockholm University

http://staff.math.su.se/rloukanova/LACompLing2018-web/


DESCRIPTION
==
Computational linguistics studies natural language in its various
manifestations from a computational point of view, both on the theoretical
level (modeling grammar modules dealing with natural language form and
meaning, and the relation between these two) and on the practical level
(developing applications for language and speech technology). Right from
the start in the 1950ties, there have been strong links with computer
science, logic, and many areas of mathematics - one can think of Chomsky's
contributions to the theory of formal languages and automata, or Lambek's
logical modeling of natural language syntax. The workshop assesses the
place of logic, mathematics, and computer science in present day
computational linguistics. It intends to be a forum for presenting new
results as well as work in progress.


SCOPE
==
The workshop focuses mainly on logical approaches to computational
processing of natural language, and on the applicability of methods and
techniques from the study of artificial languages (programming/logic) in
computational linguistics. We invite participation and submissions from
other relevant approaches too, especially if they can inspire new work and
approaches.

The topics of LACompLing2018 include, but are not limited to:

- Computational theories of human language
- Computational syntax
- Computational semantics
- Computational syntax-semantics interface
- Interfaces between morphology, lexicon, syntax, semantics, speech, text,
pragmatics
- Computational grammar
- Logic and reasoning systems for linguistics
- Type theories for linguistics
- Models of computation and algorithms for linguistics
- Language processing
- Parsing algorithms
- Generation of language from semantic representations
- Large-scale grammars of natural languages
- Multilingual processing
- Data science in language processing
- Machine learning of language
- Interdisciplinary methods
- Integration of formal, computational, model theoretic, graphical,
diagrammatic, statistical, and other related methods
- Logic for information extraction or expression in written and spoken
language
- Language theories based on biological fundamentals of information and
languages
- Computational neuroscience of language

IMPORTANT DATES
==
Submission deadline, regular papers: 31 May 2018 (Anywhere on Earth / AoE)
- extended
Submission deadline, abstracts: 31 May 2018 (AoE)
Notifications: 15 June 2018
Final submissions: TBA
LACompLing2018: between 28-31 Aug 2018 (few days, depending on the program)

SUBMISSION INSTRUCTIONS
==
We invite original, regular papers that are not submitted concurrently to
another conference or for publication elsewhere. Abstracts of presentations
can be on work submitted or published elsewhere.

- Regular papers: maximum 10 pages, including figures and references
- Abstracts of contributed presentations: not more than 2 pages
- The submissions of proposed papers and abstracts have to be in pdf
- The camera-ready submissions require the pdf and their sources

Authors are required to use Springer LNCS style files. Styles and templates
can be downloaded from Springer, for LaTeX and Microsoft:

https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines

The submissions are via the EasyChair management system of LACompLing2018:

https://easychair.org/conferences/?conf=lacompling2018

PUBLICATIONS
==
- The proceedings of LACompLing2018 will be published digitally by the DiVA
system of Stockholm University:
http://su.diva-portal.org

- Improved and extended versions of selected papers, which have been
presented at the workshop LACompLing2018, will be published in a special
issue of a journal after the workshop.

ORGANIZERS
==
Krasimir Angelov, University of Gothenburg, Sweden
Kristina Liefke, Ludwig-Maximilians-University Munich, Germany
Roussanka Loukanova, Stockholm University, Sweden (chair)
Michael Moortgat, Utrecht University, The Netherlands
Satoshi Tojo, School of Information Science, JAIST, Japan

CONTACT
==
Roussanka Loukanova (rloukan...@gmail.com)
Kristina Liefke (lie...@lingua.uni-frankfurt.de)


=
CALL FOR PAPERS

Symposium Logic and Algorithms in Computational Linguistics 2018
(LACompLing2018)
Stockholm, 28-31 August 2018
Department of Mathematics, Stockholm University

[TYPES/announce] Postdoc position in formal verification for formal compositional contracts

[Łukasz Czajka]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Deon Digital and DIKU are looking for a postdoc in formal verification
for formal compositional contracts in a domain-specific language
specifying rules (obligations, permissions, prohibitions) without
conflating these with specific execution strategies (as done in smart
contracts). Contracts are hosted on a variety of
blockchain/distributed ledger systems. The postdoc is to develop
proof-assisted semantic foundations and verification technology (for
example--but not necessarily--in Coq) for guaranteed sound contract
analysis and reasoning, ranging from basic security and privacy
properties to quantitative analysis of resources and time constraints
to guard against both errors and traps in (smart) contracts.

Application: Now until June 10th, 2018.

Position: The postdoc is a 2-year position co-funded by Deon Digital
and the Danish Innovation Foundation; it carries a competitive salary,
advantageous tax status for researchers moving to Denmark, and shares
in Deon Digital; it is automatically converted into a permanent
position at Deon Digital after the postdoc period. The postdoc will
work with Prof. Fritz Henglein and his colleagues at the Programming
Languages and Theoretical Computer Science section at DIKU; and with
Dr. Jesper Andersen at Deon Digital Denmark and his team at Deon
Digital Denmark (all of whom are computer scientists with a background
in semantics-based programming language theory and technology).

Requirements: Relevant Ph.D. in computer science, awarded by end of
June 2018, with documented high research quality.  Maximum 6 months of
work in private sector since start of Ph.D. studies (requirement by
funding agency).  Interest in working in congenial, self-organizing
environments at both Deon Digital and DIKU.  Flexible remote work from
home is possible in the beginning, but an eventual move to Copenhagen
is expected.

Application: If you are interested in the position, please send your
CV, 1-3 papers, and (links to some of) your open source software
contributions (if any) by email to Fritz Henglein, hengl...@diku.dk.
The position is open now.  Applications will be accepted from now
until June 10th, 2018; they will be processed on an ongoing
(first-come) basis.

DIKU (diku.dk) is the Department of Computer Science at the University
of Copenhagen with 40+ junior and senior faculty researching
fundamentals and applications of algorithms, programming languages and
systems, data science, machine learning, image processing,
human-computer interaction, and more.  DIKU's research is consistently
ranked highly.   Its newly formed section on Programming Languages and
Theoretical Computer Science is located on the North Campus in
Copenhagen, 15 minutes (by bicycle or public transportation) from Deon
Digital's R center.

Deon Digital (deondigital.com) is a rapidly growing Zürich-based
start-up developing domain-specific language technology for
blockchain/distributed ledger-hosted contracts, with applications in
finance, insurance, pensions, mobility (transportation), logistics,
supply chain, commodity trading and more.  Its research and
development center is located in the Christianshavn section of
Copenhagen, close to DIKU, the city center and 10 minutes from
Copenhagen airport.

[TYPES/announce] PhD studentship in formal methods & verification at University College London

[Matteo Sammartino]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Applications are invited for a PhD studentship at University College London, 
under the supervision of Prof. Alexandra Silva and Dr. Matteo Sammartino.

The start date is flexible. It should be in September 2018 at the latest.

The studentship is funded by the UK Research Institute in Verified Trustworthy 
Software Systems, and will be carried out within the Programming Principles, 
Logic and Verification (PPLV) group (http://pplv.cs.ucl.ac.uk/). The PPLV group 
offers an exciting research environment, with outstanding connections with 
cutting-edge industry.

Potential applicants are encouraged to contact Prof. Silva 
(alexandra.si...@ucl.ac.uk) and Dr. Sammartino (m.sammart...@ucl.ac.uk) for 
further information and expressions of interest.
Applications should be made via the UCL evision system:

https://evision.ucl.ac.uk/urd/sits.urd/run/siw_ipp_lgn.login?process=siw_ipp_app=RRDCOMSING01=0025


=== PROJECT DESCRIPTION ===

Our society is increasingly reliant on complex networking systems, consisting 
of several components that operate in a distributed/concurrent fashion, 
exchange data that may be highly sensitive, and are implemented with a mix of 
open and closed-source code. Examples are Software Defined Networks, cloud 
computing systems, Internet of Things and others. 

As the complexity of these systems increases, there is a pressing need of 
methods and tools to automatically verify security and privacy properties. High 
quality models – able to express all the behaviours of interest – are of 
paramount importance to this aim. However, it is often the case that the task 
of building a model is performed by humans and in a short span of time – if it 
is performed at all – and as such can be error-prone and inaccurate. 

The goal of the PhD project is to develop techniques and tools to automate the 
modelling and verification of networking software systems. The novel idea is to 
rely on the model learning paradigm, originally proposed in artificial 
intelligence, to automatically build an automaton model of a running system in 
a black-box fashion -- purely via interactions with the running system.  

[TYPES/announce] BOOM! 2018 @ CONFESTA - 2nd Call for Contributions

[Nils Jansen]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

The BOOM! workshop solicits presentations of ongoing or previously published 
work to enable discussions on a broad range of topics, without formal 
proceedings.  
Selected abstracts will be invited for full submission as part of a special 
issue of the Journal on Reliable Intelligent Environments.



 Call for presentations (abstracts)

  BOOM! 2018

Workshop on Big Data meets Formal Methods
September 08, 2018, Beijing, China.

Co-Located with CONFESTA 2018

http://wwwhome.ewi.utwente.nl/~marielle/boom.html 



Big data is booming. Advanced data analytic techniques, like deep learning, 
predict the weather, buy and sell stocks, beat the humans in chess playing, 
diagnose diseases from CT scans, and recommend us which books to buy. 

Big data is gaining more and more importance in the area of formal methods: 
quantitative analysis techniques largely depend on the values of the input 
parameters, which could be learned from historic data. 
Moreover, automatic learning formal models themselves, or model skeletons as 
well as solutions have gained a lot of momentum with techniques like model 
mining, and reinforcement learning. 
In the other direction, formal methods have also a lot to offer for the 
development of big data analytic techniques, such as the verification of deep 
learning algorithms, model-based classification algorithms, methods and models 
for data cleaning etc.

As there are no formal proceedings for the workshop, the main focus is on a 
broad range of topics that trigger lively discussions.


==
INVITED SPEAKERS 
==
Alessandro Abate, University of Oxford, United Kingdom
Luca Bortolussi, University of Trieste, Italy


==
IMPORTANT DATES
==
Abstract submission: June 10, 2018
Notification: June 30, 2018
Workshop: September 08, 2018


==
 SUBMISSIONS 
==
We encourage all interested authors to submit an abstract of their presentation 
through Easychair under the following link:

https://easychair.org/conferences/?conf=boom2018 


We particularly invite work recently accepted to top conferences and ongoing 
work.
The submission should be a pdf of at most two pages in the llncs style.
Accepted presentations will not be subject to proceedings publication, though 
there will be invitations for selected abstracts for a special issue of the 
Journal on Reliable Intelligent Environments.


==
 PC CHAIRS
==
*  Nils Jansen, Radboud University Nijmegen, The Netherlands
*  Marielle Stoelinga, University of Twente, The Netherlands


Nils Jansen
Assistant Professor
Department of Software Science
Radboud University Nijmegen
http://nilsjansen.org 

[TYPES/announce] Tezos is hiring!

[careers]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Tezos is a self-governing blockchain and smart-contract platform written in
OCaml. Tezos' self-governance allows it to evolve in a decentralised manner
by enabling collective decision making.

We are currently filling 40 open positions world-wide, including 25 in
France. Part-time and remote work will be considered.

The development of the project is centred around different areas, such as
distributed systems, peer to peer systems, theory of programming languages,
cryptography and formal methods.

We are looking for a range of profiles, with a preference towards PhD
holders. Possibility of PhD funding for excellent master students.

Mastering of a functional language such as OCaml, Haskell or Clojure is
particularly desirable, as well as skills in one or more of the following
topics: algorithms, compilers, design of programming languages,
cryptography, p2p, web programming / UI in OCaml, SAT / SMT, formal
verification, linear and integer programming, numerical optimization,
stochastic processes or computer algebra.
Attractive compensation.

If you are interested, please send your CV (resumé) to care...@tezos.com!