The following pages link to PARLOG (Q35531):
Displaying 36 items.
- A parallel parsing system for natural language analysis (Q580997) (← links)
- Transforming generate-and-test programs to execute under committed-choice AND-parallelism (Q914360) (← links)
- Finite failures and partial computations in concurrent logic languages (Q915476) (← links)
- A declarative semantics of flat guarded Horn clauses for programs with perpetual processes (Q915481) (← links)
- Specification and initialization of a logic computer system (Q1076506) (← links)
- Dataflow computing and Eager and Lazy evaluations (Q1077928) (← links)
- Control and data driven execution of logic programs: A comparison (Q1083186) (← links)
- Set abstraction - an extension of all solutions predicate in logic programming language (Q1094865) (← links)
- Making exhaustive search programs deterministic (Q1094889) (← links)
- An execution model for exploiting AND-parallelism in logic programs (Q1098621) (← links)
- Flat Parlog: A basis for comparison (Q1099945) (← links)
- Unfolding rules for GHC programs (Q1108817) (← links)
- Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
- An abstract machine for the implementation of PARLOG on uniprocessors (Q1115584) (← links)
- A backtracking algorithm for the stream AND-parallel execution of logic programs (Q1118390) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- An operational formal definition of PROLOG: A specification method and its application (Q1186100) (← links)
- A methodology for detecting shared variable dependencies in logic programs (Q1186710) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
- Semantics of distributed definite clause programs (Q1262747) (← links)
- Parallelism in logic programs (Q1360680) (← links)
- The correctness of nondeterministic programs revisited (Q1819925) (← links)
- P-Prolog: A parallel logic language based on exclusive relation (Q1819929) (← links)
- Compiling OR-parallelism into AND-parallelism (Q1819930) (← links)
- Kernel-LEAF: A logic plus functional language (Q2638759) (← links)
- Parallélisation sémantique (Q3479539) (← links)
- Notes on the implementation of PARLOG (Q3694655) (← links)
- (Q3721800) (← links)
- (Q3725570) (← links)
- PARLOG and its applications (Q3806790) (← links)
- Logic and functional programming by retractions (Q3817574) (← links)
- (Q4288282) (← links)
- (Q4701967) (← links)
- (Q4721627) (← links)
- Guarded horn clauses (Q5044782) (← links)
