Pages that link to "Item:Q2842123"
From MaRDI portal
The following pages link to A General Proof System for Modalities in Concurrent Constraint Programming (Q2842123):
Displaying 20 items.
- Dynamic spaces in concurrent constraint programming (Q281160) (← links)
- Proving concurrent constraint programming correct, revisited (Q530860) (← links)
- Subexponential concurrent constraint programming (Q897936) (← links)
- Hybrid and subexponential linear logics (Q1744445) (← links)
- Proof search and certificates for evidential transactions (Q2055859) (← links)
- Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
- Mechanizing focused linear logic in Coq (Q2333326) (← links)
- On concurrent behaviors and focusing in linear logic (Q2358701) (← links)
- On subexponentials, focusing and modalities in concurrent systems (Q2404074) (← links)
- A framework for linear authorization logics (Q2449046) (← links)
- Verification of spatial and temporal modalities in biochemical systems (Q2520667) (← links)
- A proof theoretic view of spatial and temporal dependencies in biochemical systems (Q2628774) (← links)
- Foundations for Reliable and Flexible Interactive Multimedia Scores (Q2942295) (← links)
- (Q3776603) (← links)
- Expressing additives using multiplicatives and subexponentials (Q4637626) (← links)
- (Q5015208) (← links)
- Hybrid linear logic, revisited (Q5236552) (← links)
- Subexponentials in non-commutative linear logic (Q5236554) (← links)
- Programming Languages and Systems (Q5308700) (← links)
- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs (Q5418961) (← links)