Thesis
Type projections over self-describing data
- Creator
- Rights statement
- Awarding institution
- University of Strathclyde
- Date of award
- 2011
- Thesis identifier
- T12816
- Qualification Level
- Qualification Name
- Department, School or Faculty
- Abstract
- We present a model for binding statically typed programs and self-describing data based on dynamic projections of type assertions, or type projections. The model exploits the potential for loose coupling which inheres in self-description in order to endorse a principle of typeful programming over shared data: the type of the data should vary in accordance with the processing requirements of individual programs. Loose coupling is key between programs that execute in cooperating but autonomous runtimes. Accordingly, type projections may be employed at the boundary of typed languages to regulate the exchange of untyped data across the nodes of distributed systems. External type projections give rise to a class of data binding tools for mainstream languages and standard self-describing formats, such as XML. Loose coupling is also desirable between programs that execute within a single runtime, where conventional typechecking regimes may unduly constrain the interpretations of shared data. Type projections may then be employed within typed languages to regulate the exchange of typed data across local application components. Internal type projections give rise to a class of metamorphic languages, where an unconventional ‘data-first’ approach to dynamic typechecking extends support for typeful programming beyond the scope of polymorphism and coercions.
- Resource Type
- DOI
- EThOS ID
- uk.bl.ethos.538864
- Date Created
- 2011
- Former identifier
- 824055
Relations
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
PDF of thesis T12816 | 2021-07-02 | Public | Download |