Logical types for untyped languages

DOI10.1145/1863543.1863561MaRDI QIDQ5176933zbMATH OpenOpenAlexFDO

Authors Sam Tobin-Hochstadt, Matthias Felleisen

Publication date 5 March 2015

Published in Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

logictype systemsuntyped languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70)

Recommendations

• The design and implementation of Typed Scheme
• A type system for logic programs
• A gradual polymorphic type system with subtyping for Prolog
• Nested refinements: a logic for duck typing
• A practical subtyping system for Erlang

Cited in

(7)

• Verifying Whiley programs with Boogie
• Sound and complete concolic testing for higher-order functions
• The recursive union of some gradual types
• Practical Optional Types for Clojure
• The design and implementation of Typed Scheme
• scientific article; zbMATH DE number 1341540 (Why is no real title available?)
• Typing local control and state using flow analysis

This page was built for publication: Logical types for untyped languages

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