Sciweavers

13734 search results - page 112 / 2747
» Abstractions of data types
Sort
View
WOLLIC
2009
Springer
14 years 3 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 1 months ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins
POPL
1994
ACM
14 years 1 months ago
Manifest Types, Modules, and Separate Compilation
This paper presents a variant of the SML module system roduces a strict distinction between abstract types and manifest types (types whose definitions are part of the module speci...
Xavier Leroy
SCOPES
2004
Springer
14 years 2 months ago
An Automated C++ Code and Data Partitioning Framework for Data Management of Data-Intensive Applications
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...
Athanasios Milidonis, Grigoris Dimitroulakos, Mich...
ASIAN
1998
Springer
133views Algorithms» more  ASIAN 1998»
14 years 1 months ago
Type Inference for First-Class Messages with Feature Constraints
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
Martin Müller, Susumu Nishimura