Results 1  10
of
10
Power reduction techniques for microprocessor systems
 ACM Computing Surveys
, 2005
"... Power consumption is a major factor that limits the performance of computers. We survey the “state of the art ” in techniques that reduce the total power consumed by a microprocessor system over time. These techniques are applied at various levels ranging from circuits to architectures, architecture ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
Power consumption is a major factor that limits the performance of computers. We survey the “state of the art ” in techniques that reduce the total power consumed by a microprocessor system over time. These techniques are applied at various levels ranging from circuits to architectures, architectures to system software, and system
Impact for Agents
 In Proc. 4th Int. Joint Conf. on Autonomous Agents and MultiAgent Systems (Industry Track
, 2005
"... Impact for agents. Most of the agent research community has been predicting greater impact for years and many of us have been working to help the process along. Yet the tremendous growth on the research front has not been met with a ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Impact for agents. Most of the agent research community has been predicting greater impact for years and many of us have been working to help the process along. Yet the tremendous growth on the research front has not been met with a
A COMBINATORY ACCOUNT OF INTERNAL STRUCTURE
"... Abstract. Traditional combinatory logic is able to represent all Turing computable functions on natural numbers, but there are effectively calculable functions on the combinators themselves that cannot be so represented, because they have direct access to the internal structure of their arguments. S ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. Traditional combinatory logic is able to represent all Turing computable functions on natural numbers, but there are effectively calculable functions on the combinators themselves that cannot be so represented, because they have direct access to the internal structure of their arguments. Some of this expressive power is captured by adding a factorisation combinator. It supports structural equality, and more generally, a large class of generic queries for updating of, and selecting from, arbitrary structures. The resulting combinatory logic is structure complete in the sense of being able to represent patternmatching functions, as well as simple abstractions. §1. Introduction. Traditional combinatory logic [21, 4, 10] is computationally equivalent to pure λcalculus [3] and able to represent all of the Turing computable functions on natural numbers [23], but there are effectively calculable functions on the combinators themselves that cannot be so represented, as they examine the internal structure of their arguments.
Semantic Predicate Types and Approximation for Classbased Object Oriented Programming
"... Abstract. We define a small functional calculus that expresses classbased object oriented features and is modelled on the similar calculi of Featherweight Java [34] and Middleweight Java [15], which are ultimately based upon the Java programming language. We define a predicate system, similar to th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We define a small functional calculus that expresses classbased object oriented features and is modelled on the similar calculi of Featherweight Java [34] and Middleweight Java [15], which are ultimately based upon the Java programming language. We define a predicate system, similar to the one defined in [10], and show subject reduction and expansion, and argue that program analysis systems can be built on top of this system. Generalising the concept of approximant from the Lambda Calculus, we show that all expressions that we can assign a predicate to have an approximant that satisfies the same predicate. From this, a characterisation of (head)normalisation follows. 1
CROSSING DEPENDENCIES IN PERSIAN
, 2006
"... and by majority vote has been found to be satisfactory. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and by majority vote has been found to be satisfactory.
Global semantic typing for inductive and coinductive computing
"... Common datatypes, such as N, can be identified with term algebras. Thus each type can be construed as a global set; e.g. for N this global set is instantiated in each structure S to the denotations in S of the unary numerals. We can then consider each declarative program as an axiomatic theory, and ..."
Abstract
 Add to MetaCart
Common datatypes, such as N, can be identified with term algebras. Thus each type can be construed as a global set; e.g. for N this global set is instantiated in each structure S to the denotations in S of the unary numerals. We can then consider each declarative program as an axiomatic theory, and assigns to it a semantic (Currystyle) type in each structure. This leads to the intrinsic theories of [18], which provide a purely logical framework for reasoning about programs and their types. The framework is of interest because of its close fit with syntactic, semantic, and proof theoretic fundamentals of formal logic. This paper extends the framework to data given by coinductive as well as inductive declarations. We prove a Canonicity Theorem, stating that the denotational semantics of an equational program P, understood operationally, has type τ over the canonical model iff P, understood as a formula has type τ in every “datacorrect ” structure. In addition we show that every intrinsic theory is interpretable in a conservative extension of firstorder arithmetic. 1998 ACM Subject Classification F.3 Logics and meanings of programs
15424: Foundations of CyberPhysical Systems Lecture Notes on Dynamical Systems & Dynamic Axioms
"... Lecture 4 demonstrated how useful and crucial CPS contracts are for CPS. Their role and understanding goes beyond dynamic testing, though. In CPS, proven CPS contracts are infinitely more valuable than dynamically tested contracts, because dynamical tests of contracts at runtime of a CPS generally l ..."
Abstract
 Add to MetaCart
Lecture 4 demonstrated how useful and crucial CPS contracts are for CPS. Their role and understanding goes beyond dynamic testing, though. In CPS, proven CPS contracts are infinitely more valuable than dynamically tested contracts, because dynamical tests of contracts at runtime of a CPS generally leave open very little flexibility for