This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Corrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, and Simona Ronchi Della Rocca. A discrimination algorithm inside A-calculus. Theoretical Computer Science, 8 (3): 271–291, 1978.
Simona Ronchi Della Rocca. Discriminability of infinite sets of terms in the Doe -models of the A-calculus. In Egidio Astesiano and Corrado Böhm, editors, Proceedings of the 6th Colloquium on Trees in Algebra and Programming (CAAP’81), volume 112 of Lecture Notes in Computer Science, pages 350–364, Genova, Italy, March 1981. Springer-Verlag.
Adolfo Piperno. An algebraic view of the Böhm-out technique. Theoretical Computer Science, 212 (1–2): 233–246, February 1999.
Corrado Böhm and Adolfo Piperno. Characterizing X-separability and one-side invertibility in A-ß-Q-calculus. In Proceedings, Third Annual Symposium on Logic in Computer Science - LICS’88,pages 91–103, Edinburgh, Scotland, 5–8 July 1988. IEEE Computer Society Press.
Corrado Böhm, Adolfo Piperno, and Enrico Tronci. Solving equations in lambda-calculus. In Logic Colloquium’88,Amsterdam, 1988. North-Holland.
Matthias Felleisen and Daniel P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69(3): 243–287, 1989. Preliminary version in Proc. 14th ACM Symp. Principles of Programming Languages 1987, pages 314–325.
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, and Bruce F. Duba. A syntactic theory of sequential control. Theoretical Computer Science, 52: 205–237, 1987.
Eugenio Moggi. The Partial Lambda-Calculus. PhD thesis, Edinburgh University, February 1988. Report CST-53–88.
Pierre-Louis Curien and Hugo Herbelin. The duality of computation. In Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP-00),volume 35(9) of ACM Sigplan Notices,pages 233–243, Montréal, Canada, September 18–21 2000. ACM Press.
Philip Wadler. Call-by-value is dual to call-by-name. In Cindy Norris and Jr. James B. Fenwick, editors, Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP-03),volume 38, 9 of ACM SIGPLAN Notices,pages 189–201, New York, August 25–29 2003. ACM Press.
Author information
Authors and Affiliations
Rights 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-10394-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05746-5
Online ISBN: 978-3-662-10394-4
eBook Packages: Springer Book Archive