Alcohol dehydrogenase II and fructose-1,6-bisphosphatase appear to be co-regulated in wild-type yeast

AbstractAn activity gel assay for fructose-1,6-bisphosphatase (FBP), the enzyme catalyzing the final step in gluconeogenesis in yeast, has been developed which can be used in conjunction with spectrophotometric assays to show that it is tightly co-regulated with the inducible alcohol dehydrogenase, ADHII. Both enzymes are repressed coordinately in aerobically grown yeast by the addition of high levels of glucose or ethanol, and induced on minimal medium by the addition of yeast extract. A mutant deficient in FBP segregates independently of the ADHII structural gene locus. This phenomenon is of interest because of the discovery of Ciriacy [(1979) Mol. Gen. Genet. 176, 427-431] of mutants (ccr, or carbon catabolite repression) which repress both FBP and ADHII simultaneously, along with several other enzymes.Activity gel electrophoresisGluconeogenesisRegulatio

Using Recursive Types to Reason about Hardware in Higher Order Logic

: The expressive power of higher order logic makes it possible to define a wide variety of data types within the logic and to prove theorems that state the properties of these types concisely and abstractly. This paper describes how such defined data types can be used to support formal reasoning in higher order logic about the behaviour of hardware designs. First printed: May 1988 Reprinted with revisions: April 1990 An earlier version of this paper appears in: The Fusion of Hardware Design and Verification, ed. G.J. Milne (North-Holland, 1988), pp. 27--50. Contents Introduction 5 1 Hardware Verification using Higher Order Logic 5 1.1 Notation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 1.2 Specifying Hardware Behaviour : : : : : : : : : : : : : : : : : : 6 1.3 Specifying Hardware Structure : : : : : : : : : : : : : : : : : : 7 1.4 Formulating Correctness : : : : : : : : : : : : : : : : : : : : : : 8 2 Recursive Types in Higher Order Logic 8 2.1 Type Definit..

A Package for Inductive Relation Definitions in HOL

This paper describes a set of theorem proving tools based on a new derived principle of definition in HOL, namely the introduction of relations inductively defined by a set of rules. Such inductive definitions abound in computer science. Example application areas include reasoning about structured operational semantics, type judgements, transition relations for process algebras, reduction relations, and compositional proof systems. The package described in this paper automates the derivation of certain inductive definitions involved in these applications and provides the basic tools needed for reasoning about the relations introduced by them. 1 Introduction The HOL user community has a strong tradition of taking a purely definitional approach to using higher order logic. That is, the syntax of the logic is extended with new notation not simply by postulating axioms to give meaning to it, but rather by defining it in terms of existing expressions of the logic that already have the requ..

Computers still need people

"Although jobs in many scientific fields seem to be declining, the computer programmer and other specialists are in great demand."--Table of contents for issue