Sciweavers

888 search results - page 87 / 178
» The Power of Temporal Proofs
Sort
View
CONCUR
2010
Springer
14 years 11 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
APAL
2010
125views more  APAL 2010»
14 years 10 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
ENTCS
2008
116views more  ENTCS 2008»
14 years 10 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
APPML
2006
65views more  APPML 2006»
14 years 10 months ago
Some inequalities related to the analysis of electricity auctions
Most balancing markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the inte...
Peter Hästö, Pär Holmberg
CPC
2006
93views more  CPC 2006»
14 years 10 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper