686 search results - page 56 / 138 » Foundations for Bidirectional Programming |
105
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
119
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we initiate a formal study of security on Android: Google’s new open-source platform for mobile devices. Specifically, we present a core typed language to descri...
135
click to vote
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
118
click to vote
MFPS
1993
15 years 7 months ago
1993
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
135
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...