In general, logic programs are undirected, i.e. there is no concept of ‘‘input’’ and ‘‘output’’ arguments to a procedure. An argument may be used either as an input or as an output argument, and programs may be executed either in a ‘‘forward’’ direction or in a ‘‘backward’’ direction. However, it is often the case that in a given program, a predicate is used with some of its arguments used cons...

Analytical inductive programming and evolutionary inductive programming are two opposing strategies for learning recursive programs from incomplete specifications such as input/output examples. Analytical inductive programming is data-driven, namely, the minimal recursive generalization over the positive input/output examples is generated by recurrence detection. Evolutionary inductive programm...

Converting programs from full or PR-Hume to FSMor HW-Hume involves transforming expression recursion to box iteration. However, this can add considerable overheads through unnecessary scheduling of other boxes dependent on the iteration output. Here we explore how analysis of output behaviour can identify boxes which may be executed independently of normal super-step scheduling, without affecti...

oriented textual output displayed on the screen was stored in the computer’s framebuffer. An access program could simply copy the contents of the framebuffer to a speech synthesizer, a Braille terminal or a Braille printer. Conversely, the contents of the framebuffer for a graphical interface are simple pixel values. To provide access to GUIs, it is necessary to intercept application output bef...

outputs relate to inputs by a match transition relation, given by a dependency analysis. Definition 4 (Match transition relation). A match transition of a CHR program P is an ordered pair M(i, j,k,l) = (out(i, j), in(k,l)), expressing a dependency between an output out(i, j) = (C(i, j),Gi) of OutP and an input in(k,l) = (C(k,l),Gk) of I nP, for which ∃θ : CT |= ((C(i, j) = C(k,l))∧Gi∧Gk)θ holds...

Much effort has been expended in the past years on the specification of the CORE and the GKS subprogram system standard proposals. Both have a common intent: They standardize the input/output interface between an application program and the graphics terminals. Such systems can not, however, address the modelling problem, i.e. ways and means to create or define graphical objects. This task is at...

BACKGROUND Studying rare outcomes, new interventions and diverse populations often requires collaborations across multiple health research partners. However, transferring healthcare research data from one institution to another can increase the risk of data privacy and security breaches. METHODS A working group of multi-site research programmers evaluated the need for tools to support data se...

Higher-order program transformations raise new challenges for proving properties of their output, since they resist traditional, rst-order proof techniques. In this work, we consider (1) the \one-pass" continuation-passing style (CPS) transformation, which is second-order, and (2) the occurrences of parameters of continuations in its output. To this end, we specify the one-pass CPS transformati...

We discuss the method of Inductive Assertions introduced by Floyd and refined by Hoare, and others. We will study the following idealized problem: Given a program written in a simple imperative language without input/output commands or procedure calls, is it correct? It is possible to introduce input/output, procedure calls and many other features for the programming language, but we will restr...

An understanding of the determinants of cardiac output is essential to both medical specialists in their dealing with heart disease and hypertension, and to surgical specialists who deal with shock states and the maintenance of adequate circulation during surgical procedures. In this program, I'll introduce you to some fundamental yet often misunderstood concepts about the determinants of cardi...