280 search results - page 25 / 56 » Equivalence of Two Formal Semantics for Functional Logic Pro... |
IFL
2005
Springer
14 years 1 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
IWFM
2003
13 years 9 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
FLAIRS
2008
13 years 10 months ago
2008
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
JAR
2008
13 years 8 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...