The first-order theory of subtyping constraints

DOI10.1145/503272.503292MaRDI QIDQ5178907zbMATH OpenOpenAlexFDO

Authors Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen

Publication date 17 March 2015

Published in Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00536828/file/fot02.pdf

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1500567
• The subtyping problem for second-order types is undecidable.
• Non-structural subtype entailment in automata theory
• scientific article; zbMATH DE number 2242596

Cited in

(6)

• Simplifying subtyping constraints: a theory
• Non-structural subtype entailment in automata theory
• Placement Inference for a Client-Server Calculus
• scientific article; zbMATH DE number 1500567 (Why is no real title available?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 2242596 (Why is no real title available?)

This page was built for publication: The first-order theory of subtyping constraints

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