Pages that link to "Item:Q3936229"
From MaRDI portal
The following pages link to An Efficient Unification Algorithm (Q3936229):
Displaying 50 items.
- Effective codescent morphisms in the varieties determined by convergent term rewriting systems. (Q278228) (← links)
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Bounding messages for free in security protocols -- extension to various security properties (Q476179) (← links)
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
- Proximity-based unification theory (Q529054) (← links)
- A linear algorithm for MLL proof net correctness and sequentialization (Q534705) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- An almost linear Robinson unification algorithm (Q582141) (← links)
- Order-sorted unification (Q582269) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- An intensional epistemic logic (Q687156) (← links)
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- A sound and complete semantics for a similarity-based logic programming language (Q723251) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- A practical unification algorithm (Q751312) (← links)
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- Accumulators: New logic variable abstractions for functional languages (Q808233) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Logic programming as classical inference (Q898781) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- Type inference with subtypes (Q914357) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Safely composing security protocols (Q1028731) (← links)
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
- Context unification with one context variable (Q1041589) (← links)
- Properties of substitutions and unifications (Q1074342) (← links)
- A parallel algorithm for the monadic unification problem (Q1083189) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Unification problems with one-sided distributivity (Q1099650) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- A practically efficient and almost linear unification algorithm (Q1105360) (← links)
- A unification algorithm for second-order monadic terms (Q1109019) (← links)
- Finite generation of ambiguity in context-free languages (Q1117043) (← links)
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- Equational problems and disunification (Q1124372) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
