history.bib

@ARTICLE{hughes89,
  AUTHOR = {J. Hughes},
  TITLE = {{W}hy {F}unctional {P}rogramming {M}atters},
  JOURNAL = {The Computer Journal},
  YEAR = 1989,
  VOLUME = {32},
  NUMBER = {2},
  PAGES = {98-107},
  NOTE = {},
  CONTENTS = {},
  HTTP = {http://www.cs.chalmers.se/~rjmh/Papers/whyfp.html}
}

@ARTICLE{hudak89,
  AUTHOR = {P. Hudak},
  TITLE = {{C}onception, {E}volution, and {A}pplication of {F}unctional 
              {P}rogramming {L}anguages},
  JOURNAL = {ACM Computing Surveys},
  YEAR = 1989,
  VOLUME = {21},
  NUMBER = {3},
  PAGES = {359-411},
  NOTE = {},
  CONTENTS = {},
  HTTP = {http://portal.acm.org/citation.cfm?id=72554&coll=ACM&dl=ACM&CFID=14719759&CFTOKEN=32376333}
}

@ARTICLE{Backus78,
  AUTHOR = {J. Backus},
  TITLE = {{C}an {P}rogramming be {L}iberated from the von {N}eumann {S}tyle?},
  JOURNAL = {Communications of the ACM},
  YEAR = 1978,
  VOLUME = {21},
  NUMBER = {8},
  PAGES = {613-641},
  NOTE = {},
  CONTENTS = {},
  HTTP = {http://portal.acm.org/citation.cfm?id=359579&coll=portal&dl=ACM&CFID=15157362&CFTOKEN=18827448}
}

@ARTICLE{Church32/33,
  AUTHOR = {Alonzo Church},
  TITLE = {A set of Postulates for the foundation of Logic},
  JOURNAL = {Annals of Mathematics},
  YEAR = {1933-1934},
  VOLUME = {2},
  PAGES = {33, 346-366 and 34, 839-864}
}

@BOOK{Church41,
  TITLE = {The calculi of lambda conversion},
  AUTHOR = {Alonzo Church},
  PUBLISHER = {Princeton University Press},
  YEAR = 1941,
  HTTP = {http://pup.princeton.edu/titles/2390.html}
}

@INCOLLECTION{barendregt92lambda,
  AUTHOR = {Henk Barendregt},
  TITLE = {Lambda Calculi with Types},
  BOOKTITLE = {Handbook of Logic in Computer Science, Volumes 1 (Background: Mathematical Structures) and 2 (Background: Computational Structures), Abramsky \& Gabbay \& Maibaum (Eds.), Clarendon},
  VOLUME = {2},
  YEAR = {1992},
  HTTP = {http://citeseer.nj.nec.com/barendregt92lambda.html}
}

@ARTICLE{kleene36,
  AUTHOR = {S.C.Kleene},
  TITLE = {Lambda-definability and recursiveness},
  JOURNAL = {Duke Mathematical Journal},
  YEAR = {1936},
  VOLUME = {2},
  PAGES = {340-353}
}

@ARTICLE{turing37,
  AUTHOR = {Alan M. Turing},
  TITLE = {Computability and lambda-Definability},
  JOURNAL = {J. Symb. Log.},
  YEAR = {1937},
  VOLUME = {2},
  NUMBER = {4},
  PAGES = {153-163}
}

@INPROCEEDINGS{john78history,
  AUTHOR = {McCarthy, John},
  TITLE = {History of {LISP}},
  BOOKTITLE = {History of Programming Languages: Proceedings of the {ACM} 		 {SIGPLAN} Conference},
  MONTH = {June 1--3},
  PUBLISHER = {Academic Press},
  EDITOR = {Wexelblat, Richard L.},
  PAGES = {173--197},
  YEAR = {1978},
  PS = {http://www-formal.stanford.edu/jmc/history/lisp.ps}
}

@INPROCEEDINGS{gordon78,
  AUTHOR = {M. Gordon and R. Milner and L. Morris and M. Newey and C. Wadsworth},
  TITLE = {A Metalanguage for interactive proof in LCF},
  BOOKTITLE = {Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages},
  YEAR = {1978},
  PAGES = {119--130},
  LOCATION = {Tucson, Arizona},
  HTTP = {http://doi.acm.org/10.1145/512760.512773},
  PUBLISHER = {ACM Press}
}

@ARTICLE{hindley69,
  AUTHOR = {J. R. Hindley},
  TITLE = {The principal type-scheme of an object in combinatory logic},
  JOURNAL = {Trans. American Math. Soc},
  YEAR = 1969,
  VOLUME = {146},
  PAGES = {29-60}
}

@ARTICLE{milner78,
  AUTHOR = {R. Milner},
  TITLE = {A theory of type polymorphism in programming},
  JOURNAL = {Journal of Computer and System Sciences},
  YEAR = 1978,
  VOLUME = {17},
  NUMBER = {3},
  PAGES = {348--375}
}

@INPROCEEDINGS{turner85,
  AUTHOR = {D.A. Turner},
  TITLE = {{M}iranda: a {N}on-{S}trict {F}unctional {L}anguage with
               {P}olymorphic {T}ypes},
  EDITOR = {J.-P. Jouannaud},
  BOOKTITLE = {Proceedings of the IFIP International Conference on Functional 
               Programming Languages and Computer Architectures (FPCA'85),
               Nancy, France},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {201},
  PUBLISHER = {Springer-Verlag, Berlin, Germany},
  YEAR = 1985,
  PAGES = {1--16},
  NOTE = {},
  CONTENTS = {}
}