278 search results - page 29 / 56 » Pure Pattern Calculus |
CSL
2009
Springer
14 years 1 months ago
2009
Springer
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
UAI
2008
13 years 11 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
APAL
2010
13 years 10 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, fo...
ISORC
1998
IEEE
14 years 2 months ago
1998
IEEE
Many engineers are still reluctant to adopt advanced object-oriented technologies (such as high modularity, dynamic binding, automatic garbage collection, etc.) for embedded syste...