Sciweavers

102 search results - page 15 / 21
» Reformulation for Extensional Reasoning
Sort
View
CL
2000
Springer
13 years 12 months ago
Promoting Constraints to First-Class Status
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
Tobias Müller
POPL
2009
ACM
14 years 8 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
JUCS
2006
89views more  JUCS 2006»
13 years 7 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CSL
2000
Springer
13 years 12 months ago
Subtyping with Power Types
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
David Aspinall