Sciweavers

1003 search results - page 29 / 201
» Type Inference with Inequalities
Sort
View
MSCS
2008
87views more  MSCS 2008»
13 years 8 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ICALP
1998
Springer
14 years 27 days ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
TCS
2008
13 years 8 months ago
Abstract interpretation and types for systems biology
Interpretation and Types for Systems Biology Fran
François Fages, Sylvain Soliman
FLOPS
2008
Springer
13 years 10 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
IWPC
2000
IEEE
14 years 1 months ago
Types and Concept Analysis for Legacy Systems
We combine type inference and concept analysis in order to gain insight into legacy software systems. Type inference for COBOL yields the types for variables and program parameter...
Tobias Kuipers, Leon Moonen