Complexity Analysis for Call-by-Value Higher-Order Rewriting

07/25/2023
by   Cynthia Kop, et al.
0

In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size semantics to call-by-value rewriting: a class of algebraic interpretations that map terms to tuples that bound both the reductions' cost and the size of normal forms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2022

Tuple Interpretations and Applications to Higher-Order Runtime Complexity

Tuple interpretations are a class of algebraic interpretation that subsu...
research
05/03/2021

Tuple Interpretations for Higher-Order Rewriting

We develop a class of algebraic interpretations for many-sorted and high...
research
11/11/2019

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)

The main way of analyzing the complexity of a program is that of extract...
research
03/23/2023

Analyzing Innermost Runtime Complexity Through Tuple Interpretations

Time complexity in rewriting is naturally understood as the number of st...
research
04/13/2021

Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case

We describe a mathematical structure that can give extensional denotatio...
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
07/23/2023

Saturating automata for game semantics

Saturation is a fundamental game-semantic property satisfied by strategi...

Please sign up or login with your details

Forgot password? Click here to reset