Skip to content
<title>Channels - A Functional Abstraction of Typed Invocation Contexts :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
A Functional Abstraction of Typed Invocation Contexts
Search for more channels:
Similar Items: A Functional Abstraction of Typed Invocation Contexts
Channel Options
View Record
Explore related channels
Quick Look
Extended Initiality for Typed Abstract Syntax
Quick Look
Scientific abstracts: Texts, contexts, and subtexts
Quick Look
Fully Abstract Encodings of $lambda$-Calculus in HOcore through Abstract Machines
Quick Look
Abstract Model Repair
Quick Look
Games for Bisimulations and Abstraction
Quick Look
Abstract Completion, Formalized
Quick Look
A rich hierarchy of functionals of finite types
Quick Look
Relating Functional and Imperative Session Types
Quick Look
Predicate Abstraction with Under-approximation Refinement
Quick Look
Full abstraction for nominal general references
Quick Look
Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretability
Quick Look
Predicate Abstraction via Symbolic Decision Procedures
Quick Look
Automatic Modular Abstractions for Template Numerical Constraints
Quick Look
Formalization of Abstract State Transition Systems for SAT
Quick Look
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
Quick Look
A tier-based typed programming language characterizing Feasible Functionals
Quick Look
Inductive Definition and Domain Theoretic Properties of Fully Abstract
Quick Look
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
Quick Look
Constraint solving in non-permutative nominal abstract syntax
Quick Look
Coarse abstractions make Zeno behaviours difficult to detect
Quick Look
Full abstraction for fair testing in CCS (expanded version)
Quick Look
Modular, Fully-abstract Compilation by Approximate Back-translation
Quick Look
Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
Quick Look
A Fully Abstract Model of PCF Based on Extended Addressing Machines
Load more items
View Record
Prev
Explore related channels
Next
