Preemptive type checking
DOI10.1016/J.JLAMP.2018.08.003zbMATH Open1400.68056OpenAlexW2810701304WikidataQ129244863 ScholiaQ129244863MaRDI QIDQ1994367FDOQ1994367
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
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cites Work
- Type Inference by Coinductive Logic Programming
- Integrating typed and untyped code in a scripting language
- Co-Logic Programming: Extending Logic Programming with Coinduction
- The design and implementation of Typed Scheme
- Doomed program points
- A note on model checking the modal \(\nu\)-calculus
- Safe \& efficient gradual typing for TypeScript
- Preemptive Type Checking in Dynamically Typed Languages
Cited In (2)
Uses Software
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)