Skip to main content
SpringerLink
Log in

Counting a Type’s Principal Inhabitants

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1581))

Included in the following conference series:

Abstract

We present a Counting Algorithm that computes the number of λ-terms in β-normal form that have a given type τ as a principal type and produces a list of these terms. The design of the algorithm follows the lines of Ben-Yelles’ algorithm for counting normal (not necessarily principal) inhabitants of a type τ.

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

Access this chapter

Log in via an institution
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. H. Barendregt. Lambda calculi with types. In Abramsky, Gabbay, and Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science, pages 117–309. Oxford Science Publications, 1992.

    Google Scholar 

  2. C.-B. Ben-Yelles. Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, Mathematics Dept., University of Wales Swansea, UK, 1979.

    Google Scholar 

  3. J. R. Hindley. Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Takahashi, Y. Akama, and S. Hirokawa. Normal proofs and their grammar. In M. Hagiya and J. Mitchell, editors, Theoretical Aspects of Computer Software (TACS’94), volume 789 of LNCS, pages 465–493. Springer Verlag, 1994.

    Google Scholar 

  6. M. Zaionc. The set of unifiers in typed λ-calculus as regular expression. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, volume 202 of LNCS, pages 430–440. Springer Verlag, 1985.

    Google Scholar 

  7. M. Zaionc. Mechanical procedure for proof construction via closed terms in typed λ-calculus. J. Automated Reasoning, 4:173–190, 1988.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DCC & LIACC, Universidade do Porto, Porto, Portugal

    Sabine Broda & Luís Damas

Authors
  1. Sabine Broda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Damas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - UPR9016, Institut de Mathématiques de Luminy, 163 Avenue de Luminy, case 907, F-13288, Marseille cedex 9, France

    Jean-Yves Girard

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broda, S., Damas, L. (1999). Counting a Type’s Principal Inhabitants. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48959-2_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48959-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation