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
9da6e89c
Commit
9da6e89c
authored
6 years ago
by
Max New
Browse files
Options
Downloads
Patches
Plain Diff
related work on gradual session types
parent
2575fea3
Branches
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
paper/gtt.tex
+24
-0
24 additions, 0 deletions
paper/gtt.tex
with
24 additions
and
0 deletions
paper/gtt.tex
+
24
−
0
View file @
9da6e89c
...
...
@@ -5582,6 +5582,30 @@ This gives some evidence that the specific choice of connectives of
CBPV occupies a certain ``sweet spot'' between semantic expressivity
and amenability to extensions.
\paragraph
{
Modal Gradual Typing
}
The most similar gradually typed language to our full GTT is the
language of gradual session types given in (TODO: cite Gradual Session
Types).
%
It has several similarities: there are two sorts of types (values and
sessions) and correspondingly two dynamic types: a dynamic value type
and dynamic session type.
%
However, their formulation is quite different in that sessions are
considered to be a
\emph
{
subset
}
of value types whereas in ours there
are explicit coercions between value and computation types.
%
Furthermore their language is not
\emph
{
polarized
}
in the same way as
CBPV, so there is not likely an analogue between our upcasts being
always between value types and downcasts being always between
computation types in their system.
%
Instead, we could reconstruct this in a
\emph
{
polarized
}
session type
language where there are two types of sessions: sending and receiving
and there would be ``universal sender'' and ``universal receiver''
session types.
\paragraph
{
Dynamically Typed Call-by-push-value
}
Our interpretation of the dynamic types in CBPV suggests a design for
...
...
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