In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can be defined by lexicographic induction on a and r, thus, giving rise to a structurally recursive normalizer for the simply-typed lambda-calculus. We generalize this scheme to simultaneous substitutions, ...

User-generated contents (UGC) represent an important source of information for governments, companies, political candidates and consumers. However, most of the Natural Language Processing tools and techniques are developed from and for texts of standard language, and UGC is a type of text especially full of creativity and idiosyncrasies, which represents noise for NLP purposes. This paper prese...

The balanced superelliptic handlebody group is the normalizer of transformation covering space in total space. We prove that mapping class generated by four elements. To this, we also proved liftable Hilden three This generating set for minimal except some hyperelliptic cases and above several cases.

It is shown that the the maximal torus normalizer determines the p-compact group PU(p) and its automorphisms. This leads to homotopy uniqueness results for PU(p) and related p-compact groups and to a novel construction of unstable Adams operations.

We show that for n ≥ 3 the symplectic group Sp(n) is as a 2-compact group determined up to isomorphism by the isomorphism type of its maximal torus normalizer. This allows us to determine the integral homotopy type of Sp(n) among connected finite loop spaces with maximal torus.