1830 search results - page 52 / 366 » Functional Programs as Linked Data |
118
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
115
Voted
SAS
2004
Springer
15 years 8 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
119
click to vote
IFL
1997
Springer
15 years 6 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
152
Voted
ICFP
2012
ACM
13 years 5 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
126
Voted
APLAS
2010
ACM
15 years 2 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...