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

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों:	Neil Ghani, Peter Hancock, Dirk Pattinson
स्वरूप:	लेख
भाषा:	English
प्रकाशित:	Logical Methods in Computer Science e.V. 2009-09-01
श्रृंखला:	Logical Methods in Computer Science
विषय:	computer science - data structures and algorithms computer science - logic in computer science e.1 e.2 f.2.1 f.2.2
ऑनलाइन पहुंच:	https://lmcs.episciences.org/713/pdf

समान संसाधन

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
द्वारा: Lijun Zhang, और अन्य
प्रकाशित: (2008-11-01)

The complexity of global cardinality constraints
द्वारा: Andrei A. Bulatov, और अन्य
प्रकाशित: (2010-10-01)

Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
द्वारा: Lars Kuhtz, और अन्य
प्रकाशित: (2012-10-01)

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
द्वारा: Libor Barto, और अन्य
प्रकाशित: (2012-02-01)

The complexity of linear-time temporal logic over the class of ordinals
द्वारा: Stephane Demri, और अन्य
प्रकाशित: (2010-12-01)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
द्वारा: Dušan Knop, और अन्य
प्रकाशित: (2019-12-01)

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
द्वारा: Paola Bruscoli, और अन्य
प्रकाशित: (2016-05-01)

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
द्वारा: Ahmed Bouajjani, और अन्य
प्रकाशित: (2009-04-01)

Formalizing Randomized Matching Algorithms
द्वारा: Dai Tri Man Le, और अन्य
प्रकाशित: (2012-08-01)

Visibly Tree Automata with Memory and Constraints
द्वारा: Hubert Comon-Lundh, और अन्य
प्रकाशित: (2008-06-01)

Polynomial Size Analysis of First-Order Shapely Functions
द्वारा: Olha Shkaravska, और अन्य
प्रकाशित: (2009-05-01)

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
द्वारा: Vincent Atassi, और अन्य
प्रकाशित: (2007-11-01)

Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
द्वारा: Jan Krajíček
प्रकाशित: (2012-08-01)

Width and size of regular resolution proofs
द्वारा: Alasdair Urquhart
प्रकाशित: (2012-06-01)

Bootstrapping Inductive and Coinductive Types in HasCASL
द्वारा: Lutz Schröder
प्रकाशित: (2008-12-01)

Improved Algorithms for Parity and Streett objectives
द्वारा: Krishnendu Chatterjee, और अन्य
प्रकाशित: (2017-09-01)

Well-definedness of Streams by Transformation and Termination
द्वारा: Hans H Zantema
प्रकाशित: (2010-09-01)

Nested Hoare Triples and Frame Rules for Higher-order Store
द्वारा: Jan Schwinghammer, और अन्य
प्रकाशित: (2011-09-01)

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
द्वारा: Takahito Aoto, और अन्य
प्रकाशित: (2012-03-01)

Weighted Logics for Nested Words and Algebraic Formal Power Series
द्वारा: Christian Mathissen
प्रकाशित: (2010-02-01)

Generic Modal Cut Elimination Applied to Conditional Logics
द्वारा: Dirk Pattinson, और अन्य
प्रकाशित: (2011-03-01)

Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
द्वारा: Silvio Ghilardi, और अन्य
प्रकाशित: (2010-12-01)

A Reduced Semantics for Deciding Trace Equivalence
द्वारा: David Baelde, और अन्य
प्रकाशित: (2017-06-01)

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
द्वारा: Paolo Baldan, और अन्य
प्रकाशित: (2008-10-01)

Guarded Second-Order Logic, Spanning Trees, and Network Flows
द्वारा: Achim Blumensath
प्रकाशित: (2010-02-01)

Failure Trace Semantics for a Process Algebra with Time-outs
द्वारा: Rob van Glabbeek
प्रकाशित: (2021-04-01)

Concurrency and Probability: Removing Confusion, Compositionally
द्वारा: Roberto Bruni, और अन्य
प्रकाशित: (2019-12-01)

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
द्वारा: Samuel R. Buss, और अन्य
प्रकाशित: (2008-12-01)

Psi-calculi: a framework for mobile processes with nominal data and logic
द्वारा: Jesper Bengtson, और अन्य
प्रकाशित: (2011-03-01)

Event Structures for Petri nets with Persistence
द्वारा: Paolo Baldan, और अन्य
प्रकाशित: (2018-09-01)

Ologisms
द्वारा: Ruggero Pagnan
प्रकाशित: (2018-08-01)

Efficient Open World Reasoning for Planning
द्वारा: Tamara Babaian, और अन्य
प्रकाशित: (2006-09-01)

Tractable Combinations of Temporal CSPs
द्वारा: Manuel Bodirsky, और अन्य
प्रकाशित: (2022-05-01)

The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
द्वारा: Manuel Bodirsky, और अन्य
प्रकाशित: (2020-02-01)

Complexity classifications for different equivalence and audit problems for Boolean circuits
द्वारा: Elmar BÃ¶hler, और अन्य
प्रकाशित: (2012-09-01)

A Strategy for Dynamic Programs: Start over and Muddle through
द्वारा: Samir Datta, और अन्य
प्रकाशित: (2019-05-01)

Randomisation and Derandomisation in Descriptive Complexity Theory
द्वारा: Kord Eickmeyer, और अन्य
प्रकाशित: (2011-09-01)

A lower bound on web services composition
द्वारा: Anca Muscholl, और अन्य
प्रकाशित: (2008-05-01)

Essential Convexity and Complexity of Semi-Algebraic Constraints
द्वारा: Manuel Bodirsky, और अन्य
प्रकाशित: (2012-10-01)

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
द्वारा: Makoto Hamana
प्रकाशित: (2017-11-01)