We introduce a new abstract domain, namely the domain of Interval Linear Equalities (itvLinEqs), which generalizes the affine equality domain with interval coefficients by leveraging results from interval linear algebra. The representation of itvLinEqs is based on a row echelon system of interval linear equalities, which natively allows expressing classical linear relations as well as certain t...

Let X and Y be finite-type CW–complexes (X connected, Y simply connected), such that the rational cohomology ring of Y is a k–rescaling of the rational cohomology ring of X . Assume H∗(X,Q) is a Koszul algebra. Then, the homotopy Lie algebra π∗(ΩY ) ⊗ Q equals, up to k–rescaling, the graded rational Lie algebra associated to the lower central series of π1(X). If Y is a formal space, this equali...

Sandro Zucchi Dipartimento di Scienze della Comunicazione Università di Salerno One difference between the Italian Sign Language sentences in (1)-(3) below and their English translations is that, while the English predicates are inflected for tense, the sign for the verb in Italian Sign Language (LIS) appears in its citational form: (1) GIANNI HOUSE BUY “Gianni is buying a house” (2) TIME-AGO G...

This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...

In this paper, extension of the EQ-logic by the ∆connective is introduced. The former is a new kind of many-valued logic which based on EQ-algebra of truth values, i.e. the algebra in which fuzzy equality is the fundamental operation and implication is derived from it. First, we extend the EQ-algebra by the ∆ operation and then introduce axioms and inference rules of EQ∆-logic. We also prove th...

We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus and first-order ...

We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete and efficient procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus an...

Two distinct mechanisms are often considered necessary to account for generation of the past-tense of English verbs: a lexical associative process for irregular forms like speak “ spoke, and a rule-governed process (‘add -ed ’) for regular and novel forms like talk “ talked and wug “ wugged. An alternative account based on a parallel-distributed processing approach proposes that one complex pro...