REASONABLE SPACE FOR THE )- CALCULUS, LOGARITHMICALLY

被引：0
|
作者：
Accattoli, Beniamino [1 ,2 ]
Dal Lago, Ugo [1 ,3 ]
Vanoni, Gabriele [4 ]
机构：
[1] Inria, Le Chesnay Rocquencourt, France
[2] Ecole Polytech, LIX, UMR 7161, Palaiseau, France
[3] Univ Bologna, Bologna, Italy
[4] Univ Paris, IRIF, CNRS, Paris, France
来源：
LOGICAL METHODS IN COMPUTER SCIENCE | 2024年 / 20卷 / 04期
关键词：
lambda-calculus; abstract machines; complexity; space;
D O I：
10.46298/lmcs-20(4:15)2024
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
. Can the lambda-calculus be considered a reasonable computational model? Can we use it for measuring the time and space consumption of algorithms? While the literature contains positive answers about time, much less is known about space. This paper presents a new reasonable space cost model for the lambda-calculus, based on a variant over the Krivine abstract machine. For the first time, this cost model is able to accommodate logarithmic space. Moreover, we study the time behavior of our machine, which is unreasonable but it can be turned into a reasonable one using known techniques. Finally, we show how to transport our results to the call-by-value lambda-calculus.
引用
收藏
页码：1 / 15
页数：57
相关论文
共 50 条
  • [1] The Weak Call-by-Value λ-Calculus Is Reasonable for Both Time and Space
    Forster, Yannick
    Kunze, Fabian
    Roth, Marc
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [2] The weak lambda calculus as a reasonable machine
    Dal Lago, Ugo
    Martini, Simone
    THEORETICAL COMPUTER SCIENCE, 2008, 398 (1-3) : 32 - 50
  • [3] The Useful MAM, a Reasonable Implementation of the Strong λ-Calculus
    Accattoli, Beniamino
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, 2016, 9803 : 1 - 21
  • [4] DHT routing analysis in a logarithmically transformed space
    Kersch, Peter
    Szabo, Robert
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2008, 1 (01) : 64 - 74
  • [5] DHT routing analysis in a logarithmically transformed space
    Peter Kersch
    Róbert Szabó
    Peer-to-Peer Networking and Applications, 2008, 1 : 64 - 74
  • [6] In the Space of Reasonable Doubt
    Vorms, Marion
    Hahn, Ulrike
    SYNTHESE, 2021, 198 (SUPPL 15) : 3609 - 3633
  • [7] In the Space of Reasonable Doubt
    Marion Vorms
    Ulrike Hahn
    Synthese, 2021, 198 : 3609 - 3633
  • [8] Multi Types and Reasonable Space
    Accattoli, Beniamino
    Dal Lago, Ugo
    Vanoni, Gabriele
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2022, 6 (ICFP):
  • [9] AN INTEGRAL CALCULUS FOR A FUNCTION SPACE
    CAMERON, RH
    AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (03): : 250 - &
  • [10] Space complexity in propositional calculus
    Alekhnovich, M
    Ben-Sasson, E
    Razborov, AA
    Wigderson, A
    SIAM JOURNAL ON COMPUTING, 2002, 31 (04) : 1184 - 1211
12345