Sciweavers

678 search results - page 53 / 136
» Dependent Types for Program Understanding
Sort
View
101
Voted
PLDI
1998
ACM
15 years 6 months ago
Units: Cool Modules for HOT Languages
A module system ought to enable assembly-line programming using separate compilation and an expressive linking language. Separate compilation allows programmers to develop parts o...
Matthew Flatt, Matthias Felleisen
118
Voted
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 7 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
116
Voted
APLAS
2009
ACM
15 years 8 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier
140
Voted
TYPES
2004
Springer
15 years 7 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
92
Voted
ESOP
2009
Springer
15 years 9 months ago
Abstraction for Concurrent Objects
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, ...