270 search results - page 14 / 54 » A Simple and General Theoretical Account for Abstract Types |
STACS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
DLT
2009
13 years 5 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
ML
2011
ACM
13 years 2 months ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...