Skip to main content

Part of the book series: Texts in Theoretical Computer Science ((TTCS))

  • 372 Accesses

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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Bibliography

  1. Daniele Turi and Gordon Plotkin. Towards a mathematical operational semantics. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science LICS’97,pages 280–291, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.

    Google Scholar 

  2. Rod Burstall and Furio Honsell. Operational semantics in a natural deduction setting. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 185–214, Cambridge, 1991. Cambridge University Press.

    Chapter  Google Scholar 

  3. Andrew M. Pitts. Operational semantics and program equivalence. In G. Barthe, P. Dybjer, and J. Saraiva, editors, Applied Semantics,volume 2395 of Lecture Notes in Computer Science,pages 378–412. Springer-Verlag, 2002. (Revised version of lectures at the International Summer School On Applied Semantics, APPSEM 2000, Caminha, Minho, Portugal, 9–15 September 2000.).

    Google Scholar 

  4. Corrado Böhm and Mariangiola Dezani-Ciancaglini. A CUCH-machine: the automatic treatment of bound variables. International Journal of Computer and Information Sciences, 1 (2): 171–191, June 1972.

    Article  MATH  Google Scholar 

  5. Corrado Böhm, Adolfo Piperno, and Stefano Guerrini. Lambda-definition of function(al)s by normal forms. In Donald Sannella, editor, Programming Languages and Systems-ESOP’94, 5th European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 135–149. Springer-Verlag, 1994.

    Google Scholar 

  6. Jean Louis Krivine. Lambda-Calculus, Types and Models. Ellis Horwood Series in Computers and Their Applications. Masson, Paris, and Ellis Horwood, Hemel Hempstead, 1993. Transation from French by René Cori, French orig. ed., Masson, Paris, 1990.

    Google Scholar 

  7. Andrea Asperti, Cecilia Giovannetti, and Andrea Naletto. The bologna optimal higher-order machine. Technical Report UBLCS-95–9, University of Bologna, Department of Computer Science, March 1995.

    Google Scholar 

  8. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50: 1–102, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  9. Andrea Asperti and Stefano Guerrini. The Optimal Implementation of Functional Programming Languages Cambridge University Press, Cambridge, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rocca, S.R.D., Paolini, L. (2004). Further Reading. In: The Parametric Lambda Calculus. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-10394-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-10394-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05746-5

  • Online ISBN: 978-3-662-10394-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics