Sciweavers

13734 search results - page 149 / 2747
» Abstractions of data types
Sort
View
ECOOP
1999
Springer
15 years 8 months ago
Type-Safe Delegation for Run-Time Component Adaptation
Abstract. The aim of component technology is the replacement of large monolithic applications with sets of smaller software components, whose particular functionality and interoper...
Günter Kniesel
POPL
1997
ACM
15 years 7 months ago
Parameterized Types for Java
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This pape...
Andrew C. Myers, Joseph A. Bank, Barbara Liskov
CORR
2007
Springer
194views Education» more  CORR 2007»
15 years 4 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
ENTCS
2007
113views more  ENTCS 2007»
15 years 3 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
MSCS
2008
97views more  MSCS 2008»
15 years 3 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...