Precise constraint-based type inference for Java

DOI10.1007/3-540-45337-7_6MaRDI QIDQ2779233zbMATH OpenFDO

Authors Scott F. Smith, Tiejun Wang

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2072/20720099

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1231454
• Efficient inference of static types of Java bytecode
• Dynamic inference of static types for Ruby
• Type Inference by Coinductive Logic Programming
• Type inference against races

Cited in

(16)

• Efficient inference of static types of Java bytecode
• Practical Optional Types for Clojure
• Representing Java classes in a typed intermediate language
• Static single information form for abstract compilation
• Idealized coinductive type systems for imperative object-oriented programs
• Tunable static inference for generic universe types
• An Interval-Based Inference of Variant Parametric Types
• Context inference for static analysis of Java Card object sharing
• Type elaboration and subtype completion for Java bytecode
• Formalisation and implementation of an algorithm for bytecode verification of \@NonNull types
• Dynamic inference of static types for Ruby
• Static Analysis
• Languages and Compilers for Parallel Computing
• Programming Languages and Systems
• Inferring region types via an abstract notion of environment transformation
• Type inference against races

This page was built for publication: Precise constraint-based type inference for Java

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