Several types of types in programming languages

Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming languages with the concept of the same name in mathematical logic, an identification that is only the result of the convergence of two different paths, which started apart with different aims. The paper will present several remarks (some historical, some of more conceptual character) on the subject, as a basis for a further investigation. The thesis we will argue is that there are three different characters at play in programming languages, all of them now called types: the technical concept used in language design to guide implementation; the general abstraction mechanism used as a modelling tool; the classifying tool inherited from mathematical logic. We will suggest three possible dates ad quem for their presence in the programming language literature, suggesting that the emergence of the concept of type in computer science is relatively independent from the logical tradition, until the Curry-Howard isomorphism will make an explicit bridge between them.Comment: History and Philosophy of Computing, HAPOC 2015. To appear in LNC

A Variant of Earley Parsing

The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a ``delayed'' recognition of constituents. This allows us to start the recognition of a constituent only in cases in which all of its subconstituents have been found within the input string. This is particularly advantageous in several cases in which partial analysis of a constituent cannot be completed and in general in all cases of productions sharing some suffix of their right-hand sides (even for different left-hand side nonterminals). Although the two algorithms result in the same asymptotic time and space complexity, from a practical perspective our algorithm improves the time and space requirements of the original method, as shown by reported experimental results.Comment: 12 pages, 1 Postscript figure, uses psfig.tex and llncs.st

Imaging the Algol Triple System in H Band with the CHARA Interferometer

Algol (Beta Per) is an extensively studied hierarchical triple system whose inner pair is a prototype semi-detached binary with mass transfer occurring from the sub-giant secondary to the main-sequence primary. We present here the results of our Algol observations made between 2006 and 2010 at the CHARA interferometer with the Michigan Infrared Combiner in the H band. The use of four telescopes with long baselines allows us to achieve better than 0.5 mas resolution and to unambiguously resolve the three stars. The inner and outer orbital elements, as well as the angular sizes and mass ratios for the three components are determined independently from previous studies. We report a significantly improved orbit for the inner stellar pair with the consequence of a 15% change in the primary mass compared to previous studies. We also determine the mutual inclination of the orbits to be much closer to perpendicularity than previously established. State-of-the-art image reconstruction algorithms are used to image the full triple system. In particular an image sequence of 55 distinct phases of the inner pair orbit is reconstructed, clearly showing the Roche-lobe-filling secondary revolving around the primary, with several epochs corresponding to the primary and secondary eclipses

On the basis for ELF - An Extensible Language Facility

Computer language for data processing and information retrieva

Efficient Tabular LR Parsing

We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar transformations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time, is significantly reduced.Comment: 8 pages, uses aclap.st

Development of an MSC language and compiler, volume 1

Higher order programming language and compiler for advanced computer software system to be used with manned space flights between 1972 and 198