1894 search results - page 111 / 379 » A TLA Proof System |
121
click to vote
FROCOS
2005
Springer
15 years 6 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
116
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
114
click to vote
ALP
1992
Springer
15 years 4 months ago
1992
Springer
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
111
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
109
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...