The Recursive Union of Some Gradual Types

DOI10.1007/978-3-319-30936-1_21zbMath1343.68049OpenAlexW2503601755MaRDI QIDQ3188297

Jeremy G. Siek, Sam Tobin-Hochstadt

Publication date: 17 August 2016

Published in: A List of Successes That Can Change the World (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30936-1_21

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Gradual typing using union typing with records ⋮ Migrating gradual types ⋮ Gradual type theory

Uses Software

• Racket
• gradualizerDynamicSemantics

Cites Work

• Unnamed Item
• Unnamed Item
• Revised report on the algorithmic language scheme
• The gradualizer: a methodology and algorithm for generating gradual type systems
• The design and implementation of typed scheme
• Semantic subtyping
• Well-Typed Programs Can’t Be Blamed
• Logical types for untyped languages
• Computer Science Logic
• Polymorphic functions with set-theoretic types

This page was built for publication: The Recursive Union of Some Gradual Types