Sciweavers

1830 search results - page 122 / 366
» Functional Programs as Linked Data
Sort
View
124
Voted
PEPM
1993
ACM
15 years 7 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
265
Voted
ICFP
2009
ACM
16 years 4 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
IEEEIAS
2007
IEEE
15 years 9 months ago
Metrics-based Evaluation of Slicing Obfuscations
An obfuscation aims to transform a program, without affecting its functionality, so that some secret data within the program can be hidden for as long as possible from an adversar...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
DOCENG
2009
ACM
15 years 10 months ago
Automated extensible XML tree diagrams
: © Automated Extensible XML Tree Diagrams John Lumley HP Laboratories HPL-2009-137 XSLT, SVG, XML trees, Functional programming XML is a tree-oriented meta-language and visual de...
John Lumley
112
Voted
COR
2008
97views more  COR 2008»
15 years 3 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...