PARSIFAL - 2019 - Annual activity report

PARSIFAL

PARSIFAL - 2019

Project-Team Parsifal

Team, Visitors, External Collaborators

Overall Objectives

Main themes

Research Program

General overview
Inductive and co-inductive reasoning
Developing a foundational approach to defining proof evidence
Deep inference
Proof nets, atomic flows, and combinatorial proofs
Cost Models and Abstract Machines for Functional Programs

Application Domains

Automated Theorem Proving
Proof-assistants
Programming language design

Highlights of the Year

New Software and Platforms

Abella
Bedwyr
Checkers
Psyche
Maetning
OCaml

New Results

Functional programming with $λ$ -tree syntax
Mechanized metatheory revisited
New applications of Foundational Proof Certificates
Historical reflections on proof theory and logic programming
Intuitionistic proofs without syntax
Towards a combinatorial proof theory
Combinatorial Proofs for Logics of Relevance and Entailment
On combinatorial proofs for modal logic
Deep inference and expansion trees for second-order multiplicative linear logic
A fully labelled proof system for intuitionistic modal logics
Types by Need
Sharing Equality is Linear
Crumbling Abstract Machines
Factorization and Normalization, Essentially
A Fresh Look at the $ł$ -Calculus
Abstract Machines for Open Call-by-Value

Bilateral Contracts and Grants with Industry

Bilateral Grants with Industry

Partnerships and Cooperations

Regional Initiatives
National Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Major publications
Publications of the year
References in notes

Previous |

Home | Next next

Section: Application Domains

Programming language design

Our work also gives insight on the structure and properties of programming languages. We can improve the design or implementation of programming languages, help programmers or language implementors reason about the correctness of the programs in a given language, or reason about the cost of execution of a program.

Previous |

Home | Next next