3323 search results - page 280 / 665 » Computational Semantics with Functional Programming |
297
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
176
click to vote
ICPP
2005
IEEE
16 years 7 days ago
2005
IEEE
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
181
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
187
click to vote
SIGCSE
1990
ACM
15 years 10 months ago
1990
ACM
This paper presents a philosophy underlying CS-1 programming projects, and illustrates this philosophy with a concrete example. Integral to the philosophy is the use of Ada packag...
203
click to vote
ENTCS
2006
15 years 6 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...