into two principal paradigms: model-theoretic syntax (MTS), which

. Functional languages are based on the notion of application: programs may be applied to data or programs. By application one may define algebraic functions; and a programming language is functionally complete when any algebraic function f(x 1 ,...,x n ) is representable (i.e. there is a constant a such that f(x 1 ,...,x n ) = (a . x 1 . ... . x n ). Combinatory Logic is the simplest type-free language which is functionally complete. In a sound category-theoretic framework the constant a above may be considered as an "abstract gödel-number" for f, when gödel-numberings are generalized to "principal morphisms", in suitable categories. By this, models of Combinatory Logic are categorically characterized and their relation is given to lambda-calculus models within Cartesian Closed Categories. Finally, the partial recursive functionals in any finite higher type are shown to yield models of Combinatory Logic. ________________ (+) Theoretical Computer Science, 70 (2), 1990, pp.193-211. A p...

this paper we introduce another abstract machine, Categorical MultiCombinator Machine, (CMCM). In this paper we give a thoroughgoing introduction to the machine, in particular as far as the discussion of sharing of computational information is concerned. The approaches of both TIM and the CMCM depend upon the source code being l-lifted before the translation takes place. This transformation, discovered by Johnsson [Joh], independently of related work by Hughes into supercombinators, has the effect of making flat the environments in which function bodies are interpreted. The transformation only came to light with the work on combinators, mentioned above, so perhaps reflecting the epigraph. In another paper, [LiTh], we discuss in detail the close relationship between the TIM and the CMCM. CMCM 10/7/92 2 CATEGORICAL MULTI-COMBINATORS The second author in his thesis [Lins1] introduces the system of categorical multi-combinators, which are based on Curien's categorical combinators [Cur], which in turn have their foundation in the theory of Cartesian Closed categories [Sco]. The major innovation of the multicombinators is that a number of b-reductions can be performed in a single step of rewriting, rather than in a sequence of such steps. This offers the possibility of increasing the efficiency of a rewriting implementation considerably; a similar idea has been discussed by the implementors of the G-machine [Joh2]. The syntax of categorical multi-combinators consists of variables, n,... the constants P,

Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages � and it is folklore that the calculus is the prototypical functional language in puri ed form. The course investigates the syntax and semantics of lambda calculus both as a theory of functions from a foundational point of view, and as a minimal programming language. Synopsis Formal theory, xed point theorems, combinatory logic: combinatory completeness, translations between lambda calculus and combinatory logic � reduction: Church-Rosser theorem � Bohm's theorem and applications � basic recursion theory � lambda calculi considered as programming languages � simple type theory and pcf: correspondence between operational and denotational semantics � current developments. Relationship with other courses Basic knowledge of logic and computability in paper B1 is assumed.

Engberg and Winskel's Petri net semantics of linear logic is re-considered, from the point of view of the logic BI of bunched implications. We first show how BI can be used to overcome a number of difficulties pointed out by Engberg and Winskel, and we argue that it provides a more natural logic for the net semantics. We then briefly consider a more expressive logic based on an extension of BI with classical and modal features.

The -calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of -conversion is shown to be deductively complete with respect to such topological semantics. It is also shown to be functionally complete, in the sense that there is always a "minimal" topological model, in which every continuous function is -definable. These results subsume earlier ones using cartesian closed categories, as well as those employing so-called Henkin and Kripke -models. Introduction The -calculus originates with Church [6]; it is intended as a formal calculus of functional application and specification. In this paper, we are mainly interested in the version known as simply typed -calculus ; as is now wellknown, the untyped version can be treated as a special case of this ([17]). We present here a topological representation of the -calculus: types are represented by cert...

In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in the tree that embodies all possible input sequences.

5.1 Definition and Examples 5.1.1 Definition and Definability Results A tripos is a weak tripos with disjunction which has a (weak) generic object. Explicitly we define:

Classical recursion theory asserts that all conventional programming languages are equally expressive because they can define all partial recursive functions over the natural numbers. However, most real programming languages support some form of higher-order data such as potentially infinite streams, lazy trees, and functions. Since these objects do not have finite canonical representations, computations over these objects cannot be accurately modeled as ordinary computations over the natural numbers. In my thesis, I develop a theory of higher order computability based on a new formulation of domain theory. This new formulation interprets elements of any data domain as lazy trees. Like classical domain theory, it provides a universal domain T and a universal language KL. A rich class of domains called observably sequential domains can be specified in T with functions definable in KL. Such an embedding of a data domain enables the operations on the domain to be defined in the universa...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS