The following pages link to Types and programing languages (Q2778806):
Displaying 50 items.
- Comparing type systems for deadlock freedom (Q2667185) (← links)
- Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
- Reasoning in Abella about structural operational semantics specifications (Q2804943) (← links)
- Categories of timed stochastic relations (Q2805158) (← links)
- Practical foundations for programming languages (Q2805272) (← links)
- Implicit propagation in structural operational semantics (Q2810689) (← links)
- A Gentle Introduction to Multiparty Asynchronous Session Types (Q2822666) (← links)
- A Type Theory for Robust Failure Handling in Distributed Systems (Q2827463) (← links)
- A calculus of global interaction based on session types (Q2864218) (← links)
- A parametric calculus for mobile open code (Q2864499) (← links)
- Rule-based operational semantics for an imperative language (Q2864516) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- An institutional theory for \#-components (Q2873612) (← links)
- Homotopy type theory and Voevodsky’s univalent foundations (Q2933829) (← links)
- Environment classifiers (Q2942909) (← links)
- Bigraphs and transitions (Q2942911) (← links)
- The m-calculus (Q2942912) (← links)
- A generic approach to the static analysis of concurrent programs with procedures (Q2942913) (← links)
- Discovering affine equalities using random interpretation (Q2942914) (← links)
- Bitwidth aware global register allocation (Q2942915) (← links)
- Folklore confirmed (Q2942916) (← links)
- New results on the computability and complexity of points--to analysis (Q2942917) (← links)
- Incremental algorithms for dispatching in dynamically typed languages (Q2942919) (← links)
- From control effects to typed continuation passing (Q2942920) (← links)
- Coercive subtyping for the calculus of constructions (Q2942921) (← links)
- A type theory for memory allocation and data layout (Q2942924) (← links)
- Static prediction of heap space usage for first-order functional programs (Q2942925) (← links)
- Ownership types for object encapsulation (Q2942927) (← links)
- Guarded recursive datatype constructors (Q2942928) (← links)
- A type system for higher-order modules (Q2942929) (← links)
- Pure patterns type systems (Q2942930) (← links)
- (Q2980974) (← links)
- A Light Modality for Recursion (Q2988388) (← links)
- The Essence of Functional Programming on Semantic Data (Q2988667) (← links)
- $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations (Q2988843) (← links)
- Typing Local Control and State Using Flow Analysis (Q3000584) (← links)
- A New Method for Dependent Parsing (Q3000590) (← links)
- MikiBeta : A General GUI Library for Visualizing Proof Trees (Q3003488) (← links)
- A Language for Biochemical Systems: Design and Formal Specification (Q3068848) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- PiStache: Implementing π-Calculus in Scala (Q3098054) (← links)
- A formal language for cyclic operads (Q3121012) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- New (Q3178271) (← links)
- A Realizability Interpretation for Intersection and Union Types (Q3179292) (← links)
- Unified Syntax with Iso-types (Q3179296) (← links)
- The HOL-Omega Logic (Q3183533) (← links)
- Subtyping Supports Safe Session Substitution (Q3188281) (← links)
- The Recursive Union of Some Gradual Types (Q3188297) (← links)
