The idea of modular term rewriting systems (TRSs) is extended by allowing modules to share constructors, and it is proved that there is no infinite sequence of modular reduction;thus a modular TRS with shared construc...
详细信息
The idea of modular term rewriting systems (TRSs) is extended by allowing modules to share constructors, and it is proved that there is no infinite sequence of modular reduction;thus a modular TRS with shared constructors is terminating iff every module is terminating.
In type systems based on subtyping, type equality is replaced with subtyping, which is a less restrictive relationship. The idea is, if τ1 is a subtype of τ2, then a value of type τ1 can be transparently supplied w...
详细信息
In type systems based on subtyping, type equality is replaced with subtyping, which is a less restrictive relationship. The idea is, if τ1 is a subtype of τ2, then a value of type τ1 can be transparently supplied whether a value of type τ2 is expected. Subtyping is used as a key concept to create formal type systems for object-oriented languages. These systems often require to be annotated with user-supplied type information. Being able to omit this information, or at least part of it, provides the programmer a greater degree of freedom, hence the desire arises to do type inference in the presence of subtyping.
The author introduces a conception of normalized convergence (NC) occupying an interim position between mean convergence and probability convergence. The NC conception arose in investigating convergence rates of stati...
详细信息
The author introduces a conception of normalized convergence (NC) occupying an interim position between mean convergence and probability convergence. The NC conception arose in investigating convergence rates of statistical methods of stochastic programming. The paper has proven the following main results. NC remains valid for Gelder transformations of random values, as well as in adding, multiplying, dividing and performing Deckart product for sequences of random values converging in a normalized way. Each limiting theorem for the probability theory results in NC of corresponding random values. A convergence criterion of Koshi type is valid for NC.
A high-level “agent oriented” model of intelligent real-time systems is discussed. The model is based on epistemic logic. The initial application domain is intelligent robotics. Preliminary results indicate that the...
详细信息
A high-level “agent oriented” model of intelligent real-time systems is discussed. The model is based on epistemic logic. The initial application domain is intelligent robotics. Preliminary results indicate that the model can be mapped to low-level system models to facilitate the development and use of more intelligent, automatic, process scheduling and resource allocation algorithms.
Unstable equilibrium programming problems are considered for the case when a goal function and a set containing a desired equilibrium point are given not exactly. The residual method is proposed for solving of such pr...
详细信息
Unstable equilibrium programming problems are considered for the case when a goal function and a set containing a desired equilibrium point are given not exactly. The residual method is proposed for solving of such problems. The convergence of the residual method is investigated. The regulating operator is constructed.
The paper deals with the language that generates the class of asynchronous production-type programs (L-programs). Formal verification of L-programs has been carried out. The L-programs of synchronous and asynchronous ...
详细信息
The paper deals with the language that generates the class of asynchronous production-type programs (L-programs). Formal verification of L-programs has been carried out. The L-programs of synchronous and asynchronous sorting of arrays are considered. The partial correctness of these programs has been analyzed. The logical formulas for the 'post' and 'fix' semantic notions were found. It is noted that L-programs can be used for simulating asynchronous parallel systems.
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be `recycled.' Once they have served their purpose as temporary, intermediate structures...
详细信息
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be `recycled.' Once they have served their purpose as temporary, intermediate structures for managing program control, the space they occupy can be reused for the structures that the programs produce as their output. To effect this immediate memory reclamation, we use a sequence of correctness-preserving program transformations, demonstrated through a series of simple examples. We then apply the transformations to general anamorphism operators, with the important consequence that all finite-output anamorphisms can now be run without any stack- or continuation-space overhead.
Reactive models allow to describe a system that changes with time, by describing the state of an object after an event in terms of the situation before the event. To make the reactive approach as expressive as the imp...
详细信息
Reactive models allow to describe a system that changes with time, by describing the state of an object after an event in terms of the situation before the event. To make the reactive approach as expressive as the imperative approach, and thus practically applicable to areas beyond those of real time processing and animations, a degree of temporal non-determinism is introduced into the model.
The main concepts of the theory of operator formal program models are introduced. The main properties of the smooth models are considered. The advantages of the smooth models are justified. The single characteristic p...
详细信息
The main concepts of the theory of operator formal program models are introduced. The main properties of the smooth models are considered. The advantages of the smooth models are justified. The single characteristic property of smooth sets of marking-out functions having some topological nuance has been established. The sufficient conditions for smoothing of the formal models based only on the properties of the marking-out function set have determined. Necessary and sufficient conditions under which a formal model with the specified parameters is smooth have been found.
Like an ordinary AND, a LAND* special form evaluates its arguments - expressions - one after another in order, until the first one that yields #f. Unlike AND, a non-#f result of one expression can be found to a fresh ...
详细信息
Like an ordinary AND, a LAND* special form evaluates its arguments - expressions - one after another in order, until the first one that yields #f. Unlike AND, a non-#f result of one expression can be found to a fresh variable and used in the subsequent expressions. LAND* can be thought of as a combination of LET* and AND, or a generalization of COND's send operator. A LAND* form can also be considered a sequence of guarded expressions.
暂无评论