686 search results - page 56 / 138 » Foundations for Bidirectional Programming |
CORR
2002
Springer
14 years 9 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...
PLDI
2009
ACM
15 years 4 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...
TLCA
2007
Springer
15 years 3 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...
MFPS
1993
15 years 1 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...
SIGSOFT
2007
ACM
15 years 10 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...