Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that coalgebraic strong (bi)similarity on their operational model is a congruence. In the present work, we establish a corresponding congruence theorem for weak similarity, which is shown to instantiate to well-known concepts such as Abramsky's applicative similarity for the lambda-calculus. On the way, we develop several techniques of independent interest at the level of abstract categories, including relation liftings of mixed-variance bifunctors and higher-order GSOS laws, as well as Howe's method

Designing intelligent computer‐based simulations: A pragmatic approach

This paper examines the design of intelligent multimedia simulations. A case study is presented which uses an approach based in part on intelligent tutoring system design to integrate formative assessment into the learning of clinical decision‐making skills for nursing students. The approach advocated uses a modular design with an integrated intelligent agent within a multimedia simulation. The application was created using an object‐orientated programming language for the multimedia interface (Delphi) and a logic‐based interpreted language (Prolog) to create an expert assessment system. Domain knowledge is also encoded in a Windows help file reducing some of the complexity of the expert system. This approach offers a method for simplifying the production of an intelligent simulation system. The problems developing intelligent tutoring systems are examined and an argument is made for a practical approach to developing intelligent multimedia simulation systems

The use of proof plans in tactic synthesis

We undertake a programme of tactic synthesis. We first formalize the notion of a tactic as a rewrite rule, then give a correctness criterion for this by means of a reflection mechanism in the constructive type theory OYSTER. We further formalize the notion of a tactic specification, given as a synthesis goal and a decidability goal. We use a proof planner. CIAM. to guide the search for inductive proofs of these, and are able to successfully synthesize several tactics in this fashion. This involves two extensions to existing methods: context-sensitive rewriting and higher-order wave rules. Further, we show that from a proof of the decidability goal one may compile to a Prolog program a pseudo- tactic which may be run to efficiently simulate the input/output behaviour of the synthetic tacti

Coinductive Techniques on a Linear Quantum λ-Calculus

In this thesis, it is examined the issue of equivalence between linear terms in higher order languages, that is, in languages which allow to use functions as variables, and where variables which appear in the terms must be used exactly once. The work is developed focusing on the bisimulation method, with the purpose to compare this technique with that which has become the standard for the comparison between the terms of a language, i.e. the context equivalence. The thesis is divided into three parts: in the first one, the introduction of the bisimulation and context equivalence techniques takes place within a deterministic linear and typed language. In the second part, the same techniques are reformulated for a language that, while preserving the linearity, loses the deterministic connotation, allowing the terms to evaluate to a set of values each one having a certain probability to appear in the end of calculation. In the last part, a quantum language is examined, discussing the advantages of quantum computation, which allows to speed-up many of the algorithms of computation. Here one gives the concept of quantum program, which is inextricably linked to the (quantum) register where the qubits used in the computation are stored, entailing a more complex notion of equivalence between terms. The techniques to demonstrate that bisimulation is a congruence are not standard and have been used for the first time by Howe for untyped languages: within the thesis, one shows that bisimulation is a congruence in all considered languages but it coincides with the context equivalence relation only for the deterministic one. Indeed, extending the techniques already used by Howe to the probabilistic and quantum environment, it is shown, as non trivial result, that in probabilistic and quantum linear languages the bisimulation is contained in context equivalence relation

Socorro Chieftain, 06-07-1902

https://digitalrepository.unm.edu/socorro_c_news/1230/thumbnail.jp

Picking up the principles: An applied linguistic analysis of the legal problem genre

Legal study requires not only the learning of new content, but also the learning of a new academic discourse with its own lexico-semantic, syntactic, and discoursal features. This thesis explores the answering of legal problem questions as an important and distinct new genre that undergraduates studying law units need to achieve competence in. In order to delineate the general features of this genre, systemic functional linguistic (SFL) analyses were performed on a series of texts (a tutorial question, an assignment question, and an examination question) written by lecturers in the introductory Commerce course Principles of Commercial Law as exemplars of the answering of legal problem questions. SFL analyses were also conducted on a series of student texts (both native and non-native English speaking students\u27 answers to the examination question) which showed that considerable difficulties exist not only with the content, but also with the linguistic demands of writing in this particular genre. It follows that students may require specific training in picking up the principles . The pedagogical implications for both content and language staff teaching in this area are explored with particular reference to tertiary ESL/EFL students

In the Tribunal of Conscience: Mills v. Wyman Reconsidered

In this Article, Professor Watson explores the historical record surrounding Mills v. Wyman, 20 Mass (3 Pick) 207 (1825), one of the leading American cases on moral obligation in contract law. In Mills, the Massachusetts Supreme Judicial Court refused to enforce a father\u27s promise to compensate a Good Samaritan who had cared for the father\u27s dying son. Professor Watson combs the historical evidence--court records, census reports, genealogical data, probate records, military rolls, and so on-and argues that the Mills court got both the facts and the law wrong. According to Professor Watson, the father did not make the promise in question, the son did not die until years later, and the law did not mandate the holding in the case. Professor Watson then evaluates modem theories of moral obligation and argues that none of them fully explains or justifies the result in cases like Mills. He concludes by arguing for reform of moral obligation doctrine, and more generally, of consideration doctrine. He contends that promises should be binding if they are made with formalities indicating intent to be legally boun