Solving systems of subtype constraints (or subtype inequalities) is in the core of eecient type reconstruction in modern object-oriented languages with subtyping and inheritance, two problems known polynomial time equivalent. It is important to know how diierent combinations of type constructors innuence the complexity of the problem. We show the NP-hardness of the satissability problem for sub...

Arabidopsis thaliana is a reference plant that has been studied intensively for several decades. Recent advances in high-throughput experimental technology have enabled the generation of an unprecedented amount of data from A. thaliana, which has facilitated data-driven approaches to unravel the genetic organization of plant phenotypes. We previously published a description of a genome-scale fu...

Prey (N) dependence [g(N)], predator (P) dependence [g(P) or g(N,P)], and ratio dependence [f(P/N)] are often seen as contrasting forms of the predator’s functional response describing predator consumption rates on prey resources in predator–prey and parasitoid–host interactions. Analogously, prey-, predator-, and ratio-dependent functional responses are apparently alternative functional respon...

Type isomorphism for intersection types is quite odd, since it is not a congruence and it does not extend type equality in the standard interpretation of types. The lack of congruence is due to the proof theoretic nature of the intersection introduction rule, which requires the same term to be the subject of both premises. A partial congruence can be recovered by introducing a suitable notion o...

We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, associated with a communication channel, specifies the state transitions of a protocol and also the data types of messages associated with transitions; thus typechecking can verify both correctness of individual messages and ...

In this paper, we present several extensions to the FU formalism that address these limitations. These extensions are based on the formal semantics Functional Unification Grammars (FUGs) are presented in (Elhadad, 1990). They have been impopular for natural language applications because the plemented and tested on several applications. formalism uses very few primitives and is uniform and expre...