222 search results - page 1 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
JFLP
2002
13 years 6 months ago
2002
We consider prescriptive type systems for logic programs (as in G
LOPSTR
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
FSTTCS
2000
Springer
13 years 10 months ago
2000
Springer
LFCS
1992
Springer
13 years 11 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
ENTCS
2002
13 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...