Add to ORKGModern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given
The Generic Haskell programming language allows functions to be defined by induction on the structur...
This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three par...
Functional size, or function points, is a language-independent measure of software size. It is used ...
International audienceFunction specialization is a compilation technique that consists in optimizing...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
This paper presents a library for programming with polymorphic dynamic types in the dependently type...
This paper is a survey of dynamic programming algorithms for problems in computer science. For each ...
Most algorithms that we have seen so far have been static in that the input was given initially and ...
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering an...
We describe a new automatic static analysis for determining upper-bound functions on the use of quan...
Giegerich R, Meyer C, Steffen P. A discipline of dynamic programming over sequence data. SCIENCE OF ...
Sized types are a modular and theoretically well-understood tool for checking termination of recur-s...
In this paper we describe a method, based on lazy evaluation, for creating infinite data structures ...
frobertcmeyerpsteffengtechfakunibielefeldde Abstract Dynamic programming is a classic programming t...
This paper describes an inference system, whose purpose is to determine the cost of evaluating expre...
The Generic Haskell programming language allows functions to be defined by induction on the structur...
This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three par...
Functional size, or function points, is a language-independent measure of software size. It is used ...
International audienceFunction specialization is a compilation technique that consists in optimizing...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
This paper presents a library for programming with polymorphic dynamic types in the dependently type...
This paper is a survey of dynamic programming algorithms for problems in computer science. For each ...
Most algorithms that we have seen so far have been static in that the input was given initially and ...
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering an...
We describe a new automatic static analysis for determining upper-bound functions on the use of quan...
Giegerich R, Meyer C, Steffen P. A discipline of dynamic programming over sequence data. SCIENCE OF ...
Sized types are a modular and theoretically well-understood tool for checking termination of recur-s...
In this paper we describe a method, based on lazy evaluation, for creating infinite data structures ...
frobertcmeyerpsteffengtechfakunibielefeldde Abstract Dynamic programming is a classic programming t...
This paper describes an inference system, whose purpose is to determine the cost of evaluating expre...
The Generic Haskell programming language allows functions to be defined by induction on the structur...
This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three par...
Functional size, or function points, is a language-independent measure of software size. It is used ...