1763 search results - page 166 / 353 » A Formalization of Polytime Functions |
112
Voted
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
137
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
252
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
130
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—The generation of device drivers is a very time consuming and error prone activity. All the strategies proposed up to now to simplify this operation require a manual, ev...
140
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is now much more complex. Subt...