Strong Normalization of Second Order Symmetric λ-Calculus

  • Michel Parigot
Conference paper

DOI: 10.1007/3-540-44450-5_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1974)
Cite this paper as:
Parigot M. (2000) Strong Normalization of Second Order Symmetric λ-Calculus. In: Kapoor S., Prasad S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg

Abstract

Typed symmetric α-calculus is a simple computational interpretation of classical logic with an involutive negation. Its main distinguishing feature is to be a true non-confluent computational interpretation of classical logic. Its non-confluence reflects the computational freedom of classical logic (as compared to intuitionistic logic). Barbanera and Berardi proved in [1],[2] that first order typed symmetric α-calculus enjoys the strong normalization property and showed in [3] that it can be used to derive symmetric programs.

In this paper we prove strong normalization for second order typed symmetric α-calculus.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Michel Parigot
    • 1
  1. 1.Equipe de Logique Mathématiquecase 7012Université Paris 7Paris cedex05France

Personalised recommendations