1,455 research outputs found

    CONCUR test-of-time award for the period 1994–97 interview with uwe nestmann and Benjamin C. Pierce

    No full text
    Last year, the CONCUR conference series inaugurated its Test-of-Time Award, the purpose of which is to recognise important achievements in Concurrency Theory that were published at the conference and have stood the test of time. This year, Decoding Choice Encodings by Uwe Nestmann and Benjamin C. Pierce was one of four papers chosen to receive the CONCUR Test-of-Time Award for the periods 1994–1997 and 1996–1999 by a jury consisting of Rob van Glabbeek (chair), Luca de Alfaro, Nathalie Bertrand, Catuscia Palamidessi, and Nobuko Yoshida. This article is devoted to the engaging and interesting interview conducted with Uwe Nestmann and Benjamin C. Pierce via video conference

    Historic tree at Mission Carmel (San Carlos Borromeo de Carmelo) in Monterey, ca.1888

    No full text
    Photograph of the historic tree at Mission Carmel (San Carlos Borromeo de Carmelo) in Monterey, ca.1888. The tree stands at center, growing from the slope of a hill that feeds into the dry ravine at left. In the background left, the gaurd rail of a bridge can be seen.; "Viscaino hung bell on this tree and held mass in 1602 and Father Juniper Serra utilized it for the same purpose June 3, 1770 when he first landed to establish a mission for Saint Charles. [Also the boat was tied here.] The tree fell early in 1900 and the trunk was removed to the garden at rear of San Carlos Mission in Monterey. Photo made by a Mr. Adams [a photographer of Monterey about 1890] abt. 1880 and [negative] purchased from him about 1895 by C.C. Pierce". -- Unknown author

    Preface Volume 16, Issue 3

    No full text
    AbstractThe HLCL workshops are intended to bring together researchers involved in the design, development, foundations, and applications of high-level concurrent programming languages and models.Programming models should be simple, practical, high-level, and well founded. These qualities allow rigorous language specifications and support both formal and informal reasoning about programs. For concurrent and distributed systems, research on programming models has driven the design of several recent programming languages, including Erlang, versions of ML, like CML, Facile, and Haskell, as well as languages explicitly designed for concurrency or distribution such as Obliq, Oz, Pict, and the Join-Calculus language. Although the motivations behind the design of these languages are diverse (ranging from the development of graphical user interfaces and multi-agent systems to constraint, real-time, and distributed programming), suitable foundations have turned out to be quite similar in style and technique, often based on variants of well-known calculi for mobile processes.The first HLCL Workshop was organized by Benjamin Pierce and Matthew Hennessy at the Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK, in October 1995. The second HLCL Workshop was organized by Martin Müller and Joachim Niehren at Dagstuhl, Germany, in January 1997, chaired by Kohei Honda, Martin Odersky, Benjamin Pierce, Gert Smolka, and Phil Wadler. For more information see the workshop homepage.In addition to the six contributed papers presented at the workshop, this collection contains an abstract of the invited talk by James E. White (General Magic, US). We would like to thank the authors of the submitted papers, the invited speaker, and the members of the program committee for their contribution to both the meeting and this volume. We also would like to thank BRICS for the printing and Michael Mislove for his help with the editing of the proceedings, ERCIM for financial support, the CONCUR organizing committee at INRIA for hosting HLCL'98, and Silvano Dal-Zilio for further local organization

    Decorated steam locomotive used by President Benjamin Harrison, April 24, 1891

    No full text
    Photograph of the decorated steam locomotive used by President Benjamin Harrison, April 24, 1891. The fireman stands beside the engine leaning against it. The conductor stands up on the engine close to the control booth. Another railroad car is barely visible behind the locomotive. Hills rise in the distance at right. Caption reads "The President's 'Special', left Los Angeles April 24, 1891.

    Type systems for dummies

    No full text
    We extend Pure Type Systems with a function turning each term M of type A into a dummy |M| of the same type (|.| is not an identity, in that M ≠ |M|). Intuitively, a dummy represents an unknown, canonical object of the given type: dummies are opaque (cannot be internally inspected), and irrelevant in the sense that dummies of a same type are convertible to each other. This latter condition makes convertibility in PTS with dummies (DPTS) stronger than usual, hence raising not trivial consistency issues. DPTS offer an alternative approach to (proof) irrelevance, tagging irrelevant information at the level of terms and not of types, and avoiding the annoying syntactical duplication of products, abstractions and applications into an explicit and an implicit version, typical of systems like ICC*

    Four horse hack outside of the Los Angeles House hotel in Pasadena, at the disposal of United States President Benjamin Harrison, 1891

    No full text
    Photograph of a four horse hack outside of the Los Angeles House hotel in Pasadena, at the disposal of United States President Benjamin Harrison, 1891. Four horses, two black and two white, are hitched to a covered carriage decorated with leaves and flowers that stands in front of the Los Angeles House. The coachmen attends the horses' reigns. Behind, on the porch of the L.A. house, above which American flags and star-spangled ribbon are hung, spectators gather, looking out. A streetlamp and the rear of another carriage are visible to the extreme left

    Portrait of James Laughlin, author of "This Is My Blood," [s.d.]

    No full text
    Photographic portrait of James Laughlin, author of "This Is My Blood," [s.d.]. A elderly man with smiling eyes turns his face toward the camera. He has a slight smile on his face, and a large nose, bushy eyebrows and slicked-back graying hair. He wears a light-colored suit, striped tie, and undergarment.; The book was to be published March 3, 1989 in a limited edition by The Yolla Bolly Press

    Parameterised notions of computation

    No full text
    Moggi’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

    Pasadena looking east from Salt Lake Railroad Depot, ca.1887

    No full text
    Photograph of a view of Pasadena, looking east from the Salt Lake Railroad Depot along a rural street (Colorado Street?), ca.1887. The C. Ehrenfeld Carpenter Shop is in the right foreground. Railroad tracks (bottom foreground) run across the street. An orchard is on one side of the street. The residence of Dr. and Jeanne (the author) C. Carr is visible beyond the trees at center. A wooden building in the foreground at right has signs on it reading "C. Ehrenfeld, carpenter shop", "C. Ehrenfeld, architect & builder"
    corecore