ITRS FULL PAPERS: KEYWORD INDEX
      | A | |
| adequate numeral system | |
| C | |
| call-by-value | |
| cut elimination | |
| D | |
| discrete polymorphism | |
| E | |
| execution time | |
| G | |
| gradual typing | |
| I | |
| intersection types | |
| L | |
| lambda calculus | |
| lambda-calculus | |
| linear logic | |
| N | |
| Natural deduction | |
| non-idempotent intersection types | |
| Normalization | |
| P | |
| product types | |
| R | |
| relational semantics | |
| S | |
| shuffling calculus | |
| simple types | |
| strongly normalizable terms | |
| subject reduction | |
| Subtyping | |
| U | |
| uniform intersection types | |