432 search results - page 46 / 87 » Type Inference for COBOL Systems |
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
ENGL
2007
13 years 7 months ago
2007
— This paper presents clustering techniques (K-means, Fuzzy K-means, Subtractive) applied on specific databases (Flower Classification and Mackey-Glass time series) , to automati...
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
FSTTCS
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...