CakeML / CakeML/pure

Top-level proofs for TypeClassLang

Open
#65 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Standard ML
Stars
44
Forks
5
PR merge metrics
No merged PRs in 30d

Description

The top-level result for TypeClassLang should state:
- given a well-annotated TypeClassLang program
- there should be a valid translation to a PureLang program
- which is itself well-typed (and therefore safe)

Though prior work has considered Core-like/System-F like languages with higher-rank polymorphism, we should hopefully be able to show type preservation for simple types - but this remains to be seen.

Contributor guide

No contributing guide indexed for this repository

Research direction

Review the existing TypeClassLang and PureLang definitions, along with the prior work on Core-like or System-F-like languages mentioned in the issue. Determine the formal statement and proof obligations for translating well-annotated TypeClassLang programs into well-typed PureLang programs; done means the top-level type-preservation and safety result is established.

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.