conference-paper

Termination of Recursive Functions by Lexicographic Orders of Linear Combinations

Research footprint

At a glance

الاستشهادات
0
المراجع
5
Comments
0
Paper overview

Abstract

This paper presents an improvement to Isabelle/HOL’s lex- icographic termination algorithm. This paper also shows how to encode positive vector-component maximisation as a linear program.

Record transparency

Publication details

DOI
10.1145/3563768.3563958
OpenAlex
W4310496976
Document type
conference-paper
Language
EN
Last metadata update
المجتمع

Comments

تسجيل الدخول للانضمام إلى النقاش.

  1. لا توجد تعليقات بعد. ابدأ النقاش.