Sciweavers

1901 search results - page 64 / 381
» Predicting Program Properties from
Sort
View
POPL
2009
ACM
15 years 11 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
ICFP
2010
ACM
15 years 4 days ago
Security-typed programming within dependently typed programming
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
Jamie Morgenstern, Daniel R. Licata
JFP
2002
89views more  JFP 2002»
14 years 10 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
CEFP
2009
Springer
14 years 9 months ago
Reasoning about Codata
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
Ralf Hinze
GCB
1998
Springer
78views Biometrics» more  GCB 1998»
15 years 3 months ago
Computational approaches to identify Leucine Zippers
The leucine zipper is a dimerization domain occurring mostly in regulatory and thus in many oncogenic proteins. The leucine repeat in the sequence has been traditionally used for ...
Erich Bornberg-Bauer