Introduction to Functional Programming

[1]  Michel Mauny,et al.  Functional programming using Caml Light , 1995 .

[2]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[3]  Lawrence C. Paulson,et al.  A Higher-Order Implementation of Rewriting , 1983, Sci. Comput. Program..

[4]  Miriam Leeser,et al.  Verifying a Logic Synthesis Tool in Nuprl: A Case Study in Software Verification , 1992, CAV.

[5]  S. Kleene.  A Theory of Positive Integers in Formal Logic. Part II , 1935 .

[6]  Elaine J. Weyuker,et al.  Computability, complexity, and languages - fundamentals of theoretical computer science , 2014, Computer science and applied mathematics.

[7]  Richard J. Lipton,et al.  Social processes and proofs of theorems and programs , 1977, POPL.

[8]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[9]  Valerie Menissier-Morain Menissier.  Arithmetique exacte : conception, algorithmique et performances d'une implementation informatique en precision arbitraire , 1994 .

[10]  Harry G. Mairson.  Outline of a Proof Theory of Parametricity , 1991, FPCA.

[11]  Chris Reade,et al.  Elements of functional programming , 1989, International computer science series.

[12]  A. Whitehead.  An Introduction to Mathematics , 1949, Nature.

[13]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[14]  John C. Reynolds,et al.  The discoveries of continuations , 1993, LISP Symb. Comput..

[15]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[16]  Bertram Raphael.  The structure of programming languages , 1966, CACM.

[17]  DONALD MICHIE,et al.  “Memo” Functions and Machine Learning , 1968, Nature.

[18]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[19]  Harry G. Mairson.  Deciding ML typability is complete for deterministic exponential time , 1989, POPL '90.

[20]  Jeffrey C. Lagarias,et al.  The 3x + 1 Problem and its Generalizations , 1985 .

[21]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[22]  James H. Davenport,et al.  On the Integration of Algebraic Functions , 1979, Lecture Notes in Computer Science.

[23]  Lawrence Charles Paulson,et al.  ML for the working programmer , 1991 .

[24]  J. A. Robinson,et al.  Logic, Computers, Turing, and von Neumann , 1994, Machine Intelligence 13.

[25]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[26]  Paul Hudak,et al.  Conception, evolution, and application of functional programming languages , 1989, CSUR.

[27]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[28]  M. Schönfinkel.  Über die Bausteine der mathematischen Logik , 1924 .

[29]  S. Abramsky.  The lazy lambda calculus , 1990 .

[30]  Martin C. Henson.  Elements of Functional Languages , 1988 .

[31]  Helmut Schwichtenberg,et al.  Definierbare Funktionen imλ-Kalkül mit Typen , 1975, Archive for Mathematical Logic.

[32]  Andrew Wright.  Polymorphism for Imperative Languages without Imperative Types , 1993 .

[33]  James H. Davenport,et al.  Computer Algebra: Systems and Algorithms for Algebraic Computation , 1988 .

[34]  Hans-Juergen Boehm,et al.  Exact real arithmetic: a case study in higher order programming , 1986, LFP '86.

[35]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[36]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[37]  Andrew Donald Gordon,et al.  Functional programming and input/output , 1995 .

[38]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[39]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[40]  William H. Burge,et al.  Recursive Programming Techniques , 1975 .

[41]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[42]  Ivars Peterson,et al.  Fatal Defect: Chasing Killer Computer Bugs , 1995 .

[43]  L. Wittgenstein.  Tractatus Logico-Philosophicus , 2021, Nordic Wittgenstein Review.

[44]  Michael J. C. Gordon.  Programming language theory and its implementation - applicative and imperative paradigms , 1988, Prentice Hall International series in Computer Science.

[45]  Haskell B. Curry.  Grundlagen der kombinatorischen Logik , 1930 .

[46]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[47]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

[48]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[49]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[50]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[51]  Peter G. Neumann,et al.  Computer-related risks , 1994 .

[52]  Chris Mellish,et al.  Programming in Prolog (2nd ed.) , 1984 .

[53]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.