5415 search results - page 106 / 1083 » The Implementation of Functional Programming Languages |
124
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
PPDP
2001
Springer
15 years 5 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
120
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
192
click to vote
CC
2009
Springer
16 years 2 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
122
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...