Pages that link to "Item:Q2500473"
From MaRDI portal
The following pages link to Ensuring termination by typability (Q2500473):
Displaying 12 items.
- Termination in higher-order concurrent calculi (Q710674) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Dependent types for program termination verification (Q1850960) (← links)
- Causal computational complexity of distributed processes (Q2112798) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- Termination in a π-calculus with subtyping (Q2971078) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Typed ψ-calculi (Q3090835) (← links)
- Mobile Processes and Termination (Q3184750) (← links)
- Logic Programming (Q5191484) (← links)
- Divergence and unique solution of equations (Q5228882) (← links)
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination (Q6488159) (← links)