Sciweavers

1003 search results - page 28 / 201
» Type Inference with Inequalities
Sort
View
ACL
1994
13 years 10 months ago
Common Topics and Coherent Situations: Interpreting Ellipsis in the Context of Discourse Inference
It is claimed that a variety of facts concerning ellipsis, event reference, and interclausal coherence can be explained by two features of the linguistic form in question: (1) whe...
Andrew Kehler
ICFP
2001
ACM
14 years 8 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
UAI
1993
13 years 10 months ago
Inference Algorithms for Similarity Networks
We examine two types of similarity networks each based on a distinct notion of relevance. For both types of similarity networks we present an efficient inference algorithm that wo...
Dan Geiger, David Heckerman
ERLANG
2007
ACM
14 years 18 days ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
CORR
2004
Springer
98views Education» more  CORR 2004»
13 years 8 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui