@inproceedings{Kobayashi:Pumping:LICS13,
    Author = {Kobayashi, N.},
    BookTitle = {Proc. of LICS'13},
    File = {Pumping by Typing - Kobayashi (0) (0) - a - a - j.pdf},
    ISSN = {1043-6871},
    Keywords = {grammars;inference mechanisms;program verification;pushdown automata;theorem proving;trees (mathematics);type theory;{$\lambda$}-term reduction;HORS;Kartzow and Parys proof;collapsible pushdown automata;higher-order grammar;higher-order program verification;higher-order recursion scheme;infinite trees;intersection type system;model checking;pumping lemma;reasoning;trees hierarchy;typing;Automata;Cognition;Context;Generators;Grammar;Model checking;Standards;pumping lemma},
    Month = {June},
    Pages = {398--407},
    Title = {Pumping by Typing},
    Year = {2013},
    bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2013.46},
    date-added = {2016-01-12 13:05:26 +0000},
    date-modified = {2016-01-12 13:06:12 +0000},
    doi = {10.1109/LICS.2013.46}
}

@inproceedings{Kobayashi:Pumping:LICS13, Author = {Kobayashi, N.}, BookTitle = {Proc. of LICS'13}, File = {Pumping by Typing - Kobayashi (0) (0) - a - a - j.pdf}, ISSN = {1043-6871}, Keywords = {grammars;inference mechanisms;program verification;pushdown automata;theorem proving;trees (mathematics);type theory;{$\lambda$}-term reduction;HORS;Kartzow and Parys proof;collapsible pushdown automata;higher-order grammar;higher-order program verification;higher-order recursion scheme;infinite trees;intersection type system;model checking;pumping lemma;reasoning;trees hierarchy;typing;Automata;Cognition;Context;Generators;Grammar;Model checking;Standards;pumping lemma}, Month = {June}, Pages = {398--407}, Title = {Pumping by Typing}, Year = {2013}, bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2013.46}, date-added = {2016-01-12 13:05:26 +0000}, date-modified = {2016-01-12 13:06:12 +0000}, doi = {10.1109/LICS.2013.46} }