System \(T\), call-by-value and the minimum problem
From MaRDI portal
Publication:1274979
DOI10.1016/S0304-3975(98)00011-5zbMath0912.68012MaRDI QIDQ1274979
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
A complete characterization of primitive recursive intensional behaviours ⋮ Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control ⋮ Minimality in a Linear Calculus with Iteration ⋮ The efficiency of primitive recursive functions: a programmer's view
Cites Work
- Computing minimum with primitive recursion over lists
- Intensional aspects of function definitions
- On list primitive recursion and the complexity of computing inf
- On a hitherto unexploited extension of the finitary standpoint
- About primitive recursive algorithms
- LCF considered as a programming language
- Constructive mathematics and computer programming
- The Expressiveness of Simple and Second-Order Type Structures
- Intensional interpretations of functionals of finite type I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: System \(T\), call-by-value and the minimum problem
