Preemptive type checking

DOI10.1016/J.JLAMP.2018.08.003MaRDI QIDQ1994367zbMATH OpenOpenAlexWikidataFDO

Authors Neville Grech, Bernd Fischer, Julian Rathke

Publication date 1 November 2018

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/421793/1/Preemptive_type_checking.pdf

zbMATH Keywords

type theoryprogram analysisprogram transformationdynamic typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)

Recommendations

• Preemptive Type Checking in Dynamically Typed Languages
• Typing dynamic typing
• Hybrid type checking
• Type checking for JavaScript
• Publication:3484338

Cites work

• A note on model checking the modal \(\nu\)-calculus
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Doomed program points
• Integrating typed and untyped code in a scripting language
• Preemptive Type Checking in Dynamically Typed Languages
• Safe \& efficient gradual typing for TypeScript
• The design and implementation of Typed Scheme
• Type Inference by Coinductive Logic Programming

Cited in

(3)

• Type checking for JavaScript
• Preemptive Type Checking in Dynamically Typed Languages
• Static type checking without downcast operator

Describes a project that uses

Uses Software

• Erlang
• Python
• Flow
• Hack
• Starkiller
• RPython

This page was built for publication: Preemptive type checking

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