A lambda calculus for quantum computation with classical control

The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and we give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.Comment: 15 pages, submitted to TLCA'05. Note: this is basically the work done during the first author master, his thesis can be found on his webpage. Modifications: almost everything reformulated; recursion removed since the way it was stated didn't satisfy lemma 11; type inference algorithm added; example of an implementation of quantum teleportation adde

ASMs and Operational Algorithmic Completeness of Lambda Calculus

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step of the algorithm can be simulated by exactly K successive reductions in a natural extension of lambda calculus with constants for functions in the above considered family. The proof is based on a fixed point technique in lambda calculus and on Gurevich sequential Thesis which allows to identify sequential deterministic algorithms with Abstract State Machines. This extends to algorithms for partial computable functions in such a way that finite computations ending with exceptions are associated to finite reductions leading to terms with a particular very simple feature.Comment: 37 page

The case of classroom robots: teachers’ deliberations on the ethical tensions

Robots are increasingly being studied for use in education. It is expected that robots will have the potential to facilitate children’s learning and function autonomously within real classrooms in the near future. Previous research has raised the importance of designing acceptable robots for different practices. In parallel, scholars have raised ethical concerns surrounding children interacting with robots. Drawing on a Responsible Research and Innovation perspective, our goal is to move away from research concerned with designing features that will render robots more socially acceptable by end users toward a reflective dialogue whose goal is to consider the key ethical issues and long-term consequences of implementing classroom robots for teachers and children in primary education. This paper presents the results from several focus groups conducted with teachers in three European countries. Through a thematic analysis, we provide a theoretical account of teachers’ perspectives on classroom robots pertaining to privacy, robot role, effects on children and responsibility. Implications for the field of educational robotics are discussed.info:eu-repo/semantics/acceptedVersio

A Vernacular for Coherent Logic

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.Comment: CICM 2014 - Conferences on Intelligent Computer Mathematics (2014

Human Hair Morphology: A Scanning Electron Microscopy Study on a Male Caucasoid and a Computerized Classification of Regional Differences

The present study was performed to provide a better understanding of the morphological variations of mammalian hair. Terminal hair samples were obtained from different regions of the body of the same Caucasian male. All hair samples were either cleaned or treated before being examined with scanning electron microscopy. As human scalp hair grew it appeared small like lanugo hair, but the increase in diameter appeared to have been relatively rapid. As hair increased in diameter the appearance of the scales changed. Neck hair was slightly smaller in diameter than scalp hair, and axillary hair was slightly smaller in diameter than neck hair. Nostril hair was larger than scalp or axillary hair. Eyelash hair was much smaller and much shorter than eyebrow hair. Neck hair, forearm hair, and shin hair were smaller than hair from most other regions of the body. Chest hair was similar in size to scalp hair, and pubic and sideburn hair were larger than scalp hair. A morphological feature called steak-boning was more characteristically present in whiskers of Caucasoids than Orientals or Blacks. Steak-boning occurred most frequently in hair of the mustache, followed by that of the chin, sideburn, cheek and under the chin. Cut surfaces of whiskers were different for electric as compared with straightedge razors. Hair morphology varied relative to the body region. Computer analysis of resin-embedded hair made it possible to classify arm, mustache, cheek, chin, head, shin, and pubic hair, and to quantify cross-sectioned differences

SCC: A Service Centered Calculus

We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCC’s session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones