Sciweavers

1052 search results - page 14 / 211
» Foundations for Virtual Types
Sort
View
FOCS
1992
IEEE
13 years 11 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
TPHOL
1997
IEEE
13 years 11 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
BIRTHDAY
2008
Springer
13 years 9 months ago
Observability Concepts in Abstract Data Type Specification, 30 Years Later
ility concepts in abstract data type specification, 30 years later Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburg...
Donald Sannella, Andrzej Tarlecki
FLAIRS
2008
13 years 9 months ago
Causal Reasoning with Contexts Using Dependent Types
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic...
Richard Dapoigny, Patrick Barlatier
PE
2010
Springer
133views Optimization» more  PE 2010»
13 years 5 months ago
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
Yoni Nazarathy, Gideon Weiss