Paul Hudak
Simon Peyton Jones
Philip Wadler
Kevin Hammond
Skip Abstract Section
Abstract
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published something erroneous. Since some of our fellow sinners are among the most careful and competent logicians on the contemporary scene, we regard this as evidence that the subject is refractory. Thus fullness of exposition is necessory for accurary; and excessive condensation would be false economy here, even more than it is ordinarily."
- [1] J. Backus. Can Programming be liberated from the von Neumann style? A functional style and its algebra of programs. CACM, 21(8):613-641, August 1978. Google Scholar
Digital Library
- [2] R.M. Burstall, D.B. MacQueen, and D.T. Sannella. HOPE: An experimental applicative language. In The 1980 LISP Conference, pages 136-143, Stanford University, August 1980. Google ScholarDigital Library
- [3] H.B. Curry and R. Feys. Combinatory Logic. North-Holland Pub. Co., Amsterdam, 1958.Google Scholar
- [4] L. Damas and R. Milner. Principal type schemes for functional programs. In Proceedings of 9th ACM Symposium on Principles of Programming Languages, pages 207-212, Albuquerque, N.M. January 1982. Google ScholarDigital Library
- [5] M. Gordon, R. Milner, L. Morris, M. Newey, and C. Wadsworth. An metalanguage for interactive proof in LCF. In Proceedings of 5th ACM Symposium on Principles of Programming Languages, pages 119-130, 1978. Google ScholarDigital Library
- [6] K. Hammond and C. Hall. A natural dynamic semantics for Haskell (draft). Department of Computing Science, Glasgow University, February 1991.Google Scholar
- [7] R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, December 1969.Google Scholar
- [8] P. Hudak and R. Sundaresh. On the expressiveness of purely functional I/O systems. Technical Report YALEU/DCS/RR665, Yale University, Department of Computer Science, December 1988.Google Scholar
- [9] P.J. Landin. The next 700 programming languages. CACM, 9(3):157-166, March 1966. Google ScholarDigital Library
- [10] D.W. Matula. A formalization of floating-point numeric base conversion. IEEE Transactions on Computers, C-19(8):681-692, August 1970.Google ScholarDigital Library
- [11] J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, Part I. CACM, 3(4):184-195, April 1960. Google ScholarDigital Library
- [12] R.S. Nikhil. Id-Nouveau (version 88.0) reference manual. Technical report, MIT Laboratory for Computer Science, Cambridge, Mass., March 1988.Google Scholar
- [13] P. Penfield, Jr. Principal values and branch cuts in complex APL. In APL '81 Conference Proceedings, pages 248-256, San Francisco, September 1981. Google ScholarDigital Library
- [14] S. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, New Jersey, 1987. Google ScholarDigital Library
- [15] S.L. Peyton Jones and P. Wadler. A static semantics for HASKELL. Department of Computing Science, Glasgow University, May 1991.Google Scholar
- [16] J. Rees and W. Clinger (eds.). The revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(21):37-79, December 1986. Google ScholarDigital Library
- [17] J.C. Reynolds. Introduction to part II (polymorphic lambda calculus). In G. Huet, editor, Logical Foundations of Functional Programming, University of Taxas Year of Programming Series. Addison-Wesley, 1990. Google ScholarDigital Library
- [18] G.L. Steele Jr. Common Lisp: The Language. Digital Press, Burlington, Mass., 1984. Google ScholarDigital Library
- [19] D.A. Turner. Miranda: a non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 1-16, Nancy, France, September 1985. Springer-Verlag. Google ScholarDigital Library
- [20] P. Wadler. A new array operation. In J.H. Fasel and R.M. Keller, editors, Graph Reduction , volume 279 of Lecture Notes in Computer Science, pages 328-335, Heidelberg, 1987. Springer-Verlag. Google ScholarDigital Library
- [21] P. Wadler and S. Blott. How to make ad hoc polymorphism less ad hoc. In Proceedings of 16th ACM Symposium on Principles of Programming Languages, pages 60-76, Austin, Taxas, January 1989. Google ScholarDigital Library
Index Terms
- Report on the programming language Haskell: a non-strict, purely functional language version 1.2
Recommendations
Programming Language Semantics with Isabelle/HOL
WEIT '13: Proceedings of the 2013 2nd Workshop-School on Theoretical Computer ScienceIsabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order Logic. In programming language theory, formal semantics is the field concerned ...
Comments