[TYPES/announce] CoqPL 2019: Call for Participation

[Robbert Krebbers]

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

The CoqPL'19 program is now online: on 19 January 2019, we will have
12 exciting talks on using Coq for building certified systems.

# Program

See https://popl19.sigplan.org/track/CoqPL-2019#program

## Invited talks

- Coq User Interfaces: Past, Present, and Future
  Emilio Jesús Gallego Arias
- Session with the Coq Development Team
  Maxime Dénès, Matthieu Sozeau

## Contributed talks

- Counterexamples for Coq Conjectures
  Sam Gruetter
- Towards Mechanising Probabilistic Properties of a Blockchain
  Kiran Gopinathan, Ilya Sergey
- Verifying Finality for Blockchain Systems
  Karl Palmskog, Milos Gligoric, Lucas Peña, Grigore Rosu
- WIP: Formalizing the Concordium consensus protocol in Coq
  Thomas Dinsdale-Young, Bas Spitters, Søren Eller Thomsen, Daniel Tschudi
- Reification of shallow-embedded DSLs in Coq with automated verification
  Vadim Zaliva, Matthieu Sozeau
- Reifying and translating a monadic fragment of Gallina
  Paolo Torrini
- Deep Embedded Hoare Logic for Building Machine-Checkable Foundational
  Program Correctness Proofs
  Qinxiang Cao
- Teaching Discrete Mathematics to Early Undergraduates with Software
  Foundations
  Michael Greenberg, Joseph C. Osborn
- Ltac2: Tactical Warfare
  Pierre-Marie Pédrot
- Towards a Coq Formalisation of Build Systems
  Georgy Lukyanov, Andrey Mokhov

# Venue / Registration

CoqPL'19 is co-located with POPL'19 in Cascais/Lisbon (Portugal). The
early registration deadline for POPL/CoqPL is 10 December 2018. More
information can be found at the POPL website:

https://popl19.sigplan.org/attending/Registration

[TYPES/announce] Postdoc Position Reminder

[Mislove, Michael W]

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

Dear All,

This is a reminder that we have an open postdoc position in Quantum Programming 
Languages here at Tulane. The project goal is to devise models of high-level 
functional quantum programming languages that support recursion, including 
recursive types. We’re also interested in contextuality as a quantum resource. 
This is a part of a multi-university research project that includes a new team 
at the University of Maryland whose work on Hoare logics for quantum 
programming languages also is of interest. Details and application instructions 
can be found at https://apply.interfolio.com/56794 

  Thanks,
  Mike Mislove

===
Michael MislovePhone: +1 504 865-5803 

Professor and Chair FAX: +1 504 865-5063 

Department of Computer Science
Tulane University   URL: http://www.cs.tulane.edu/~mwm 

New Orleans, LA 70118 USA
===



smime.p7s
Description: S/MIME cryptographic signature

[TYPES/announce] PEPM 2019 Call for Posters, Demos, and Participation

[Atsushi Igarashi]

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

-- Call for Poster/Demo Abstracts and Participation --

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) 2019
===

  * Website : http://popl19.sigplan.org/track/pepm-2019-papers
  * Time: 14th – 15th January 2019
  * Place   : Cascais/Lisbon, Portugal (co-located with POPL 2019)


POSTER/DEMO SESSIONS: PEPM 2019 is accepting proposals for poster/demo
presentations on a rolling basis, until 14th December (AoE).  See
below for the submission guidelines.


Registration


  * Web page : https://popl19.sigplan.org/attending/Registration
  * Early registration deadline : 10th December 2018


Accepted papers
---

Reduction from Branching-time Property Verification of Higher-Order Programs to 
HFL Validity Checking
  Keiichi Watanabe, Takeshi Tsukada, Hiroki Oshikawa, Naoki Kobayashi
Generating mutually recursive definitions
  Jeremy Yallop, Oleg Kiselyov
Method Name Suggestion with Hierarchical Attention Networks
  Sihan Xu, Xinya Cao, Jing Xu
Futures and Promises in Haskell and Scala
  Tamino Dauth, Martin Sulzmann
Combining Higher-Order Model Checking with Refinement Type Inference
  Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi
Typed parsing and unparsing for untyped regular expression engines
  Gabriel Radanne
Control Flow Obfuscation via CPS Transformation
  Kenny Zhuo Ming Lu
Extracting a Partial Evaluator from a Proof of Termination
  Kenichi Asai
A Simpler Lambda Calculus
  Barry Jay


Poster/demo abstract submission guideline
-

  * 
https://popl19.sigplan.org/track/pepm-2019-papers#Call-for-Poster-Demo-Abstracts

To maintain PEPM’s dynamic and interactive nature, PEPM 2019 will continue to
have special sessions for poster/demo presentations.  In addition to the main
interactive poster/demo session, there will also be a scheduled short-talk
session where each poster/demo can be advertised to the audience in, say, 5–10
minutes.

Poster/demo abstracts should describe work relevant to PEPM (whose scope is
detailed below), typeset as a one-page PDF using the two-column ‘sigplan’
sub-format of the new ‘acmart’ format available at:

  http://sigplan.org/Resources/Author/

and sent by email to the programme co-chairs, Manuel Hermenegildo and Atsushi 
Igarashi, at:

  manuel.hermenegi...@imdea.org, igara...@kuis.kyoto-u.ac.jp

Please also include in the email:

  * a short summary of the abstract (in plain text),
  * the type(s) of proposed presentation (poster and/or demo), and
  * whether you would like to give a scheduled short talk (in addition to the
poster/demo presentation).

Abstracts should be sent no later than:

  Friday, 14th December 2018, anywhere on earth

and will be considered for acceptance on a rolling basis.  Accepted abstracts,
along with their short summary, will be posted on PEPM 2019’s website.

At least one author of each accepted abstract must attend the workshop and
present the work during the poster/demo session.

Student participants with accepted posters/demos can apply for a SIGPLAN PAC
grant to help cover travel expenses and other support.  PAC also offers other
support, such as for child-care expenses during the meeting or for travel costs
for companions of SIGPLAN members with physical disabilities, as well as for
travel from locations outside of North America and Europe.  For details on the
PAC programme, see its web page.


Scope
-

In addition to the traditional PEPM topics (see below), PEPM 2019 welcomes
submissions in new domains, in particular:

  * Semantics based and machine-learning based program synthesis and program
optimisation.

  * Modelling, analysis, and transformation techniques for distributed and
concurrent protocols and programs, such as session types, linear types, and
contract specifications.

More generally, topics of interest for PEPM 2019 include, but are not limited
to:

  * Program and model manipulation techniques such as: supercompilation,
partial evaluation, fusion, on-the-fly program adaptation, active
libraries, program inversion, slicing, symbolic execution, refactoring,
decompilation, and obfuscation.

  * Techniques that treat programs/models as data objects including
metaprogramming, generative programming, embedded domain-specific
languages, program synthesis by sketching and inductive programming, staged
computation, and model-driven program generation and transformation.

  * Program analysis techniques that are used to drive program/model
manipulation such as: abstract interpretation, termination checking,
binding-time analysis, constraint solving, type systems, automated testing
and test case generation.

  * Application of the above techniques including case studies of program
manipulation in