racket / racket/typed-racket

TR should provide a Dictionary type

Open
#31 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

good first issue
Dominant language
Racket
Stars
575
Forks
106
Avg merge
2h 1m
Merged PRs (30d)
2

Description

It would be nice if TR provided a built-in Dictionary type. At its simplest, it would just be (U (HashTable a b) (Listof (Pairof a b)), but vectors are also technically dictionaries.

Does TR's type system allow "specializations" of types? I.e. some way to define a special case for (Dictionary Integer b) that includes vectors?

Technically, dictionaries also include structures that implement gen:dict, but obviously generics don't exist in TR yet.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with the Typed Racket type-system implementation and determine whether it supports specialized type definitions or vector-specific cases. Investigate how HashTable, Listof, Pairof, and vector types could participate in a Dictionary abstraction, then document a concrete design and its scope; the issue names no files or tests.

Written by the indexing model from the issue text.

Assessment

Domain
compilers
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.