5377 search results - page 637 / 1076 » Programming Languages For Interactive Computing |
157
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
152
Voted
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
164
click to vote
ERSHOV
2009
Springer
16 years 29 days ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
152
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
186
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...