Typing unmarshalling without marshalling types

  • Authors:

  • Grégoire Henry;Michel Mauny;Emmanuel Chailloux;Pascal Manoury

  • Affiliations:

  • Univ Paris Diderot - Sorbonne Paris Cité, Paris, France;ENSTA-Paristech, Paris, France;Université Pierre et Marie Curie & Sorbonne Universités, Paris, France;Université Pierre et Marie Curie & Sorbonne Universités, Paris, France

  • Venue:
  • Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Unmarshalling primitives in statically typed language require, in order to preserve type safety, to dynamically verify the compatibility between the incoming values and the statically expected type. In the context of programming languages based on parametric polymorphism and uniform data representation, we propose a relation of compatibility between (unmarshalled) memory graphs and types. It is defined as constraints over nodes of the memory graph. Then, we propose an algorithm to check the compatibility between a memory graph and a type. It is described as a constraint solver based on a rewriting system. We have shown that the proposed algorithm is sound and semi-complete in presence of algebraic data types, mutable data, polymorphic sharing, cycles, and functional values, however, in its general form, it may not terminate. We have implemented a prototype tailored for the OCaml compiler [17] that always terminates and still seems sufficiently complete in practice.