Higher-order Logic Programming

Higher-Order Logic Programming is a form of logic programming that extends first-order logic programming by permitting predicate variables and higher-order terms in quantification, unification, and rule bodies, thereby enabling the direct representation and manipulation of higher-order logical constructs within the computational model.

64

Publications

3.1K

Citations

93

Authors

48

Institutions

Publications per year

2017–2026

5

Authors

93

  1. DM
    Dale Miller

    University of Pennsylvania, United States

    9 publications · 890 citations

    9

    h-index

  2. GN
    Gopalan Nadathur

    Duke University, United States

    6 publications · 328 citations

    7

    h-index

  3. FP
    Frank Pfenning

    Carnegie Mellon University, United States

    6 publications · 189 citations

    6

    h-index

  4. BP
    Brigitte Pientka

    McGill University, Canada

    3 publications · 66 citations

    3

    h-index

  5. MH
    Michael Hanus

    Christian-Albrechts-Universität zu Kiel, Germany

    2 publications · 89 citations

    2

    h-index

1–5 of 93

Venues

  1. Theory and Practice of Logic Programming

    2 publications · 171 citations

    2

    h-index

  2. Oxford University Research Archive (ORA) (University of Oxford)

    Repository · 2 publications · 68 citations

    2

    h-index

  3. ACM Transactions on Computational Logic

    TOCL · 2 publications · 45 citations

    2

    h-index

  4. Journal of Functional Programming

    2 publications · 101 citations

    2

    h-index

  5. ScholarlyCommons (University of Pennsylvania)

    Repository · 2 publications · 112 citations

    2

    h-index

1–5