Sciweavers

441 search results - page 32 / 89
» The logical approach to stack typing
Sort
View
JANCL
2006
105views more  JANCL 2006»
14 years 9 months ago
BDD-based decision procedures for the modal logic K
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi
99
Voted
POPL
2012
ACM
13 years 5 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
ENTCS
2002
92views more  ENTCS 2002»
14 years 9 months ago
The Relevance of Semantic Subtyping
We compare Meyer and Routley's minimal relevant logic B+ with the recent semanticsbased approach to subtyping introduced by Frisch, Castagna and Benzaken in the definition of...
Mariangiola Dezani-Ciancaglini, Alain Frisch, Elio...
CORR
2006
Springer
135views Education» more  CORR 2006»
14 years 9 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
CADE
2003
Springer
15 years 9 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow