1805 search results - page 114 / 361 » Functional programming with structured graphs |
128
click to vote
ICALP
1998
Springer
15 years 5 months ago
1998
Springer
This paper investigates the use of a complete metric space framework for providing denotational semantics to a real-time process algebra. The study is carried out in a non-interlea...
146
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
98
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
120
click to vote
JAPLL
2010
14 years 8 months ago
2010
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...
113
click to vote
IFL
2007
Springer
15 years 7 months ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...