System \(T\), call-by-value and the minimum problem
type: Item
instance of: scholarly article
title: System \(T\), call-by-value and the minimum problem
zbMATH Open document ID: 0912.68012
DOI: 10.1016/S0304-3975(98)00011-5
author: Loïc Colson
author: Daniel Fredholm
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1238725
zbMATH Keywords: typed lambda-calculus
zbMATH Keywords: functional programming
MaRDI profile type: Publication
cites work: About primitive recursive algorithms
cites work: On list primitive recursion and the complexity of computing inf
cites work: Q4001132
cites work: Q4289139
cites work: The Expressiveness of Simple and Second-Order Type Structures
cites work: Intensional aspects of function definitions
cites work: Computing minimum with primitive recursion over lists
cites work: Q3760480
cites work: Q3791120
cites work: On a hitherto unexploited extension of the finitary standpoint
cites work: Q5812175
cites work: Q3816051
cites work: Constructive mathematics and computer programming
cites work: Q3688389
cites work: LCF considered as a programming language
cites work: Intensional interpretations of functionals of finite type I
Recommended article: Call-by-Value Solvability, Revisited
Recommended article: Q4448358
Recommended article: Call-by-value Solvability
Recommended article: Q4038678
Recommended article: Q4281486
Recommended article: A Semantical and Operational Account of Call-by-Value Solvability
Recommended article: Q5874223
Recommended article: Complexity of Model-Checking Call-by-Value Programs
Recommended article: Call-by-value, elementary time and intersection types
Recommended article: Call-by-Value -calculus and LJQ
description: scientific article; zbMATH DE number 1238725