Preemptive type checking
From MaRDI portal
Publication:1994367
DOI10.1016/j.jlamp.2018.08.003zbMath1400.68056OpenAlexW2810701304WikidataQ129244863 ScholiaQ129244863MaRDI QIDQ1994367
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
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- 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
- The design and implementation of typed scheme
- Type Inference by Coinductive Logic Programming
- Integrating typed and untyped code in a scripting language
- Co-Logic Programming: Extending Logic Programming with Coinduction
This page was built for publication: Preemptive type checking