Sciweavers

15 search results - page 2 / 3
» Big-step Operational Semantics Revisited
Sort
View
LICS
2012
IEEE
11 years 7 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
ACTA
2005
94views more  ACTA 2005»
13 years 5 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek
CORR
2000
Springer
132views Education» more  CORR 2000»
13 years 4 months ago
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
Marc Denecker, Victor W. Marek, Miroslaw Truszczyn...
SLP
1994
121views more  SLP 1994»
13 years 6 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
IFIP
2004
Springer
13 years 10 months ago
Effective Chemistry for Synchrony and Asynchrony
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
Deepak Garg, Akash Lal, Sanjiva Prasad