P Wadler
- [Abelson and Sussman 1985a] Harold Abelson, Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press and McGraw Hill, 1985. Google Scholar
Digital Library
- [Abelson and Sussman 1985b] Harold Abelson and Gerald Jay Sussman. Computation: an intorduction to engineering design. Massachusetts Institute of Technology, 1985.Google Scholar
- [Augustsson 1984] Lennart Augustsson. A compiler for Lazy ML. ACM Symposium on Lisp and Functional Programming, Austin, Texas, August 1984. Google ScholarDigital Library
- [Burstall 1969] R. M. Burstall. Proving properties of programs by structural induction. The Computer Journal, 12(1), February 1969.Google ScholarCross Ref
- [Burstall and Goguen 1982] R. M. Burstall and J. A. Goguen. Algebras, theories and freeness: an introduction for computer scientists. Internal report CSR-101-82, Department of Computer Science, Edinburgh University, February 1982.Google Scholar
- [Fairbairn 1982] Jon Fairbairn. Ponder and its type system. Technical report 31, Cambridge University Computer Laboratory, 1982.Google Scholar
- [Hughes 1985] R. J. M. Hughes. Why functional programming matters. Programming Methodology Group Memo PMG-40, Chalmers Tekniska Hogskola, Goteborg, Sweden, 1985.Google Scholar
- [Rees and Adams 1982] J. A. Rees and N. I. Adams. T: a dialect of Lisp, or Lambda: the ultimate software tool. ACM Symposium on Lisp and Functional Programming, Pittsburgh, Pennsylvania, August 1982. Google ScholarDigital Library
- [Richards 1984] Hamilton Richards, Jr. An overview of ARC SASL. SIGPLAN Notices, 19(10), October 1984, 40-45. Google ScholarDigital Library
- [Steele and Sussman 1978] Guy Lewis Steele, Jr. and Gerald Jay Sussman. The revised report on scheme, a dialect of Lisp. MIT Artifical Intelligence Laboratory Memo 452, January 1978.Google Scholar
- [Steele 1982] Guy Lewis Steele, Jr. An overview of Common Lisp. ACM Symposium on Lisp and Functional Programming, Pittsburgh, Pennsylvania, August 1982. Google ScholarDigital Library
- [Turner 1976] David Turner. SASL language manual. Computer Laboratory, University of Kent, Canterbury, 1976 (revised, 1979).Google Scholar
- [Turner 1981] David Turner. Recursion equations as a programming language. In Darlington, Henderson and Turner (editors), Functional Programming and Its Applications. Cambridge University Press, 1981.Google Scholar
- [Turner 1985] David Turner. Miranda: A non-strict functional language with polymorphic types. Symposium on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. Google ScholarDigital Library
- [Walder 1985a] Philip Walder. An introduction to Orwell. Internal report, Programming Research Group, Oxford University, April 1985.Google Scholar
- [Walder 1985b] Philip Wadler. How to replace failure by a list of successes: Exception handling, backtracking and pattern matching in lazy functional languages. Symposium on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. Google ScholarDigital Library
- [Wadler 1987] Philip Walder. Views: A way for pattern matching to cohabit with data abstraction. Symposium on Principles of Programming Languages, Munich, FRG, January 1987. Google ScholarDigital Library
Index Terms
- A critique of Abelson and Sussman or why calculating is better than scheming
Recommendations
The Better Bubbling Lemma
BCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, JSL 48 (1983), 931-940] relies for its modeling of @l calculus in intersection type filters on a key theorem which I ...
Can naturalism explain consciousness? A critique
The problem of consciousness is one of the most important problems both in cognitive science and in philosophy. There are different philosophers and different scientists who define consciousness and explain it differently. In philosophy, `consciousness' ...
Comments