Polymorphic Higher-order Termination

04/22/2019
by   Łukasz Czajka, et al.
0

We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This enables a direct interpretation of rewrite rules which make essential use of impredicative polymorphism. In addition, our generalisation eases the applicability of the method in the non-polymorphic setting by allowing for the encoding of inductive data types. As an illustration of the potential of our method, we prove termination of a substantial fragment of full intuitionistic second-order propositional logic with permutative conversions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2023

Certifying Higher-Order Polynomial Interpretations

Higher-order rewriting is a framework in which one can write higher-orde...
research
12/10/2021

Formalizing Higher-Order Termination in Coq

We describe a formalization of higher-order rewriting theory and formall...
research
12/07/2019

A Modular Termination Method for Second-Order Computation

We present a new modular proof method of termination for second-order co...
research
12/07/2019

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers

We present a new modular proof method of termination for second-order co...
research
04/02/2018

An interpretation of system F through bar recursion

There are two possible computational interpretations of second-order ari...
research
01/25/2018

Theory of higher order interpretations and application to Basic Feasible Functions

Interpretation methods and their restrictions to polynomials have been d...
research
12/07/2019

Modular Termination Checking Theorems for Second-Order Computation

We present new theorems of modular termination checking for second-order...

Please sign up or login with your details

Forgot password? Click here to reset