Skip to content
<title>Channels - Sequential decision problems, dependent types and generic solutions :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Sequential decision problems, dependent types and generic solutions
Search for more channels:
Similar Items: Sequential decision problems, dependent types and generic solutions
Channel Options
View Record
Explore related channels
Quick Look
Generic algorithms for halting problem and optimal machines revisited
Quick Look
Generic Fibrational Induction
Quick Look
Generic Trace Semantics via Coinduction
Quick Look
Multimodal Dependent Type Theory
Quick Look
Algebraic Presentations of Type Dependency
Quick Look
A dependent nominal type theory
Quick Look
Linear Dependent Types and Relative Completeness
Quick Look
Sequential Relational Decomposition
Quick Look
Generic Modal Cut Elimination Applied to Conditional Logics
Quick Look
Solution of a Problem of Barendregt on Sensible lambda-Theories
Quick Look
Infinite sequential Nash equilibrium
Quick Look
Optimizing ASReview Simulations: A generic Multiprocessing Solution for ‘Light-data’ and ‘Heavy-data’ Users
Quick Look
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
Quick Look
The Algebraic Intersection Type Unification Problem
Quick Look
An extensible equality checking algorithm for dependent type theories
Quick Look
Linear Dependent Type Theory for Quantum Programming Languages
Quick Look
Decision problems for linear recurrences involving arbitrary real numbers
Quick Look
Quantitative information flow under generic leakage functions and adaptive adversaries
Quick Look
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Quick Look
The sequential functionals of type $(iota rightarrow iota)^n rightarrow iota$ form a dcpo for all $n in Bbb N$
Quick Look
Bistable Biorders: A Sequential Domain Theory
Quick Look
Logical Concurrency Control from Sequential Proofs
Quick Look
Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
Quick Look
Model Checking CTL is Almost Always Inherently Sequential
Load more items
View Record
Prev
Explore related channels
Next
