894 search results - page 71 / 179 » Typed Contracts for Functional Programming |
214
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
103
Voted
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
230
Voted
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
144
Voted
PEPM
1994
ACM
15 years 6 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
247
Voted
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...