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
bcac2b02
Commit
bcac2b02
authored
1 year ago
by
Eric Giovannini
Browse files
Options
Downloads
Patches
Plain Diff
begin discussion section
parent
c61a9523
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
paper-new/discussion.tex
+26
-0
26 additions, 0 deletions
paper-new/discussion.tex
paper-new/paper.tex
+2
-0
2 additions, 0 deletions
paper-new/paper.tex
with
28 additions
and
0 deletions
paper-new/discussion.tex
0 → 100644
+
26
−
0
View file @
bcac2b02
\section
{
Discussion
}
\subsection
{
Related Work
}
% Discuss Joey Eremondi's thesis on gradual dependent types
\subsection
{
Mechanization
}
% Discuss Guarded Cubical Agda and mechanization efforts
\subsection
{
Benefits and Drawbacks of the Synthetic Approach
}
\subsection
{
Synthetic Ordering
}
While the use of synthetic guarded domain theory allows us to very
conveniently work with non-well-founded recursive constructions while
abstracting away the precise details of step-indexing, we do work with
the error ordering in a mostly analytic fashion in that gradual types
are interpreted as sets equipped with an ordering relation, and all
terms must be proven to be monotone.
%
It is possible that a combination of synthetic guarded domain theory
with
\emph
{
directed
}
type theory would allow for an a synthetic
treatment of the error ordering as well.
\subsection
{
Future Work
}
% Cite GrEff paper
\ No newline at end of file
This diff is collapsed.
Click to expand it.
paper-new/paper.tex
+
2
−
0
View file @
bcac2b02
...
...
@@ -144,6 +144,8 @@
%\input{denotational-model}
\input
{
concrete-model
}
\input
{
discussion
}
% \section{Discussion}\label{sec:discussion}
% \subsection{Synthetic Ordering}
...
...
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