Amanote Research

Amanote Research

    RegisterSign In

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Lecture Notes in Computer Science - Germany
doi 10.1007/11814771_32
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Brigitte Pientka
Publisher

Springer Berlin Heidelberg


Related search

Ramified Higher-Order Unification

English

Higher-Order Unification via Explicit Substitutions

English

Linear Unification of Higher-Order Patterns

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Higher-Order Pattern Anti-Unification in Linear Time

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2016English

Higher-Order Unification Revisited: Complete Sets of Transformations

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1989English

Partial Polymorphic Type Inference and Higher-Order Unification

1988English

Quark Lepton Unification in Higher Dimensions

Physical Review D
2012English

A Recurrence Relation Approach to Higher Order Quantum Superintegrability

Symmetry, Integrability and Geometry: Methods and Applications (SIGMA)
GeometryMathematical PhysicsAnalysisTopology
2011English

Simplifying the Signature in Second-Order Unification

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy