This paper explains how the high-level treatment of datatypes in functional languages—using features like constructor functions and pattern matching—can be made to coexist with bitdata.Weuse this term to describe the bit-level representations of data that are required in the construction of many different applications, including operating systems, device drivers, and assemblers. We explain our approach as a combination of two language extensions, each of which could potentially be adapted to any modern functional language. The first adds simple and elegant constructs for manipulating raw bitfield values, while the second provides a view-like mechanism for defining distinct new bitdata types with fine-control over the underlying representati...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
To accommodate polymorphic data types and operations, several computer scientists-most notably MacQu...
A generic function is defined by induction on the structure of types. The structure of a data type ...
International audienceInitially present only in functional languages such as OCaml and Haskell, Alge...
Initially present only in functional languages such as OCaml and Haskell, Algebraic Data Types (ADTs...
Bitwise operations are commonly used in low-level systems code to access multiple data fields that h...
International audienceIn a computer program, basic functionalities may be implemented using bit-wise...
In a computer program, basic functionalities may be implemented using bit-wise operations. To formal...
Systems programs rely on fine-grain control of data representa-tion and use of state to achieve perf...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
Datatype-generic programming involves parametrization by the shape of data, in the form of type cons...
Datatype-generic programming involves parametrization by the shape of data, in the form of type cons...
A model is proposed for specification and implementation of data types. This model is based on a nov...
We present a framework for analyzing the complexity and expressive power of many existing languages ...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
To accommodate polymorphic data types and operations, several computer scientists-most notably MacQu...
A generic function is defined by induction on the structure of types. The structure of a data type ...
International audienceInitially present only in functional languages such as OCaml and Haskell, Alge...
Initially present only in functional languages such as OCaml and Haskell, Algebraic Data Types (ADTs...
Bitwise operations are commonly used in low-level systems code to access multiple data fields that h...
International audienceIn a computer program, basic functionalities may be implemented using bit-wise...
In a computer program, basic functionalities may be implemented using bit-wise operations. To formal...
Systems programs rely on fine-grain control of data representa-tion and use of state to achieve perf...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
Datatype-generic programming involves parametrization by the shape of data, in the form of type cons...
Datatype-generic programming involves parametrization by the shape of data, in the form of type cons...
A model is proposed for specification and implementation of data types. This model is based on a nov...
We present a framework for analyzing the complexity and expressive power of many existing languages ...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
To accommodate polymorphic data types and operations, several computer scientists-most notably MacQu...
A generic function is defined by induction on the structure of types. The structure of a data type ...