Pages that link to "Item:Q3003510"
From MaRDI portal
The following pages link to Functional and Constraint Logic Programming (Q3003510):
Displaying 14 items.
- Types for Role-Based Access Control of Dynamic Web Data (Q3003511) (← links)
- Transforming Functional Logic Programs into Monadic Functional Programs (Q3003513) (← links)
- An Access Control Language Based on Term Rewriting and Description Logic (Q3003515) (← links)
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry (Q3003516) (← links)
- Bridging the Gap between Two Concurrent Constraint Languages (Q3003518) (← links)
- Constraint Based Strategies (Q3557093) (← links)
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures (Q3557094) (← links)
- Semantic Labelling for Proving Termination of Combinatory Reduction Systems (Q3557095) (← links)
- A Taxonomy of Some Right-to-Left String-Matching Algorithms (Q3557096) (← links)
- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types (Q3557097) (← links)
- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation (Q3557098) (← links)
- New Results on Type Systems for Functional Logic Programming (Q3557099) (← links)
- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions (Q3557101) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
