Tools for Sustainability: Water Footprints

There have been significant global developments in water footprinting in the past few years and a growing adoption and application of the water footprint concept to improve water management outcomes. This article provides an overview of the principles and ideas underlying water footprints and their current status in sanctioned water dialogue and governance in Australia. Arguments are advanced as to why and how water footprint initiatives generally, and water footprint labelling of consumer products specifically, can contribute to the efficient use and sustainability of freshwater resources. The article concludes that any initiative will require both the cooperation and goodwill of industry organisations and policy guidance from government

Proof-Theoretic Methods for Analysis of Functional Programs

We investigate how, in a natural deduction setting, we can specify concisely a wide variety of tasks that manipulate programs as data objects. This study will provide us with a better understanding of various kinds of manipulations of programs and also an operational understanding of numerous features and properties of a rich functional programming language. We present a technique, inspired by structural operational semantics and natural semantics, for specifying properties of, or operations on, programs. Specifications of this sort are presented as sets of inference rules and are encoded as clauses in a higher-order, intuitionistic meta-logic. Program properties are then proved by constructing proofs in this meta-logic. We argue the following points regarding these specifications and their proofs: (i) the specifications are clear and concise and they provide intuitive descriptions of the properties being described; (ii) a wide variety of program analysis tools can be specified in a single unified framework, and thus we can investigate and understand the relationship between various tools; (iii) proof theory provides a well-established and formal setting in which to examine meta-theoretic properties of these specifications; and (iv) the meta-logic we use can be implemented naturally in an extended logic programming language and thus we can produce experimental implementations of the specifications. We expect that our efforts will provide new perspectives and insights for many program manipulation tasks

Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language

We demonstrate how a specification for the standard evaluation of a simple functional programming language can be systematically extended to a specification for mixed evaluation. Using techniques inspired by natural semantics we specify a standard evaluator by a set of inference rules. The evaluation of programs is then performed by a restricted kind of theorem proving in this logic. We then describe a systematic method for extending the proof system for standard evaluation to a new proof system that provides greater flexibility in treating bound variables in the object-level functional programs. We demonstrate how this extended proof system provides the capabilities of a mixed evaluator and how correctness with respect to standard evaluation can be proved in a simple and direct manner. The current work focuses only on a primitive notion of mixed evaluation for a simple functional programming language, but we believe that our methods will extend to more sophisticated kinds of evaluations and richer languages

Enriching a Meta-Language With Higher-Order Features

Various meta-languages for the manipulation and specification of programs and programming languages have recently been proposed. We examine one such framework, called natural semantics, which was inspired by the work of G. Plotkin on operational semantics and extended by G. Kahn and others at INRIA. Natural semantics makes use of a first-order meta-language which represents programs as first-order tree structures and reasons about these using natural deduction-like methods. We present the following three enrichments of this meta-language. First, programs are represented not by first-order structures but by simply typed λ-terms. Second, schema variables in inference rules can be higher-order variables. Third, the reasoning mechanism is explicitly extended with proof methods which have proved valuable for natural deduction systems. In particular, we add methods for introducing and discharging assumptions and for introducing and discharging parameters. The first method can be used to prove hypothetical propositions while the second can be used to prove generic or universal propositions. We provide several example specifications using this extended meta-language and compare them to their first-order specifications. We argue that our extension yields a more natural and powerful meta-language than the related first-order system. We outline how this enriched meta-language can be compiled into the higher-order logic programming language λProlog

From Operational Semantics to Abstract Machines: Preliminary Results

The operational semantics of functional programming languages is frequently presented using inference rules within simple meta-logics. Such presentations of semantics can be high-level and perspicuous since meta-logics often handle numerous syntactic details in a declarative fashion. This is particularly true of the meta-logic we consider here, which includes simply typed λ-terms, quantification at higher types, and β-conversion. Evaluation of functional programming languages is also often presented using low-level descriptions based on abstract machines: simple term rewriting systems in which few high-level features are present. In this paper, we illustrate how a high-level description of evaluation using inference rules can be systematically transformed into a low-level abstract machine by removing dependencies on high-level features of the meta-logic until the resulting inference rules are so simple that they can be immediately identified as specifying an abstract machine. In particular, we present in detail the transformation of two inference rules specifying call-by-name evaluation of the untyped λ-calculus into the Krivine machine, a stack-based abstract machine that implements such evaluation. The initial specification uses the meta-logic\u27s β-conversion to perform substitutions. The resulting machine uses de Bruijn numerals and closures instead of formal substitution. We also comment on a similar construction of a simplified SECD machine implementing call-by-value evaluation. This approach to abstract machine construction provides a semantics directed method for motivating, proving correct, and extending such abstract machines

From Operational Semantics to Abstract Machines

We consider the problem of mechanically constructing abstract machines from operational semantics, producing intermediate-level specifications of evaluators guaranteed to be correct with respect to the operational semantics. We construct these machines by repeatedly applying correctness-preserving transformations to operational semantics until the resulting specifications have the form of abstract machines. Though not automatable in general, this approach to constructing machine implementations can be mechanized, providing machine-verified correctness proofs. As examples we present the transformation of specifications for both call-by-name and call-by-value evaluation of the untyped λ-calculus into abstract machines that implement such evaluation strategies. We also present extensions to the call-by-value machine for a language containing constructs for recursion, conditionals, concrete data types, and built-in functions. In all cases, the correctness of the derived abstract machines follows from the (generally transparent) correctness of the initial operational semantic specification and the correctness of the transformations applied

System model development for nuclear thermal propulsion

A critical enabling technology in the evolutionary development of nuclear thermal propulsion (NTP) is the ability to predict the system performance under a variety of operating conditions. This is crucial for mission analysis and for control subsystem testing as well as for the modeling of various failure modes. Performance must be accurately predicted during steady-state and transient operation, including startup, shutdown, and post operation cooling. The development and application of verified and validated system models has the potential to reduce the design, testing, and cost and time required for the technology to reach flight-ready status. Since Oct. 1991, the U.S. Department of Energy (DOE), Department of Defense (DOD), and NASA have initiated critical technology development efforts for NTP systems to be used on Space Exploration Initiative (SEI) missions to the Moon and Mars. This paper presents the strategy and progress of an interagency NASA/DOE/DOD team for NTP system modeling. It is the intent of the interagency team to develop several levels of computer programs to simulate various NTP systems. The first level will provide rapid, parameterized calculations of overall system performance. Succeeding computer programs will provide analysis of each component in sufficient detail to guide the design teams and experimental efforts. The computer programs will allow simulation of the entire system to allow prediction of the integrated performance. An interagency team was formed for this task to use the best capabilities available and to assure appropriate peer review

Implications of Epithelial–Mesenchymal Plasticity for Heterogeneity in Colorectal Cancer

Colorectal cancer (CRC) is a genetically heterogeneous disease that develops and progresses through several distinct pathways characterized by genomic instability. In recent years, it has emerged that inherent plasticity in some populations of CRC cells can contribute to heterogeneity in differentiation state, metastatic potential, therapeutic response, and disease relapse. Such plasticity is thought to arise through interactions between aberrant signaling events, including persistent activation of the APC/β-catenin and KRAS/BRAF/ERK pathways, and the tumor microenvironment. Here, we highlight key concepts and evidence relating to the role of epithelial-mesenchymal plasticity as a driver of CRC progression and stratification of the disease into distinct molecular and clinicopathological subsets

Dune vegetation fertilization by nesting sea turtles

Sea turtle nesting presents a potential pathway to subsidize nutrient-poor dune ecosystems, which provide the nesting habitat for sea turtles. To assess whether this positive feedback between dune plants and turtle nests exists, we measured N concentration and delta N-15 values in dune soils, leaves from a common dune plant ( sea oats [Uniola paniculata]), and addled eggs of loggerhead (Caretta caretta) and green turtles ( Chelonia mydas) across a nesting gradient ( 200 - 1050 nests/km) along a 40.5-km stretch of beach in east central Florida, USA. The delta N-15 levels were higher in loggerhead than green turtle eggs, denoting the higher trophic level of loggerhead turtles. Soil N concentration and delta N-15 values were both positively correlated to turtle nest density. Sea oat leaf tissue delta N-15 was also positively correlated to nest density, indicating an increased use of augmented marine-based nutrient sources. Foliar N concentration was correlated with delta N-15, suggesting that increased nutrient availability from this biogenic vector may enhance the vigor of dune vegetation, promoting dune stabilization and preserving sea turtle nesting habitat