GHC
From MaRDI portal
GHC Q35532
Cited in
(64)- Specification and initialization of a logic computer system
- Control and data driven execution of logic programs: A comparison
- Making exhaustive search programs deterministic
- An execution model for exploiting AND-parallelism in logic programs
- Flat Parlog: A basis for comparison
- Unfolding rules for GHC programs
- Contributions to the semantics of logic perpetual processes
- An abstract machine for the implementation of PARLOG on uniprocessors
- Semantic models for concurrent logic languages
- A canonical form for generalized linear constraints
- The implementation of a distributed model for logic programming based on multiple-headed clauses
- An algebraic semantics for structured transition systems and its application to logic programs
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- The semantics of the combination of atomized statements and parallel choice
- MLOG: A strongly typed confluent functional language with logical variables
- Bounded quantifications for iteration and concurrency in logic programming
- MLOG
- HYPROLOG
- KLIC
- DASWAM
- Real number computation with committed choice logic programming languages
- P-Prolog: A parallel logic language based on exclusive relation
- Compiling OR-parallelism into AND-parallelism
- clpfd
- CDAOstore
- Kima: An automated error correction system for concurrent logic programs
- wamcc
- LMNtal
- PhyloWS
- Kima
- TeaBag
- Kernel-LEAF
- Multilisp
- Janus
- Models and emerging trends of concurrent constraint programming
- WebPIE
- YapOr
- OPTYap
- PARLOG
- April
- scientific article; zbMATH DE number 4074449 (Why is no real title available?)
- scientific article; zbMATH DE number 4092730 (Why is no real title available?)
- LPaaS
- HaLoop
- tccp
- Yedalog
- SWISH DataLab
- DiSCiPl
- scientific article; zbMATH DE number 1497827 (Why is no real title available?)
- scientific article; zbMATH DE number 1926605 (Why is no real title available?)
- Constraint-based concurrency and beyond
- TCC, with history
- 2P-Kt
- tuProlog
- scientific article; zbMATH DE number 2242583 (Why is no real title available?)
- A parallel parsing system for natural language analysis
- VeriFly
- CUD@SAT
- An integrated framework for the diagnosis and correction of rule-based programs
- Locally parallel cache design based on KL1 memory access characteristics
- Transforming generate-and-test programs to execute under committed-choice AND-parallelism
- Comparative metric semantics for concurrent PROLOG
- Finite failures and partial computations in concurrent logic languages
- A declarative semantics of flat guarded Horn clauses for programs with perpetual processes
This page was built for software: GHC
