This note covers
the following topics: introduction, pattern matching, The Sieve of Eratosthenes,
Fibonacci Series, Folding Lists, Data types, An expression evaluator, Lambda
Calculus, Modules, type inference, Uni cation algorithm, The type inference
algorithm, Type classes, Functions with varible number of arguments.
Gert Smolka's "Introduction to Functional Programming and the Structure of Programming
Languages using OCaml" is an extensive tutorial that deals with the functional
principles of programming using OCaml. The document first addresses basic issues
like syntax and semantics, thereby providing a solid grounding in the
theoretical issues concerning programming languages. Polymorphic functions are
considered, iteration has been discussed, and lists, constructor types, and
trees have been dealt with, including linearization. The notes include practical
aspects such as parsing and a mini OCaml interpreter to help in the
implementation of functional languages. Additional topics include running time
analysis, inductive correctness proofs, and arrays. It takes a well-rounded
approach to functional programming and data structures; both theoretical ideas
and practice are emphasized.
Tyng-Ruey Chuang's
"Functional Programming" gives a condensed summary of the leading concepts of
functional programming. The basic concepts of functional programming are covered
in this PDF and expose the core principles and paradigms. Among other things, it
considers fold and unfold functions that are indispensable in the treatment of
data structures in a functional manner. The paper also considers parameterized
modules, which allow flexible and reusable parts of code. Main topics are
function evaluation and binding, raw items of how functions work and interact in
functional programming languages. Addressing these notions, Chuang's notes give
a chance for brief but intensive introduction to the techniques and practices of
functional programming.
This
is a resource provided by Loyola Marymount University on functional programming.
It starts with a basic explanation and goes further into how one can make a
shift from imperative programming to functional. The key topics it covers are
higher-order functions, which are the backbone for doing functional programming
in order to write abstract code reuse. This paper describes closures and purity,
including side effects, in detail to apprise the reader about the value of
immutability and functional purity. It describes both the functional and
object-oriented programming paradigms, then it points to point-free programming,
and concludes with an overview of the functional programming landscape. This
should be a good reference for students and practitioners alike who want to know
about the basics in functional programming and its theoretical underpinnings.
This course note, from the
University of Edinburgh and offered online, emphasizes from a very practical
point of view how to apply basic functional programming concepts in a graphical
environment. Major topics to be covered include recursion, abstraction,
higher-order functions, and several different data types-how all these concepts
can be used to solve problems is demonstrated. The note introduces theoretical
aspects but underlines their practical relevance by showing how these can be put
into practice within graphical programming contexts. Learners develop a solid,
theoretically based understanding of functional programming principles and get
real practical experience applying these principles to graphical applications.
This resource takes an integrated approach in the way that it interrelates
theory and practice, hence acting as a bridge from concepts of functional
programming to real-life practice.