Functional Programming and Lambda Calculus

This publication has 35 references indexed in Scilit:

• Needed reduction and spine strategies for the lambda calculus
  Information and Computation, 1987
• Clean — A language for functional graph rewriting
  Published by Springer Nature ,1987
• Strictness analysis for higher-order functions
  Science of Computer Programming, 1986
• Automatic synthesis of typed Λ-programs on term algebras
  Theoretical Computer Science, 1985
• On understanding types, data abstraction, and polymorphism
  ACM Computing Surveys, 1985
• The semantics of second order polymorphic lambda calculus
  Lecture Notes in Computer Science, 1984
• A semantics of multiple inheritance
  Lecture Notes in Computer Science, 1984
• A filter lambda model and the completeness of type assignment
  The Journal of Symbolic Logic, 1983
• Can programming be liberated from the von Neumann style?
  Communications of the ACM, 1978
• An Unsolvable Problem of Elementary Number Theory
  American Journal of Mathematics, 1936