Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
Text classification remains one of the major fields of research in natural language processing. This paper evaluates the use of the computational tool Coh-Metrix as a means to dis...
Scott A. Crossley, Philip M. McCarthy, Danielle S....
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...
This paper provides a design rationale for a mechanism that enforces a correct mapping between a model of a nested agent organization and a model of a composite interaction-based ...
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...