The following pages link to (Q5624680):
Displaying 50 items.
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Synthesis of rewrite programs by higher-order and semantic unification (Q749216) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Type inference with subtypes (Q914357) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- Schema induction for logic program synthesis (Q1128483) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- The extended calculus of constructions (ECC) with inductive types (Q1193601) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Mixtus: An automatic partial evaluator for full Prolog (Q1313369) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Logic program synthesis from incomplete specifications (Q1322854) (← links)
- Lower bounds on type checking overloading (Q1350740) (← links)
- Static correctness of hierarchical procedures (Q1351792) (← links)
- Most specific logic programs (Q1356224) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Analogical program derivation based on type theory (Q1802072) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause (Q1959491) (← links)
- A framework for approximate generalization in quantitative theories (Q2104546) (← links)
- Order-sorted equational generalization algorithm revisited (Q2134938) (← links)
- Anti-unification and the theory of semirings (Q2215964) (← links)
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach (Q2219192) (← links)
- Anti-unification for unranked terms and hedges (Q2352488) (← links)
- Higher-order pattern anti-unification in linear time (Q2362208) (← links)
- Metaphors and heuristic-driven theory projection (HDTP) (Q2368944) (← links)
- Unranked second-order anti-unification (Q2401634) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
- E-generalization using grammars (Q2457667) (← links)
- A certifying square root and division elimination (Q2520687) (← links)
- A higher-order calculus and theory abstraction (Q2639838) (← links)
- A Library of Anti-unification Algorithms (Q2938520) (← links)
- On Generalization and Subsumption for Ordered Clauses (Q3617035) (← links)
- A Modular Equational Generalization Algorithm (Q3617428) (← links)
- Order-Sorted Generalization (Q4982625) (← links)
- A New Algorithm for Computing Least Generalization of a Set of Atoms (Q5041770) (← links)
- Polymorphic type inference with overloading and subtyping (Q5044772) (← links)
- A Generic Framework for Higher-Order Generalizations. (Q5089010) (← links)
- Heuristic-Driven Theory Projection: An Overview (Q5739525) (← links)
- Analogical logic program synthesis algorithm that can refute inappropriate similarities (Q6083916) (← links)
- Variant-based equational anti-unification (Q6160760) (← links)
- One or nothing: anti-unification over the simply-typed lambda calculus (Q6610194) (← links)
