Skip to main content

On Principal Types of BCK-λ-Terms

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4576))

  • 654 Accesses

Abstract

Condensed BCK-logic, i.e. the set of BCK-theorems provable by the condensed detachment rule of Carew Meredith, has been shown to be exactly the set of principal types of BCK-λ-terms. In 1993 Sachio Hirokawa gave a characterization of the set of principal types of BCK-λ-terms in β-normal form based on a relevance relation that he defined between the type variables in a type. We define a symmetric notion of this and call it dependence relation. Then, using the notion of β S -reduction introduced by de Groote, we obtain a characterization of the complete set of principal types of BCK-λ-terms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Broda, S., Damas, L.: On principal types of combinators. Theoretical Computer Science 247, 277–290 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Broda, S., Damas, L.: On Long Normal Inhabitants of a Type. Journal of Logic and Computation 15(3), 353–390 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. de Groote, P.: The Conservation Theorem revisited. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 163–178. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  4. Hindley, J.R.: BCK-combinators and linear λ-terms have types. Theoretical Computer Science 64, 97–105 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hindley, J.R., Meredith, D.: Principal type-schemes and condensed detachment. Journal of Symbolic Logic 55, 90–105 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hindley, J.R.: BCK and BCI logics, condensed detachment and the 2-property. Notre Dame J. Formal Logic 34(2), 231–250 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hirokawa, S.: Principal types of BCK-lambda-terms. Theoretical Computer Science 107, 253–276 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hirokawa, S.: The Relevance Graph of a BCK-Formula. Journal of Logic and Computation 3(3), 269–285 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Daniel Leivant Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Broda, S., Damas, L. (2007). On Principal Types of BCK-λ-Terms. In: Leivant, D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2007. Lecture Notes in Computer Science, vol 4576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73445-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73445-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73443-7

  • Online ISBN: 978-3-540-73445-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics