Expansion-passing style: A general macro mechanism

The traditional Lisp macro expansion facility inhibits several important forms of expansion control. These include selective expansion of subexpressions, expansion of subexpressions using modified expansion functions, and expansion of application and variable expressions. Furthermore, the expansion algorithm must treat every special form as a separate case. The result is limited expressive power and poor modularity. We propose an alternative facility that avoids these problems, using a technique calledexpansion-passing style (EPS). The critical difference between the facility proposed here and the traditional macro mechanism is that expansion functions are passed not only an expression to be expanded but also another expansion function. This function may or may not be used to perform further expansion. The power of this technique is illustrated with several examples. Most Lisp systems may be adapted to employ this technique.A preliminary version of this paper was presented at the 1986 ACM Symposium on Lisp and Functional Programming. This material is based on work supported by the National Science Foundation under Grants MCS 83-04567, MCS 83-03325, and DCR 85-01277.     

Evaluation of intraspecies genetic variation within the 16S rRNA gene of Mycoplasma hominis and detection by polymerase chain reaction

Mycoplasma hominis is a heterogeneous species with DNA-DNA hybridization values ranging from 51 to 100%. We report here the sequencing of the 16S rRNA gene of a strain (183) that greatly differs from the type strain (PG21) of this species. Comparison of 16S rDNA sequences from these two strains showed limited differences, indicating that the two strains belong to the same rRNA species complex. Using these nucleotide sequence data, we established a rapid method for the detection of M. hominis by using polymerase chain reaction. This method was shown to be sensitive and specific when tested with reference strains and clinical isolates.     

Subcontinuations

Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, because the notion of the rest of the computation represented by a continuation does not in general make sense. Traditional continuations can also be difficult to use in nonconcurrent settings, since their global nature is sometimes problematic. This article presents a new type of continuation, called asubcontinuation. Just as a traditional continuation represents the rest of a computation ¿from a given point in the computation, a subcontinuation represents the rest of asubcomputation ¿from a given point in the subcomputation. Subcontinuations may be used to control tree-structured concurrency by allowing nonlocal exits to arbitrary points in a process tree and allowing the capture of a subtree of a computation as a composable continuation for later use. In the absence of concurrency the localized control achievable with subcontinuations makes them more useful than traditional continuations.This material is based on work supported by the National Science Foundation under grant number CCR-88-03432 and by Sandia National Laboratories under contract number 06-06211. This article is a revised and extended version of a paper presented at the 1990 ACM Conference on Principles and Practice of Parallel Programming.Robert Hieb died in an automobile accident in April 1992.     

Threads Yield Continuations

Just as a traditional continuation represents the rest of acomputation from a given point in the computation, a subcontinuationrepresents the rest of a subcomputation from agiven point in the subcomputation. Subcontinuationsare more expressive than traditional continuations and have been shown to beuseful for controlling tree-structured concurrency, yet they havepreviously been implemented only on uniprocessors. This article describes aconcurrent implementation of one-shot subcontinuations. Like one-shotcontinuations, one-shot subcontinuations are first-class but may be invokedat most once, a restriction obeyed by nearly all programs that usecontinuations. The techniques used to implement one-shot subcontinuationsmay be applied directly to other one-shot continuation mechanisms and may begeneralized to support multi-shot continuations as well. A novel feature ofthe implementation is that continuations are implemented in terms ofthreads. Because the implementation model does not rely upon any speciallanguage features or compilation techniques, the model is applicable toany language or language implementation that supports a small set of threadprimitives.     

Characterization of the lysogenic bacteriophage MAV1 from Mycoplasma arthritidis

The lysogenic bacteriophage MAV1, which is associated with the arthritogenicity of Mycoplasma arthritidis, was characterized. Several strains of M. arthritidis were examined for their ability to support growth of MAV1. A PFU assay was developed, and the sensitivity of phage to various chemical treatments was assayed. The most notable result was the resistance of MAV1 to proteinase K. The MAV1 genome is a double-stranded, linear DNA molecule of about 16 kb. The site of MAV1 DNA integration in the host chromosome was investigated. The ends of MAV1 DNA were cloned from three independent lysogens shown to have MAV1 DNA inserted at different sites in the host. The nucleotide sequences of the ends of the MAV1 genome and of the MAV1 DNA-chromosomal DNA junctions from each of three lysogens were determined. Sequences flanking the integrated prophage and the ends of native MAV1 DNA were determined, allowing the identification of the phage DNA (attP) and bacterial DNA (attB) recombination sites. Analysis of the left MAV1 DNA-chromosomal DNA junction sites showed a single-base heterogeneity located within MAV1 DNA sequences immediately adjacent to the attB sequence. A model for MAV1 integration-excision is proposed.     

Syntactic abstraction in scheme

Naive program transformations can have surprising effects due to the interaction between introduced identifier references and previously existing identifier bindings, or between introduced bindings and previously existing references. These interactions can result in inadvertent binding, or capturing, of identifiers. A further complication is that transformed programs may have little resemblance to original programs, making correlation of source and object code difficult. This article describes an efficient macro system that prevents inadvertent capturing while maintaining the correlation between source and object code. The macro system allows the programmer to define program transformations using an unrestricted, general-purpose language. Previous approaches to the capturing problem have been inadequate, overly restrictive, or inefficient, and the problem of source-object correlation has been largely unaddressed. The macro system is based on a new algorithm for implementing syntactic transformations and a new representation for syntactic expressions.This material is based on work supported by the National Science Foundation under grant number CCR-8803432.Robert Hieb died in an automobile accident in April 1992.