Channels - Guarded and Unguarded Iteration for Generalized Processes :: FRELIP Discovery

Similar Items: Guarded and Unguarded Iteration for Generalized Processes

Quick Look
Unguarded Recursion on Coinductive Resumptions
Quick Look
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
Quick Look
Querying the Guarded Fragment
Quick Look
On guarded extensions of MMSNP
Quick Look
Logics with rigidly guarded data tests
Quick Look
Answer Counting under Guarded TGDs
Quick Look
Tighter Bounds for Query Answering with Guarded TGDs
Quick Look
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
Quick Look
Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
Quick Look
A Generalization of Iterative Closest Point Registration Algorithms Using a Local Reference Frame-Based SE(3) Augmentation
Quick Look
Guarded Second-Order Logic, Spanning Trees, and Network Flows
Quick Look
msibi: Multistate Iterative Boltzmann Inversion
Quick Look
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
Quick Look
On two-variable guarded fragment logic with expressive local Presburger constraints
Quick Look
EasyGuard: A Gamified App for Generating Strong and Memorable Passwords
Quick Look
First steps in synthetic guarded domain theory: step-indexing in the topos of trees
Quick Look
AdaptivePixGuard: Attention-Enhanced Temporal Convolutions for Robust Mobile Pixnapping Detection
Quick Look
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
Quick Look
Decentralized Bilevel Optimization: A Perspective from Transient Iteration Complexity
Quick Look
Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
Quick Look
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
Quick Look
Last-iterate Convergence of Shuffling Momentum Gradient Method under the Kurdyka-Lojasiewicz Inequality
Quick Look
Affine Rank Minimization via Asymptotic Log-Det Iteratively Reweighted Least Squares
Quick Look
Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis