1194 search results - page 62 / 239 » A Calculus for Predicative Programming |
130
click to vote
JFP
2002
15 years 1 months ago
2002
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
204
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
121
click to vote
GPCE
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Component-oriented programming yields a tension between higherorder features (deployment, reconfiguration, passivation), encapsulation, and component sharing. We propose...
109
click to vote
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
216
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...