We show that function types which have only initial algebras for regular functors in the domains, i.e. first order function types, can be represented by terminal coalgebras for certain nested functors. The representation exploits properties of ω-limits and local ω-colimits.

Logic programs can be synthesized as a by-product of the planning of their verification proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate ...

In this paper we study Language, Εmbodied Learning and other semiotic systems as an integral means through which students express emotions, reasoning and scientific meanings when they realize scientific theatrical performances. Four characteristics of Embodied Learning examined, those of gestures, whole body movements, emotional involvement and facial expressions combined with two semiotic syst...

This contribution gives an overview about different approaches to semantic spaces. It is not a exhaustive survey, but rather a personal view on different approaches which use metric spaces for the representation of meanings of linguistic units. The aim is to demonstrate the similarities of apparently different approaches and to inspire the generalisation of semantic spaces tailored to the repre...

Online help systems are typically used as a last resource in interactive breakdown situations. In this paper, we present a method for building online help based on design models according to a semiotic engineering approach. We show the benefits of having designers explicitly communicate their design vision to users, and we also point at the need to foster a new culture for online help. We show ...

In this paper, we present Semionics, a contribution to the field of Computational Semiotics, and propose its use in order to build and simulate models of organizations. Computational Semiotics refers to a research area where semiotic techniques are used in order to synthesize semiotic processes in computers and computer-based applications. Semionics is the main technology developed by our resea...

Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper, we explore folds over a form of recursive higher-order function, called hyperfunctions, and show that hyperfunctions allow fold computations to coroutine ac...

The scalar version of the pathway model of Mathai (2005) is shown to be associated with a large number of probability models used in physics. Different families of densities are listed here, which are all connected through the pathway parameter α, generating a distributional pathway. The idea is to switch from one functional form to another through this parameter and it is shown that one can pr...

ion X → X ′ 〈λx.X〉(t)→ 〈λx.X ′〉(t) +Lambda ¬X → ¬X ′ ¬〈λx.X〉(t)→ ¬〈λx.X ′〉(t) −Lambda Quantification For new variables x1, . . . , xn, ¬φ(x)→ ¬φ1(x) . . . ¬φ(x)→ ¬φn(x) ¬(∀x)φ(x)→ ¬[φ1(x1) ∧ . . . ∧ φn(xn)] −Quant Binding For x not free in X, X → X ′ X → 〈λx.X ′〉(t) +Bind ¬X → ¬X ′ ¬X → ¬〈λx.X ′〉(t) −Bind Definition 5.2 We say Y is a modal Herbrand expansion of X provided there is a formula X∗ ...

The slow roll approximation is studied for cosmological models in Hyperextended Scalar-Tensor Theories of Gravity. A procedure to obtain slow roll solutions in non-minimally coupled gravity is outlined and some examples are provided. An integral condition over the functional form of the non-minimal coupling is imposed in order to obtain intermediate in ationary behavior. e-mail: dtorres@venus. ...