1932 search results - page 203 / 387 » A Functional Quantum Programming Language |
182
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
138
click to vote
PPDP
2001
Springer
15 years 11 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
158
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
180
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
165
click to vote
LISP
2002
15 years 6 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...