11397 search results - page 285 / 2280 » A Relational Abstraction for Functions |
192
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
196
click to vote
PADL
2000
Springer
15 years 11 months ago
2000
Springer
We show how the features of modern integrated functional logic programming languages can be exploited to implement graphical user interfaces (GUIs) in a high-level declarative styl...
231
click to vote
PLILP
1995
Springer
15 years 11 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
162
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
183
click to vote
MP
2011
14 years 10 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...