Am Di., 24. Sept. 2024 um 18:17 Uhr schrieb Daphne Preston-Kendal <xxxxxx@nonceword.org>:
On 24 Sep 2024, at 05:14, Antero Mejr - mail at antr.me (via srfi-discuss list) <xxxxxx@srfi.schemers.org> wrote:

> It is possible to implement define-record-type in terms of anonymous
> records. Features like record constructors with default values and
> type-checking are also relatively easy to implement and portable.
>
> Would there be any interest in an anonymous records SRFI?

[chair hat on]

While this would be a potential implementation strategy for define-record-type on R7RS small systems, for R7RS Large it is likely we will adopt some cleaned-up variant of the R6RS record system, which includes support for record types with opacity, sealedness, and nongenerativity, and it is not immediately apparent to me that these features are compatible with this view of records. In any case, to be accepted into the fascicle on records would require support from at least 3 notable Scheme implementations by around this time next year.

That said, even if not adopted into R7RS – or even if ‘records’ of this type build a completely different system from that supported by the R7RS record system* – this idea is intriguing.

[chair hat off]

Some questions:
• How is this distinct from a symbol-keyed hash table or mapping (SRFI 146)?

Yes, I would also like to know whether there is any semantic difference to a finite map from symbols to Scheme values.

What would be the advantage compared to using association lists for keyword arguments?