5096 search results - page 396 / 1020 » Associations as a Language Construct |
217
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
175
click to vote
ICFP
2004
ACM
16 years 7 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
196
click to vote
ICFP
2001
ACM
16 years 7 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
219
click to vote
PPDP
2007
Springer
16 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
215
click to vote
HASKELL
2006
ACM
16 years 1 months ago
2006
ACM
Correct handling of concurrently accessed external resources is a demanding problem in programming. The standard approaches rely on database transactions or concurrency mechanisms...