4835 search results - page 122 / 967 » Refactoring Functional Programs |
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
CAGD
2010
14 years 10 months ago
2010
Many problems in computer aided geometric design and geometry processing are stated as least
FPCA
1989
15 years 2 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
174
click to vote
Book
"This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of pr...
ASM
2003
ASM
15 years 3 months ago
2003
ASM
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...