Passer à la navigation principale Passer à la recherche Passer au contenu principal

Unboxing mutually recursive type definitions in ocaml

  • Université Paris

Résultats de recherche: Contribution à une conférence › Papier › Revue par des pairs

3 Citations (Scopus)

Résumé

In modern OCaml, single-argument datatype declarations (variants with a single constructor, records with a single immutable field) can sometimes be “unboxed”. This means that their memory representation is the same as their single argument, omitting an indirection through the variant or record constructor, thus achieving better memory efficiency. However, in the case of generalized/guarded algebraic datatypes (GADTs), unboxing is not always possible due to a subtle assumption about the runtime representation of OCaml values. The current correctness check is incomplete, rejecting many valid definitions, in particular those involving mutually-recursive datatype declarations. In this paper, we explain the notion of separability as a semantic for the unboxing criterion, and propose a set of inference rules to check separability. From these inference rules, we derive a new implementation of the unboxing check that properly supports mutually-recursive definitions.

langue originaleAnglais
Pages173-192
Nombre de pages20
étatPublié - 1 janv. 2019
Evénement30emes Journees Francophones des Langages Applicatifs, JFLA 2019 - 30th French-Speaking Conference on Applicative Languages, JFLA 2019 - Les Rousses, France
Durée: 30 janv. 2019 → 2 févr. 2019

Une conférence

Une conférence30emes Journees Francophones des Langages Applicatifs, JFLA 2019 - 30th French-Speaking Conference on Applicative Languages, JFLA 2019
Pays/TerritoireFrance
La villeLes Rousses
période30/01/19 → 2/02/19

Empreinte digitale

Examiner les sujets de recherche de « Unboxing mutually recursive type definitions in ocaml ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation