In this paper we propose higher-order rewrite systems without bound variables. In order to prove their connuence under the assumption of orthogonality, we study a simple proof method which employs a characterization of the diamond property of a parallel reduction. By an application of the proof method, we obtain a new connuence result for orthogonal higher-order conditional rewrite systems.

Every theory we will consider will be in a language that has a name ṅ for each n ∈ ω. For example, the name for 2 ∈ ω in the language LΩ of arithmetic is the term “1 + 1”. The results stated will only apply to countable languages. This requirement is implicit in the hypothesis of the existence of an enumeration of all formulas with one free variable, for example. We also assume that formulas an...

In this paper, we introduce a new fragment of the rst-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satissability problem for monodic formulas in various linear time structures can be reduced to the satissability problem for a certain fragment of classical rst-order...

various researches have been carried out about benefits of accounting information and their influence on decision making of financial statements users. for example, many researches have examined the relationship between accounting variables and stock returns or stock price. this study determines and compares the relative and incremental content of accounting variables, too. for this purpose, th...

Traditionally, spoken dialog systems have interpreted a user's speech one complete utterance at a time, and operated on one level of processing at a time as well. It is clear, however, that people understand language incrementally: they can backchannel, interrupt, and begin taking actions while the speaker's utterance unfolds. It has also become clear that human language understanding involves ...

The Pi-calculus [2,10] is one of the most well-known and widely-studied process calculi – roughly, it extends the binary synchronisations along a channel/name, familiar from ccs, with the ability to pass names as arguments. Thus, the input prefix becomes a binder and the synchronisation itself results in a substitution of the communicated name for the bound variable. The Pi-calculus inherits an...

ion and function application employ the notion of substitution. Recall the inference rule and its representation in LF: e1 ↪→ lam x. e1 e2 ↪→ v2 [v2/x]e1 ↪→ v ev app e1 e2 ↪→ v ev app : ΠE1:exp. ΠE2:exp. ΠE′ 1:exp→ exp. ΠV2:exp. ΠV :exp. eval E1 (lam E′ 1) → eval E2 V2 → eval (E′ 1 V2) V → eval (app E1 E2) V. As before, we transcribe this (and the trivial rule for evaluating λ-expressions) into...

Due to urbanization and population increase, need for metro tunnels, has been considerably increased in urban areas. Estimating the surface settlement caused by tunnel excavation is an important task especially where the tunnels are excavated in urban areas or beneath important structures. Many models have been established for this purpose by extracting the relationship between the settlement a...

Curry is a multi-paradigm declarative language aiming to amalgamate functional, logic, and concurrent programming paradigms. Curry combines in a seamless way features from functional programming and (concurrent) logic programming. Curry’s operational semantics is based on the combination of lazy reduction of expressions together with a possibly non-deterministic binding of free variables occurr...