We propose an improvement to session-types, introducing nested protocols, the possibility to call a subprotocol from a parent protocol. This feature adds expressiveness and modularity to the existing session-type theory, allowing arguments to be passed and enabling higher-order protocols definition. Our theory is introduced through a new type system for protocols handling subprotocol calls, and...

We discuss the use of logic for natural language (NL) processing, both as an internal query language and as a programming tool. Some extensions of standard predicate calculus are motivated by the first of these roles. A logical system including these extensions is informally described. It incorporates semantic as well as syntactic NL features, and its semantics in a given interpretation (or dat...

This paper introduces global session nets, an integration of multiparty session types (MPST) and Petri nets, for role-based choreographic specifications to verify distributed multiparty systems. The graphical representation of session nets enables more liberal combinations of branch, merge, fork and join patterns than the standard syntactic MPST. We use session net token dynamics to verify a fl...

So-called ill-formed utterances abound in natural discourse. This paper describes how listeners can understand such utterances in a discourse, including speech hesitations and slips-of-the-tongue. Through analysis of durations of utterances and their succeeding pauses, and of intonation patterns, and also through listener understanding experiments using ill-formed utterances, the following resu...

Euler diagrams are used for visualizing set-based information. Closed curves represent sets and the relationship between the curves correspond to relationships between sets. A notation is well-matched to meaning when its syntactic relationships are reflected in the semantic relationships being represented. Euler diagrams are said to be wellmatched to meaning because, for example, curve containm...

In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed...

The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smolensky (1993, 1996, 1998,2000), which initiated the learnability research program for Optimality T...

In classic generative phonology, linguistic competence in the area of sound structure is modeled by a phonological grammar. The theory takes a grammatical form because it posits an inventory of categories (such as features, phonemes, syllables or feet) and a set of principles which specify the well-formed combinations of these categories. In any particular language, a particular set of principl...

We present an effective technique to easily augment GHKM-style syntax-based machine translation systems (Galley et al., 2006) with phrase pairs that do not comply with any syntactic well-formedness constraints. Non-syntactic phrase pairs are distinguished from syntactic ones in order to avoid harming effects. We apply our technique in state-of-the-art string-totree and tree-to-string setups. Fo...

The purpose of the article is to comprehensively consider concept visualization, which one main factors effective learning educational material, as well analyze possibilities using visualization in distance learning. shows relevance education, describes technologies a tool for improving effectiveness learning, defines essence finds out ensure professional training future specialists course acad...