545 search results - page 14 / 109 » Recursive logic frames |
79
Voted
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ...
103
click to vote
TLDI
2009
ACM
15 years 8 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
105
Voted
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
We show how to reason about âstep-indexedâ logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superïŹcially...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...