This paper defines a new imperative language called Feudal C which is essentially a restricted su... more This paper defines a new imperative language called Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and operational semantics for Feudal C, and proves memory safety for the language. Page 1 of 40 This paper defines a new imperative language called Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and operational semantics for Feudal C, and proves memory safety for the language.
This paper defines a new imperative language c alled Feudal C which is essentially a restricted s... more This paper defines a new imperative language c alled Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and
Journal of the Australian Mathematical Society, 1989
AbsractIn this paper, it is shown that any connected, small category can be embedded in a semi-gr... more AbsractIn this paper, it is shown that any connected, small category can be embedded in a semi-groupoid (a category in which there is at least one isomorphism between any two elements) in such a way that the embedding includes a homotopy equivalence of classifying spaces. This immediately gives a monoid whose classifying space is of the same homotopy type as that of the small category. This construction is essentially algorithmic, and furthermore, yields a finitely presented monoid whenever the small category is finitely presented. Some of these results are generalizations of ideas of McDuff.
The analysis of Lie groups depends to a large extent on their maximal tori. For a compact connect... more The analysis of Lie groups depends to a large extent on their maximal tori. For a compact connected topological group c, the subgroups analogous to the maximal tori are the maximal connected Abelian subgroups. As i n Hofmann and Morris 171 we call them maximal protori. We sharpen some results of [7] by showing that each maximal protorus is in a natural way the projective limit of maximal tori T, in the corresponding G,, where c = projC,, This sharpened characterization together with some methods of Moskowitz [4], [ 101 will be used to show that a number of well-known theorems concerning Lie groups extend in a natural way to all compact connected groups.
This paper defines a new imperative language called Feudal C which is essentially a restricted su... more This paper defines a new imperative language called Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and operational semantics for Feudal C, and proves memory safety for the language. Page 1 of 40 This paper defines a new imperative language called Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and operational semantics for Feudal C, and proves memory safety for the language.
This paper defines a new imperative language c alled Feudal C which is essentially a restricted s... more This paper defines a new imperative language c alled Feudal C which is essentially a restricted subset of C. Feudal C provides automatic memory management and statically prevents dangling references and memory leaks with very low runtime overhead. The key enabling insight is that memory management information in typical programs is static. This paper presents the syntax, typing rules and
Journal of the Australian Mathematical Society, 1989
AbsractIn this paper, it is shown that any connected, small category can be embedded in a semi-gr... more AbsractIn this paper, it is shown that any connected, small category can be embedded in a semi-groupoid (a category in which there is at least one isomorphism between any two elements) in such a way that the embedding includes a homotopy equivalence of classifying spaces. This immediately gives a monoid whose classifying space is of the same homotopy type as that of the small category. This construction is essentially algorithmic, and furthermore, yields a finitely presented monoid whenever the small category is finitely presented. Some of these results are generalizations of ideas of McDuff.
The analysis of Lie groups depends to a large extent on their maximal tori. For a compact connect... more The analysis of Lie groups depends to a large extent on their maximal tori. For a compact connected topological group c, the subgroups analogous to the maximal tori are the maximal connected Abelian subgroups. As i n Hofmann and Morris 171 we call them maximal protori. We sharpen some results of [7] by showing that each maximal protorus is in a natural way the projective limit of maximal tori T, in the corresponding G,, where c = projC,, This sharpened characterization together with some methods of Moskowitz [4], [ 101 will be used to show that a number of well-known theorems concerning Lie groups extend in a natural way to all compact connected groups.
Uploads
Papers by Carol Hurwitz