Complexity of type inference

DOI10.3233/FI-2010-329zbMATH Open1231.03013OpenAlexW1580190102MaRDI QIDQ3000286FDOQ3000286

Jerzy Tyszkiewicz

Publication date: 18 May 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-329

Recommendations

• The complexity of type inference for higher-order typed lambda calculi
• scientific article; zbMATH DE number 445160
• Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
• Type Inference for a Polynomial Lambda Calculus
• scientific article; zbMATH DE number 445157

zbMATH Keywords

complexitytypabilitytyped lambda calculusPTIMEsimple types

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cited In (5)

• Type-Based Complexity Analysis for Fork Processes
• Computational Complexity Via Finite Types
• A type-based complexity analysis of object oriented programs
• On the runtime complexity of type-directed unboxing
• Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus

This page was built for publication: Complexity of type inference

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