4716 search results - page 356 / 944 » Tangible functional programming |
166
click to vote
TPHOL
2000
IEEE
15 years 10 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
179
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
148
Voted
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
175
click to vote
APLAS
2006
ACM
16 years 22 days ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
178
click to vote
APLAS
2000
ACM
15 years 11 months ago
2000
ACM
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...