A deep quantitative type system

We investigate intersection types and resource lambda-calculus in deep-inference proof theory. We give a unified type system that is parametric in various aspects: it encompasses resource calculi, intersection-typed lambda-calculus, and simply-typed lambda-calculus; it accommodates both idempotence and non-idempotence; it characterizes strong and weak normalization; and it does so while allowing a range of algebraic laws to determine reduction behaviour, for various quantitative effects. We give a parametric resource calculus with explicit sharing, the "collection calculus", as a Curry-Howard interpretation of the type system, that embodies these computational properties

Node Replication: Theory And Practice

We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools.Comment: 64 pages, submitted to LMC

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.

Estimation of the length of interactions in arena game semantics

We estimate the maximal length of interactions between strategies in HO/N game semantics, in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in simply typed lambdacalculus. Because of the operational content of game semantics, the bounds presented here also apply to head linear reduction on lambda-terms and to the execution of programs by abstract machines (PAM/KAM), including in presence of computational effects such as non-determinism or ground type references. The proof proceeds by extracting from the games model a combinatorial rewriting rule on trees of natural numbers, which can then be analyzed independently of game semantics or lambda-calculus.Comment: Foundations of Software Science and Computational Structures 14th International Conference, FOSSACS 2011, Saarbr\"ucken : Germany (2011

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.

Focal Spot, Fall 1984

https://digitalcommons.wustl.edu/focal_spot_archives/1038/thumbnail.jp

The recursion hierarchy for PCF is strict

We consider the sublanguages of Plotkin's PCF obtained by imposing some bound k on the levels of types for which fixed point operators are admitted. We show that these languages form a strict hierarchy, in the sense that a fixed point operator for a type of level k can never be defined (up to observational equivalence) using fixed point operators for lower types. This answers a question posed by Berger. Our proof makes substantial use of the theory of nested sequential procedures (also called PCF B\"ohm trees) as expounded in the recent book of Longley and Normann

Differentiation of femur bone from surrounding soft tissue using laserinduced breakdown spectroscopy as a feedback system for Smart Laserosteotomy

Although laserosteotomes have become generally accepted devices in surgical applications, they still suffer from a lack of information about the type of tissue currently being ablated; as a result, critical structures of the body under or near the focal spot of the laser beam are prone to inadvertent ablation. The lack of information about the properties of the ablated tissue can be solved by connecting the laserosteotome to an optical detection setup which can differentiate various types of tissues, especially bone from connective soft tissues. This study examines the applicability of laser-induced breakdown spectroscopy (LIBS) as a potential technique to differentiate bone from surrounding soft tissue (fat and muscle). In this experiment, fresh porcine femur bone, muscle, and fat were used as hard and soft tissue samples. The beam of a nanosecond frequency-doubled Nd:YAG laser was used to ablate the tissue samples and generate the plasma. The plasma light emitted from the ablated spot, which corresponds to the recombination spectra of ionized atoms and molecules, was gathered with a collection optic (including a reflective light collector and a fiber optic) and sent to an Echelle spectrometer for resolving the atomic composition of the ablated sample. Afterwards, Discriminant Function Analysis (DFA) based on the ratio of the intensity of selected peak pairs was performed to classify three sample groups (bone, muscle, and fat). Lastly, the sensitivity, specificity, and accuracy of the proposed method were calculated. Sensitivity and specificity of 100 % and 99 % were achieved, respectively, to differentiate bone from surrounding soft tissue

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems