A computational complexity analysis of tunable type inference for Generic Universe Types

DOI10.1016/J.TCS.2020.01.035MaRDI QIDQ2304565zbMATH OpenOpenAlexFDO

Authors Nahid Juma, Werner Dietl, Mahesh Tripunitara

Publication date 12 March 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.01.035

zbMATH Keywords

computational complexityJavaNP-hardnessobject ownershipprogramming languagestype inferencetype systems

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

Recommendations

• Tunable static inference for generic universe types
• Satisfying subtype inequalities in polynomial space
• Static Analysis
• A type-based complexity analysis of object oriented programs
• scientific article; zbMATH DE number 1638659

Cites work

• Generating hard satisfiability problems
• scientific article; zbMATH DE number 1617324 (Why is no real title available?)
• scientific article; zbMATH DE number 1089242 (Why is no real title available?)
• scientific article; zbMATH DE number 1775419 (Why is no real title available?)
• Introduction to algorithms.
• Principles and Practice of Constraint Programming – CP 2004
• Reducibility among combinatorial problems
• Static Analysis
• Tunable static inference for generic universe types
• Type inference for record concatenation and subtyping

Cited in

(3)

• Tunable static inference for generic universe types
• scientific article; zbMATH DE number 2111733 (Why is no real title available?)
• On the runtime complexity of type-directed unboxing

Describes a project that uses

Uses Software

• Treengeling
• Plingeling
• Lingeling

This page was built for publication: A computational complexity analysis of tunable type inference for Generic Universe Types

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