Cover Image

Higher-Order Constrained Dependency Pairs for (Universal) Computability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guo, Liye, Hagens, Kasper, Kop, Cynthia, Vale, Deivid
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Templates in Rewriting Induction
by: Hagens, Kasper, et al.
Published: (2026)

Bounded Rewriting Induction for LCSTRSs
by: Hagens, Kasper, et al.
Published: (2026)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)

A weakly monotonic, logically constrained, HORPO-variant
by: Kop, Cynthia
Published: (2024)

Proceedings of the 19th International Workshop on Logical and Semantic Frameworks, with Applications
by: Kop, Cynthia, et al.
Published: (2025)

Verifying Procedural Programs via Constrained Rewriting Induction
by: Fuhs, Carsten, et al.
Published: (2014)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
by: Niederhauser, Johannes, et al.
Published: (2024)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
by: Kura, Satoshi, et al.
Published: (2024)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
by: Bacci, Giorgio, et al.
Published: (2025)

The Dependently Typed Higher-Order Form for the TPTP World
by: Ranalter, Daniel, et al.
Published: (2025)

Kuroda's Translation for Higher-Order Logic
by: Traversié, Thomas
Published: (2024)

SAT-Inspired Higher-Order Eliminations
by: Blanchette, Jasmin, et al.
Published: (2022)

Hammering Higher Order Set Theory
by: Brown, Chad E., et al.
Published: (2025)

Higher Order Automatic Differentiation of Higher Order Functions
by: Huot, Mathieu, et al.
Published: (2021)

A Dependency Pair Framework for Relative Termination of Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Syntactic Effectful Realizability in Higher-Order Logic
by: Cohen, Liron, et al.
Published: (2025)

Free Monads, Intrinsic Scoping, and Higher-Order Preunification
by: Kudasov, Nikolai
Published: (2022)

Unification of Deterministic Higher-Order Patterns (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2026)

Expectation-based Analysis of Higher-Order Quantum Programs
by: Avanzini, Martin, et al.
Published: (2025)

Big Steps in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2025)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
by: Charalambidis, Angelos, et al.
Published: (2026)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
by: Pollaci, Samuele, et al.
Published: (2024)

Higher Order Model Checking in Isabelle for Human Centric Infrastructure Security
by: Kammüller, Florian
Published: (2023)

Higher-Order Weakest Precondition Transformers via a CPS Transformation
by: Kura, Satoshi
Published: (2023)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Higher-Order Asynchronous Effects
by: Ahman, Danel, et al.
Published: (2023)

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
by: Watanabe, Kazuki, et al.
Published: (2025)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)

Primitive Recursive Dependent Type Theory
by: Buchholtz, Ulrik, et al.
Published: (2024)

Bialgebraic Reasoning on Higher-Order Program Equivalence
by: Goncharov, Sergey, et al.
Published: (2024)

Non-Derivability Results in Polymorphic Dependent Type Theory
by: Geuvers, Herman
Published: (2026)

Approximate Relational Reasoning for Higher-Order Probabilistic Programs
by: Haselwarter, Philipp G., et al.
Published: (2024)

Logical Predicates in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2024)

Towards a Higher-Order Bialgebraic Denotational Semantics
by: Goncharov, Sergey, et al.
Published: (2026)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)