Advertisement
Published in:
2021 | OriginalPaper | Chapter
27. Finite Automata
Authors : Donald Sannella, Michael Fourman, Haoran Peng, Philip Wadler
Published in: Introduction to Computation
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
As you saw in Chap. 13, everything in Haskell is ultimately based on lambda expressions, meaning that computation in Haskell is based on function application and substitution. That is Haskell’s model of computation: the basic mechanisms that underlie its way of producing results of computational problems.