O trabalho constitui-se numa investigação teórica da estrutura ordenada e intuitiva dos espaços coerentes, introduzidos por Girard [GIR 86], na definição do modelo de máquina geométrica para construção e interpretação de estados e processos computacionais rotulados por posições de um espaço geométrico. Esta interpretação poderá ser aplicada às construções determinísticas, incluindo dois tipos especiais de paralelismo - o espacial, com memória e processos infinitos definidos por estruturas matriciais, que operam sobre dimensões independentes, de forma sincronizada; e o temporal, na versão genérica do modelo, com memória global transfinita e processos distribuídos num conjunto enumerável de máquinas geométricas, sincronizadas no tempo. O modelo contempla interpretação para computações não-determinísticas e prevê a aplicação de operadores exponenciais na interpretação do espaço funcional. A noção mais intuitiva deste trabalho está na definição da relação de coerência, que define o grafo sobre o qual se constrói este domínio semántico. Sobre o conjunto de pontos compatíveis de tais grafos, a coerência estrita interpreta a condição implícita para modelar o paralelismo - a concorrência entre posições de memória. Na construção dual, justificada pela presença da negação involutiva no grafo complementar, a incoerência interpreta a condição para o não-determinismo - o conflito de acesso à memória. Para os demais construtores, o produto sequencial e a soma determinística, consideram-se os endofunctores produto e soma direta da categoria CospLin dos espaços coerentes e funções lineares. A estrutura ordenada deste modelo é formalizada pelo espaço coerente D∞ de todos os processos, construído em níveis a partir do espaço coerente D∞ dos processos elementares, seguindo a metodologia proposta por Scott [SCO 76]. Neste sentido, cada nível da construção está identificado por um subespaço Dn que reconstrói todos os objetos do nível anterior, preservando suas propriedades e relações, além de construir os novos objetos. Compatível com a abordagem algébrica, o relacionamento entre os níveis é expresso por funções lineares denominadas imersões e projeções, interpretanto os construtores de processos e seus destrutores, respectivamente. Pelo procedimento de completação, assegura-se a existência do menor ponto fixo para equações recursivas definidas pela composição infinita destes morfismos. Além disso, as interpretações para processos infinitos, construídos por prefixação, apresentadas em D→∞ comprovam que este modelo é compatível com a diversidade dos construtores. O espa¸co coerente D∞2 dos processos transfinitos generaliza a construção e define a estrutura ordenada do modelo de máquina geométrica distribuída. Seus objetos são subconjuntos coerentes de tokens rotulados por posições do espaço geométrico e indexados por subconjuntos isomorfos aos ordinais transfinitos. O espaço coerente S S dos traços lineares de funções definidas sobre o espaço coerente S dos estados computacionais constitui-se no modelo semântico para análise do comportamento associado a cada processo interpretado em D∞. A definição da função de representação introduz um domínio de expressões que formaliza uma linguagem capaz de expressar, de forma mais operacional, as interpretações obtidas neste modelo de m´aquina. Cada uma das expressões válidas na linguagem é compatível com uma expressão gráfica. / This work presents a theoretical investigation of the constructive, intuitive and ordered structure of the coherence spaces, introduced by Girard, in order to define the geometric machine model for interpretation of computational states and processes labelled by positions of a geometric space. This interpretation can be applied to deterministic process constructions, including two special types of parallelism - the temporal parallelism, with infinite memory and infinite processes defined over array structures, that operate over independent dimensions in a synchronized way; and the spatial parallelism, in a generic version of the model, with a transfinite global memory shared by transfinite processes distributed in a enumerable set of geometric machines, synchronized in the time. The work also provides interpretation to the non-deterministic computations and applies the exponential operators in the interpretation of the functional space. The most basic notion of this work is the definition of the coherence relation as the admissibility of parallelism between basic operations (elementary processes). That relation defines the web over which the coherence space of the whole set of deterministic and non-deterministic processes is step-wise and systematically build. Over the set of the compatible points of such graph, the strict coherence interprets the implicity condition to model parallelism - the true concurrence. In the dual construction, justified by the presence of involutive negation in the complementary graph, the incoherence interprets the condition that models non-determinism - the conflict of memory accesses. The other constructors, the sequential product and the deterministic sum, are defined by the endofunctors in the CospLin category of the coherence spaces and linear functions. The ordered structure of this model is formalized by the coherence space D∞ of all processes, constructed by levels from the coherence space D0 of the elementary processes, following the Scott’s methodology [SCO 76]. In this sense, each level is identified by a subspace Dn, which reconstructs all the objects from the level before, preserving their properties and relations, and drives the construction of the new objects. Compatible with the algebraic-theoretic approach to computational processes, the relationship between the levels is expressed by linear functions called embedding and projection-functions, which interpret constructors and destructors of processes, respectively. The completion procedure guarantees the existence of the least fixed point to the recursive equations, defined by infinite composition of these morphisms. In addition, the interpretation for infinite processes constructed by prefix is presented in D→∞ , confirms that the ordered structure of these model is compatible with the diversity of constructors. The coherence space D∞2 of transfinite processes generalizes the construction and defines the ordered structure of the distributed geometric machine model. Its objects are coherent subsets of tokens labelled by the positions of a geometric space and indexed by isomorphic subsets related to the transfinite ordinal numbers. In order to analyze the behavior related to the interpretations in D∞, the coherence space S S of the linear traces of functions, defined over the coherence space S of the computational states, is introduced. The definition of the representation-function induces the construction of the domain Ω of valid expressions and formalizes a (graphic) language which is able to express, in an more operational way, the interpretations obtained in the geometric machine model.

O trabalho constitui-se numa investigação teórica da estrutura ordenada e intuitiva dos espaços coerentes, introduzidos por Girard [GIR 86], na definição do modelo de máquina geométrica para construção e interpretação de estados e processos computacionais rotulados por posições de um espaço geométrico. Esta interpretação poderá ser aplicada às construções determinísticas, incluindo dois tipos especiais de paralelismo - o espacial, com memória e processos infinitos definidos por estruturas matriciais, que operam sobre dimensões independentes, de forma sincronizada; e o temporal, na versão genérica do modelo, com memória global transfinita e processos distribuídos num conjunto enumerável de máquinas geométricas, sincronizadas no tempo. O modelo contempla interpretação para computações não-determinísticas e prevê a aplicação de operadores exponenciais na interpretação do espaço funcional. A noção mais intuitiva deste trabalho está na definição da relação de coerência, que define o grafo sobre o qual se constrói este domínio semántico. Sobre o conjunto de pontos compatíveis de tais grafos, a coerência estrita interpreta a condição implícita para modelar o paralelismo - a concorrência entre posições de memória. Na construção dual, justificada pela presença da negação involutiva no grafo complementar, a incoerência interpreta a condição para o não-determinismo - o conflito de acesso à memória. Para os demais construtores, o produto sequencial e a soma determinística, consideram-se os endofunctores produto e soma direta da categoria CospLin dos espaços coerentes e funções lineares. A estrutura ordenada deste modelo é formalizada pelo espaço coerente D∞ de todos os processos, construído em níveis a partir do espaço coerente D∞ dos processos elementares, seguindo a metodologia proposta por Scott [SCO 76]. Neste sentido, cada nível da construção está identificado por um subespaço Dn que reconstrói todos os objetos do nível anterior, preservando suas propriedades e relações, além de construir os novos objetos. Compatível com a abordagem algébrica, o relacionamento entre os níveis é expresso por funções lineares denominadas imersões e projeções, interpretanto os construtores de processos e seus destrutores, respectivamente. Pelo procedimento de completação, assegura-se a existência do menor ponto fixo para equações recursivas definidas pela composição infinita destes morfismos. Além disso, as interpretações para processos infinitos, construídos por prefixação, apresentadas em D→∞ comprovam que este modelo é compatível com a diversidade dos construtores. O espa¸co coerente D∞2 dos processos transfinitos generaliza a construção e define a estrutura ordenada do modelo de máquina geométrica distribuída. Seus objetos são subconjuntos coerentes de tokens rotulados por posições do espaço geométrico e indexados por subconjuntos isomorfos aos ordinais transfinitos. O espaço coerente S S dos traços lineares de funções definidas sobre o espaço coerente S dos estados computacionais constitui-se no modelo semântico para análise do comportamento associado a cada processo interpretado em D∞. A definição da função de representação introduz um domínio de expressões que formaliza uma linguagem capaz de expressar, de forma mais operacional, as interpretações obtidas neste modelo de m´aquina. Cada uma das expressões válidas na linguagem é compatível com uma expressão gráfica. / This work presents a theoretical investigation of the constructive, intuitive and ordered structure of the coherence spaces, introduced by Girard, in order to define the geometric machine model for interpretation of computational states and processes labelled by positions of a geometric space. This interpretation can be applied to deterministic process constructions, including two special types of parallelism - the temporal parallelism, with infinite memory and infinite processes defined over array structures, that operate over independent dimensions in a synchronized way; and the spatial parallelism, in a generic version of the model, with a transfinite global memory shared by transfinite processes distributed in a enumerable set of geometric machines, synchronized in the time. The work also provides interpretation to the non-deterministic computations and applies the exponential operators in the interpretation of the functional space. The most basic notion of this work is the definition of the coherence relation as the admissibility of parallelism between basic operations (elementary processes). That relation defines the web over which the coherence space of the whole set of deterministic and non-deterministic processes is step-wise and systematically build. Over the set of the compatible points of such graph, the strict coherence interprets the implicity condition to model parallelism - the true concurrence. In the dual construction, justified by the presence of involutive negation in the complementary graph, the incoherence interprets the condition that models non-determinism - the conflict of memory accesses. The other constructors, the sequential product and the deterministic sum, are defined by the endofunctors in the CospLin category of the coherence spaces and linear functions. The ordered structure of this model is formalized by the coherence space D∞ of all processes, constructed by levels from the coherence space D0 of the elementary processes, following the Scott’s methodology [SCO 76]. In this sense, each level is identified by a subspace Dn, which reconstructs all the objects from the level before, preserving their properties and relations, and drives the construction of the new objects. Compatible with the algebraic-theoretic approach to computational processes, the relationship between the levels is expressed by linear functions called embedding and projection-functions, which interpret constructors and destructors of processes, respectively. The completion procedure guarantees the existence of the least fixed point to the recursive equations, defined by infinite composition of these morphisms. In addition, the interpretation for infinite processes constructed by prefix is presented in D→∞ , confirms that the ordered structure of these model is compatible with the diversity of constructors. The coherence space D∞2 of transfinite processes generalizes the construction and defines the ordered structure of the distributed geometric machine model. Its objects are coherent subsets of tokens labelled by the positions of a geometric space and indexed by isomorphic subsets related to the transfinite ordinal numbers. In order to analyze the behavior related to the interpretations in D∞, the coherence space S S of the linear traces of functions, defined over the coherence space S of the computational states, is introduced. The definition of the representation-function induces the construction of the domain Ω of valid expressions and formalizes a (graphic) language which is able to express, in an more operational way, the interpretations obtained in the geometric machine model.

O trabalho constitui-se numa investigação teórica da estrutura ordenada e intuitiva dos espaços coerentes, introduzidos por Girard [GIR 86], na definição do modelo de máquina geométrica para construção e interpretação de estados e processos computacionais rotulados por posições de um espaço geométrico. Esta interpretação poderá ser aplicada às construções determinísticas, incluindo dois tipos especiais de paralelismo - o espacial, com memória e processos infinitos definidos por estruturas matriciais, que operam sobre dimensões independentes, de forma sincronizada; e o temporal, na versão genérica do modelo, com memória global transfinita e processos distribuídos num conjunto enumerável de máquinas geométricas, sincronizadas no tempo. O modelo contempla interpretação para computações não-determinísticas e prevê a aplicação de operadores exponenciais na interpretação do espaço funcional. A noção mais intuitiva deste trabalho está na definição da relação de coerência, que define o grafo sobre o qual se constrói este domínio semántico. Sobre o conjunto de pontos compatíveis de tais grafos, a coerência estrita interpreta a condição implícita para modelar o paralelismo - a concorrência entre posições de memória. Na construção dual, justificada pela presença da negação involutiva no grafo complementar, a incoerência interpreta a condição para o não-determinismo - o conflito de acesso à memória. Para os demais construtores, o produto sequencial e a soma determinística, consideram-se os endofunctores produto e soma direta da categoria CospLin dos espaços coerentes e funções lineares. A estrutura ordenada deste modelo é formalizada pelo espaço coerente D∞ de todos os processos, construído em níveis a partir do espaço coerente D∞ dos processos elementares, seguindo a metodologia proposta por Scott [SCO 76]. Neste sentido, cada nível da construção está identificado por um subespaço Dn que reconstrói todos os objetos do nível anterior, preservando suas propriedades e relações, além de construir os novos objetos. Compatível com a abordagem algébrica, o relacionamento entre os níveis é expresso por funções lineares denominadas imersões e projeções, interpretanto os construtores de processos e seus destrutores, respectivamente. Pelo procedimento de completação, assegura-se a existência do menor ponto fixo para equações recursivas definidas pela composição infinita destes morfismos. Além disso, as interpretações para processos infinitos, construídos por prefixação, apresentadas em D→∞ comprovam que este modelo é compatível com a diversidade dos construtores. O espa¸co coerente D∞2 dos processos transfinitos generaliza a construção e define a estrutura ordenada do modelo de máquina geométrica distribuída. Seus objetos são subconjuntos coerentes de tokens rotulados por posições do espaço geométrico e indexados por subconjuntos isomorfos aos ordinais transfinitos. O espaço coerente S S dos traços lineares de funções definidas sobre o espaço coerente S dos estados computacionais constitui-se no modelo semântico para análise do comportamento associado a cada processo interpretado em D∞. A definição da função de representação introduz um domínio de expressões que formaliza uma linguagem capaz de expressar, de forma mais operacional, as interpretações obtidas neste modelo de m´aquina. Cada uma das expressões válidas na linguagem é compatível com uma expressão gráfica. / This work presents a theoretical investigation of the constructive, intuitive and ordered structure of the coherence spaces, introduced by Girard, in order to define the geometric machine model for interpretation of computational states and processes labelled by positions of a geometric space. This interpretation can be applied to deterministic process constructions, including two special types of parallelism - the temporal parallelism, with infinite memory and infinite processes defined over array structures, that operate over independent dimensions in a synchronized way; and the spatial parallelism, in a generic version of the model, with a transfinite global memory shared by transfinite processes distributed in a enumerable set of geometric machines, synchronized in the time. The work also provides interpretation to the non-deterministic computations and applies the exponential operators in the interpretation of the functional space. The most basic notion of this work is the definition of the coherence relation as the admissibility of parallelism between basic operations (elementary processes). That relation defines the web over which the coherence space of the whole set of deterministic and non-deterministic processes is step-wise and systematically build. Over the set of the compatible points of such graph, the strict coherence interprets the implicity condition to model parallelism - the true concurrence. In the dual construction, justified by the presence of involutive negation in the complementary graph, the incoherence interprets the condition that models non-determinism - the conflict of memory accesses. The other constructors, the sequential product and the deterministic sum, are defined by the endofunctors in the CospLin category of the coherence spaces and linear functions. The ordered structure of this model is formalized by the coherence space D∞ of all processes, constructed by levels from the coherence space D0 of the elementary processes, following the Scott’s methodology [SCO 76]. In this sense, each level is identified by a subspace Dn, which reconstructs all the objects from the level before, preserving their properties and relations, and drives the construction of the new objects. Compatible with the algebraic-theoretic approach to computational processes, the relationship between the levels is expressed by linear functions called embedding and projection-functions, which interpret constructors and destructors of processes, respectively. The completion procedure guarantees the existence of the least fixed point to the recursive equations, defined by infinite composition of these morphisms. In addition, the interpretation for infinite processes constructed by prefix is presented in D→∞ , confirms that the ordered structure of these model is compatible with the diversity of constructors. The coherence space D∞2 of transfinite processes generalizes the construction and defines the ordered structure of the distributed geometric machine model. Its objects are coherent subsets of tokens labelled by the positions of a geometric space and indexed by isomorphic subsets related to the transfinite ordinal numbers. In order to analyze the behavior related to the interpretations in D∞, the coherence space S S of the linear traces of functions, defined over the coherence space S of the computational states, is introduced. The definition of the representation-function induces the construction of the domain Ω of valid expressions and formalizes a (graphic) language which is able to express, in an more operational way, the interpretations obtained in the geometric machine model.

This study investigates how multilinguals compared with monolinguals categorise landscape. The aim is to contribute to research already done with fresh data in a new setting. The thesis suggests that speakers with lower proficiency in a language will tend to choose vocabulary based on frequency and not semantic knowledge. The study was done through a quantitative and qualitative questionnaire targeting French, English, and Swiss-German speakers. Methods used were among others word-to-referent mapping and priming to gather useful vocabulary. The participants were to look at 30 images per language and choose among three words which one best fit the images. All images portraying different features of landscapes. What could be found is that 20% of the time the multilingual had a tendency to behave differently to the monolingual baseline. Data from this study shows that the Indo-European languages in this research seem to have more similar constraints on the semantic domains than differences. 80% of the time all speakers, monolingual and multilingual, agreed on what word best fit the image. Qualitative and quantitative data support this idea. The frequency theory proved to be true in the 20% of cases where the trilingual group deviated from the answers of the other groups.

This dissertation is a nuanced study of ‘compassion’ in the context of the Pauline Letters. The Letters are considered within the socio/political context of imperial Rome. ‘Compassion’ is a complex emotion, therefore it has been necessary to include, in my analysis, cognate sentiments such as patience, kindness, gentleness, perseverance. As this is a semantic study the Greek-English Lexicon of the New Testament based on Semantic Domains, compiled by Louw and Nida (L-N), is used extensively. A dictionary provides a potential meaning, but it is the context of the sentence, the sentence within a larger unit of the text as a whole, considered within the prevailing social conditions, that influence meaning. This method reveals that Paul envisages ‘compassion’ as the means to establish communities, not enslaved by the values of ‘the world’, nor grasping things for themselves at the expense of others. In Paul, ‘compassion’ is expansive and inclusive, where the good of the whole community is valued. His paradigm is the sacrifice of Christ. / Religious Studies and Arabic / M. A. (Ancient Languages and Cultures)

This dissertation is a nuanced study of ‘compassion’ in the context of the Pauline Letters. The Letters are considered within the socio/political context of imperial Rome. ‘Compassion’ is a complex emotion, therefore it has been necessary to include, in my analysis, cognate sentiments such as patience, kindness, gentleness, perseverance. As this is a semantic study the Greek-English Lexicon of the New Testament based on Semantic Domains, compiled by Louw and Nida (L-N), is used extensively. A dictionary provides a potential meaning, but it is the context of the sentence, the sentence within a larger unit of the text as a whole, considered within the prevailing social conditions, that influence meaning. This method reveals that Paul envisages ‘compassion’ as the means to establish communities, not enslaved by the values of ‘the world’, nor grasping things for themselves at the expense of others. In Paul, ‘compassion’ is expansive and inclusive, where the good of the whole community is valued. His paradigm is the sacrifice of Christ. / Religious Studies and Arabic / M. A. (Ancient Languages and Cultures)

<p>This corpus-based study examines adjectives and adjectival expressions used to describe characters in British children’s fiction. The focus is on diachronic variation, by comparing Victorian (19th-century) and contemporary (late 20th-century) children’s fiction, and on gender variation, by comparing the descriptions of female and male characters. I adopt a qualitative as well as a quantitative approach, and consider factors such as lexical diversity, adjectival density, collocation patterns, evaluative meaning, syntactic function and distribution across semantic domains. Most findings are related to a dichotomy set up between an idealistic and a realistic portrayal of characters. The study shows that an idealistic portrayal of characters is typical of the Victorian material and a realistic portrayal of characters typical of the contemporary material. Further, gender differences are much more pronounced, and reflect traditional gender role patterns more in the Victorian material than in the contemporary material. For instance, a pleasant appearance is typically described for Victorian female characters and social position for Victorian male characters. Moreover, descriptions of mental properties of Victorian female characters are conspicuously rare. Such gendered patterns are less distinct in the contemporary material, although appearance is still more extensively described for female than male characters. As regards how the qualities are attributed to characters, the descriptions of Victorian female characters were found to be the most formulaic compared to the descriptions of Victorian male, contemporary female and contemporary male characters.</p>

This corpus-based study examines adjectives and adjectival expressions used to describe characters in British children’s fiction. The focus is on diachronic variation, by comparing Victorian (19th-century) and contemporary (late 20th-century) children’s fiction, and on gender variation, by comparing the descriptions of female and male characters. I adopt a qualitative as well as a quantitative approach, and consider factors such as lexical diversity, adjectival density, collocation patterns, evaluative meaning, syntactic function and distribution across semantic domains. Most findings are related to a dichotomy set up between an idealistic and a realistic portrayal of characters. The study shows that an idealistic portrayal of characters is typical of the Victorian material and a realistic portrayal of characters typical of the contemporary material. Further, gender differences are much more pronounced, and reflect traditional gender role patterns more in the Victorian material than in the contemporary material. For instance, a pleasant appearance is typically described for Victorian female characters and social position for Victorian male characters. Moreover, descriptions of mental properties of Victorian female characters are conspicuously rare. Such gendered patterns are less distinct in the contemporary material, although appearance is still more extensively described for female than male characters. As regards how the qualities are attributed to characters, the descriptions of Victorian female characters were found to be the most formulaic compared to the descriptions of Victorian male, contemporary female and contemporary male characters.

The aim of the present study has been to investigate how titles of social rank used in Tudor and Stuart England are modified by attributive adjectives in pre-adjacent position and the implications that become possible to observe. Using the Corpus of Early English Correspondence Sampler (CEECS) the present work set out to examine adjectival modification, gender perspectives and MI (Mutual Information) scores in order to gain a deeper understanding of how and why titles were modified in certain ways. The titles under scrutiny are Lord, Lady, Sir, Dame, Madam, Master and Mistress and these have been analysed following theories and frameworks pertaining to the scientific discipline of sociohistorical linguistics.    The findings of the present study suggest that male titles were modified more frequently than, and differently from, female titles. The adjectives used as pre-modifiers, in turn, stem from different semantic domains which reveals differences in attitudes from the language producers towards the referents and in what traits are described regarding the holders of the titles. Additionally, a type/token ratio investigation reveals that the language producers were keener on using a more varied vocabulary when modifying female titles and less so when modifying male titles. The male terms proved to be used more formulaically than the female terms, as well. Lastly, an analysis of MI scores concludes that the most frequent collocations are not necessarily the most relevant ones.    A discussion regarding similarities and differences to other studies is carried out, as well, which, further, is accompanied by suggestions for future research.