• Mathematics, Computer Science
  • Published 1995

Solving higher order equations: from logic to programming

@inproceedings{Prehofer1995SolvingHO,
  title={Solving higher order equations: from logic to programming},
  author={Christian Prehofer},
  year={1995}
}
Higher-order equational reasoning decidability of higher-order unification higher-order lazy narrowing variations of higher-order narrowing applications of higher-order narrowing. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 41 CITATIONS

Higher-Order Narrowing with Definitional Trees

VIEW 15 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS

Higher-Order Narrowing with Convergent Systems

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS

How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation

VIEW 1 EXCERPT
CITES BACKGROUND
HIGHLY INFLUENCED

Higher-Order Rewriting with Dependent Types

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Higher-order Narrowing with Deenitional Trees Higher-order Narrowing with Deenitional Trees

  • Michael Hanusy, Christian Prehoferz
  • 1996
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 119 REFERENCES

A F ormal Foundation for Concurrent Object Oriented P r ogramming

  • R Gro, Grosu
  • A F ormal Foundation for Concurrent Object Oriented P r ogramming
  • 1994

Completeness results for basic narrowing

Connuence for Abstract and Higher-Order Rewriting Amsterdam. OR94] Vincent v an Oostrom and Femke v an Raamsdonk. Weak orthogonality implies connuence: the higher-order case

  • Vincent Oos
  • Logical Foundations of Computer Science, v olume 813 of Lect. Notes in Comp. Sci., pages 379{392
  • 1994