A run-time representation of scheme record types. Issue 6 (November 2014)

• Record Type: Journal Article
• Authors: KEEP, ANDREW W.; DYBVIG, R. KENT
• Is Part Of: Journal of functional programming. Volume 24:Issue 6(2014)
• Page Start: 675
• Page End: 716
• Publication Date: 2014-11
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796814000203
• Languages: English
• ISSNs: 0956-7968

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>The Revised⁶ Report on the Algorithmic Language Scheme added a mechanism to the Scheme programming language for creating new record types procedurally. While many programming languages support user defined, structured data types, these are usually handled syntactically, so that the compiler can make choices at compile time about the memory layout of these data types. The procedural record types in Scheme, however, can be constructed at run time, making the efficient run-time representation of record types important to ensure good run-time performance. The run-time representation used in our implementation provides an extended model for record types allowing record types to represent foreign scalar data types, e.g., machine word integers, and allows the base record type to be extended to create non-R6RS record-type systems. This article describes our run-time representation for record types, how the garbage collector handles foreign scalar data types, and includes extended record type systems both for an object-oriented programming model and a representation of foreign structured data types.</p> </abstract>