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 achieved by adding ¬¬A = A to typed λ-calculus: the main obstacle is that an involutive negation cannot be a particular case of implication at the computational level. It means that one has to go out typed λ-calculus in order to have a safe computational interpretation of an involutive negation.
We then show how to equip λµ-calculus in a natural way with an involutive negation: the abstraction and application associated to negation are simply the operators µ and [ ] from λµ-calculus. The resulting system is called symmetric λµ-calculus.
Finally we give a translation of symmetric λ-calculus in symmetric λµ-calculus, which doesn’t make use of the rule of µ-reduction of λµ-calculus (which is precisely the rule which makes the difference between classical and intuitionistic proofs in the context of λµ-calculus). This seems to indicate that an involutive negation generates an original way of computing. Because symmetric λµ-calculus contains both ways, it should be a good framework for further investigations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Barendregt: The Lambda-Calculus. North-Holland, 1981.
F. Barbanera, S. Berardi: A symmetric lambda-calculus for classical program extraction. Proceedings TACS’94, Springer LNCS 789 (1994).
F. Barbanera, S. Berardi: A symmetric lambda-calculus for classical program extraction. Information and Computation 125 (1996) 103–117.
F. Barbanera, S. Berardi, M. Schivalocchi: “Classical” programming-with-proofs in lambda-sym: an analysis of a non-confluence. Proc. TACS’97.
M. Felleisen, D.P. Friedman, E. Kohlbecker, B. Duba: A syntactic theory of sequential control. Theoretical Computer Science 52 (1987) pp 205–237.
M. Felleisen, R. Hieb: The revised report on the syntactic theory of sequential control and state. Theoretical Computer Science 102 (1994) 235–271.
J.Y. Girard: Linear logic. Theoretical Computer Science. 50 (1987) 1–102.
J.Y. Girard, Y. Lafont, and P. Taylor: Proofs and Types. Cambridge University Press, 1989.
T. Griffin: A formulae-as-types notion of control. Proc. POPL’90 (1990) 47–58.
M. Hofmann, T. Streicher: Continuation models are universal for λμ-calculus. Proc. LICS’97 (1997) 387–397.
M. Hofmann, T. Streicher: Completeness of continuation models for λμ-calculus. Information and Computation (to appear).
J.L. Krivine, M. Parigot: Programming with proofs. J. of Information Processing and Cybernetics 26 (1990) 149–168.
J.L. Krivine: Lambda-calcul, types et mod`eles. Masson, 1990.
D. Leivant: Reasoning about functional programs and complexity classes associated with type disciplines. Proc. FOCS’83 (1983) 460–469.
C. Murthy: Extracting Constructive Content from Classical Proofs. PhD Thesis, Cornell, 1990.
M. Parigot: Free Deduction: an Analysis of “Computations” in Classical Logic. Proc. Russian Conference on Logic Programming, 1991, Springer LNCS 592 361–380.
M. Parigot: λμ-calculus: an Algorithmic Interpretation of Classical Natural Deduction. Proc. LPAR’92, Springer LNCS 624 (1992) 190–201.
M. Parigot: Strong normalisation for second order classical natural deduction, Proc. LICS’93 (1993) 39–46.
C.H.L. Ong, C.A. Stewart: A Curry-Howard foundation for functional computation with control. Proc. POPL’97 (1997)
P. Selinger: Control categories and duality: on the categorical semantics of lambda-mu calculus, Mathematical Structures in Computer Science (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parigot, M. (2000). On the Computational Interpretation of Negation. In: Clote, P.G., Schwichtenberg, H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44622-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-44622-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67895-3
Online ISBN: 978-3-540-44622-4
eBook Packages: Springer Book Archive