To perform higher-order matching, we need to decide the βη-equivalence on λ-terms. The first way to do it is to use simply typed λ-calculus and this is the usual framework where higher-order matching is performed. Another approach consists in deciding a restricted equivalence based on finite superdevelopments. We consider higher-order matching modulo this equivalence over untyped λ-terms for wh...

The Nkx2.6 gene belongs to the NK superfamily of homeobox genes (Harvey, 1996). We report here the expression pattern of the murine Nkx2.6 gene during early mouse development, which is unique among the NK family of homeobox genes in that its expression is restricted to the very narrow development period between stages E8.5 and E10.5 of embryogenesis. The distribution of Nkx2.6 transcripts is al...

Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a V-free 2-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a V-free 2-matching.

Primates undoubtedly have impressive abilities in perceiving, recognizing, manipulating, and predicting other individuals, but only great apes seem to recognize the cognitive basis of manipulative and cooperative tactics or the concept of self. None of these abilities is unique to primates. We distinguish (1) a package of quantitative advantages in social sophistication, perhaps based on more e...

Teaching the first instances of arbitrary matching to sample to nonhumans can prove difficult and time consuming. Stimulus control relations may develop that differ from those intended by the experimenter - even when stimulus control shaping procedures are used. This paper reports efforts to identify sources of shaping program failure with a capuchin monkey. Procedures began with a baseline of ...

ontology is the main infrastructure of the semantic web which provides facilities for integration, searching and sharing of information on the web. development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. by emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic...