A pervasive challenge in programming theory and practice are feature combinations. Here, we propose a semantic framework that combines monad-based computational effects (e.g. store, nondeterminism, random), underdefined or free operations (e.g. actions in process algebra and automata, exceptions), and recursive definitions (e.g. loops, systems of process equations). The joint treatment of these...

Composition synthesis is based on the idea of using inhabitation in combinatory logic with intersection types as a foundation for computing compositions from component repositories. Components implemented in a language L1 are exposed to composition synthesis in the form of typed combinator symbols. In practice, it is useful to augment the collection of components in the implementation language ...

We show that self-referentiality can be formalized in Basic logic by means of a new connective: @, called "entanglement". In fact, the property of non-idempotence of the connective @ is a metatheorem, which states that a self-referential sentence loses its own identity. This prevents having self-referential paradoxes in the corresponding metalanguage.

This paper links Systemic Functional-based multimodal discourse analysis and English as a Foreign Language (EFL) teacher education through the workshop “Multimodal Literacy in EFL classroom” (MLEFL). Drawing upon ‘multimodal for critical thinking’ (MACT) pedagogy (O’Halloran et al., 2017) Approach to teaching viewing (Lim Tan, 2017, Lim, 2018), MLEFL aims at involving student teachers (STs) tra...

This paper presents a typed higher-order concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that a higherorder variant of the traces model is fully abstract for maytesting. This proof uses a program logic based on Hennessy– Milner logic and Abramsky’s domain theory in logical...

A semantic formulation of Lindley and Stark’s >>-lifting is given. We first illustrate our semantic formulation of the >>-lifting in Set with several examples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic >>-lifting as the lifting of strong monads across bifibrations with lifted symmetric monoidal closed structures.

Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their characteristics vary significantly. This paper describes a paradigm for practical general shape grammar interpreters, which aim to address computational difficulties posed by parameterization. The paradigm is expressed in terms of frameworks each comprising an underlying data structure, manipulation algori...

We describe Fresh O’Caml, a metalanguage equipped with facilities to manipulate object-level syntax involving α-convertible names and binding operations. The language extensions made to Objective Caml are surveyed from a practical perspective and the implementation details are briefly discussed.

Synopsis Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and recursive types) are deened. Then, domain-theoretic models of FPC are axiomatised and a wide subclass of them |the non-trivial and absolute ones| are proved to be both computationally sound and adequate. Examples include: the category of cpos and partial continuous functions and functor cate...

A variety of approaches to knowledge base refinement [3, 81 and rule acquistion [4] have appeared recently. This paper is concerned with the means by which alternative refinement systems themselves may be specified, developed, and studied. The anticipated virtues of taking a metalinguistic approach to these tasks are described, and shown to be confirmed by experience with an actual refinement m...