Skip to content
<title>Channels - Ludics with repetitions (Exponentials, Interactive types and Completeness) :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Ludics with repetitions (Exponentials, Interactive types and Completeness)
Search for more channels:
Similar Items: Ludics with repetitions (Exponentials, Interactive types and Completeness)
Channel Options
View Record
Explore related channels
Quick Look
Incarnation in Ludics and maximal cliques of paths
Quick Look
Interaction Graphs: Exponentials
Quick Look
Reasoning about Data Repetitions with Counter Systems
Quick Look
Linear Dependent Types and Relative Completeness
Quick Look
Playing with Repetitions in Data Words Using Energy Games
Quick Look
Point-free Construction of Real Exponentiation
Quick Look
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
Quick Look
Simply typed convertibility is TOWER-complete even for safe lambda-terms
Quick Look
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
Quick Look
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
Quick Look
Linear cost and exponentially convergent approximation of Gaussian Matérn processes on intervals
Quick Look
Machine Space I: Weak exponentials and quantification over compact spaces
Quick Look
A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
Quick Look
Non-Contact Human Height Estimation Based on Pulse Count and Walking Repetition Characteristics Using a 24 GHz Radar
Quick Look
Exponential Family Graphical Models: Correlated Replicates and Unmeasured Confounders, with Applications to fMRI Data
Quick Look
Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
Quick Look
On the meaning of logical completeness
Quick Look
Abstract Completion, Formalized
Quick Look
Completeness of the ZX-Calculus
Quick Look
Completeness of Nominal PROPs
Quick Look
Completeness for the coalgebraic cover modality
Quick Look
Strongly Complete Logics for Coalgebras
Quick Look
Localic completion of uniform spaces
Quick Look
Weihrauch-completeness for layerwise computability
Load more items
View Record
Prev
Explore related channels
Next
