Pith. sign in

Title resolution pending

Pair Channel Int Channel Figure 25: Splitting among values llambda : ∀ {t1 t2} → (body : Expr (t1 :: Φ) t2) → Expr Φ (TFun LL t1 t2) rec : ∀ {t1 t2} → (unr-Φ : All Unr Φ) → let t = TFun UU t1 t2 in (body : Expr (t :: t1 :: Φ) t2) → Expr Φ t · 2018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.PL 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Intrinsically-Typed Mechanized Semantics for Session Types

cs.PL · 2019-08-08 · conditional · novelty 7.0

An Agda implementation of an intrinsically typed CEK machine proves type preservation and a scheduler-defined relative progress property for a functional session-typed calculus with recursion and subtyping.

citing papers explorer

Showing 1 of 1 citing paper.

  • Intrinsically-Typed Mechanized Semantics for Session Types cs.PL · 2019-08-08 · conditional · partial · ref 2

    An Agda implementation of an intrinsically typed CEK machine proves type preservation and a scheduler-defined relative progress property for a functional session-typed calculus with recursion and subtyping.