• Corpus ID: 122750269

Introduction to Functional Programming

@inproceedings{Harrison1997IntroductionTF,
  title={Introduction to Functional Programming},
  author={John Harrison},
  year={1997}
}
No Paper Link Available
4 Citations

4 Citations

Citation Type

Citation Type

Course Notes Equational Programming: Lambda Calculus
A Type-theoretic Approach to Cloud Data Integration
TLDR
An architecture that helps to integrate data accessible via cloud application APIs based on type theory is proposed that is used to automate the building of integration solutions and for automatic verification of program code and compatibility between APIs.
An Introduction to the Lambda Calculus
Lambda calculus (?-calculus) is one of the most well-known formal models of computer science. It is the basis for functional programming like Turing machines are the foundation of imperative…
Understanding functional programming
In my programming languages course, I have found that an effective and convincing introduction to functional programming is harder to deliver than might be thought. Careful communications with…

References

SHOWING 1-10 OF 53 REFERENCES
Functional programming and input/output
TLDR
The author obtains, for the first time, operational semantics for the three most widely implemented I/O mechanisms for lazy languages, and proves that the three are equivalent in expressive power.
Fatal Defect: Chasing Killer Computer Bugs
TLDR
Author Ivars Peterson traces the lurching history of software development and describes how misconceptions and mistakes have become an inextricable part of computer programs and systems, and creates fascinating and colorful profiles of the people who hunt down these elusive computer bugs.
Functional programming using Caml Light
TLDR
Through the study of the CAML functional programming, the author presents polymorphic type synthesis implemented by Milner's algorithm and a simple execution model for functional languages: a simpli ed version of the Categorical Abstract Machine (CAM).
Arithmetique exacte : conception, algorithmique et performances d'une implementation informatique en precision arbitraire
Nous montrons dans cette these la necessite d'avoir une arithmetique sure, c'est-a-dire une arithmetique rationnelle exacte et une arithmetique reelle en precision arbitraire. Nous decrivons tout…
Computer-related risks
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
Polymorphism for Imperative Languages without Imperative Types
The discoveries of continuations
TLDR
A brief account of the discoveries of continuations and related concepts by A. L. Morris, C. P. Wadsworth, J. J. Fischer, and S. Abdali is given.
The formal semantics of programming languages - an introduction
  • G. Winskel
  • Computer Science
    Foundation of computing series
  • 1993
TLDR
The Formal Semantics of Programming Languages" provides the basic mathematical techniques necessary for those who are beginning a study of semantics and logics of programming languages, including the vital area of concurrency.
Logic, Computers, Turing, and von Neumann
...
1
2
3
4
5
...