Sciweavers

7529 search results - page 25 / 1506
» The Modula-3 Type System
Sort
View
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ISSTA
2012
ACM
11 years 10 months ago
Static detection of brittle parameter typing
To avoid receiving incorrect arguments, a method specifies the expected type of each formal parameter. However, some parameter types are too general and have subtypes that the me...
Michael Pradel, Severin Heiniger, Thomas R. Gross
RV
2010
Springer
177views Hardware» more  RV 2010»
13 years 6 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
IJNSEC
2010
163views more  IJNSEC 2010»
13 years 2 months ago
Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types
As the importance and the value of exchanged data over the Internet or other media types are increasing, the search for the best solution to offer the necessary protection against...
Diaa Salama Abdul Minaam, Hatem M. Abdual-Kader, M...
JFP
2007
136views more  JFP 2007»
13 years 7 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...