As we move from developing procedure-oriented to object-oriented programs, the complexity traditionally found in functions and procedures is moving to the connections among components. Different faults occur when components are integrated to form higher level structures that aggregate the behavior and state of the components. Consequently, we need to place more effort on testing the connections...

This paper is concerned with testing properties of polymorphic functions. The problem is that testing can only be performed on specific monomorphic instances, whereas parametrically polymorphic functions are expected to work for any type. We present a schema for constructing a monomorphic instance for a polymorphic property, such that correctness of that single instance implies correctness for ...

Communicating Sequential Processes (CSP) is a language used to describe and reason about concurrent systems. It consists of a process algebra combined with a functional language. This combination poses unique problems when attempting to design a type checker. In this paper the differences between a conventional functional language type checker and a type checker for the CSP language are discuss...

This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of !; type constructors and the 8 quantifier, and we show that such axiomatization is not encodable in the system with !;8 only. In order to give a logical semantics to such a subtyping relation, w...

Polymorphic types in programming languages facilitate code reuse, increase reliability and reduce semantic errors in programs. Hindley-Milner type inference forms a strong basis for checking polymorphic types but is less well suited to explaining them, as it introduces intermediate constructs that relate poorly to a programmer's understanding of the program. We report an experiment into expert ...

We present an extension of superposition that natively handles a polymorphic type system extended with type classes, thus eliminating the need for type encodings when used by an interactive theorem prover like Isabelle/HOL. We describe syntax, typing rules, semantics, the polymorphic superposition calculus and an evaluation on a problem set that is generated from Isabelle/HOL theories. Our eval...

Defunctionalization is generally considered a whole-program transformation and thus incompatible with separate compilation. In this paper, we formalize a modular variant of defunctionalization which can support separate compilation for a functional programming language with parametric polymorphism. Our technique allows modules in a Haskell-like language to be separately defunctionalized and com...

Nitrazepam is metabolized in part by nitro-reduction to an amine followed by acetylation. This acetylation step has been shown to be under the control of the same genetic polymorphism as sulphamethazine (syn: sulphadimidine).

Starting from the hypothesis that the tubulin dimer is a conformationally bistable molecule fluctuating between a curved and a straight configuration at room temperature we develop a model for polymorphic dynamics of the microtubule lattice. We show that tubulin bistability consistently explains unusual dynamic fluctuations, the apparent length-stiffness relation of grafted microtubules and the...

Repeating the work of Meertens [1] we show how to define in a few lines a very general “aggregation” function. It is parameterized by a binary operation ⊕ : t × t → t that performs the elementary aggregation steps on values of type t . The aggregation function, then, aggregates all t constituents of a composite ...t ... value into a single t value; its type is: ...t ... → t . The generality is ...