Polymorphic digital circuits are circuits composed of polymorphic (multifunctional) as well as ordinary gates. In addition to its standard logic function (such as NAND), a polymorphic gate exhibits another logic function which is activated under a specific condition, for example, when Vdd, temperature, illumination or a special signal reaches a certain level. This paper describes existing polym...

cardiac involvement infrequently occurs in hypopituitarism, and lethal cardiac arrhythmias are rarely reported. we present a middle age female who died as a consequence of refractory ventricular arrhythmia whose medical history and previous laboratory investigation were consistent with hypopituitarism. we conclude that hypopituitarism may lead to electrocardiographic changes and malignant ventr...

This paper introduces the concept of polymorphic electronics (polytronics) –referring to electronics with superimposed built-in functionality. A function change does not require switches/reconfiguration as in traditional approaches. Instead, the change comes from modifications in the characteristics of devices involved in the circuit, in response to controls such as temperature, power supply vo...

In this paper we present construction of polymorphic type theory and its model in terms of category theory. We extend the notion of many-typed signature to polymorphic type signature. We define polymorphic type calculi for first-, secondand higher-order types and set-theoretical semantics of first-order polymorphism. Semantics for higher-order polymorphic type calculi we construct in categorica...

The generalized quantifier theory does not apply to Japanese quantifiers since: i) the number of NP argument is unspecified; and, ii) quantities are often expressed by predicative adjectives. The word order changes the interpretation, e.g., non-split quantifiers correspond to definite NPs with uniqueness and maximality conditions while split NPs are wide scope indefinites. This paper shows that...

Manifest contracts track precise properties by refining types with predicates—e.g., {x :Int | x > 0} denotes the positive integers. Contracts and polymorphism make a natural combination: programmers can give strong contracts to abstract types, precisely stating preand post-conditions while hiding implementation details—for example, an abstract type of stacks might specify that the pop operation...