Sciweavers

1081 search results - page 29 / 217
» Type Inference of SELF
Sort
View
IFL
2001
Springer
142views Formal Methods» more  IFL 2001»
15 years 8 months ago
A Compilation Scheme for a Hierarchy of Array Types
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
Dietmar Kreye
149
Voted
GI
1997
Springer
15 years 8 months ago
Functional Object-Oriented Programming with Object-Gofer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
Wolfram Schulte, Klaus Achatz
ARITH
2003
IEEE
15 years 9 months ago
A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2m ) which has a low hardware complexity and a low latenc...
Soonhak Kwon
136
Voted
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
15 years 9 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
127
Voted
TCS
2008
15 years 3 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini