A type inference algorithm for a stratified polymorphic type discipline
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Alpha-conversion and typability
Information and Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Light Types for Polynomial Time Computation in Lambda-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A feasible algorithm for typing in elementary affine logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Elementary affine logic and the call-by-value lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A soft type assignment system for &lambda-calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The role of polymorphism in the characterisation of complexity by soft types
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Hi-index | 0.00 |
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.