Sciweavers

1003 search results - page 58 / 201
» Type Inference with Inequalities
Sort
View
ICNP
2005
IEEE
15 years 9 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
129
Voted
CIE
2008
Springer
15 years 6 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
JLP
2008
134views more  JLP 2008»
15 years 3 months ago
Backwards type analysis of asynchronous method calls
Asynchronous method calls have been proposed to better integrate object orientation with distribution. In the Creol language, asynchronous method calls are combined with so-called...
Einar Broch Johnsen, Ingrid Chieh Yu
CSL
2006
Springer
15 years 7 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
HASKELL
2006
ACM
15 years 10 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser