Sciweavers

581 search results - page 76 / 117
» On the Verifiability of Programs Written in the Feature Lang...
Sort
View
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
14 years 16 days ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
PPPJ
2003
ACM
14 years 2 months ago
A Java implemented key collision attack on the data encryption standard (DES)
A Java implementation of a key collision attack on DES suggested by Eli Biham, [1], is discussed. Storage space minimization and fast searching techniques to speed up the attack a...
John Loughran, Tom Dowling
FOAL
2007
ACM
14 years 25 days ago
Specializing continuations a model for dynamic join points
By modeling dynamic join points, pointcuts, and advice in a defunctionalized continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms. Dyna...
Christopher Dutchyn
SAC
2009
ACM
14 years 3 months ago
A practical solution for scripting language compilers
Although scripting languages are becoming increasingly popular, even mature scripting language implementations remain interpreted. Several compilers and reimplementations have bee...
Paul Biggar, Edsko de Vries, David Gregg
ICFP
2009
ACM
14 years 9 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg