815 search results - page 155 / 163 » Algebraic Recognizability of Languages |
FPCA
1989
15 years 1 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
104
click to vote
KBSE
2000
IEEE
15 years 1 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
84
Voted
PLDI
1995
ACM
15 years 1 months ago
1995
ACM
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
FC
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
IJCAI
1993
14 years 10 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...