Copertina

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Niederhauser, Johannes, Middeldorp, Aart
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
di: Schöpf, Jonas, et al.
Pubblicazione: (2023)

Left-Linear Completion with AC Axioms
di: Niederhauser, Johannes, et al.
Pubblicazione: (2024)

Automated Analysis of Logically Constrained Rewrite Systems using crest
di: Schöpf, Jonas, et al.
Pubblicazione: (2025)

Confluence of Logically Constrained Rewrite Systems Revisited
di: Schöpf, Jonas, et al.
Pubblicazione: (2024)

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

Hydra Battles and AC Termination
di: Hirokawa, Nao, et al.
Pubblicazione: (2023)

Unifying Semantic Path Order and Weighted Path Order
di: Saito, Teppei, et al.
Pubblicazione: (2026)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
di: Takahata, Kanta, et al.
Pubblicazione: (2025)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
di: Aoto, Takahito, et al.
Pubblicazione: (2024)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
di: Aoto, Takahito, et al.
Pubblicazione: (2026)

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

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
di: Nishida, Naoki, et al.
Pubblicazione: (2025)

Higher-Order Constrained Dependency Pairs for (Universal) Computability
di: Guo, Liye, et al.
Pubblicazione: (2024)

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

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
di: Li, Kwing Hei, et al.
Pubblicazione: (2025)

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

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

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

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

First-Order LTLf Synthesis with Lookback (Extended Version)
di: Winkler, Sarah
Pubblicazione: (2025)

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

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
di: Haselwarter, Philipp G., et al.
Pubblicazione: (2026)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
di: Nishida, Naoki, et al.
Pubblicazione: (2026)

On a Second-Order Version of Russellian Theory of Definite Descriptions
di: Petrukhin, Yaroslav
Pubblicazione: (2025)

Localized Attractor Computations for Infinite-State Games (Full Version)
di: Schmuck, Anne-Kathrin, et al.
Pubblicazione: (2024)

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

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

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

Higher-Order Asynchronous Effects
di: Ahman, Danel, et al.
Pubblicazione: (2023)

Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
di: Vilmart, Renaud
Pubblicazione: (2023)

Linearization via Rewriting (Long Version)
di: Lago, Ugo Dal, et al.
Pubblicazione: (2025)

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

A General Automata Model for First-Order Temporal Logics (Extended Version)
di: Geatti, Luca, et al.
Pubblicazione: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2023)

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

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

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

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

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