/***
##############################
# Identification of the news #
##############################
# DO NOT MODIFY
name: popl19
date: 2018-11-17


################
# General data #
################

# the picture address, in dokuwiki or web syntax
picture = :actualites:ressources:popl19.png

# the name displayed when hovering over the picture (optional)
picture tag = popl19

# the link to be followed when clicking on the picture (optional)
picture link = https://popl19.sigplan.org/

# the link in the circled arrow icon (optional)
extra link = https://popl19.sigplan.org/track/POPL-2019-Research-Papers#event-overview


#######################
# Visibility/priority #
#######################
#
# This part describes when the news should be visible, and with what priority (how high in the list).
#

from 2018-11-17 for 1 month, priority= low
from 2018-11-17 for 2 weeks, priority= normal
from 2018-11-17 for 1 week, priority= high

#
# Other intervals of priority can/have to be specified.
#
# As a rule of thumb:
#  - priority high for up to 3 days, 10 days for very important events (FOCS) (appears top of the list)
#  - priority normal for up to 2 or 3 weeks (appears with high probability)
#  - priority low for as long as one wishes (probably invisible but sometimes can be if there is sufficient space)
#  - priority null makes the news invisible
#  - priorities may change several times (e.g. high for registration and for the event)
#  - this syntax can also be used for changing pictures, links, ...
#
# The syntax is the following
#   from DATE until DATE, priority= PRIORITY
#   from DATE for DURATION, priority= PRIORITY
#   for DURATION until DATE, priority= PRIORITY
#
# PRIORITY: high | normal | low | null
#
# DATE:
#   NUMBER MONTH NUMBER   (e.g. 22 June 2018)
#   ???-??-??             (e.g. 2018-06-22)
#
# DURATION:
#   NUMBER (day|days|week|weeks|month|months|year|years)


##########
# Notion #
##########
# if one wants to have a notion (a small text that unravels when clicked and is used to highlight a concept)
#
notion = Games, gradual typing, proofs, consistency
notion text = {**Games** are mathematical objects used for modeling situations in which several participants/players interact, and each of them aims at fulfilling a personal goal. Real games such as chess or go are cases in which there are two players which are opponents. Games occur in computer science for modeling the logical duality between conjunction and disjunctions, or for defining particular families of complexity classes. Games appear in verification for describing how a system has to react to the environment (the opponent) in order to perform what it has been designed for.\\ **Gradual typing** is a technique that allows the programmer to control which parts of a program check their type correctness (i.e., that apples are added to apples) before execution and which parts check it during their execution instead. It is often used to //gradually// add the before-execution check to dynamic languages, like JavaScript, which perform the check only at run-time, since it is generally better to find errors before the execution of a program rather than during its execution.\\ **Proof theory** is the branch of mathematical logic that studies proofs as mathematical objects. In particular, proof are syntactic constructions built from axioms and inference rules. Relevant to computer science are the studies of computational and complexity aspects of proofs.\\ **Memory consistency models** characterize the effect of concurrent invocations to a library implementing a shared state, e.g., a queue or a key-value map. Strong consistency means that the results of concurrently-executed invocations match the results of some serial execution of those same invocations. Since strong consistency carries a significant penalty on performance, modern implementations provide weaker guarantees known as weak consistency models, e.g., eventual or causal consistency.
}


####################
# TEXT OF THE NEWS #
####################
***/
Four papers coauthored by IRIF members will be presented at [[https://popl19.sigplan.org/|POPL’19]], the main conference on programming languages and programming systems. The papers' topics are game semantics, proof theory, gradual typing, and consistency for concurrent computations.