85,317 research outputs found
Safe Compositional Specification of Network Systems With Polymorphic, Constrained Types
In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It allows safety property to be formalized in terms of types and subtyping relations. Extending upon our previous work, we add Hindley-Milner style polymorphism [8] with constraints [9] to the type system of TRAFFIC. This allows a programmer to use for-all quantifier to describe types of network components, escalating power and expressiveness of types to a new level that was not possible before with propositional subtyping relations. Furthermore, we design our type system with a pluggable constraint system, so it can adapt to different application needs while maintaining soundness.
In this paper, we show the soundness of the type system, which is not syntax-directed but is easier to do typing derivation. We show that there is an equivalent syntax-directed type system, which is what a type checker program would implement to verify the safety of a network flow. This is followed by discussion on several constraint systems: polymorphism with subtyping constraints, Linear Programming, and Constraint Handling Rules (CHR) [3]. Finally, we provide some examples to illustrate workings of these constraint systems.National Science Foundation (CCR-0205294
Bimodal activation of different neuron classes with the spectrally red-shifted channelrhodopsin chimera C1V1 in Caenorhabditis elegans
The C. elegans nervous system is particularly well suited for optogenetic analyses of circuit function: Essentially all connections have been mapped, and light can be directed at the neuron of interest in the freely moving, transparent animals, while behavior is observed. Thus, different nodes of a neuronal network can be probed for their role in controlling a particular behavior, using different optogenetic tools for photo-activation or –inhibition, which respond to different colors of light. As neurons may act in concert or in opposing ways to affect a behavior, one would further like to excite these neurons concomitantly, yet independent of each other. In addition to the blue-light activated Channelrhodopsin-2 (ChR2), spectrally red-shifted ChR variants have been explored recently. Here, we establish the green-light activated ChR chimera C1V1 (from Chlamydomonas and Volvox ChR1′s) for use in C. elegans. We surveyed a number of red-shifted ChRs, and found that C1V1-ET/ET (E122T; E162T) works most reliable in C. elegans, with 540–580 nm excitation, which leaves ChR2 silent. However, as C1V1-ET/ET is very light sensitive, it still becomes activated when ChR2 is stimulated, even at 400 nm. Thus, we generated a highly efficient blue ChR2, the H134R; T159C double mutant (ChR2-HR/TC). Both proteins can be used in the same animal, in different neurons, to independently control each cell type with light, enabling a further level of complexity in circuit analyses
A Decidable Confluence Test for Cognitive Models in ACT-R
Computational cognitive modeling investigates human cognition by building
detailed computational models for cognitive processes. Adaptive Control of
Thought - Rational (ACT-R) is a rule-based cognitive architecture that offers a
widely employed framework to build such models. There is a sound and complete
embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis
techniques from CHR can be used to reason about computational properties of
ACT-R models. For example, confluence is the property that a program yields the
same result for the same input regardless of the rules that are applied.
In ACT-R models, there are often cognitive processes that should always yield
the same result while others e.g. implement strategies to solve a problem that
could yield different results. In this paper, a decidable confluence criterion
for ACT-R is presented. It allows to identify ACT-R rules that are not
confluent. Thereby, the modeler can check if his model has the desired
behavior.
The sound and complete translation of ACT-R to CHR from prior work is used to
come up with a suitable invariant-based confluence criterion from the CHR
literature. Proper invariants for translated ACT-R models are identified and
proven to be decidable. The presented method coincides with confluence of the
original ACT-R models.Comment: To appear in Stefania Costantini, Enrico Franconi, William Van
Woensel, Roman Kontchakov, Fariba Sadri, and Dumitru Roman: "Proceedings of
RuleML+RR 2017". Springer LNC
Towards a Generic Trace for Rule Based Constraint Reasoning
CHR is a very versatile programming language that allows programmers to
declaratively specify constraint solvers. An important part of the development
of such solvers is in their testing and debugging phases. Current CHR
implementations support those phases by offering tracing facilities with
limited information. In this report, we propose a new trace for CHR which
contains enough information to analyze any aspects of \CHRv\ execution at some
useful abstract level, common to several implementations. %a large family of
rule based solvers. This approach is based on the idea of generic trace. Such a
trace is formally defined as an extension of the semantics of
CHR. We show that it can be derived form the SWI Prolog CHR trace
Constraint Handling Rules with Binders, Patterns and Generic Quantification
Constraint Handling Rules provide descriptions for constraint solvers.
However, they fall short when those constraints specify some binding structure,
like higher-rank types in a constraint-based type inference algorithm. In this
paper, the term syntax of constraints is replaced by -tree syntax, in
which binding is explicit; and a new generic quantifier is introduced,
which is used to create new fresh constants.Comment: Paper presented at the 33nd International Conference on Logic
Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017
16 pages, LaTeX, no PDF figure
- …