2076 search results - page 244 / 416 » Functional logic overloading |
148
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
122
Voted
ISMIS
2005
Springer
15 years 9 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
116
click to vote
ADC
2004
Springer
15 years 9 months ago
2004
Springer
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...
112
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
143
Voted
RSCTC
2004
Springer
15 years 9 months ago
2004
Springer
The combination of fuzzy set and rough set theories lead to various models. Functional and set approaches are two categories based on different fuzzy representations. In this pape...