The following pages link to Mercury (Q20342):
Displayed 50 items.
- Data decomposition of Monte Carlo particle transport simulations via tally servers (Q348002) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Propagating systems of dense linear integer constraints (Q842789) (← links)
- The design of the zinc modelling language (Q941812) (← links)
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses (Q980470) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Precise goal-independent abstract interpretation of constraint logic programs. (Q1395430) (← links)
- Static and dynamic slicing of constraint logic programs (Q1857275) (← links)
- Online Bayesian inference for the parameters of PRISM programs (Q1945138) (← links)
- Algeo: an algebraic approach to reversibility (Q2097422) (← links)
- A functional account of probabilistic programming with possible worlds. Declarative pearl (Q2163171) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
- Transforming Boolean equalities into constraints (Q2628300) (← links)
- (Q2703693) (← links)
- (Q2723918) (← links)
- (Q2767032) (← links)
- (Q2767145) (← links)
- A Framework for Timed Concurrent Constraint Programming with External Functions (Q2867965) (← links)
- Minimizing the overheads of dependent AND-parallelism (Q2909152) (← links)
- Estimating the overlap between dependent computations for automatic parallelization (Q3087446) (← links)
- Turning Inductive into Equational Specifications (Q3183524) (← links)
- (Q3372484) (← links)
- A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (Q3434630) (← links)
- An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy (Q3507366) (← links)
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (Q3591078) (← links)
- Static Region Analysis for Mercury (Q3608664) (← links)
- A Flexible Search Framework for CHR (Q3616878) (← links)
- Automatic Generation of Test Inputs for Mercury (Q3617431) (← links)
- From Monomorphic to Polymorphic Well-Typings and Beyond (Q3617436) (← links)
- The integration of functions into logic programming: From theory to practice (Q4305632) (← links)
- The execution algorithm of mercury, an efficient purely declarative logic programming language (Q4339846) (← links)
- Towards the uniform implementation of declarative languages (Q4395686) (← links)
- (Q4415100) (← links)
- (Q4421869) (← links)
- The witness properties and the semantics of the Prolog cut (Q4452589) (← links)
- Logic program specialisation through partial deduction: Control issues (Q4452606) (← links)
- Using parametric set constraints for locating errors in CLP programs (Q4452608) (← links)
- Generic program monitoring by trace analysis (Q4452609) (← links)
- Verifying termination and error-freedom of logic programs with <i>block</i> declarations (Q4452637) (← links)
- (Q4499248) (← links)
- (Q4499257) (← links)
- (Q4499271) (← links)
- (Q4499274) (← links)
- Generalizing Def and Pos to Type Analysis (Q4542943) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- Concolic testing in logic programming (Q4593010) (← links)
- Description and Optimization of Abstract Machines in a Dialect of Prolog (Q4593018) (← links)
- Opium: an extendable trace analyzer for Prolog (Q4700389) (← links)
- (Q4702568) (← links)