Sciweavers

397 search results - page 76 / 80
» The lambda calculus is algebraic
Sort
View
DLT
2008
14 years 11 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
AAAI
1993
14 years 10 months ago
Numeric Reasoning with Relative Orders of Magnitude
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...
Philippe Dague
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Mathematical Foundations for a Compositional Distributional Model of Meaning
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...
Bob Coecke, Mehrnoosh Sadrzadeh, Stephen Clark
ENTCS
2008
91views more  ENTCS 2008»
14 years 9 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
FUIN
2006
77views more  FUIN 2006»
14 years 9 months ago
The Impact of seq on Free Theorems-Based Program Transformations
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
Patricia Johann, Janis Voigtländer