scientific article; zbMATH DE number 3349328
From MaRDI portal
Publication:5624680
Cited in
(61)- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- An algebraic semantics approach to the effective resolution of type equations
- Schema induction for logic program synthesis
- Varieties of chain-complete algebras
- Reduction rules for resolution-based systems
- The extended calculus of constructions (ECC) with inductive types
- C-expressions: A variable-free calculus for equational logic programming
- Mixtus: An automatic partial evaluator for full Prolog
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- Sound and complete partial deduction with unfolding based on well-founded measures
- Logic program synthesis from incomplete specifications
- Lower bounds on type checking overloading
- Static correctness of hierarchical procedures
- Most specific logic programs
- Learning unions of tree patterns using queries
- A game semantics for generic polymorphism
- Analogical program derivation based on type theory
- Evolution of rule-based programs
- The Girard-Reynolds isomorphism
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- A framework for approximate generalization in quantitative theories
- Order-sorted equational generalization algorithm revisited
- Anti-unification and the theory of semirings
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
- Anti-unification for unranked terms and hedges
- Higher-order pattern anti-unification in linear time
- Metaphors and heuristic-driven theory projection (HDTP)
- Unranked second-order anti-unification
- On the generation of quantified lemmas
- A modular order-sorted equational generalization algorithm
- E-generalization using grammars
- A certifying square root and division elimination
- A higher-order calculus and theory abstraction
- A library of anti-unification algorithms
- On Generalization and Subsumption for Ordered Clauses
- A Modular Equational Generalization Algorithm
- Existential type systems between Church and Curry style (type-free style)
- Order-sorted generalization
- A new algorithm for computing least generalization of a set of atoms
- Polymorphic type inference with overloading and subtyping
- A Generic Framework for Higher-Order Generalizations.
- Heuristic-driven theory projection: an overview
- Learning unions of tree patterns using queries
- Analogical logic program synthesis algorithm that can refute inappropriate similarities
- Variant-based equational anti-unification
- Matching and Generalization Modulo Proximity and Tolerance Relations
- Towards Fast Nominal Anti-unification of Letrec-Expressions
- Learning Proof Transformations and Its Applications in Interactive Theorem Proving
- One or nothing: anti-unification over the simply-typed lambda calculus
- Unital anti-unification: type and algorithms
- Generalization-based similarity
- Non-distributive lattices, stable matchings, and linear optimization
- Efficient parallel term matching and anti-unification
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
- Fuzzy order-sorted feature logic
- Logic program proportions
- Some properties of substitutions in the framework of similarity relations
- Equational anti-unification over absorption theories
- Synthesis of rewrite programs by higher-order and semantic unification
- The Girard-Reynolds isomorphism (second edition)
- Type inference with subtypes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5624680)
