Opendata, web and dolomites

PACT

Proof-theoretical Approaches to Concurrency Theory

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "PACT" data sheet

The following table provides information about the project.

Coordinator
TECHNISCHE UNIVERSITAT BERLIN 

Organization address
address: STRASSE DES 17 JUNI 135
city: BERLIN
postcode: 10623
website: www.tu-berlin.de

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Germany [DE]
 Project website https://www.mtv.tu-berlin.de/menue/research/research_projects/pact_projekt/parameter/de/
 Total cost 159˙460 €
 EC max contribution 159˙460 € (100%)
 Programme 1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
 Code Call H2020-MSCA-IF-2015
 Funding Scheme MSCA-IF-EF-ST
 Starting year 2016
 Duration (year-month-day) from 2016-10-01   to  2018-09-30

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    TECHNISCHE UNIVERSITAT BERLIN DE (BERLIN) coordinator 159˙460.00

Map

 Project objective

This project aims at providing a mathematical understanding of software exploiting modern distributed computer architectures, through the study of type systems for concurrent programs from a logical perspective. Type systems are an essential part of modern programming languages, that have proved to be a reliable support for the development of trustworthy software in the standard setting of sequential (functional) computing. However, the mathematical foundations and associated techniques underlying the type systems of functional programming languages have not yet been transferred to the distributed setting, although this is a crucial step in the development of concurrent programming languages.

A cornerstone of the development of functional type systems was the connection between proof systems, in formal logic, and programming languages. Proof theory is a flexible tool that naturally leads to a precise, mathematical specification of type systems that can be very expressive. The goal of the project is to leverage recent work in computational logic (in particular linear logic and its extensions) to design type systems for process calculi (a mathematical representation of distributed software) that support the features necessary to the development of a programming language. Specifically, the question of the sequentiality of computing steps in this parallel setting is the major point of contention, that needs to be addressed for such a programming language to be reasonably conceived. This proof-theoretical approach to concurrency theory (the mathematical study of distributed software) is the key to the development of type systems that would validate well-behaved distributed programs: the main objectives of the project are the integration of explicit sequentiality to state-of-the-art systems, and the establishment of a precise relation between the typeability of a program (its validity according to the type system) and its implementability.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "PACT" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "PACT" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.2.)

OSeaIce (2019)

Two-way interactions between ocean heat transport and Arctic sea ice

Read More  

ACES (2019)

Antarctic Cyclones: Expression in Sea Ice

Read More  

FarGo (2019)

'Farming God's Way': Cultivation and religious practice in contemporary South Africa

Read More