Filtering by reason

The filtering by reason is the checking of the presence of components of a reason. By contrast with the Pattern recognition, the reasons are specified rigidly. Such reasons concern conventionally either of the sequence S, or of the trees. One uses filtering by reason to check that the object filtered with the wished structure, to find there a structure adapted, to find there aligned parts or to substitute something of other for the recognized reasons. The sequences (particularly character strings) are often described by rational Expressions. The sequences can also be seen like trees.

The reasons for tree can be used by the Computer programming languages like a general tool to treat their structure. Certain languages of functional Programming such as Haskell, ml and the language of mathematics symbolic systems Mathematica have a special syntax to express the reasons for tree and a construction of language for the conditional execution and the recovery of values based on this one. For reasons of effectiveness and simplicity, these reasons for tree do not have all the functionalities specific to the rational expressions. According to the language, the expressions of recognition of reason can be used like argument of functions, in expression case where news variables are bound, or in situations very limited like the assignment in Python. It is often possible to give reasons alternate which is tested in sequence. The recognition of reason can profit from guard S.

The languages of rewriting of terms rest on filtering by reason like fundamental manner for a program to evaluate a result. Filtering by reason is most suitable when the subjacent structure of data is as simple and flexible device as possible. It is particularly the case for the languages with leaning a symbolic system. In the computer programming languages symbolic system, the reasons are of the same type that the remainder of the data, and can thus be last like argument with functions. In other terms, it is entities of first class.

Filtering by reason recognizes a reason in a structure arborescent preexistent while the rational expressions recognize a reason in a structure punt. Perl 6 proposes a system which integrates the two semantic ones in one Syntaxe concretes unified.

See too

  • AIML for a language of artificial intelligence based on the filtering of reason in the word.
  • SNOBOL for a computer programming language based on a kind of reason.
  • Compatible PCRE Perl Regular Expressions, a modern establishment of filtering by reason for chain used by many languages.

References

  • The Implementation off Functional Programming Languages pages 53-103 Simon Peyton Jones, published by Prentice Hall, 1987.

External bonds

  • The Mathematica Book, chapter Section 2.3: Patterns.
  • The Haskell 98 Carryforward, chapter 3.17 Pattern Matching.
  • Pattern matching in The Free On-line Dictionary off Computing, Editor Denis Howe.
  • Python Refers Manual, chapter 6.3 Assignment statements.
  • filtering by reason in Ocaml.
  • has Gentle Introduction to Haskell: Patterns.
  • Views: Year Extension to Haskell Pattern Matching.
  • Nikolaas NR. Oosterhof, Philip K.F. Hölzenspies, and Jan Kuper. Patterns application. At presentation At Trends in Functional Programming, 2005.
  • an incomplete history of the text editor QED by Refusals Ritchie - described the history of the rational expressions.
  • Simphile - Software Open Source of filtering by reason.

Random links:1445 | Cantante de Fred | Buddhism Tibetan | Mireille Storeroom | Ash Williams | The Council of the police chiefs of the people (the USSR) | Allumer_les_lumières_lumineuses