Grammar-based analysis of string expressions


We specify a polymorphic type system for an applied lambda calculus that refines the string type with a subtype hierarchy derived from language containment. It enables us to find a language for each string-type expression such that the value of the expression is a member of that language. Type inference for this system infers language inclusion constraints… (More)
DOI: 10.1145/1040294.1040300


7 Figures and Tables