The design and implementation of Typed Scheme

DOI10.1145/1328438.1328486MaRDI QIDQ3189858zbMATH OpenOpenAlexFDO

Authors Sam Tobin-Hochstadt, Matthias Felleisen

Publication date 12 September 2014

Published in Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1328438.1328486

zbMATH Keywords

type systemsscheme

Mathematics Subject Classification ID

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

Recommendations

• Logical types for untyped languages
• Integrating typed and untyped code in a scripting language
• Types for flexible objects
• Programming Languages and Systems
• Typing local control and state using flow analysis

Cited in

(22)

• Preemptive type checking
• Static blame for gradual typing
• Type-directed operational semantics for gradual typing
• Types for flexible objects
• How to evaluate the performance of gradual type systems
• The recursive union of some gradual types
• Debugging hygienic macros
• Practical Optional Types for Clojure
• Gradual type theory
• Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
• Blame and coercion: Together again for the first time
• Reconciling method overloading and dynamically typed scripting languages
• Pragmatic gradual polymorphism with references
• Practical run-time checking via unobtrusive property caching
• Logical types for untyped languages
• General bindings and alpha-equivalence in Nominal Isabelle
• Nominal techniques in Isabelle/HOL
• Space-efficient gradual typing
• Programming Languages and Systems
• Call-by-name gradual type theory
• Implementing metcast in Scheme
• Typing local control and state using flow analysis

This page was built for publication: The design and implementation of Typed Scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189858)