1194 search results - page 53 / 239 » A Calculus for Predicative Programming |
141
click to vote
CADE
2001
Springer
16 years 2 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
112
click to vote
FROCOS
2005
Springer
15 years 7 months ago
2005
Springer
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
118
click to vote
APLAS
2007
ACM
15 years 6 months ago
2007
ACM
Abstract. We propose an extension of the Applied Pi
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
123
click to vote
PEPM
2009
ACM
15 years 6 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...