Higher order unification via explicit substitutions (Q1854337): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/inco.1999.2837 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite representations of infinite sequences of terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence properties of weak and strong calculi of explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5748888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Turing machines by a regular rewrite rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification via combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatory logic approach to higher-order E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Proof Synthesis Method for the Cube of Type Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the second-order unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically-typed computations for order-sorted equational presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of unification in third order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4297316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-rule synthesis from crossed rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for basic narrowing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming language with lambda-abstraction, function variables, and simple unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification under a mixed prefix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification revisited: Complete sets of transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instantiation theory. On the foundations of automated deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938612 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/INCO.1999.2837 / rank
 
Normal rank

Latest revision as of 10:29, 16 December 2024

scientific article
Language Label Description Also known as
English
Higher order unification via explicit substitutions
scientific article

    Statements

    Higher order unification via explicit substitutions (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    higher-order unification
    0 references
    lambda calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references