The design and implementation of typed scheme

DOI10.1145/1328438.1328486zbMath1295.68055OpenAlexW1973186567MaRDI QIDQ3189858

Matthias Felleisen, Sam Tobin-Hochstadt

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)

Related Items

Unnamed Item, The Recursive Union of Some Gradual Types, Debugging hygienic macros, Practical run-time checking via unobtrusive property caching, Space-efficient gradual typing, Nominal techniques in Isabelle/HOL, Typing Local Control and State Using Flow Analysis, Preemptive type checking, Practical Optional Types for Clojure, General Bindings and Alpha-Equivalence in Nominal Isabelle, 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