Skip to content
Channels - Relational Parametricity for Computational Effects :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Relational Parametricity for Computational Effects
Search for more channels:
Similar Items: Relational Parametricity for Computational Effects
Channel Options
View Record
Explore related channels
Quick Look
Relational Parametricity and Control
Quick Look
Relational Parametricity and Separation Logic
Quick Look
Parametric updates in parametric timed automata
Quick Look
Semantics and Algorithms for Parametric Monitoring
Quick Look
Parametricity for Nested Types and GADTs
Quick Look
Internal Parametricity for Cubical Type Theory
Quick Look
Reachability and liveness in parametric timed automata
Quick Look
On completeness and parametricity in the realizability semantics of System F
Quick Look
Language Preservation Problems in Parametric Timed Automata
Quick Look
A case study on parametric verification of failure detectors
Quick Look
Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
Quick Look
Architectures in parametric component-based systems: Qualitative and quantitative modelling
Quick Look
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Quick Look
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
Quick Look
TarGene: A Nextflow pipeline for the estimation of genetic effects on human traits via semi-parametric methods.
Quick Look
Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
Quick Look
Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models
Quick Look
Parametric a Priori-Aided Beamspace Channel Tracking for Terahertz Massive MIMO Systems
Quick Look
Effective zero-dimensionality for computable metric spaces
Quick Look
Logical relations for coherence of effect subtyping
Quick Look
Products of effective topological spaces and a uniformly computable Tychonoff Theorem
Quick Look
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
Quick Look
Robust non-computability of dynamical systems and computability of robust dynamical systems
Quick Look
A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential
Load more items
View Record
Prev
Explore related channels
Next