Type inference for a polynomial lambda calculus
M Gaboardi, SR Della Rocca - International Workshop on Types for Proofs …, 2008 - Springer
M Gaboardi, SR Della Rocca
International Workshop on Types for Proofs and Programs, 2008•SpringerWe study the type inference problem for the Soft Type Assignment system (STA) for λ-
calculus introduced in [1], which is correct and complete for polynomial time computations. In
particular we design an algorithm which, given in input a λ-term, provides all the constraints
that need to be satisfied in order to type it. For the propositional fragment of STA, the
satisfiability of the constraints is decidable. We conjecture that, for the whole system, the type
inference is undecidable, but our algorithm can be used for checking the typability of some …
calculus introduced in [1], which is correct and complete for polynomial time computations. In
particular we design an algorithm which, given in input a λ-term, provides all the constraints
that need to be satisfied in order to type it. For the propositional fragment of STA, the
satisfiability of the constraints is decidable. We conjecture that, for the whole system, the type
inference is undecidable, but our algorithm can be used for checking the typability of some …
Abstract
We study the type inference problem for the Soft Type Assignment system (STA) for λ-calculus introduced in [1], which is correct and complete for polynomial time computations. In particular we design an algorithm which, given in input a λ-term, provides all the constraints that need to be satisfied in order to type it. For the propositional fragment of STA, the satisfiability of the constraints is decidable. We conjecture that, for the whole system, the type inference is undecidable, but our algorithm can be used for checking the typability of some particular terms.
Springer
Showing the best result for this search. See all results