| Abstract | .... 2 | |
| 1 | Introduction | .... 2 |
| 2 | Defining Stream Transformers | .... 5 |
| 2.1 | Cetegorical Characterization of Stream Transformers | .... 6 |
| 2.2 | Choice Sequences | .... 7 |
| 2.3 | A Problem on Infinity | .... 8 |
| 2.4 | The Coinduction | .... 9 |
| 3 | Formal System | .... 10 |
| 3.1 | Non-deterministic ^-calculus | .... 10 |
| 3.2 | Rules for Sterams | .... 13 |
| 3.3 | Other rules of Inference | .... 14 |
| 3.4 | Embedding of Computational Streams into Steream Types | .... 15 |
| 3.5 | Realizability Interpretation | .... 16 |
| 3.6 | Realizability Interpretation of (Coind) | .... 18 |
| 4 | Example | .... 20 |
| 4.1 | Double | .... 20 |
| 4.2 | Step Filter | .... 20 |
| 4.3 | Stream Filter | .... 21 |
| 4.4 | Eratosthenes' Sieve Algorithm | .... 21 |
| 4.5 | Nondeterministic Stream Merger | .... 22 |
| 5 | Discussion and Concluding Remarks | .... 23 |
| Acknowledgements | .... 24 | |
| References | .... 25 | |
| End | .... 27 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports