| Autor: |
Jan Springintveld |
| Rok vydání: |
2006 |
| Předmět: |
|
| Zdroj: |
Lecture Notes in Computer Science ISBN: 3540565175 |
| DOI: |
10.1007/bfb0037120 |
| Popis: |
For several important systems of the λ-cube we study the time-complexity of type conversion. Non-elementary lower bounds are given for the type-conversion problem for λ\(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\omega }\)and λP and hence for the systems that include one of these systems. For λ\(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\omega }\)and λP a super-exponential upper bound is given to the length of reduction sequences starting from types that are legal in these systems. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
