- OpenBU
- →
- College of Arts and Sciences
- →
- Browsing College of Arts and Sciences by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing College of Arts and Sciences by Title
Now showing items 1192-1211 of 1265
-
(Boston University Computer Science Department, 1993-08-01)We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types ...
-
(Boston University Computer Science Department, 1996-03-09)System F is the well-known polymorphically-typed λ-calculus with universal quantifiers ("∀"). F+η is System F extended with the eta rule, which says that if term M can be given type τ and M η-reduces to N, then N can also ...
-
(Boston University Computer Science Department, 2005-05-01)The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average ...
-
(Boston University Computer Science Department, 2008-10-09)We first introduce a very simple typed language for expressing allocation algorithms that allows automatic verification that an algorithm is monotonic and therefore truthful. The analysis of truthfulness is accomplished ...
-
(Boston University Computer Science Department, 2000-03-06)We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant's notion of rank. To motivate our work, we ...
-
(Boston University Computer Science Department, 2000-10-16)Existing type systems for object calculi are based on invariant subtyping. Subtyping invariance is required for soundness of static typing in the presence of method overrides, but it is often in the way of the expressive ...
-
(Boston University Computer Science Department, 1993-12-20)We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. ...
-
(Boston University Computer Science Department, 2008-06-14)snBench is a platform on which novice users compose and deploy distributed Sense and Respond programs for simultaneous execution on a shared, distributed infrastructure. It is a natural imperative that we have the ability ...
-
(Boston University Computer Science Department, 2005-12-28)When analysing the behavior of complex networked systems, it is often the case that some components within that network are only known to the extent that they belong to one of a set of possible "implementations" – e.g., ...
-
(CS Department, Boston University, 2010-01-24)Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1999-10)An outstanding problem in psychiatry concerns how to link discoveries about the pharmacological, neurophysiological, and neuroanatomical substrates of mental disorders to the abnormal behaviors that they control. A related ...
-
(Boston University Computer Science Department, 1995-12-10)Mitchell defined and axiomatized a subtyping relationship (also known as containment, coercibility, or subsumption) over the types of System F (with "→" and "∀"). This subtyping relationship is quite simple and does not ...
-
(Boston University Computer Science Department, 2000-07-03)Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint ...
-
(Boston University Computer Science Department, 2002)The objective of unicast routing is to find a path from a source to a destination. Conventional routing has been used mainly to provide connectivity. It lacks the ability to provide any kind of service guarantees and smart ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1992-07)A computational model of visual processing in the vertebrate retina provides a unified explanation of a range of data previously treated by disparate models. Three results are reported here: the model proposes a functional ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2008-06)Sensors working at different times, locations, and scales, and experts with different goals, languages, and situations, may produce apparently inconsistent image labels that are reconciled by their implicit underlying ...
-
(University of Washington Press, 2013-01-24)
-
(Boston University Computer Science Department, 2008-02-15)We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1994-06)We have recently introduced a neural network mobile robot controller (NETMORC). The controller is based on earlier neural network models of biological sensory-motor control. We have shown that NETMORC is able to guide a ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1993-10)This article introduces an unsupervised neural architecture for the control of a mobile robot. The system allows incremental learning of the plant during robot operation, with robust performance despite unexpected changes ...
Now showing items 1192-1211 of 1265
