General Recursion via Coinductive Types

A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations, implementation of operational semantics, formalization of domain theory, and inductive definition of domain predicates. Here, a different solution is proposed: exploiting coinductive types to model infinite computations. To every type A we associate a type of partial elements Partial(A), coinductively generated by two constructors: the first, return(a) just returns an element a:A; the second, step(x), adds a computation step to a recursive element x:Partial(A). We show how this simple device is sufficient to formalize all recursive functions between two given types. It allows the definition of fixed points of finitary, that is, continuous, operators. We will compare this approach to different ones from the literature. Finally, we mention that the formalization, with appropriate structural maps, defines a strong monad.Comment: 28 page

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

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

Strong Zonation of Benthic Communities Across a Tidal Freshwater Height Gradient

Trade-offs associated with environmental gradients generate patterns of diversity and govern community organisation in a landscape. In freshwaters, benthic community structure is driven by trade-offs along generally orthogonal gradients of habitat permanence and predation—where ephemeral systems are physiologically harsh because of drying stress, but inhabitants are less likely to be under the intense predation pressure of more permanent waterbodies. However, in tidal freshwaters, these two stressors are compounding, and the trade-offs associated with them are decoupled. 2. We investigated benthic community structure in a tidal freshwater habitat. These communities experience a suite of conditions atypical for a freshwater habitat: twice-daily drying; and high predation pressure by mobile fishes. We compared benthic communities at three tidal heights (low, mid, high) and contrasted these with nearby non-tidal freshwaters that varied in their hydrology (permanent, temporary). 3. We found that communities were more strongly differentiated in tidal freshwater habitats than between permanent and temporary inland freshwaters, which was surprising given the high interconnectedness and condensed longitudinal scale of tidal habitats. The differentiation of communities in tidal habitats was probably driven by the combined gradients of desiccation risk at low tide and intense predation by fish at high tide—a combination of pressures that are novel for the evolutionary history of the regional freshwater invertebrate fauna. 4. Our study provides evidence that environmental gradients can produce stronger patterns of community zonation than would be predicted for habitats that are spatially contiguous and have little or no dispersal limitation. These results give insight into how communities might respond if drivers of community structure are altered or reorganised from their regional or evolutionary norms

Человек, которого мучила бесконечность. О мудрости тургеневской

Het Zwanenwater anno 2011: heidevelden, meren, graslanden vol orchideeën, moerasplanten, wilgenstruweel en duingraslanden richting de zeereep. In hoeverre komt dit beeld overeen met dat van eind 19e eeuw, toen enkele natuurkenners na een urenlange reis dit gebied wisten te bereiken? Zijn de omstandigheden nu anders en kan aan de hand van de natuur inzicht worden verkregen in de veranderingsprocessen

Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects

Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker

Since the proof of the four color theorem in 1976, computer-generated proofs have become a reality in mathematics and computer science. During the last decade, we have seen formal proofs using verified proof assistants being used to verify the validity of such proofs. In this paper, we describe a formalized theory of size-optimal sorting networks. From this formalization we extract a certified checker that successfully verifies computer-generated proofs of optimality on up to 8 inputs. The checker relies on an untrusted oracle to shortcut the search for witnesses on more than 1.6 million NP-complete subproblems.Comment: IMADA-preprint-c

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