Results 1 
2 of
2
A Sketch of Complete Type Inference for Functional Programming
 IN PROC. OF THE INTERNATIONAL WORKSHOP ON FUNCTIONAL AND (CONSTRAINT) LOGIC PROGRAMMING (WFLP 2001
, 2001
"... Complete type inference for functional programming is an approach to incorporate static type inference into dynamically typed languages that is based on the following idea: For every program or program expression that can be evaluated without a runtime type error, types denoting all valid input ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Complete type inference for functional programming is an approach to incorporate static type inference into dynamically typed languages that is based on the following idea: For every program or program expression that can be evaluated without a runtime type error, types denoting all valid input values (in case of functions) and all corresponding output/result values are inferred. A type error is just raised for program expressions that must provably fail for every input. In this
An Algorithm for Checking the Disjointness of Types
, 2001
"... We describe an algorithm approximating the following question: Given two types t1 and t2 , are there instances (t1) and (t2) denoting a common element? By answering this question we solve a main problem towards a type checking algorithm for nondisjoint types that raises an error just for function c ..."
Abstract
 Add to MetaCart
We describe an algorithm approximating the following question: Given two types t1 and t2 , are there instances (t1) and (t2) denoting a common element? By answering this question we solve a main problem towards a type checking algorithm for nondisjoint types that raises an error just for function calls that cannot be executed successfully for any input arguments. For dynamically typed functional languages as e.g. Scheme such a type checker can extend current soft typing systems in order to reject provably illtyped programs.