A program logic for higher-order procedural variables and non-local jumps

Relying on the formulae-as-types paradigm for classical logic, we define a program logic for an imperative language with higher-order procedural variables and non-local jumps. Then, we show how to derive a sound program logic for this programming language. As a by-product, we obtain a non-dependent type system which is more permissive than what is usually found in statically typed imperative languages. As a generic example, we encode imperative versions of delimited continuations operators shift and reset

Real Islamic Logic

Four options for assigning a meaning to Islamic Logic are surveyed including a new proposal for an option named "Real Islamic Logic" (RIL). That approach to Islamic Logic should serve modern Islamic objectives in a way comparable to the functionality of Islamic Finance. The prospective role of RIL is analyzed from several perspectives: (i) parallel distributed systems design, (ii) reception by a community structured audience, (iii) informal logic and applied non-classical logics, and (iv) (in)tractability and artificial intelligence

SAGA: A project to automate the management of software production systems

The Software Automation, Generation and Administration (SAGA) project is investigating the design and construction of practical software engineering environments for developing and maintaining aerospace systems and applications software. The research includes the practical organization of the software lifecycle, configuration management, software requirements specifications, executable specifications, design methodologies, programming, verification, validation and testing, version control, maintenance, the reuse of software, software libraries, documentation, and automated management

Unifying Semantic Foundations for Automated Verification Tools in Isabelle/UTP

The growing complexity and diversity of models used for engineering dependable systems implies that a variety of formal methods, across differing abstractions, paradigms, and presentations, must be integrated. Such an integration requires unified semantic foundations for the various notations, and co-ordination of a variety of automated verification tools. The contribution of this paper is Isabelle/UTP, an implementation of Hoare and He’s Unifying Theories of Programming, a framework for unification of formal semantics. Isabelle/UTP permits the mechanisation of computational theories for diverse paradigms, and their use in constructing formalised semantics. These can be further applied in the development of verification tools, harnessing Isabelle’s proof automation facilities. Several layers of mathematical foundations are developed, including lenses to model variables and state spaces as algebraic objects, alphabetised predicates and relations to model programs, algebraic and axiomatic semantics, proof tools for Hoare logic and refinement calculus, and UTP theories to encode computational paradigms

Parameterized monads in linguistics

A thesis submitted in partial fulfilment of the requirements of the University of Wolverhampton for the degree of Doctor of Philosophy.This dissertation follows the formal semantics approach to linguistics. It applies recent developments in computing theories to study theoretical linguistics in the area of the interaction between semantics and pragmatics and analyzes several natural language phenomena by parsing them in these theories. Specifically, this dissertation uses parameterized monads, a particular theoretical framework in category theory, as a dynamic semantic framework to reinterpret the compositional Discourse Representation Theory(cDRT), and to provide an analysis of donkey anaphora. Parameterized monads are also used in this dissertation to interpret information states as lists of presuppositions, and as dot types. Alternative interpretations for demonstratives and imperatives are produced, and the conventional implicature phenomenon in linguistics substantiated, using the framework. Interpreting donkey anaphora shows that parameterized monads is able to handle the sentential dependency. Therefore, this framework shows an expressive power equal to that of related frameworks such as the typed logical grammar and the dynamic predicate logic. Interpreting imperatives via parameterized monads also provides a compositional dynamic semantic analysis which is one of the main approaches to analysing imperatives