Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-27T22:24:59.776Z Has data issue: false hasContentIssue false
  • English
  • Français

Girard translation and logical predicates

Published online by Cambridge University Press:  01 January 2000

MASAHITO HASEGAWA
MASAHITO HASEGAWA
Affiliation:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606-8502, Japan (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type theories.

Type
Research Article
Information
Journal of Functional Programming , Volume 10 , Issue 1 , January 2000 , pp. 77 - 89
Copyright
© 2000 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.