Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Programming Languages

arXiv:1101.4428v1 (cs)
[Submitted on 24 Jan 2011]

Title:Untangling Typechecking of Intersections and Unions

Authors:Jana Dunfield
View PDF
Abstract:Intersection and union types denote conjunctions and disjunctions of properties. Using bidirectional typechecking, intersection types are relatively straightforward, but union types present challenges. For union types, we can case-analyze a subterm of union type when it appears in evaluation position (replacing the subterm with a variable, and checking that term twice under appropriate assumptions). This technique preserves soundness in a call-by-value semantics.
Sadly, there are so many choices of subterms that a direct implementation is not practical. But carefully transforming programs into let-normal form drastically reduces the number of choices. The key results are soundness and completeness: a typing derivation (in the system with too many subterm choices) exists for a program if and only if a derivation exists for the let-normalized program.
Comments: In Proceedings ITRS 2010, arXiv:1101.4104
Subjects: Programming Languages (cs.PL)
Cite as: arXiv:1101.4428 [cs.PL]
  (or arXiv:1101.4428v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.1101.4428
Journal reference: EPTCS 45, 2011, pp. 59-70
Related DOI: https://doi.org/10.4204/EPTCS.45.5

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Mon, 24 Jan 2011 01:39:46 UTC (117 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.PL
< prev   |   next >
new | recent | 2011-01
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Jana Dunfield
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)