Pages that link to "Item:Q1801289"
From MaRDI portal
The following pages link to Computational aspects of an order-sorted logic with term declarations (Q1801289):
Displaying 39 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics (Q687153) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- The calculus of context relations (Q918720) (← links)
- A rewrite-based type discipline for a subset of computer algebra (Q1176783) (← links)
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning (Q1182164) (← links)
- Semantics of order-sorted specifications (Q1185014) (← links)
- An order-sorted logic for knowledge representation systems (Q1193487) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Reduction and unification in lambda calculi with a general notion of subtype (Q1340967) (← links)
- Another look at parameterization for oder-sorted algebraic specifications (Q1342863) (← links)
- On Skolemization in constrained logics (Q1380406) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- An order-sorted resolution in theory and practice (Q1390960) (← links)
- Fuzzy types: A framework for handling uncertainty about types of objects (Q1594851) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- A typed resolution principle for deduction with conditional typing theory (Q1855225) (← links)
- A note on assumptions about Skolem functions (Q1904405) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- (Q4222859) (← links)
- Projection: A unification procedure for tableaux in Conceptual Graphs (Q4610329) (← links)
- Dynamically-typed computations for order-sorted equational presentations (Q4632447) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- Regular substitution sets: A means of controlling E-unification (Q5055844) (← links)
- A simple abstract semantics for equational theories (Q5055883) (← links)
- Equality and disequality constraints on direct subterms in tree automata (Q5096779) (← links)
- A mechanization of strong Kleene logic for partial functions (Q5210785) (← links)
- Unification in an extensional lambda calculus with ordered function sorts and constant overloading (Q5210801) (← links)
- Unique-sort order-sorted theories : A description as monad morphisms (Q5881299) (← links)
- Higher-order unification, polymorphism, and subsorts (Q5881304) (← links)
- Tableau methods for a logic with term declarations (Q5927986) (← links)
- Currying of order-sorted term rewriting systems (Q6085707) (← links)
- (Q6488530) (← links)
- Reasoning with preorders and dynamic sorts using free variable tableaux (Q6560387) (← links)
