Abstract Aim Surgical patients require closure of wounds with skin clips or sutures. Removal at an appropriate time can prevent complications, namely infection. Our goal is to ensure clear documentation type and plan for removal. The Royal College Surgeons states that “details technique” “detailed post-operative care instructions” are required. Method Retrospective data collections were underta...

We propose axioms for 1-free omega algebra, typed 1-free omega algebra and typed omega algebra. They are based on Kozen’s axioms for 1-free and typed Kleene algebra and Cohen’s axioms for the omega operation. In contrast to Kleene algebra, several laws of omega algebra turn into independent axioms in the typed or 1-free variants. We set up a matrix algebra over typed 1-free omega algebras by li...

An interpretation of Abadi and Cardelli's rst-order functional Object Calculus AC94b] into a typed-calculus is presented. The interpretation validates the subtyping relation and the typing judgements of the Object Calculus, and is computationally adequate. The type language for the-calculus is that in PS93] a development of Milner's sorting discipline Mil91] with I/O annotations to separate the...

Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language. Existing implementations of gradually typed languages have not achieved this goal due to overheads associated with runtime casts. Takikawa et al. (2016) report up to 100×...

Step-indexed logical relations are an extremely useful technique for building operational-semantics-based models and program logics realistic, richly-typed programming languages. They have proven to be indispensable modeling features like higher-order state , which many languages support but were difficult accommodate using traditional denotational models. However, the conventional wisdom is th...

We give two categorical programming languages with variable arrows and associated abstraction/reduction mechanisms, which extend the possibility of categorical programming Hag87, CF92] in practice. These languages are complementary to each other { one of them provides a rst-order programming style whereas the other does higher-order { and are \children" of the simply typed lambda calculus in th...

Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to build semantic models for typing judgments in TALs based on an induction technique, so that both the type-safety theorem and the typing rules can be proved as lemmas in a simple logic. We demonstrate this technique b...

The article deals with the denotational semantics of a special query language called XML-Lambda (abbreviated as XML-λ), which is based on the simply typed lambda calculus. The exact semantics allows experimentation with a language definition, prototyping of programs, and similar experiments. One of such experiment is the implementation of the XQuery language in the XML-λ environment. The main a...

This paper considers the existence of nite equational axiomatisations of bisimulation over a calculus of nite state processes. To express even simple properties such as XE = XE[E=X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing axioms such as the above to be written as equations of higher typ...