Space-efficient gradual typing

DOI10.1007/s10990-011-9066-zzbMath1232.68025OpenAlexW2003969655MaRDI QIDQ656856

David Herman, Cormac Flanagan, Aaron Tomb

Publication date: 13 January 2012

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-011-9066-z

zbMATH Keywords

coercionscastsgradual typingtype dynamic

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (10)

Gradual typing using union typing with records ⋮ A Delta for Hybrid Type Checking ⋮ An extended account of contract monitoring strategies as patterns of communication ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Space-efficient gradual typing ⋮ Session Types with Gradual Typing ⋮ How to evaluate the performance of gradual type systems ⋮ Blame and coercion: Together again for the first time ⋮ Gradual type theory ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi

Uses Software

• CLEAN
• Cecil
• Sage

Cites Work

• Unnamed Item
• Unnamed Item
• Space-efficient gradual typing
• Dynamic typing: Syntax and proof theory
• Trampolined style
• Contracts for higher-order functions
• Operational semantics for multi-language programs
• The design and implementation of typed scheme
• Contracts as Pairs of Projections
• Exploring the Design Space of Higher-Order Casts
• Contracts made manifest
• Static contract checking for Haskell
• On the runtime complexity of type-directed unboxing
• Hybrid type checking
• Blame for all
• Sound and complete models of contracts

This page was built for publication: Space-efficient gradual typing