1894 search results - page 215 / 379 » A TLA Proof System |
107
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
162
click to vote
IFM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
126
click to vote
PPDP
2005
Springer
15 years 10 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
129
click to vote
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
153
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...