Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
sgdt
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
gradual-typing
sgdt
Commits
0d677ab6
Commit
0d677ab6
authored
6 years ago
by
Max New
Browse files
Options
Downloads
Patches
Plain Diff
add a summary of the revisions
parent
29c2dad5
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
popl19/revisions.md
+27
-0
27 additions, 0 deletions
popl19/revisions.md
with
27 additions
and
0 deletions
popl19/revisions.md
0 → 100644
+
27
−
0
View file @
0d677ab6
We summarize the major changes to the paper. There are also some minor
typo fixes/re-wordings in various sections.
1.
To clarify the applicability of the main results, we added a few
paragraphs to the discussion section at the end to discuss what
languages should be models of GTT, how things like reference
equality fit in and the difference between call-by-name and
Haskell's notion of laziness. We also put some forward references
to this discussion in the introduction.
2.
We expanded the related work a great deal, adding comparisons to
Henglein and Degen and Thiemann's work. We also clarified that AGT
is based on the
*type safety proof*
of the static language, and not
just its dynamic semantics.
3.
We added an explicit list of contributions to the end of the
introduction.
4.
The list of contributions has forward references giving an overview
of the paper structure, and we also added an overview to the
beginning of section 2.
5.
To avoid "story of discovery" with the dynamic type models, we
mention type tags and how this is the usual way of constructing a
dynamic type for the value type and the novel aspect is the fact
that the dual is useful for interpreting the dynamic computation
type.
6.
We named the rules, specifically in figures 1-5.
7.
We re-ordered some paragraphs in the introduction to introduce eta
equality before the discussion of eager and transient cast
semantics.
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment