Typing unmarshalling without marshalling types

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

doi:10.1145/2364527.2364569

Cited by 3 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm follows the same approach as the work of Henry et al [11] to check that the result of the standard deserialisation function is compatible with a given type. A substantial difference is that our implementation also deals with abstract types.…”

Section: Outline Of the Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Generic Programming in OCaml

Balestrieri

Mauny

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We present a library for generic programming in OCAML, adapting some techniques borrowed from other functional languages. The library makes use of three recent additions to OCAML: generalised abstract datatypes are essential to reflect types, extensible variants allow this reflection to be open for new additions, and extension points provide syntactic sugar and generate boiler plate code that simplify the use of the library. The building blocks of the library can be used to support many approaches to generic programming through the concept of view. Generic traversals are implemented on top of the library and provide powerful combinators to write concise definitions of recursive functions over complex tree types. Our case study is a type-safe deserialisation function that respects type abstraction.This work was partially supported by the Secure-OCaml FUI project. 1 The library is available at https://github.com/balez/generic

show abstract

Section: Outline Of the Algorithmmentioning

confidence: 99%

“…The interested reader is referred to Henry et al [11] for the theoretical background and justifications.…”

Section: Sharing and Cyclesmentioning

confidence: 99%

Generic Programming in OCaml

Balestrieri

Mauny

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The proposed scheme is closely related to data serialization methods in typed functional languages in the sense that both the techniques and KVS externalize internal data structures without losing their structures and type consistency. Examples of such serialization methods include user-level combinator libraries for serialization [4], [7], memory dumps annotated with type information [1], [8], and type inference on memory graphs [6]. These research works focus on serialization of the entire data all at once and effcient checking of the type safety of the data.…”

Section: Introductionmentioning

confidence: 99%

A Type Safe Access to Key-value Stores from Functional Languages

Ueno

Ohori

2016

Journal of Information Processing

View full text Add to dashboard Cite

This paper presents a scheme comprising a type system and a type-directed compilation method that enables users to integrate high-level key-value store (KVS) operations into statically typed polymorphic functional languages such as Standard ML. KVS has become an important building block for cloud applications because of its scalability. The proposed scheme will enhance the productivity and program safety of KVS by eliminating the need for low-level string manipulation. A prototype that demonstrates its feasibility has been implemented in the SML# language and clarifies issues that need to be resolved in further development towards better practical performance.

show abstract