179 search results - page 31 / 36 » A calculus of functional BSP programs |
AAECC
2007
Springer
13 years 7 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ECOOP
2006
Springer
13 years 11 months ago
2006
Springer
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
LPAR
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...