144 search results - page 4 / 29 » A Fully Abstract Semantics for a Functional Language with Lo... |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
PPDP
2009
Springer
14 years 3 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
ESOP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
ICLP
1995
Springer
14 years 5 days ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...