The following pages link to (Q3994465):
Displaying 22 items.
- GHC (Q35532) (← links)
- A parallel parsing system for natural language analysis (Q580997) (← links)
- Transforming generate-and-test programs to execute under committed-choice AND-parallelism (Q914360) (← links)
- Comparative metric semantics for concurrent PROLOG (Q915474) (← 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)
- Control and data driven execution of logic programs: A comparison (Q1083186) (← 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)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- A canonical form for generalized linear constraints (Q1186697) (← 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)
- MLOG: A strongly typed confluent functional language with logical variables (Q1314424) (← links)
- Real number computation with committed choice logic programming languages (Q1779564) (← links)
- P-Prolog: A parallel logic language based on exclusive relation (Q1819929) (← links)
- Compiling OR-parallelism into AND-parallelism (Q1819930) (← links)
