Sciweavers

40 search results - page 5 / 8
» A Recursive Treatment of Collocations
Sort
View
114
Voted
APAL
2005
119views more  APAL 2005»
15 years 3 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
120
Voted
ESOP
2007
Springer
15 years 10 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
113
Voted
ICFP
2004
ACM
16 years 3 months ago
Types for path correctness of XML queries
d Abstract) Dario Colazzo1 , Giorgio Ghelli2 , Paolo Manghi2 , and Carlo Sartiani2 1 LRI - Universit?e Paris Sud 2 Dipartimento di Informatica - Universit`a di Pisa If a subexpress...
Dario Colazzo, Giorgio Ghelli, Paolo Manghi, Carlo...
126
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
The Waiting Time Distribution for a TDMA Model with a Finite Buffer
—We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and s...
Marcel F. Neuts, Jun Guo, Moshe Zukerman, Hai Le V...
118
Voted
ICCL
1998
IEEE
15 years 8 months ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin