Representations of Stream Processors Using Nested Fixed Points
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 representa...
Huvudupphovsmän: | Neil Ghani, Peter Hancock, Dirk Pattinson |
---|---|
Materialtyp: | Artikel |
Språk: | English |
Publicerad: |
Logical Methods in Computer Science e.V.
2009-09-01
|
Serie: | Logical Methods in Computer Science |
Ämnen: | |
Länkar: | https://lmcs.episciences.org/713/pdf |
Liknande verk
-
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
av: Lijun Zhang, et al.
Publicerad: (2008-11-01) -
The complexity of global cardinality constraints
av: Andrei A. Bulatov, et al.
Publicerad: (2010-10-01) -
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
av: Lars Kuhtz, et al.
Publicerad: (2012-10-01) -
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
av: Libor Barto, et al.
Publicerad: (2012-02-01) -
The complexity of linear-time temporal logic over the class of ordinals
av: Stephane Demri, et al.
Publicerad: (2010-12-01)