Sciweavers

421 search results - page 22 / 85
» CSL
Sort
View
CSL
2000
Springer
13 years 8 months ago
On the Computational Interpretation of Negation
Abstract. We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply ...
Michel Parigot
CSL
2002
Springer
13 years 8 months ago
On Continuous Normalization
Abstract. Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped -calculus and G
Klaus Aehlig, Felix Joachimski
CSL
1999
Springer
13 years 8 months ago
A P-Time Completeness Proof for Light Logics
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
Luca Roversi
DSN
2004
IEEE
14 years 6 days ago
Model Checking Action- and State-Labelled Markov Chains
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
Christel Baier, Lucia Cloth, Boudewijn R. Haverkor...