We deene a category of games G, and its extensional quotient E. A model of the lazy-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the rst purely semantic construction of a fully abstract model fo...

We discuss deadlock in reference to a simple equational dataflow language, and devise a test (the cycle sum test) which is applied to the dependency graph of a program. We use Kahn’s extensional semantics of dataflow and give a purely extensional (non-operational) proof that no program passing the cycle sum test can ever deadlock. The proof is based on the notions of size (length) and completen...

This paper presents ongoing research in the field of extensional mappings between ontologies. Hitherto, the task of generating mapping between ontologies has been focused on the intensional level of ontologies. The term intensional level refers to the set of concepts that are included in an ontology. However, an ontology that has been created for a specific task or application needs to be popul...

Analogue experiments were carried out to get insights into the processes governing positive inversion during the foreland propagating thrust tectonics in the southern Serra do Espinhaço, a Brasiliano/Panafrican foldthrust belt in southeast Brazil. In particular, model listric half-grabens were inverted by applying contractional displacement to the footwall blocks. We investigated two different ...

Suspensions of motile cells are model systems for understanding the unique mechanical properties of living materials which often consist of ensembles of self-propelled particles. We present here a quantitative comparison of theory against experiment for the rheology of such suspensions in extensional flows. The influence of motility on viscosities of cell suspensions is studied using a novel ac...

We developed, and computer-checked by means of the Ref verifier, a formal proof that every weakly extensional, acyclic (finite) digraph can be decorated injectively à la Mostowski by finite sets so that its arcs mimic membership. We managed to have one sink decorated with ∅ by this injection. We likewise proved that a graph whatsoever admits a weakly extensional and acyclic orientation; consequ...

Inside a combinatory algebra, there are 'internal' versions of the nite type structure over !, which form models of various systems of nite type arithmetic. This paper compares internal representations of the intensional and extensional functionals. If these classes coincide, the algebra is called ft-extensional. Some criteria for ft-extensionality are given and a number of well-known ca's are ...

This paper presents ongoing research in the field of extensional mappings between ontologies. Hitherto, the task of generating mappings between ontologies has focused on the intensional level of ontologies. The term intensional level herein, refers to the set of concepts that are included in an ontology. However, an ontology that has been created for a specific task or application needs to be p...

Suspensions of copper nanowires are emerging as new electronic inks for next-generation flexible electronics. Using a novel surface acoustic wave driven extensional flow technique we are able to perform currently lacking analysis of these suspensions and their complex buffer. We observe extensional viscosities from 3 mPa s (1 mPa s shear viscosity) to 37.2 Pa s via changes in the suspension con...

It is not possible to model semantics of natural language unless one can clearly establish the structure of contextual information and how "context" guides the construction of semantic identities of linguistic units. We claim that this cannot be done unless one can overcome the representational locality imposed by extensional formalisms. In this paper we present a formalism aiming at setting up...