Theory of higher order interpretations and application to Basic Feasible Functions

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional language. We develop a theory of higher order functions that i...

詳細記述

書誌詳細

出版年:	Logical Methods in Computer Science
主要な著者:	Emmanuel Hainry, Romain Péchoux
フォーマット:	論文
言語:	英語
出版事項:	Logical Methods in Computer Science e.V. 2020-12-01
主題:	computer science - logic in computer science computer science - computational complexity computer science - programming languages
オンライン･アクセス:	https://lmcs.episciences.org/4237/pdf