Skip to main content
Springer Nature Link
Log in

Tailoring Filter Models

  • Conference paper
Types for Proofs and Programs (TYPES 2003)

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

Included in the following conference series:

  • 543 Accesses

Abstract

Conditions on type preorders are provided in order to characterize the induced filter models for the λ-calculus and some of its restrictions. Besides, two examples are given of filter models in which not all the continuous functions are representable.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abramsky, S., Luke Ong, C.-H.: Full abstraction in the lazy lambda calculus. Inform. and Comput. 105(2), 159–267 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alessi, F.: The category p-sfp. Internal Report n. 27/96/RR, Dipartimento di Matematica e Informatica, University of Udine (1996)

    Google Scholar 

  3. Alessi, F., Barbanera, F., Dezani-Ciancaglini, M.: Intersection types and computational rules. In: de Queiroz, R., Pimentel, E., Figueiredo, L. (eds.) WoLLIC 2003. El. Notes in Theoret. Comput. Sci, vol. 84, Elsevier, Amsterdam (2003)

    Google Scholar 

  4. Alessi, F., Dezani-Ciancaglini, M., Honsell, F.: A complete characterization of complete intersection-type preorders. ACM Trans. on Comput. Logic 4(1), 120–147 (2003)

    Article  MathSciNet  Google Scholar 

  5. Alessi, F., Dezani-Ciancaglini, M., Lusin, S.: Intersection types and domain operators. Theoret. Comput. Sci. (2004) (to appear)

    Google Scholar 

  6. Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symbolic Logic 48(4), 931–940 (1984), 1983

    MathSciNet  Google Scholar 

  7. Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoret. Comput. Sci. 249, 81–161 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Coppo, M., Dezani-Ciancaglini, M., Honsell, F., Longo, G.: Extended type structures and filter lambda models. In: Lolli, G., Longo, G., Marcja, A.L. (eds.) Logic colloquium 1982, pp. 241–262. North-Holland, Amsterdam (1984)

    Chapter  Google Scholar 

  9. Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional characters of solvable terms. Z. Math. Logik Grundlag. Math. 27(1), 45–58 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type theories, normal forms, and D∞-lambda-models. Inform. and Comput. 72(2), 85–116 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  11. Curry, H.B., Feys, R.: Combinatory Logic. Studies in Logic and the Foundations of Mathematics, vol. I. North-Holland, Amsterdam (1958)

    MATH  Google Scholar 

  12. Dezani-Ciancaglini, M., Ghilezan, S., Likavec, S.: Behavioural inverse limit models. Theoret. Comput. Sci. (2004) (to appear)

    Google Scholar 

  13. Dezani-Ciancaglini, M., Honsell, F., Motohama, Y.: Compositional characterization of λ-terms using intersection types. Theoret. Comput. Sci. (2004) (to appear)

    Google Scholar 

  14. Egidi, L., Honsell, F., Rocca, S.R.D.: Operational, denotational and logical descriptions: a case study. Fund. Inform. 16(2), 149–169 (1992)

    MATH  MathSciNet  Google Scholar 

  15. Gierz, G.K., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M.W., Scott, D.S.: A Compendium of Continuous Lattices. Springer, Berlin (1980)

    MATH  Google Scholar 

  16. Hindley, R., Longo, G.: Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math. 26(4), 289–310 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  17. Honsell, F., Lenisa, M.: Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci. 212(1-2), 183–209 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Honsell, F., Rocca, S.R.D.: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. SystemSci. 45(1), 49–75 (1992)

    Article  MATH  Google Scholar 

  19. Johnstone, P.T.: Stone spaces. Cambridge University Press, Cambridge (1986) (Reprint of the 1982 edn)

    MATH  Google Scholar 

  20. Meyer, A.R.: What is a model of the lambda calculus? Inform. and Control 52(1), 87–122 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  21. Plotkin, G.D.: Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 1(2), 125–159 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  22. Plotkin, G.D.: Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci. 121(1-2), 351–409 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  23. Scott, D.S.: Open problem. In: Böhm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol. 37, p. 369. Springer, Heidelberg (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Via delle Scienze, 206, 33100, Udine, Italy

    Fabio Alessi

  2. Dipartimento di Matematica e Informatica, Viale A.Doria, 6, 95125, Catania, Italy

    Franco Barbanera

  3. Dipartimento di Informatica, Corso Svizzera, 125, 10149, Torino, Italy

    Mariangiola Dezani-Ciancaglini

Authors
  1. Fabio Alessi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franco Barbanera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mariangiola Dezani-Ciancaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149, Torino, Italy

    Stefano Berardi

  2. Dipartimento di Informatica, Università di Torino,  

    Mario Coppo

  3. Dipartimento di Informatica, Università di Torino, Corso Svizzera, 185, I-10149, Torino, Italy

    Ferruccio Damiani

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alessi, F., Barbanera, F., Dezani-Ciancaglini, M. (2004). Tailoring Filter Models. In: Berardi, S., Coppo, M., Damiani, F. (eds) Types for Proofs and Programs. TYPES 2003. Lecture Notes in Computer Science, vol 3085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24849-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24849-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics