Program representation size in an intermediate language with intersection and union types

The CIL compiler for core Standard ML compiles whole programs using a novel typed intermediate language (TIL) with intersection and union types and flow labels on both terms and types. The CIL term representation duplicates portions of the program where intersection types are introduced and union types are eliminated. This duplication makes it easier to represent type information and to introduce customized data representations. However, duplication incurs compile-time space costs that are potentially much greater than are incurred in TILs employing type-level abstraction or quantification. In this paper, we present empirical data on the compile-time space costs of using CIL as an intermediate language. The data shows that these costs can be made tractable by using sufficiently fine-grained flow analyses together with standard hash-consing techniques. The data also suggests that non-duplicating formulations of intersection (and union) types would not achieve significantly better space complexity.National Science Foundation (CCR-9417382, CISE/CCR ESS 9806747); Sun grant (EDUD-7826-990410-US); Faculty Fellowship of the Carroll School of Management, Boston College; U.K. Engineering and Physical Sciences Research Council (GR/L 36963, GR/L 15685

Continuation-Passing C: compiling threads to events through continuations

In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented to the programmer as a single abstraction. The CPC compiler uses a compilation technique, based on the CPS transform, that yields efficient code and an extremely lightweight representation for contexts. We provide a proof of the correctness of our compilation scheme. We show in particular that lambda-lifting, a common compilation technique for functional languages, is also correct in an imperative language like C, under some conditions enforced by the CPC compiler. The current CPC compiler is mature enough to write substantial programs such as Hekate, a highly concurrent BitTorrent seeder. Our benchmark results show that CPC is as efficient, while using significantly less space, as the most efficient thread libraries available.Comment: Higher-Order and Symbolic Computation (2012). arXiv admin note: substantial text overlap with arXiv:1202.324

Manufacturing Metallic Parts with Designed Mesostructure via Three-Dimensional Printing of Metal Oxide Powder

Cellular materials, metallic bodies with gaseous voids, are a promising class of materials that offer high strength accompanied by a relatively low mass. In this paper, the authors investigate the use of ThreeDimensional Printing (3DP) to manufacture metallic cellular materials by selectively printing binder into a bed of metal oxide ceramic powder. The resulting green part undergoes a thermal chemical post-process in order to convert it to metal. As a result of their investigation, the authors are able to create cellular materials made of maraging steel that feature wall sizes as small as 400 µm and angled trusses and channels that are 1 mm in diameter.Mechanical Engineerin

Particpants' Proceedings on the Workshop: Types for Program Analysis

As a satellite meeting of the TAPSOFT'95 conference we organized a small workshop on program analysis. The title of the workshop, ``Types for Program Analysis´´, was motivated by the recent trend of letting the presentation and development of program analyses be influenced by annotated type systems, effect systems, and more general logical systems. The contents of the workshop was intended to be somewhat broader; consequently the call for participation listed the following areas of interest:- specification of specific analyses for programming languages,- the role of effects, polymorphism, conjunction/disjunction types, dependent types etc.in specification of analyses,- algorithmic tools and methods for solving general classes of type-based analyses,- the role of unification, semi-unification etc. in implementations of analyses,- proof techniques for establishing the safety of analyses,- relationship to other approaches to program analysis, including abstract interpretation and constraint-based methods,- exploitation of analysis results in program optimization and implementation.The submissions were not formally refereed; however each submission was read by several members of the program committee and received detailed comments and suggestions for improvement. We expect that several of the papers, in slightly revised forms, will show up at future conferences. The workshop took place at Aarhus University on May 26 and May 27 and lasted two half days

Spacecraft-borne long life cryogenic refrigeration: Status and trends

The status of cryogenic refrigerator development intended for, or possibly applicable to, long life spacecraft-borne application is reviewed. Based on these efforts, the general development trends are identified. Using currently projected technology needs, the various trends are compared and evaluated. The linear drive, non-contacting bearing Stirling cycle refrigerator concept appears to be the best current approach that will meet the technology projection requirements for spacecraft-borne cryogenic refrigerators. However, a multiply redundant set of lightweight, moderate life, moderate reliability Stirling cycle cryogenic refrigerators using high-speed linear drive and sliding contact bearings may possibly suffice

Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

Lambda-lifting a functional program transforms it into a set of recursiveequations. We present the symmetric transformation: lambda-dropping.Lambda-dropping a set of recursive equations restores blockstructure and lexical scope.For lack of scope, recursive equations must carry around all theparameters that any of their callees might possibly need. Both lambda-liftingand lambda-dropping thus require one to compute a transitiveclosure over the call graph:- for lambda-lifting: to establish the Def/Use path of each freevariable (these free variables are then added as parameters toeach of the functions in the call path);- for lambda-dropping: to establish the Def/Use path of each parameter(parameters whose use occurs in the same scope as theirdefinition do not need to be passed along in the call path).Without free variables, a program is scope-insensitive. Its blocks arethen free to float (for lambda-lifting) or to sink (for lambda-dropping)along the vertices of the scope tree.We believe lambda-lifting and lambda-dropping are interesting perse, both in principle and in practice, but our prime application is partialevaluation: except for Malmkjær and Ørbæk's case study presented atPEPM'95, most polyvariant specializers for procedural programs operateon recursive equations. To this end, in a pre-processing phase,they lambda-lift source programs into recursive equations. As a result,residual programs are also expressed as recursive equations, often withdozens of parameters, which most compilers do not handle efficiently.Lambda-dropping in a post-processing phase restores their block structureand lexical scope thereby significantly reducing both the compiletime and the run time of residual programs.

NASA patent abstracts bibliography: A continuing bibliography. Section 1: Abstracts (supplement 14)

Abstracts are cited for 213 patents and applications for patent introduced into the NASA scientific and technical information system during the period of July 1978 through December 1978. Each entry consists of a citation, an abstract, and in most cases, a key illustration selected from the patent or application for patent

Space resources. Volume 2: Energy, power, and transport

This volume of the Space Resources report covers a number of technical and policy issues concerning the energy and power to carry out advanced space missions and the means of transportation to get to the sites of those missions. Discussed in the first half of this volume are the technologies which might be used to provide power and a variety of ways to convert power from one form to another, store it, move it wherever it is needed, and use it. In the second half of this volume, various kinds of transportation, including both interplanetary and surface systems, are discussed

Shape Analysis in the Absence of Pointers and Structure

discover properties of dynamic and/or mutable structures. We ask, “Is there an equivalent to shape analysis for purely functional programs, and if so, what ‘shapes ’ does it discover? ” By treating binding environments as dynamically allocated structures, by treating bindings as addresses, and by treating value environments as heaps, we argue that we can analyze the “shape ” of higher-order functions. To demonstrate this, we enrich an abstract-interpretive control-flow analysis with principles from shape analysis. In particular, we promote “anodization ” as a way to generalize both singleton abstraction and the notion of focusing, and we promote “binding invariants ” as the analog of shape predicates. Our analysis enables two optimizations known to be beyond the reach of control-flow analysis (globalization and super-β inlining) and one previously unknown optimization (higher-order rematerialization).