Stabilization — An Alternative to Double-Negation Translation for Classical Natural Deduction

@inproceedings{Matthes2004StabilizationA,
  title={Stabilization — An Alternative to Double-Negation Translation for Classical Natural Deduction},
  author={Ralph Matthes},
  year={2004}
}
A new proof of strong normalization of Parigot’s second-order λμ-calculus is given by a reduction-preserving embedding into system F (second-order polymorphic λ-calculus). The main idea is to use the least stable supertype for any type. These non-strictly positive inductive types and their associated iteration principle are available in system F, and allow to give a translation vaguely related to CPS translations (corresponding to Kolmogorov’s double-negation embedding of classical logic into… CONTINUE READING
4 Citations
27 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

An embedding of 2nd order classical logic into functional arithmetic FA2

  • Thierry Joly
  • C. R. Acad. Sci. Paris, Série I, 325:1–4,
  • 1997
Highly Influential
4 Excerpts

pages 30–36

  • Nax P. Mendler. Recursive types, type constraints in second-order lambda calculus. In Pr Science, N. Y. Ithaca
  • IEEE Computer Society Press,
  • 1987
Highly Influential
5 Excerpts

Mendler . Recursive types and type constraints in second - order lambda calculus

  • P Nax
  • Proceedings of the Second Annual IEEE Symposium…
  • 2004

Domain - free λ μ - calculus

  • Ken-Etsu Fujita
  • RAIRO - Theoretical Informatics and Applications
  • 2001

RAIRO - Theoretical Informatics and Applications

  • Ken-Etsu Fujita. Domain-free λμ-calculus
  • 34:433–466,
  • 2000

Tait . A realizability interpretation of the theory of species

  • W. William
  • 1999

Similar Papers

Loading similar papers…