67 search results - page 7 / 14 » Practical Variable-Arity Polymorphism |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
POPL
1999
ACM
13 years 12 months ago
1999
ACM
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work...
TLDI
2003
ACM
14 years 27 days ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
ICSOFT
2008
13 years 9 months ago
2008
As building large-scale software systems is complex, several software engineering paradigms have been devised. Agent oriented paradigm is one of the most predominant contributions...
POPL
1994
ACM
13 years 11 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...