Pages that link to "Item:Q1177921"

The following pages link to Semantic models for concurrent logic languages (Q1177921):

Displaying 10 items.

• Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
• Comparative metric semantics for concurrent PROLOG (Q915474) (← links)
• Finite failures and partial computations in concurrent logic languages (Q915476) (← links)
• Designing equivalent semantic models for process creation (Q1107305) (← links)
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic (Q1194328) (← links)
• A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
• Fully abstract denotational models for nonuniform concurrent languages (Q1341758) (← links)
• Syntactic forcing models for coherent logic (Q1788327) (← links)
• Linking semantic models to support \(\mathrm{CSP} \parallel \mathrm{B}\) consistency checking (Q2863864) (← links)
• (Q3839979) (← links)