Unfolding and fixpoint semantics of concurrent constraint logic programs
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 204-216
- https://doi.org/10.1007/3-540-53162-9_40
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Concurrent constraint programmingPublished by Association for Computing Machinery (ACM) ,1990
- On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequencesPublished by Springer Nature ,1990
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- Unfolding rules for GHC programsNew Generation Computing, 1988
- Fully abstract denotational semantics for flat Concurrent PrologPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Concurrent Prolog: A Progress ReportComputer, 1986
- PARLOG: parallel programming in logicACM Transactions on Programming Languages and Systems, 1986
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976