Representations of Stream Processors Using Nested Fixed Points

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...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Neil Ghani, Peter Hancock, Dirk Pattinson
Format:	Artykuł
Język:	English
Wydane:	Logical Methods in Computer Science e.V. 2009-09-01
Seria:	Logical Methods in Computer Science
Hasła przedmiotowe:	computer science - data structures and algorithms computer science - logic in computer science e.1 e.2 f.2.1 f.2.2
Dostęp online:	https://lmcs.episciences.org/713/pdf

Podobne zapisy

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
od: Lijun Zhang, i wsp.
Wydane: (2008-11-01)

The complexity of global cardinality constraints
od: Andrei A. Bulatov, i wsp.
Wydane: (2010-10-01)

Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
od: Lars Kuhtz, i wsp.
Wydane: (2012-10-01)

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
od: Libor Barto, i wsp.
Wydane: (2012-02-01)

The complexity of linear-time temporal logic over the class of ordinals
od: Stephane Demri, i wsp.
Wydane: (2010-12-01)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
od: Dušan Knop, i wsp.
Wydane: (2019-12-01)

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
od: Paola Bruscoli, i wsp.
Wydane: (2016-05-01)

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
od: Ahmed Bouajjani, i wsp.
Wydane: (2009-04-01)

Formalizing Randomized Matching Algorithms
od: Dai Tri Man Le, i wsp.
Wydane: (2012-08-01)

Visibly Tree Automata with Memory and Constraints
od: Hubert Comon-Lundh, i wsp.
Wydane: (2008-06-01)

Polynomial Size Analysis of First-Order Shapely Functions
od: Olha Shkaravska, i wsp.
Wydane: (2009-05-01)

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
od: Vincent Atassi, i wsp.
Wydane: (2007-11-01)

Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
od: Jan Krajíček
Wydane: (2012-08-01)

Width and size of regular resolution proofs
od: Alasdair Urquhart
Wydane: (2012-06-01)

Bootstrapping Inductive and Coinductive Types in HasCASL
od: Lutz Schröder
Wydane: (2008-12-01)

Improved Algorithms for Parity and Streett objectives
od: Krishnendu Chatterjee, i wsp.
Wydane: (2017-09-01)

Well-definedness of Streams by Transformation and Termination
od: Hans H Zantema
Wydane: (2010-09-01)

Nested Hoare Triples and Frame Rules for Higher-order Store
od: Jan Schwinghammer, i wsp.
Wydane: (2011-09-01)

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
od: Takahito Aoto, i wsp.
Wydane: (2012-03-01)

Weighted Logics for Nested Words and Algebraic Formal Power Series
od: Christian Mathissen
Wydane: (2010-02-01)

Generic Modal Cut Elimination Applied to Conditional Logics
od: Dirk Pattinson, i wsp.
Wydane: (2011-03-01)

Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
od: Silvio Ghilardi, i wsp.
Wydane: (2010-12-01)

A Reduced Semantics for Deciding Trace Equivalence
od: David Baelde, i wsp.
Wydane: (2017-06-01)

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
od: Paolo Baldan, i wsp.
Wydane: (2008-10-01)

Guarded Second-Order Logic, Spanning Trees, and Network Flows
od: Achim Blumensath
Wydane: (2010-02-01)

Failure Trace Semantics for a Process Algebra with Time-outs
od: Rob van Glabbeek
Wydane: (2021-04-01)

Concurrency and Probability: Removing Confusion, Compositionally
od: Roberto Bruni, i wsp.
Wydane: (2019-12-01)

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
od: Samuel R. Buss, i wsp.
Wydane: (2008-12-01)

Psi-calculi: a framework for mobile processes with nominal data and logic
od: Jesper Bengtson, i wsp.
Wydane: (2011-03-01)

Event Structures for Petri nets with Persistence
od: Paolo Baldan, i wsp.
Wydane: (2018-09-01)

Ologisms
od: Ruggero Pagnan
Wydane: (2018-08-01)

Efficient Open World Reasoning for Planning
od: Tamara Babaian, i wsp.
Wydane: (2006-09-01)

Tractable Combinations of Temporal CSPs
od: Manuel Bodirsky, i wsp.
Wydane: (2022-05-01)

The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
od: Manuel Bodirsky, i wsp.
Wydane: (2020-02-01)

Complexity classifications for different equivalence and audit problems for Boolean circuits
od: Elmar BÃ¶hler, i wsp.
Wydane: (2012-09-01)

A Strategy for Dynamic Programs: Start over and Muddle through
od: Samir Datta, i wsp.
Wydane: (2019-05-01)

Randomisation and Derandomisation in Descriptive Complexity Theory
od: Kord Eickmeyer, i wsp.
Wydane: (2011-09-01)

A lower bound on web services composition
od: Anca Muscholl, i wsp.
Wydane: (2008-05-01)

Essential Convexity and Complexity of Semi-Algebraic Constraints
od: Manuel Bodirsky, i wsp.
Wydane: (2012-10-01)

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
od: Makoto Hamana
Wydane: (2017-11-01)