144 search results - page 13 / 29 » A Fully Abstract Semantics for a Functional Language with Lo... |
127
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...
185
Voted
ICLP
2011
Springer
14 years 7 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
138
Voted
POPL
1998
ACM
15 years 7 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 ...
138
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
127
Voted
CAV
1999
Springer
15 years 8 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...