5090 search results - page 478 / 1018 » Constructing Strategies for Programming |
302
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
303
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
267
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
299
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...
156
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...