Pages that link to "Item:Q4339846"
From MaRDI portal
The following pages link to The execution algorithm of mercury, an efficient purely declarative logic programming language (Q4339846):
Displayed 43 items.
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← 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)
- 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)
- Representation sharing for Prolog (Q2845123) (← links)
- A Framework for Timed Concurrent Constraint Programming with External Functions (Q2867965) (← links)
- An overview of Ciao and its design philosophy (Q2893101) (← links)
- On Termination, Confluence and Consistent CHR-based Type Inference (Q2931268) (← links)
- Turning Inductive into Equational Specifications (Q3183524) (← links)
- Efficient description logic reasoning in Prolog: The DLog system (Q3393230) (← 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)
- Monadic constraint programming (Q3648354) (← links)
- (Q4499248) (← links)
- (Q4499257) (← links)
- (Q4499271) (← links)
- (Q4499274) (← 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)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- (Q5020543) (← links)
- From Logic to Functional Logic Programs (Q5038460) (← links)
- Concolic Testing in CLP (Q5140007) (← links)
- From High-Level Model to Branch-and-Price Solution in G12 (Q5387632) (← links)
- Region-based memory management for Mercury programs (Q5398287) (← links)
- Improving precision of type analysis using non-discriminative union (Q5437649) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- Towards a Normal Form for Mercury Programs (Q5504592) (← links)
- Towards Typed Prolog (Q5504693) (← links)
- \(\exists\)-Universal termination of logic programs (Q5940923) (← links)
- VeriFly: <i>On-the-fly Assertion Checking via Incrementality</i> (Q6063866) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Data type inference for logic programming (Q6102248) (← links)
- Linearity and uniqueness: an entente cordiale (Q6166794) (← links)