Sciweavers

1557 search results - page 25 / 312
» Programming up to Congruence
Sort
View
PLDI
2012
ACM
13 years 1 months ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...
86
Voted
MOBICOM
2012
ACM
13 years 1 months ago
RadioJockey: mining program execution to optimize cellular radio usage
Many networked applications that run in the background on a mobile device incur significant energy drains when using the cellular radio interface for communication. This is mainl...
Pavan K. Athivarapu, Ranjita Bhagwan, Saikat Guha,...
CSL
2007
Springer
15 years 5 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
70
Voted
IANDC
2008
84views more  IANDC 2008»
14 years 11 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
ENTCS
2006
137views more  ENTCS 2006»
14 years 11 months ago
Coalgebraic Description of Generalized Binary Methods
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
Furio Honsell, Marina Lenisa, Rekha Redamalla