This study investigates how bilinguals use sublexical language membership information to speed up their word recognition process in different task situations. Norwegian-English bilinguals performed a Norwegian-English language decision task, a mixed English lexical decision task, or a mixed Norwegian lexical decision task. The mixed lexical decision experiments included words from the nontarget language that required a "no" response. The language specificity of the Bokmål (a Norwegian written norm) and English (non)words was varied by including language-specific letters ("smør", "hawk") or bigrams ("dusj", "veal"). Bilinguals were found to use both types of sublexical markedness to facilitate their decisions, language-specific letters leading to larger effects than language-specific bigrams. A cross-experimental comparison indicates that the use of sublexical language information was strategically dependent on the task at hand and that decisions were based on language membership information derived directly from sublexical (bigram) stimulus characteristics instead of indirectly via their lexical representations. Available models for bilingual word recognition fail to handle the observed marker effects, because all consider language membership as a lexical property only.
A b str a c t. We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear or monotonic. Furthermore, a method that infers poly nomial size dependencies for a non-trivial class of function definitions is suggested.1
Abstract. We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix multiplication and the Cartesian product of two lists.The type system is proved to be sound w.r.t. the operational semantics of the language. The type checking problem is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear or monotonic.Furthermore, we have shown that the type-inference problem is at least semi-decidable (under this restriction). We have implemented a procedure that combines run-time testing and type-checking to automatically obtain size dependencies. It terminates on total typable function definitions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.