Termination of λΠ modulo rewriting using the size-change principle (work in progress)

12/05/2018
by   Frédéric Blanqui, et al.
0

The Size-Change Termination principle was first introduced to study the termination of first-order functional programs. In this work, we show that it can also be used to study the termination of higher-order rewriting in a system of dependent types extending LF.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2019

Dependent choice as a termination principle

We introduce a new formulation of the axiom of dependent choice that can...
research
08/06/2018

Size-Change Termination as a Contract

Program termination is an undecidable, yet important, property relevant ...
research
01/23/2019

The Size-Change Principle for Mixed Inductive and Coinductive types

This paper describes how to use Lee, Jones and Ben Amram's size-change p...
research
05/12/2019

Simulation Typology and Termination Risks

The goal of the article is to explore what is the most probable type of ...
research
06/25/2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Encodings of term rewriting systems (TRSs) into graph rewriting systems ...
research
07/26/2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems

We provide a critical assessment of the current set of benchmarks for re...
research
12/01/2022

Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation

A clustering termination procedure which is locally adaptive (with respe...

Please sign up or login with your details

Forgot password? Click here to reset