159 search results - page 2 / 32 » Specifying Proof Systems in Linear Logic with Subexponential... |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
ISSE
2007
13 years 5 months ago
2007
Increasingly, computer software must adapt dynamically to changing conditions. The correctness of adaptation cannot be rigorously addressed without precisely specifying the require...
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
ENTCS
2008
13 years 5 months ago
2008
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...