Semantic models for concurrent logic languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3951990 (Why is no real title available?)
- scientific article; zbMATH DE number 3958700 (Why is no real title available?)
- scientific article; zbMATH DE number 4053011 (Why is no real title available?)
- scientific article; zbMATH DE number 4074449 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 17798 (Why is no real title available?)
- scientific article; zbMATH DE number 41233 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- Declarative modeling of the operational behavior of logic languages
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- Notes on the implementation of PARLOG
- PARLOG: parallel programming in logic
- Processes and the denotational semantics of concurrency
- Properties of substitutions and unifications
- Solving reflexive domain equations in a category of complete metric spaces
- The Semantics of Predicate Logic as a Programming Language
Cited in
(15)- scientific article; zbMATH DE number 1407676 (Why is no real title available?)
- scientific article; zbMATH DE number 4018368 (Why is no real title available?)
- Syntactic forcing models for coherent logic
- A fully abstract semantics for concurrent constraint programming
- scientific article; zbMATH DE number 1186722 (Why is no real title available?)
- Putting logic-based distributed systems on stable grounds
- Linking semantic models to support \(\mathrm{CSP} \parallel \mathrm{B}\) consistency checking
- Fully abstract denotational models for nonuniform concurrent languages
- scientific article; zbMATH DE number 3951990 (Why is no real title available?)
- scientific article; zbMATH DE number 3958700 (Why is no real title available?)
- Finite failures and partial computations in concurrent logic languages
- Nondeterminism and infinite computations in constraint programming
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- Comparative metric semantics for concurrent PROLOG
- Designing equivalent semantic models for process creation
This page was built for publication: Semantic models for concurrent logic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177921)