Higher-Order Unification via Explicit Substitutions

doi 10.1109/lics.1995.523271
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Ramified Higher-Order Unification

English

Linear Unification of Higher-Order Patterns

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Higher-Order Unification Revisited: Complete Sets of Transformations

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1989English

Higher-Order Pattern Anti-Unification in Linear Time

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2016English

Partial Polymorphic Type Inference and Higher-Order Unification

1988English

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Cut Rules and Explicit Substitutions

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2001English

A Higher-Order Closure Model With an Explicit PBL Top

Journals of the Atmospheric Sciences
Atmospheric Science
2010English

Reductions, Intersection Types, and Explicit Substitutions

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy