This dissertation explores the development of prose fiction continuations from Sir Philip Sidney’s Arcadia to the novels of Samuel Richardson. Examining instances in which a text was continued by someone other than its original author, I ask precisely what this distinction means historically: what factors create a system of literary value in which certain continuations are defined as ‘spurious,’ and how does the discourse surrounding these texts participate in changing attitudes toward authorship, originality, and narrative closure? My work thus contributes to recent critical efforts to historicise authorship and literary property, using prose fiction examples that have not previously been discussed in this context. Analysing the rhetorical strategies found within paratextual materials such as prefaces, dedications, and advertisements, I establish how writers of continuations discuss the motivations for their works, how these are marketed and received, and how the authors of the source texts (or their representatives) respond to them. Through close reading, the dissertation traces the development of persistent metaphors for literary property across these texts, focusing on images of land, paternity, and the author’s ‘spirit.’ The introductory chapter addresses these metaphors’ significance, defines the main elements of continuations, and situates them within the historical context of a growing print marketplace and developments in copyright law. The dissertation then presents a series of case studies of the most documentarily-rich instances of continuation across the period. Starting with The Countess of Pembroke’s Arcadia, published posthumously in an incompletely-revised form, Chapter 2 shows how its gaps allowed other writers to continue the story, while Chapter 3 studies the metaphorical approaches to authorship taken in the continuations’ paratexts. Chapter 4 examines two Restoration texts, The English Rogue and The Pilgrim’s Progress, which combine the Arcadia continuations’ concern about the author’s honour with issues of commercial competition. The intersection of profit, reputation and copyright protection brought out in this chapter is reflected in the subsequent discussion of the career of Samuel Richardson. Chapter 5 shows him responding to public challenges to his authorial control following the success of Pamela, whereas Chapter 6 explores the more private assertions of authority taking place within Richardson’s correspondence during the publication of Clarissa and Sir Charles Grandison. Finally, my conclusion summarises the subsequent legal and critical privileging of original over continuation, emphasising the historical contingency of this process. The broad chronological scope of the dissertation allows the frames of all these texts to inform each other for the first time, crossing the established critical boundary between the ‘romance’ and the ‘novel.’ This approach reveals continuities as well as differences, enabling me to construct a more nuanced picture of Early Modern approaches to prose continuations and authorial ownership. In establishing links between law and literature, the project also provides an important historical context for contemporary debates about copyright, fanfiction, and literary property.

None

Complex concurrent APIs are difficult to reason about annually due to the exponential growth in the number of feasible schedules. Testing against reference solutions of these APIs is equally difficult as reference solutions implement an unknown set of allowed behaviors, and programmers have no way to directly control schedules or API internals to expose or reproduce errors. The work in this paper mechanically generates a drop-in replacement for a concurrent API from a formal specification. The specification is a guarded command system with first-order logic that is compiled into a core calculus. The term rewriting system is connected to actual C programs written against the API through lightweight wrappers in a role-based relationship with the rewriting system. The drop-in replacement supports putative what-if queries over API scenarios for behavior exploration, reproducibility for test and debug, full exhaustive search and other advanced model checking analysis methods for C programs using the API. We provide a Racket instantiation of the rewriting system with a C/Racket implementation of the role-based architecture and validate the process with an API from the Multicore Association.

Cette thèse développe un formalisme théorique pour la sémantique du discours. Il s'appuie sur l'extension des grammaires de Montague, sur la notion de continuation et sur les mécanismes de levée et de traitement des exceptions. Le formalisme permet de traiter des phénomènes dynamiques tels que les anaphores d'une phrase à l'autre, les présuppositions déclenchées par des référents et les projections présuppositions. / This thesis develops a theoretical formalism that takes into account semantical discourse dynamics. It focuses on the extension of Montague semantic with the notion of continuation and an exception handling and raising mechanism. The formalism allows to handle dynamic phenomena such as cross-sentential anaphora, presuppositions triggered by referring expressions and presupposition projection.

No description available.

No / We examine the short-term price reaction of 424 UK stocks to large one-day price changes. Using the GJR-GARCH(1,1), we find no statistical difference amongst the cumulative abnormal returns (CARs) of the Single Index, the Fama–French and the Carhart–Fama–French models. Shocks ⩾5% are followed by a significant one-day CAR of 1% for all the models. Whilst shocks ⩽−5% are followed by a significant one-day CAR of −0.43% for the Single Index, the CARs are around −0.34% for the other two models. Positive shocks of all sizes and negative shocks ⩽−5% are followed by return continuations, whilst the market is efficient following larger negative shocks. The price reaction to shocks is unaffected when we estimate the CARs using the conditional covariances of the pricing variables.

This thesis presents an introduction to the three main fields that study time: physics, philosophy, and logics. A brief introduction to general relativity, thermodynamics and quantum physics is made. Also some of the basic ideas from the philosophy of time are explained and dualities connected to time are described, e.g. eternalism vs. presentism, determinism vs. indeterminism and the reality or unreality of time. As there is a huge number of temporal logics, only the main ideas that differentiate these logics from others are pointed out and some typical proofs are then shown. Special attention is then given to the relation between logics and physics, how the first can be used in the latter. Thereafter, Branching space-times and Branching continuation models are presented, which proved to be useful within quantum physics. Next, some basic terminology connected to general relativity and the A, P and T topologies are introduced . These are used together with the given models to investigate a possible combination.

This thesis work investigates how to represent protocols for asynchronous communication in the Scala programming language and the Akka actor framework, to be run on Java Virtual Machine (JVM). Further restrictions from the problem domain - the coexistence of multiple protocol instances sharing the same Java thread - imply that neither an asynchronous call waiting for response nor anything else can block the underlying Java threads. A common way to represent asynchronous communication protocols is to use state machines. This thesis seeks a way to shrink the size of and to reduce the complexity of the protocol implementations by representing sequences of asynchronous communication calls (i.e. sequences of sent and received messages) as a type of procedure. The idea is find a way to make the procedures that contain asynchronous calls look like synchronous communication procedures by hiding the asynchronous details. In other words, the resulting procedure code should show what to do and not so much focus on how to overcome the impediment of the asynchronous calls. With the help of an asynchronous communication protocol toy example, this report shows how such an protocol can be implemented with a combination of a state machine and a procedure representation in Scala and Akka. The procedure representation hides away the asynchronous details by using the Scala capability to use CPS-transformed delimited continuations. As a sub-problem, this thesis also shows how to safely schedule asynchronous communication timeouts with help of Scala and Akka within the restrictions of the thesis problem domain.

Le contexte de ce travail est la mécanique spatiale. Plus précisément, on se propose de réaliser des transferts 'a faible poussée dans le système Terre- Lune modélise par le problème des trois corps restreint circulaire. Le but est de calculer la commande optimale de l'engin spatial pour deux critères d'optimisation: temps de transfert minimal et consommation de carburant minimale. Les contributions de cette thèse sont de deux ordres. Géométrique, tout d'abord, puisqu'on étudie la contrôlabilité du système ainsi que la géométrie des transferts (structure de la commande) à l'aide d'outils de contrôle géométrique. Numérique, ensuite, différentes méthodes homotopiques sont développées. En effet, une continuation deux-trois corps est considérée pour calculer des trajectoires temps minimales et puis une continuation sur la poussée maximale de l'engin pour atteindre des poussées faibles. Le problème de consommation minimale -- minimisation de la norme L1 du contrôle -- est connecté par une continuation différentielle au problème de minimisation de la norme L2 du contrôle. Les solutions trouvées sont comparées à celles calculées 'a l'aide d'une p pénalisation par barrière logarithmique. Ces méthodes sont ensuite appliquées pour la mission SMART-1 de l'Agence Européenne Spatiale.

This thesis develops a theoretical formalism of formal semantics of natural language in the spirit of Montague semantics. The developed framework satisfies the principle of compositionality in a simple and elegant way, by being as parsimonious as possible: completely new formalisms or extensions of existing formalisms with even more complex constructions to fit particular linguistic phenomena have been avoided; instead, the framework handles these linguistic phenomena using only basic and well-established formalisms, such as simply-typed lambda calculus and classical logic. Dynamics is achieved by employing a continuation-passing technique and an exception raising and handling mechanism. The context is explicitly represented by a term, and, therefore, can be easily accessed and manipulated. The framework successfully handles cross-sentential anaphora and presuppositions triggered by referring expressions and has potential to be extended for dealing with more complex dynamic phenomena, such as presuppositions triggered by factive verbs and conversational implicatures.