Skip to Main content Skip to Navigation
Conference papers

Typing Unmarshalling without Marshalling Types

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.
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Thursday, March 3, 2016 - 2:52:02 PM
Last modification on : Thursday, March 21, 2019 - 2:39:18 PM

Links full text



Grégoire Henry, Michel Mauny, Emmanuel Chailloux, Pascal Manoury. Typing Unmarshalling without Marshalling Types. International Conference on Functional Programming, Sep 2012, Copenhagen, Denmark. pp.287-298, ⟨10.1145/2364527.2364569⟩. ⟨hal-01282253⟩



Record views