Towards the complexity analysis of programming language proof methods

DOI10.1007/978-3-031-47963-2_8MaRDI QIDQ6605344zbMATH OpenFDO

Authors Matteo Cimini

Publication date 13 September 2024

zbMATH Keywords

complexity analysistype soundnessfunctional languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 512786 (Why is no real title available?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• scientific article; zbMATH DE number 1424053 (Why is no real title available?)
• A formulation of the simple theory of types.
• A new recursion-theoretic characterization of the polytime functions
• A syntactic approach to type soundness
• A theory of type polymorphism in programming
• Abella: a system for reasoning about relational specifications
• Information flow inference for ML
• Intensional interpretations of functionals of finite type I
• LOGSPACE and PTIME characterized by programming languages
• Practical foundations for programming languages
• Types and programing languages

This page was built for publication: Towards the complexity analysis of programming language proof methods

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