292 search results - page 30 / 59 » A linearization of the Lambda-calculus and consequences |
105
click to vote
HICSS
1998
IEEE
15 years 5 months ago
1998
IEEE
A review of the various models of New Product Development (NPD) process shows that although different approaches have been proposed, they are in fact all variants on a linear them...
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
CHARME
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
113
click to vote
SGP
2004
15 years 3 months ago
2004
Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surf...
110
click to vote
STRINGOLOGY
2008
15 years 2 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...