3323 search results - page 253 / 665 » Computational Semantics with Functional Programming |
292
click to vote
SIGLEX
1991
15 years 10 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
187
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
192
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...
164
click to vote
ESWS
2005
Springer
16 years 4 days ago
2005
Springer
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...