Dynamic inference of static types for Ruby

DOI10.1145/1926385.1926437MaRDI QIDQ5408564zbMATH OpenOpenAlexFDO

Authors

Publication date 10 April 2014

Published in Proceedings of the 38th 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/1926385.1926437

zbMATH Keywords

Rubydynamic languagesstatic typesdynamic type inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 1617324
• scientific article; zbMATH DE number 1629946
• scientific article; zbMATH DE number 1728236
• scientific article; zbMATH DE number 4058828
• Nested refinements: a logic for duck typing

Cited in

(3)

• scientific article; zbMATH DE number 1617324 (Why is no real title available?)
• Rubydust
• scientific article; zbMATH DE number 1728236 (Why is no real title available?)

Describes a project that uses

Uses Software

• Ruby

This page was built for publication: Dynamic inference of static types for Ruby

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