Sciweavers

1412 search results - page 38 / 283
» types 2004
Sort
View
FOSSACS
2004
Springer
14 years 2 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
IADIS
2004
13 years 10 months ago
Memory inspector: a data representation tutorial
This paper describes Memory Inspector, an interactive web-based tutorial on data storage types and an alternative method for teaching these concepts. Memory Inspector was designed...
Joaquin Vila, Barbara Beccue
SIAMNUM
2010
87views more  SIAMNUM 2010»
13 years 3 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 8 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
ICFP
2004
ACM
14 years 8 months ago
Generics for the masses
A generic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of generic functions are the functions that can b...
Ralf Hinze