177,021 research outputs found
Parameterised notions of computation
No full textMoggi’s Computational Monads and Power et al’s equivalent notion of Freyd category have captured a large range of computational effects present in programming languages. Examples include non-termination, non-determinism, exceptions, continuations, side-effects and input/output. We present generalisations of both computational monads and Freyd categories, which we call parameterised monads and parameterised Freyd categories, that also capture computational effects with parameters. Examples of such are composable continuations, side-effects where the type of the state varies and input/output where the range of inputs and outputs varies. By also considering structured parameterisation, we extend the range of effects to cover separated side-effects and multiple independent streams of I/O. We also present two typed λ-calculi that soundly and completely model our categorical definitions — with and without symmetric monoidal parameterisation — and act as prototypical languages with parameterised effects
Relational parametricity for higher kinds
No full textReynolds’ notion of relational parametricity has been extremely influential and well studied for polymorphic programming languages and type theories based on System F. The extension of relational parametricity to higher kinded polymorphism, which allows quantification over type operators as well as types, has not received as much attention. We present a model of relational parametricity for System Fω, within the impredicative Calculus of Inductive Constructions, and show how it forms an instance of a general class of models defined by Hasegawa. We investigate some of the consequences of our model and show that it supports the definition of inductive types, indexed by an arbitrary kind, and with reasoning principles provided by initiality
Amortised resource analysis with separation logic
No full textType-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative pointer-manipulating languages by embedding a logic of resources, based on the affine intuitionistic Logic of Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the consumable resources associated with each member of the structure. We present the logic on a small imperative language, based on Java bytecode, with procedures and mutable heap. We have formalised the logic and its soundness property within the Coq proof assistant and extracted a certified verification condition generator. We also describe an proof search procedure that allows generated verification conditions to be discharged while using linear programming to infer consumable resource annotations. We demonstrate the logic on some examples, including proving the termination of in-place list reversal on lists with cyclic tails
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Letter from R. R. Zellick, Assistant Trust Officer, Anglo California National Bank of San Francisco, to Joseph R. Goodman, October 2, 1942
No full textLetter from R. R. Zellick, Assistant Trust Officer at The Anglo California National Bank of San Francisco, to Joseph R. Goodman, regarding property owned by Dave Tatsuno. Zellick mentions a dispute between current tenants and Tatsuno, and that Tatsuno has asked Goodman to help locate trustworthy tenants.Personal correspondence, organizational records, government documents, publications, and other papers created or collected by Joseph R. Goodman documenting the forced removal and incarceration of Japanese Americans during World War II, as well as organized resistance to incarceration. Included in the collection are records of the Japanese Young Men's Christian Association and the Japanese American Citizens' League in San Francisco, including papers of the Japanese YMCA's executive secretary Lincoln Kanai; Sakai family papers; Goodman's correspondence to and from Japanese American incarcerees, organizations opposing forced removal and incarceration of Japanese Americans, the War Relocation Authority, and others; publications, photographs, and ephemera from the Topaz Relocation Center, where Goodman taught high school; War Relocation Authority records and publications; and newspaper clippings, pamphlets, and reports about forced removal and incarceration created by various government, religious, and civic organizations, in California and nationwide
Abstraction and invariance for algebraically indexed types
No full textReynolds’ relational parametricity provides a powerful way to rea- son about programs in terms of invariance under changes of data representation. A dazzling array of applications of Reynolds’ the- ory exists, exploiting invariance to yield “free theorems”, non- inhabitation results, and encodings of algebraic datatypes. Outside computer science, invariance is a common theme running through many areas of mathematics and physics. For example, the area of a triangle is unaltered by rotation or flipping. If we scale a trian- gle, then we scale its area, maintaining an invariant relationship be- tween the two. The transformations under which properties are in- variant are often organised into groups, with the algebraic structure reflecting the composability and invertibility of transformations. In this paper, we investigate programming languages whose types are indexed by algebraic structures such as groups of ge- ometric transformations. Other examples include types indexed by principals–for information flow security–and types indexed by distances–for analysis of analytic uniform continuity properties. Following Reynolds, we prove a general Abstraction Theorem that covers all these instances. Consequences of our Abstraction Theo- rem include free theorems expressing invariance properties of pro- grams, type isomorphisms based on invariance properties, and non- definability results indicating when certain algebraically indexed types are uninhabited or only inhabited by trivial programs. We have fully formalised our framework and most examples in Coq
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Liftings for noncomplete probability spaces
No full textThe current state of knowledge concerning liftings for noncomplete probability spaces is discussed. This is a somewhat expanded version of the author's talk given at the 1991 Summer Conference on General Topology and Applications in Honor of Mary Ellen Rudin and Her Work.PT: S; CR: BURKE MR, IN PRESS P AM MATH S BURKE MR, 1991, ISRAEL J MATH, V73, P33 BURKE MR, 1992, ISRAEL J MATH, V79, P289 CARLSON T, THEOREM LIFTING CHRISTENSEN JPR, 1974, TOPOLOGY BOREL STRUC FREMLIN DH, 1989, HDB BOOLEAN ALGEBRAS, P877 INOESCUTULCEA A, 1966, 5TH P BERK S MATH ST, V2 IONESCUTULCEA A, 1967, CONTRIBUTIONS PROB 1, P63 IONESCUTULCEA A, 1969, TOPICS THEORY LIFTIN JECH TJ, 1978, SET THEORY JOHNSON RA, 1980, P AM MATH SOC, V80, P234 JUST W, IN PRESS T AM MATH S KUPKA J, 1983, INDIANA U MATH J, V32, P717 LOSERT V, 1983, LNM, V1080, P95 MAHARAM D, 1958, P AM MATH SOC, V9, P987 SHELAH S, 1983, ISRAEL J MATH, V45, P90 TALAGRAND M, 1982, P AM MATH SOC, V84, P379 VONNEUMANN J, 1931, CRELLES J MATH, V165, P109; NR: 18; TC: 0; J9: ANN N Y ACAD SCI; PG: 4; GA: BZ86BSource type: Electronic(1
- …
