4716 search results - page 94 / 944 » Tangible functional programming |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
ICFP
2010
ACM
13 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
13 years 10 months ago
2010
Many problems in computer aided geometric design and geometry processing are stated as least
FPCA
1989
14 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...
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...