| Autor: |
Neil Ghani, Peter Hancock, Dirk Pattinson |
| Jazyk: |
angličtina |
| Rok vydání: |
2009 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.2168/LMCS-5(3:9)2009 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
