Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-24364-6_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Size-Change Termination as a Contract: Dynamically and Statically Enforcing Termination for Higher-Order Programs

2019English

Motion Estimation Using Higher Order Statistics

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
1996English

Higher-Order Containers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Higher-Order Uncertainty

2019English

Higher Order Operations

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Higher-Order Logic

1998English

Higher Order Crossings

1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy