On list primitive recursion and the complexity of computing inf
From MaRDI portal
Publication:688724
DOI10.1007/BF01995103zbMath0787.68047MaRDI QIDQ688724
Publication date: 28 November 1993
Published in: BIT (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q55: Semantics in the theory of computing
68P05: Data structures
Related Items
Inferring Static Non-monotone Size-aware Types Through Testing, System \(T\), call-by-value and the minimum problem, A unary representation result for system \(T\)
Cites Work