| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Representations of Stream Processors Using Nested Fixed Points | Neil Ghani
; Peter Hancock
; Dirk Pattinson
; | Date: |
29 May 2009 | Abstract: | We define representations of continuous functions on infinite streams of
discrete values, both in the case of discrete-valued functions, and in the case
of stream-valued functions. We define also an operation on the representations
of two continuous functions between streams that yields a representation of
their composite.
In the case of discrete-valued functions, the representatives are
well-founded (finite-path) trees of a certain kind. The underlying idea can be
traced back to Brouwer’s justification of bar-induction, or to Kreisel and
Troelstra’s elimination of choice-sequences. In the case of stream-valued
functions, the representatives are non-wellfounded trees pieced together in a
coinductive fashion from well-founded trees. The definition requires an
alternating fixpoint construction of some ubiquity. | Source: | arXiv, 0905.4813 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |