2272 search results - page 292 / 455 » A Calculus for |
139
click to vote
ECEASST
2008
15 years 4 months ago
2008
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
150
click to vote
ENTCS
2008
15 years 4 months ago
2008
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
130
click to vote
ENTCS
2008
15 years 4 months ago
2008
Logical frameworks serve as meta-languages to represent deductive systems, sometimes requiring special purpose meta logics to reason about the representations. In this work, we de...
142
click to vote
ENTCS
2008
15 years 4 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
130
click to vote
ENTCS
2008
15 years 4 months ago
2008
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...