A Multi-Modal Dependent Type Theory for Representing Data Accessibility in a Network

6 pages•Published: March 24, 2013

Abstract

In the present paper we explore the use of a newly formulated polymorphic modal type theory for a computational interpretation of programs in the context of distributed processing. The initial language define judgemental modalities with a the standard constructor for necessity interpreted as the presentation of instructions for a program terminating at runtime and an independent constructor for the possibility judgement as a representation of a process of partial evaluation. In order to interpret distributed and localised computing, we propose an extension in terms of multi-modalities, to express programs equipped with locations and data accessibility. Besides localised accessibility formalised by the different signed modalities, we develop further the language by prioritising these modalities, which implement seriality or staging annotations in the program structure.

Keyphrases: data accessibility, distributed and staged computing, modal type theory

In: Alex Simpson (editor). PSPL 2010. International Workshop on Proof Systems for Program Logics, vol 12, pages 17-22.

Links:	https://easychair.org/publications/paper/gRv
	https://doi.org/10.29007/vm4p

BibTeX entry

@inproceedings{PSPL2010:Multi_Modal_Dependent_Type,
  author    = {Giuseppe Primiero},
  title     = {A Multi-Modal Dependent Type Theory for Representing Data Accessibility in a Network},
  booktitle = {PSPL 2010. International Workshop on Proof Systems for Program Logics},
  editor    = {Alex Simpson},
  series    = {EPiC Series in Computing},
  volume    = {12},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/gRv},
  doi       = {10.29007/vm4p},
  pages     = {17-22},
  year      = {2013}}

Download PDF Open PDF in browser