8 citations found. Retrieving documents...
S. Eilenberg. The Category C. Unpublished manuscript.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Vector Braids - Moulton (1994)   (Correct)

....a K( 1) space. By applying Proposition 4.1 and using the long exact sequence of a fibration once more we obtain the result for the case n = 6. 5. Getting Around In this section we find generators for the fundamental group of the complement . Some of the material in this section is drawn from [15]. We begin by stating some conventions that we will use from now on. Fix a real structure on A . We denote the real points of this structure by A (R) If V is an affine linear subspace of A then let V (R) be equal to V A (R) Let fL i (R)g be a set of oriented lines in A (R) ....

R. Randell: The fundamental group of the complement of a union of complex hyperplanes :Correction, unpublished manuscript.


Causality in Commonsense Reasoning about Actions - McCain (1997)   (7 citations)  (Correct)

....infer the indirect of effects of actions. 5 The problem of finding an adequate analysis and logic of the causal relation is a notoriously difficult one. The first attempt at a logic of causality was [Burks, 1951] More recent attempts can be found in [von Wright, 1975] Faye et al. 1994] and [Koons, 1995]. 4 set of causally possible world histories. As we will see in Chapter 8, planning does as well. Our question, therefore, is this: for the purpose of determining the causally possible world histories, is it necessary to be able to represent and reason about relations of cause and effect ....

Robert C. Koons. The logic of causation. Unpublished manuscript, 1995.


Complete Axioms for Categorical Fixed-point Operators - Simpson, Plotkin (2000)   (11 citations)  (Correct)

....by a form of Gaussian elimination, see e.g. 33] More generally, the equational theory between fixed point terms ( terms) induced by the leastfixed point operator, has been axiomatized as the free iteration theory of Bloom and Esik [3] This theory is known to be decidable. Also, Eilenberg [6] and Plotkin [25] gave an order free characterisation of the least fixed point operator as the unique fixed point operator satisfying a condition known as uniformity, expressed with respect to the subcategory Cppo of strict maps in Cppo, see e.g. 15] Nowadays, one appreciates that Cppo is one ....

S. Eilenberg. The Category C. Unpublished manuscript.


An Algorithmic Framework for Specifying the Semantics of Discourse .. - Knott (1999)   (Correct)

....action being executed concludes that it is successful; similarly, we could represent a culminated process as the series of stages from an action being planned for to its being successfully completed. In fact, this approach to aspectual categories is very much in the spirit of Steedman s [7] plan based model of aspect. On a related note, it is interesting to speculate that the di erence between a state and an event could be represented at the meta level used to frame a general de nition for but in Section 3.3. A state could be characterised in relation to the agent p pursuing an ....

M Steedman. The productions of time. Unpublished manuscript.


A Fault Simulator in Prolog: a Software Re-engineering Experience - Lee   (Correct)

....Prolog, executes at the same order of magnitude of speed as a similar version written in C. In addition, the Prolog simulator helps to reveal a bug in the C version of the simulator. 1 Introduction There are two motivations for the project. First, a combinational circuit fault simulator FAULTSIM [7] was developed at the VLSI research group of the University of Victoria using the C language. Over the years, the simulator has become difficult to maintain and modify. Verification of the correctness of the simulator is infeasible as the implementation involves two inches thick of C code and ....

....have some mechanisms to connect the chunks together. Suppose that we want to break the parse tree in the previous example in chunks of three gates. The result is circuit( 3,2,1] 10] 4,fanout,2] 5,fanout,2] 6,not,4] circuit( 3,2,1,4,5,6] 10] 7,not,3] 8,nand,1,6] 9,nand,5,7] circuit([3,2,1,4,5,6,7,8,9], 10] 10,nand,8,9] The predicate circuit has three arguments. The first argument is the list of input lines to the chunk. The second one is the list of output lines of the chunk. The last argument remains to be a list of gate descriptions which describes the structure of the circuit (how ....

[Article contains additional citation context not shown here]

X. Sun. The FAULTSIM manual. Unpublished manuscript, University of Victoria, 1988.


The Case against Micropayments - Odlyzko (2003)   (4 citations)  Self-citation (Odlyzko)   (Correct)

No context found.

Odlyzko, A.M.: The Future of Money. Unpublished 1998 manuscript, available at #http://www.dtc.umn.edu/#odlyzko/doc/recent.html#.


Complete Axioms for Categorical Fixed-point Operators - Simpson, Plotkin (2000)   (11 citations)  (Correct)

No context found.

S. Eilenberg. The Category C. Unpublished manuscript.


Moving Frames: A Brief Survey - Olver   (Correct)

No context found.

Anderson, I.M., The Variational Bicomplex, unpublished manuscript.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC