π with Leftovers: a Mechanisation in Agda

Zalakain, U. and Dardha, O. (2021) π with Leftovers: a Mechanisation in Agda. In: 41st IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2021, Valletta, Malta, 14-18 Jun 2021, pp. 157-174. ISBN 9783030780883 (doi: 10.1007/978-3-030-78089-0_9)

[img] Text
248913.pdf - Accepted Version

778kB

Abstract

Linear type systems need to keep track of how programs use their resources. The standard approach is to use context splits specifying how resources are (disjointly) split across subterms. In this approach, context splits redundantly echo information which is already present within subterms. An alternative approach is to use leftover typing [2, 23], where in addition to the usual (input) usage context, typing judgments have also an output usage context: the leftovers. In this approach, the leftovers of one typing derivation are fed as input to the next, threading through linear resources while avoiding context splits. We use leftover typing to define a type system for a resource-aware π -calculus [26, 27], a process algebra used to model concurrent systems. Our type system is parametrised over a set of usage algebras [20, 34] that are general enough to encompass shared types (free to reuse and discard), graded types (use exactly n number of times) and linear types (use exactly once). Linear types are important in the π -calculus: they ensure privacy and safety of communication and avoid race conditions, while graded and shared types allow for more flexible programming. We provide a framing theorem for our type system, generalise the weakening and strengthening theorems to include linear types, and prove subject reduction. Our formalisation is fully mechanised in about 1850 lines of Agda [37].

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Dardha, Dr Ornela and Zalakain, Uma
Authors: Zalakain, U., and Dardha, O.
College/School:College of Science and Engineering > School of Computing Science
ISSN:0302-9743
ISBN:9783030780883
Published Online:08 June 2021
Copyright Holders:Copyright © 2021 IFIP International Federation for Information Processing
First Published:First published in 41st IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2021: 157-174
Publisher Policy:Reproduced in accordance with the publisher copyright policy

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
300253BEHAPIOrnela DardhaEuropean Commission (EC)778223Computing Science