1763 search results - page 14 / 353 » A Formalization of Polytime Functions |
JFP
2010
13 years 8 months ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
SODA
2012
ACM
12 years 15 days ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
SOSE
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we introduce a simple but formal service description language (ForSeL) for modelbased requirements engineering. The basic notion in ForSeL is a service representing...
IFL
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...